4 search results - page 1 / 1 » O(log n)-Localized Algorithms on the Coverage Problem in Het... |
IPCCC
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
TMC
2010
13 years 2 months ago
2010
—To make a network last beyond the lifetime of an individual sensor, redundant sensors must be deployed. What sleep-wakeup schedule can then be used for individual sensors so tha...
ICC
2007
IEEE
13 years 10 months ago
2007
IEEE
—Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energ...
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...