834 search results - page 60 / 167 » Understanding Node Localizability of Wireless Ad-hoc Network... |
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
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...
WOWMOM
2006
ACM
15 years 3 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...