Rolling Circle Algorithm for Routing Along the Boundaries of Wireless Sensor Networks

  • Rajesh Sharma
  • Lalit Kumar Awasthi
  • Naveen Chauhan
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 5)


Geographic routing has emerged as one of the most suitable strategies for routing in Wireless Sensor Networks (WSNs). Greedy forwarding (GF) is an efficient form of geographic routing in which a packet is progressively pushed closest to the destination in each hop. The presence of communication voids may lead GF to fail at dead-ends. The dead-end situation is usually handled by using methods like flooding, face routing, and routing along network boundaries. Existing schemes for handling void problems are either too inefficient or are rely on some unrealistic assumptions like unit disk graph model of connectivity. In this chapter, a scheme called Rolling Circle Algorithm (RCA) is presented for recovering from dead-ends by routing packets along the boundary of the WSN until GF can resume again. The proposed technique is based on a variant of alpha-shapes method of detecting boundaries of a point cloud. The value of the parameter alpha used to detect boundary nodes adapts according to the local topology and location information of 1-hop neighbors of the forwarding node.


Wireless sensor networks Geographic routing Perimeter routing Rolling-circle algorithm 


  1. 1.
    Kuhn, F., Wattenhofer, R, Zollinger, A.: An Algorithmic Approach to Geographic Routing. IEEE/ACM Trans Netw. 16, pp. 51–62. (2008).Google Scholar
  2. 2.
    Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry. pp. 1–4 (1999).Google Scholar
  3. 3.
    Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: 6th annual international conference on Mobile computing and networking pp. 243–254. ACM (2000).Google Scholar
  4. 4.
    Bose, P., Morin, P., Stojmenović, I. and Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless networks. 7(6), pp. 609–616 (2001).Google Scholar
  5. 5.
    Kuhn, F., Wattenhofer, R. and Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: 6th international workshop on Discrete algorithms and methods for mobile computing and communications. pp. 24–33. ACM (2002).Google Scholar
  6. 6.
    Liu, W.J. and Feng, K.T.: Greedy routing with anti-void traversal for wireless sensor networks. IEEE Transactions on Mobile Computing, 8(7), pp. 910–922 (2009).Google Scholar
  7. 7.
    Rührup, S. and Stojmenovi, I.: Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks. In: IEEE Int. Symp. on Parallel & Distributed Processing (IPDPS), pp. 1–9. IEEE (2010).Google Scholar
  8. 8.
    Chen, D. and Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys & Tutorials, 9(1), pp. 50–67 (2007).Google Scholar
  9. 9.
    Stojmenovic, I. and Lin, X.: Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(10), pp. 1023–1032 (2001).Google Scholar
  10. 10.
    Chen, D., Deng, J. and Varshney, P.K.: On the forwarding area of contention-based geographic forwarding for ad hoc and sensor networks. In: SECON (Sept-2005) pp. 130–141 (2005).Google Scholar
  11. 11.
    Kim, Y.J., Govindan, R., Karp, B. and Shenker, S.: Geographic routing made practical. In: 2nd conference on Symposium on Networked Systems Design & Implementation-Volume 2, (May-2005) pp. 217–230. USENIX Association (2005).Google Scholar
  12. 12.
    Radhakrishnan, S., Racherla, G., Sekharan, C.N., Rao, N.S. and Batsell, S.G.: DST-A routing protocol for ad hoc networks using distributed spanning trees. In: Wireless Communications and Networking Conference (WCNC-1999), pp. 1543–1547. IEEE. (1999).Google Scholar
  13. 13.
    Leong, B., Liskov, B. and Morris, R.: Geographic Routing Without Planarization. In: NSDI (May-2006), Vol. 6, pp. 25–25 (2006).Google Scholar
  14. 14.
    Edelsbrunner, H., Kirkpatrick, D. and Seidel, R.: On the shape of a set of points in the plane. IEEE Transactions on information theory, 29(4), pp. 551–559 (1983).Google Scholar
  15. 15.
    Bose, P., Devroye, L., Evans, W. and Kirkpatrick, D.: On the spanning ratio of gabriel graphs and β-skeletons. In: Latin American Symposium on Theoretical Informatics (April-2002), pp. 479–493, Springer, Berlin Heidelberg (2002).Google Scholar
  16. 16.
    Fang, Q., Gao, J. and Guibas, L.J.: Locating and bypassing holes in sensor networks. Mobile networks and Applications, 11(2), pp. 187–200 (2006).Google Scholar
  17. 17.
    Ma, X., Sun, M.T., Zhao, G. and Liu, X.: An efficient path pruning algorithm for geographical routing in wireless networks. IEEE Transactions on Vehicular Technology, 57(4), pp. 2474–2488 (2008).Google Scholar
  18. 18.
    Fayed, M. and Mouftah, H.T.: Localised alpha-shape computations for boundary recognition in sensor networks. Ad Hoc Networks, 7(6), pp. 1259–1269 (2009).Google Scholar
  19. 19.
    Rührup, S. and Stojmenovi, I.: Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks. In: IEEE Int. Symp. on Parallel & Distributed Processing (IPDPS-2010), pp. 1–9. IEEE (2010).Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  • Rajesh Sharma
    • 1
  • Lalit Kumar Awasthi
    • 1
  • Naveen Chauhan
    • 1
  1. 1.National Institute of TechnologyHamirpurIndia

Personalised recommendations