Gossiping along the Path: A Direction-Biased Routing Scheme for Wireless Ad Hoc Networks

Like any communication networks, Wireless ad hoc networks (WANETs) require routing to support many applications such as data aggregation and over-the- air firmware update. Traditional route discovery in WANETs floods request all over the network causing broadcast storm that will heavily consume the precious power resources on nodes. To respond, gossip routing is proposed to reduce the number of messages. In recent years, several algorithms have been developed to improve its efficiency using location information. However, they only make use of distance but not directional information which is much cheaper to acquire in WANETs. In this paper, we develop an approach to improve location- aided routing by making use of directional information, with and without distance information. Empirical results show that our approach outperforms existing gossip routing algorithms, including location-aided ones, on random and deployed WSNs. When only general direction information of nodes is given, performances of our algorithms only drop slightly. Hoping this approach can also benefit other types of routing tasks, we also migrate the spirit of this algorithm onto opportunistic routing and show improved performance than existing location-aided opportunistic routing.

[1]  Xiang-Yang Li,et al.  Regional Gossip Routing for Wireless Ad Hoc Networks , 2003, Mob. Networks Appl..

[2]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[3]  Bu-Sung Lee,et al.  Position Based Opportunistic Routing for Robust Data Delivery in MANETs , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[4]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[5]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[6]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[7]  L Wang,et al.  Opportunistic Routing in MultiHop Wireless Networks , 2010 .

[8]  Chen Qian,et al.  Greedy Distance Vector Routing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[9]  Jean-Yves Le Boudec,et al.  Self Organized Terminode Routing , 2002, Cluster Computing.

[10]  Yunhao Liu,et al.  Does Wireless Sensor Network Scale? A Measurement Study on GreenOrbs , 2013, IEEE Trans. Parallel Distributed Syst..

[11]  Roberto Beraldi,et al.  The polarized gossip protocol for path discovery in MANETs , 2008, Ad Hoc Networks.

[12]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[13]  Llorenç Cerdà-Alabern,et al.  Distance Progress Based Opportunistic Routing for wireless mesh networks , 2012, 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).

[14]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[15]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.