The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2013 vol.62)
pp: 2440-2453
Stefan Ruhrup , Telecommunications Research Center Vienna (FTW), Vienna
Ivan Stojmenovic , University of Ottawa, Ottawa and Univeristy of Novi Sad, Serbia
ABSTRACT
Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three messages (RTS, CTS, and DATA) per forwarding step. However, existing contention-based schemes for recovery from greedy failures do not have this property. In this paper, we show that recovery is possible within this 3-message scheme: the Rotational Sweep (RS) algorithm directly identifies the next hop after timer-based contention and constructs a traversal path that ensures progress after a greedy failure. It uses a traversal scheme (called Sweep Circle) that forwards a message along the $(\alpha)$-shape of the network and provides recovery paths shorter or equal to the prominent face routing with Gabriel graph planarization. An alternative traversal scheme (called Twisting Triangle) provides even shorter routes on average, as shown by simulations. They both also reduce per-node overall network contention delays. We prove that both traversal schemes guarantee delivery in unit disk graphs. Our traversal schemes avoid planarization and are easy to implement, based merely on the evaluation of a function of a neighbor node's relative position. They can also be used for boundary detection and improve path-length in conventional beacon-based routing.
INDEX TERMS
Routing protocols, Design methodology, Algorithm design and analysis, Planarization, Network topology,Algorithm/protocol design and analysis, Routing protocols
CITATION
Stefan Ruhrup, Ivan Stojmenovic, "Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks", IEEE Transactions on Computers, vol.62, no. 12, pp. 2440-2453, Dec. 2013, doi:10.1109/TC.2012.148
REFERENCES
[1] T. Aguilar, S.-J. Syue, V. Gauthier, H. Afifi, and C.-L. Wang, "CoopGeo: A Beaconless Geographic Cross-Layer Protocol for Cooperative Wireless Ad Hoc Networks," IEEE Trans. Wireless Comm., vol. 10, no. 8, pp. 2554-2565, Aug. 2011.
[2] B. Blum, T. He, S. Son, and J. Stankovic, "IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks," Technical Report CS-2003-11, Univ. of Virginia, Apr. 2003.
[3] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '99), pp. 48-55, 1999.
[4] D. Chen and P.K. Varshney, "A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks," IEEE Comm. Surveys and Tutorials, vol. 9, no. 1, pp. 50-67, 2007.
[5] S. Datta, I. Stojmenovic, and J. Wu, "Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks," Cluster Computing, vol. 5, no. 2, pp. 169-178, 2002.
[6] H. Edelsbrunner, D. Kirkpatrick, and R. Seidel, "On the Shape of a Set of Points in the Plane," IEEE Trans. Information Theory, vol. IT-29, no. 4, pp. 551-559, July 1983.
[7] Q. Fang, J. Gao, and L.J. Guibas, "Locating and Bypassing Routing Holes in Sensor Networks," Mobile Networks and Applications, vol. 11, pp. 187-200, 2006.
[8] M. Fayed and H.T. Mouftah, "Localised Alpha-Shape Computations for Boundary Recognition in Sensor Networks," Ad Hoc Networks, vol. 7, no. 6, pp. 1259-1269, 2009.
[9] G.G. Finn, "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks," Technical Report ISI/RR-87-180, Univ. of Southern California, Mar. 1987.
[10] H. Frey and S. Rührup, "Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks," Proc. GI/ITG Fachtagung Kommunikation in Verteilten Systemen (KiVS '09), Mar. 2009.
[11] H. Frey, S. Rührup, and I. Stojmenovic, "Routing in Wireless Sensor Networks," Guide to Wireless Sensor Networks, S. Misra, I. Woungang, and S.C. Misra, eds. Springer, May 2009.
[12] H. Frey and I. Stojmenovic, "On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks," IEEE Trans. Computers, vol. 59, no. 9, pp. 1224-1238, Sept. 2010.
[13] H. Füßler, J. Widmer, M. Mauve, and H. Hartenstein, "A Novel Forwarding Paradigm for Position-Based Routing (with Implicit Addressing)," Proc. IEEE 18th Ann. Workshop Computer Comm. (CCW '03), pp. 194-200, 2003.
[14] K.R. Gabriel and R.R. Sokal, "A New Statistical Approach to Geographic Variation Analysis," Systematic Zoology, vol. 18, no. 3, pp. 259-278, 1969.
[15] J. Gao, L.J. Guibas, J.E. Hershberger, L. Zhang, and A. Zhu, "Geometric Spanner for Routing in Mobile Networks," Proc. ACM MobiHoc '01, pp. 45-55, Oct. 2001.
[16] B. Gfeller and E. Vicari, "A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs," Ad Hoc & Sensor Wireless Networks, vol. 6, nos. 3/4, pp. 197-213, 2008.
[17] M. Heissenbüttel and T. Braun, "A Novel Position-Based and Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks," Proc. IEEE Third Workshop Applications and Services in Wireless Networks, pp. 197-209, 2003.
[18] M. Heissenbüttel, T. Braun, T. Bernoulli, and M. Wälchli, "BLR: Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks," Computer Comm., vol. 27, no. 11, pp. 1076-1086, July 2004.
[19] J.W. Jaromczyk and G.T. Toussaint, "Relative Neighborhood Graphs and their Relatives," Proc. IEEE, vol. 80, no. 9, pp. 1502-1517, Sept. 1992.
[20] H. Kalosha, A. Nayak, S. Rührup, and I. Stojmenovic, "Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks," Proc. IEEE INFOCOM, Apr. 2008.
[21] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing," Proc. Fourth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 267-278, 2003.
[22] X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, 2002.
[23] W.-J. Liu and K.-T. Feng, "Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 8, no. 7, pp. 910-922, July 2009.
[24] S. Rührup, H. Kalosha, A. Nayak, and I. Stojmenovic, "Message-Efficient Beaconless Georouting with Guaranteed Delivery in Wireless Sensor, Ad Hoc, and Actuator Networks," IEEE/ACM Trans. Networking, vol. 18, no. 1, pp. 95-108, Feb. 2010.
[25] S. Rührup and I. Stojmenovic, "Contention-Based Georouting with Guaranteed Delivery, Minimal Communication Overhead, and Shorter Paths in Wireless Sensor Networks," Proc. 24th Int'l Parallel and Distributed Processing Symp. (IPDPS '10), Apr. 2010.
[26] S. Rührup and I. Stojmenovic, "A New Traversal Scheme for Georouting and Boundary Detection in WSNs," Technical Report TR-2010-05, SITE, Univ. of Ottawa, Canada, Aug. 2010.
[27] J. Sanchez, R. Marin-Perez, and P. Ruiz, "Boss: Beacon-less on Demand Strategy for Geographic Routing Inwireless Sensor Networks," Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems (MASS '07), pp. 1-10, Oct. 2007.
[28] J.A. Sanchez, P.M. Ruiz, and R. Marin-Perez, "Beacon-Less Geographic Routing Made Practical: Challenges, Design Guidelines, and Protocols," IEEE Comm. Magazine, vol. 47, no. 8, pp. 85-91, Aug. 2009.
[29] M. Zorzi and R.R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance," IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003.
121 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool