1330 search results - page 66 / 266 » Node Connectivity Analysis in Multi-Hop Wireless Networks |
107
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
123
click to vote
TMC
2008
14 years 11 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
120
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
114
click to vote
SAMOS
2007
Springer
15 years 6 months ago
2007
Springer
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
113
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Topology control and routing protocols are used by designers of wireless packet data networks to lower the node degree, simplify routing and lower the nodes’ energy consumpti...