295 search results - page 16 / 59 » An approximation algorithm for the wireless gathering proble... |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
EWSN
2004
Springer
15 years 9 months ago
2004
Springer
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
104
click to vote
TC
2011
14 years 4 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...