Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
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...
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...