Abstract Key issues of wireless ad hoc networks are auto-configuration and flexibility. Due to mobility, wireless networks are subject to frequent splits and merges. In many situ...
Franck Legendre, Marcelo Dias de Amorim, Serge Fdi...
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
Routing in ad-hoc networks is a complicated task because of many reasons. The nodes are low-memory, lowpowered, and they cannot maintain routing tables large enough for well-known ...
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaram...
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...