1408 search results - page 154 / 282 » Dealing with Node Mobility in Ad Hoc Wireless Network |
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
WIOPT
2005
IEEE
15 years 3 months ago
2005
IEEE
The log-normal shadowing radio model has frequently been used to model radio propagation conditions. There exist accurate calculation methods for estimation of interference power ...
WOWMOM
2006
ACM
15 years 4 months ago
2006
ACM
RTS-CTS handshake based protocols achieve “reliable unicast” by eliminating the hidden node problem effectively, however, these solutions are not directly or efficiently gene...
TWC
2010
14 years 4 months ago
2010
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...