ARROW: Azimuth-Range ROuting for large-scale Wireless sensor networks

During the past few years, the development of wireless sensor network technologies has spurred the design of novel protocol paradigms capable of meeting the needs of a wide broad of applications while taking into account the inherent constraints of the underlying network technologies, e.g. limited energy and computational capacities. Geographic routing is one of such paradigms whose principles of operation are based on the geographic location of the network nodes. Even though the large number of works already reported in the literature, there are still many open issues towards the design of robust and scalable geographic routing algorithms. In this study, after an analysis of the most relevant solutions reported in the literature, we introduce Azimuth-Range ROuting for large-scale Wireless (ARROW) sensor networks. ARROW goes a step further on the design of geographic routing protocols by defining a simple and robust routing protocol whose operation principles completely free the network nodes of the burden of keeping routing records. Under ARROW, nodes carry out all routing decisions exclusively using the information imbedded in the data packets while avoiding the risk of routing loops, a major challenge when designing routing protocols for large-scale networks. Moreover, ARROW is supplemented with a simple yet effective forwarder resolution protocol, also introduced in this study, allowing the fast and loop-free selection of the forwarding node in a hop-to-hop basis. Both protocols, ARROW and the proposed forwarder resolution protocol, are validated by extensive computer simulations. Our results show that both protocols exhibit excellent scalability properties by limiting the overhead.

[1]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[2]  Pawel Kulakowski,et al.  Angle-of-arrival localization based on antenna arrays for wireless sensor networks , 2010, Comput. Electr. Eng..

[3]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[4]  Roger Wattenhofer,et al.  Randomized 3D Geographic Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[5]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[6]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[7]  Li Xiao,et al.  Sensor Localization under Limited Measurement Capabilities , 2007, IEEE Network.

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

[9]  Ivan Stojmenovic.  Simulations in wireless sensor and ad hoc networks: matching and advancing models, metrics, and solutions , 2008, IEEE Communications Magazine.

[10]  Jean-Yves Le Boudec,et al.  A Scalable Routing Scheme for Self-Organized Terminode Network , 2002 .

[11]  Sang Hyuk Son,et al.  IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks , 2003 .

[12]  Jörg Widmer,et al.  Contention-based forwarding for mobile ad hoc networks , 2003, Ad Hoc Networks.

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

[14]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[15]  I. Stojmenovic,et al.  Message-Efficient Beaconless Georouting With Guaranteed Delivery in Wireless Sensor, Ad Hoc, and Actuator Networks , 2010, IEEE/ACM Transactions on Networking.

[16]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[17]  Ivan Stojmenovic,et al.  Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[18]  Marc Heissenbuttel.  A Novel Position-based and Beacon-less Routing Algorithm for Mobile Ad-Hoc Networks , 2003 .

[19]  Volker Turau,et al.  BGR: blind geographic routing for sensor networks , 2005, Third International Workshop on Intelligent Solutions in Embedded Systems, 2005..

[20]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2009, TOSN.

[21]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

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

[23]  Ivan Stojmenovic,et al.  Handbook of Sensor Networks: Algorithms and Architectures , 2005, Handbook of Sensor Networks.

[24]  Roger Wattenhofer,et al.  An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[25]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[26]  Ivan Stojmenovic,et al.  Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[27]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[28]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[29]  Torsten Braun,et al.  BLR: beacon-less routing algorithm for mobile ad hoc networks , 2004, Comput. Commun..

[30]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..