article

GOAL: A parsimonious geographic routing protocol for large scale sensor networks

Authors:

Radu StoleruAuthors Info & Claims

Ad Hoc Networks, Volume 11, Issue 1

Pages 453 - 472

https://doi.org/10.1016/j.adhoc.2012.07.006

Published: 01 January 2013 Publication History

Abstract

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, the local minimum caused by holes/obstacles results in the worst-case path stretch of @W(c^2), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a path stretch of @Q(c) can be achieved. This path stretch, however, is achieved at the cost of communication and storage overhead, which makes the practical deployment of VIGOR in large scale sensor networks challenging. To this end, we propose GOAL (Geometric Routing using Abstracted Holes), a routing protocol that provably achieves a path stretch of @Q(c), with lower communication and storage overhead. To compactly describe holes, we develop a novel distributed convex hull algorithm, which improves the message complexity O(n log^2n) of state of art distributed convex hull algorithm to O(n log n). The concise representation of a hole is used by nodes to make locally optimal routing decisions. Our theoretical analysis proves the correctness of the proposed algorithms and the path stretch of @Q(c). Through extensive simulations and experiments on a testbed with 42 EPIC motes, we demonstrate the effectiveness of GOAL and its feasibility for resource constrained wireless sensor networks; specifically, we show that GOAL eliminates part of communication overhead of VIGOR and reduces the memory overhead of VIGOR by up to 51%.

References

[1]

M. Won, R. Stoleru, H. Wu, Geographic routing with constant stretch in large scale sensor networks with holes, in: Proc. of IEEE WiMob, 2011.

[2]

J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris, A scalable location service for geographic ad hoc routing, in: Proc. of ACM MOBICOM, 2000.

Digital Library

[3]

S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, S. Shenker, GHT: a geographic hash table for data-centric storage, in: Proc. of ACM WSNA, 2002.

[4]

F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger, Geometric ad-hoc routing: of theory and practice, in: Proc. of ACM PODC, 2003.

[5]

Z. Jiang, J. Ma, W. Lou, An information model for geographic greedy forwarding in wireless ad-hoc sensor networks, in: Proc. of IEEE INFOCOM, 2008.

[6]

Q. Fang, J. Gao, L.J. Guibas, Locating and bypassing holes in sensor networks, in: Proc. of IEEE INFOCOM, 2004.

[7]

C. Liu, J. Wu, Destination-region-based local minimum aware geometric routing, in: Proc. of IEEE MASS, 2007.

[8]

Arad, N. and Shavitt, Y., Minimizing recovery state in geographic ad hoc routing. IEEE Trans. Mobile Comput. v8.

[9]

G. Tan, M. Bertier, A.-M. Kermarrec, Visibility-graph-based shortest-path geographic routing in sensor networks, in: Proc. of IEEE INFOCOM, 2009.

[10]

B. Karp, H.T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, in: Proc. of ACM MOBICOM, 2000.

[11]

S. Rajsbaum, J. Urrutia, Some problems distributed computational geometry, in: Proc. of SIROCCO, 1999.

[12]

Rajsbaum, S. and Urrutia, J., Some problems in distributed computational geometry. Theor. Comput. Sci. v412. 5760-5770.

Digital Library

[13]

Mao, Y., Wang, F., Qiu, L., Lam, S. and Smith, J., S4: small state and small stretch compact routing protocol for large static wireless networks. IEEE/ACM Trans. Networking. 761-774.

[14]

F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger, Geometric ad-hoc routing: of theory and practice, in: Proc. of PODC, 2003.

[15]

B. Leong, B. Liskov, R. Morris, Geographic routing without planarization, in: Proc. of NSDI, 2006.

[16]

J. Zhou, Y. Chen, B. Leong, P.S. Sundaramoorthy, Practical 3D geographic routing for wireless sensor networks, in: Proc. of ACM SenSys, SenSys '10, 2010.

[17]

G. Trajcevski, F. Zhou, R. Tamassia, B. Avci, P. Scheuermann, A. Khokhar, Bypassing holes in sensor networks: load-balance vs. latency, in: Proc. of GLOBECOM, 2011.

[18]

P. Li, G. Wang, J. Wu, H.-C. Yang, Hole reshaping routing in large-scale mobile ad-hoc networks, in: Proc. of IEEE GLOBECOM, 2009.

[19]

T. He, C. Huang, B.M. Blum, J.A. Stankovic, T. Abdelzaher, Range-free localization schemes for large scale sensor networks, in: Proc. of ACM MOBICOM, 2003.

[20]

L. Hu, D. Evans, Localization for mobile sensor networks, in: Proc. of ACM MOBICOM, 2004.

[21]

Attiya, H. and Welch, J., Distributed Computing: Fundamentals, Simulations and Advanced Topics. 2004. John Wiley & Sons.

[22]

Hans, and Rohnert, Shortest paths in the plane with convex polygonal obstacles. Inform. Process. Lett. v23 i2. 71-76.

[23]

Y. Wang, X.-Y. Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, in: Proc. of DIALM-POMC, 2003.

Digital Library

[24]

K. Clarkson, Approximation algorithms for shortest path motion planning, in: Proc. of ACM STOC, 1987.

Digital Library

[25]

George, S.M., Zhou, W., Chenji, H., Won, M., Lee, Y., Pazarloglou, A., Stoleru, R. and Barooah, P., DistressNet: a wireless AdHoc and sensor network architecture for situation management in disaster response. IEEE Commun. Mag. v48 i3.

[26]

Son, D., Helmy, A. and Krishnamachari, B., The effect of mobility-induced location errors on geographic routing in mobile ad hoc and sensor networks: analysis and improvement using mobility prediction. IEEE Trans. Mobile Comput. v3. 233-245.

Digital Library

[27]

J. Heidemann, W. Ye, J. Wills, A. Syed, Y. Li, Research challenges and applications for underwater sensor networking, in: Proc. of IEEE WCNC, 2006.

[28]

J. Allred, A.B. Hasan, S. Panichsakul, W. Pisano, P. Gray, J. Huang, R. Han, D. Lawrence, K. Mohseni, Sensorflock: an airborne wireless sensor network of micro-air vehicles, in: Proc. of ACM SenSys, 2007.

[29]

R. Flury, R. Wattenhofer, Randomized 3d geographic routing, in: Proc. of IEEE INFOCOM, 2008.

[30]

S.S. Lam, C. Qian, Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch, in: Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, San Jose, California, USA, 2011, pp. 257--268.

Digital Library

[31]

C. Liu, J. Wu, Efficient geometric routing in three dimensional ad hoc networks, in: Proc. of IEEE INFOCOM, 2009.

[32]

P. Dutta, J. Taneja, J. Jeong, X. Jiang, D. Culler, A building block approach to sensornet systems, in: Proc. of ACM SenSys, 2008.

Digital Library

[33]

J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, K. Pister, System architecture directions for networked sensors, in: Proc. of ASPLOS, 2000.

Digital Library

[34]

V. Shnayder, B.-r. Chen, K. Lorincz, T.R.F.F. Jones, M. Welsh, Sensor networks for medical care, in: Proc. of ACM SenSys, 2005.

Cited By

Boulaiche MBouallouche-Medjkoune L(2017)HSecGRJournal of Network and Computer Applications10.1016/j.jnca.2016.12.02880:C(189-199)Online publication date: 15-Feb-2017
https://dl.acm.org/doi/10.1016/j.jnca.2016.12.028
Nguyen PJi YLiu ZVu HNguyen K(2017)Distributed hole-bypassing protocol in WSNs with constant stretch and load balancingComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.10.001129:P1(232-250)Online publication date: 24-Dec-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.10.001
Vu HNguyen TNguyen CNguyen VHung NThang HDe Raedt LDeville YBui MLinh TSang DPhuong NOanh N(2016)An efficient geographic algorithm for routing in the proximity of a large hole in wireless sensor networksProceedings of the 7th Symposium on Information and Communication Technology10.1145/3011077.3011101(286-293)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/3011077.3011101
Show More Cited By

Index Terms

GOAL: A parsimonious geographic routing protocol for large scale sensor networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Mobile networks

Index terms have been assigned to the content through auto-classification.

Recommendations

A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor Networks

Geographic routing is well suited for large-scale wireless sensor networks (WSNs) because it is nearly stateless. One important challenge is that network holes may arbitrarily increase the routing path length. Fortunately, recent studies have shown that ...
Guaranteed-delivery in arbitrary dimensional Wireless Sensor Networks by means of recursive virtual coordinates
ISCC '12: Proceedings of the 2012 IEEE Symposium on Computers and Communications (ISCC)

Due to limitations in sensors' hardware and communication, routing in Wireless Sensor Networks (WSN) has required different approaches as compared to more powerful and conventional networks. One successful approach to the routing problem in WSN is based ...
Analysis of per-node traffic load in multi-hop wireless sensor networks

The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption. Consequently, a mathematical model that can accurately predict the communication traffic load of a sensor node is critical for ...

Comments

Information & Contributors

Information

Published In

Copyright © Elsevier B.V. © 2012.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 January 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Boulaiche MBouallouche-Medjkoune L(2017)HSecGRJournal of Network and Computer Applications10.1016/j.jnca.2016.12.02880:C(189-199)Online publication date: 15-Feb-2017
https://dl.acm.org/doi/10.1016/j.jnca.2016.12.028
Nguyen PJi YLiu ZVu HNguyen K(2017)Distributed hole-bypassing protocol in WSNs with constant stretch and load balancingComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.10.001129:P1(232-250)Online publication date: 24-Dec-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.10.001
Vu HNguyen TNguyen CNguyen VHung NThang HDe Raedt LDeville YBui MLinh TSang DPhuong NOanh N(2016)An efficient geographic algorithm for routing in the proximity of a large hole in wireless sensor networksProceedings of the 7th Symposium on Information and Communication Technology10.1145/3011077.3011101(286-293)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/3011077.3011101
Won MStoleru R(2014)A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor NetworksACM Transactions on Sensor Networks10.1145/262965911:1(1-22)Online publication date: 4-Aug-2014
https://dl.acm.org/doi/10.1145/2629659

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents