We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
Stephane Durocher, David G. Kirkpatrick, Lata Nara...
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
Kartik Chandran, Sudarshan Raghunathan, S. Venkate...