121 search results - page 1 / 25 » Hierarchical Routing in Sensor Networks Using k-Dominating S... |
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
Hierarchical routing is a promising approach for point-topoint routing with very small routing state. While there are many theoretical analyses and high-level simulations demonstr...
ITIIS
2010
13 years 6 months ago
2010
Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient ...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
The ability to provide reliable in-network storage while balancing the energy consumption of individual sensors is a primary concern when deploying a sensor network. The main conc...