Skip to main content
SpringerLink
Log in

Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR (Scoped Bellman-Ford Routing), for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed Bellman-Ford method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good scalability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Heinzelman W, Kulik J, Balakrishnan H. Adaptive protocols for information dissemination in wireless sensor networks. In Proc. the ACM International Conference on Mobile Computing and Networking (MobiCom), Seattle, Washington, USA, 1999, pp.174–185.

  2. Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proc. the ACM International Conference on Mobile Computing and Networking (MobiCom), Boston, Massachusetts, USA, 2000, pp.56–67.

  3. Braginsky D, Estrin D. Rumor routing algorithm for sensor networks. In Proc. the ACM International Workshop on Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, 2002, pp.22–31.

  4. Schurgers C, Srivastava M B. Energy efficient routing in wireless sensor networks. In Proc. the MILCOM on Communications for Network-Centric Operations: Creating the Information Force, Washington DC, USA, 2001, pp.357–361.

  5. Ye F, Chen A, Lu S, Zhang L. A scalable solution to minimum cost forwarding in large sensor networks. In Proc. the IEEE International Conference on Computer Communications and Networks (ICCCN), Scottsdale, Arizona, USA, 2001, pp.304–309.

  6. Servetto S, Barrenechea G. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In Proc. the ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, 2002, pp.12–21.

  7. Karp B, Kung H T. Greedy perimeter stateless routing for wireless networks. In Proc. the ACM International Conference on Mobile Computing and Networking (MobiCom), Boston, Massachusetts, USA, 2000, pp.243–254,

  8. Sánchez J A, Marín-Pérez R, Ruiz P M. Beacon-less geographic routing in real wireless sensor networks. Journal of Computer Science and Technology, 2008, 23(3): 438–450.

    Article  Google Scholar 

  9. Xing Guoliang, Lu Chenyang, Pless Robert, Huang Qingfeng. Impact of sensing coverage on greedy geographic routing algorithms. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(4): 348–360.

    Article  Google Scholar 

  10. Chen D, Varshney P K. On-demand geographic forwarding for data delivery in wireless sensor networks. Computer Communications, 2007, 30(14/15): 2954–2967.

    Article  Google Scholar 

  11. Zorzi M, Rao R. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance. IEEE Transactions on Mobile Computing, 2003, 2(4): 349–365.

    Article  Google Scholar 

  12. Kuhn F, Wattenhofer R, Zollinger A. An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE/ACM Transactions on Networking, 2008, 16(1): 51–62.

    Article  Google Scholar 

  13. Wang Guojun, Wang Tian, Jia Weijia, Guo Minyi, Li Jie. Adaptive location updates for mobile sinks in wireless sensor networks. Journal of Supercomputing, 2008. (To appear)

  14. Jia Weijia, Wang Tian, Wang Guojun, Guo Minyi. Hole avoiding in advance routing in wireless sensor networks. In Proc. the IEEE Wireless Communications and Networking Conference (WCNC), Hong Kong, China, 2007, pp.3519–3523.

  15. Chen Guihai, Li Chengfa, Ye Mao, Wu Jie. An unequal cluster-based routing protocol in wireless sensor networks. Wireless Networks, 2007, 42(2): 183–198.

    Google Scholar 

  16. Fang Qing. Robust and compact geographic/topological structures for routing and information dissemination in wireless sensor networks [Dissertation]. Adviser-Leonidas J. Guibas, Stanford, CA, USA, 2007.

  17. Frey Hannes, Gorgen Daniel. Geographical cluster-based routing in sensing-covered networks. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(9): 899–911.

    Article  Google Scholar 

  18. Al-Karaki J N, Kamal A E. Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, 2004, 11(6): 6–28.

    Article  Google Scholar 

  19. Pei Guangyu, Gerla Mario, Chen Tsu Wei. Fisheye state routing: A routing scheme for ad hoc wireless networks. In Proc. the IEEE International Conference on Communications (ICC), New Orleans, LA, USA, 2000, pp.70–74.

  20. Clausen T, Jacquet P. Optimized link state routing protocol (OLSR). IETF RFC 3626, 2003, http://www.ietf.org/rfc/rfc3626.txt.

  21. Perkins C, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proc. the ACM Conference on Communications Architectures, Protocols and Applications (SIGCOMM), London, UK, 1994, pp.234–244.

  22. Murthy S, Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks. ACM Mobile Networks and Applications, 1996, 1(2): 183–197.

    Article  Google Scholar 

  23. Ahmed N, Kanhere S S, Jha S. The holes problem in wireless sensor networks: A survey. ACM SIGMOBILE Mobile Computing and Communications Review, 2005, 9(2): 4–18.

    Article  Google Scholar 

  24. Chen D, Varshney P K. A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys and Tutorials, First Quarter, 2007, 9(1): 50–67.

    Article  Google Scholar 

  25. Kranakis E, Singh H, Urrutia J. Compass routing on geometric networks. In Proc. the Canadian Conference on Computational Geometry, Vancouver, Canada, 1999, pp.51–54.

  26. Kuhn F, Wattenhofer R, Zollinger A. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), Atlanta, Georgia, USA, 2002, pp.24–33.

  27. Kuhn F, Wattenhofer R, Zollinger A. Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proc. the ACM International Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), Annapolis, Maryland, USA, 2003, pp.267–278.

  28. Huang Qingfeng, Bhattacharya Sangeeta, Lu Chenyang, Roman Gruia-Catalin. FAR: Face-aware routing for mobicast in large-scale sensor network. ACM Transactions on Sensor Networks, 2005, 1(2): pp.240–271.

    Article  Google Scholar 

  29. Li Xiang Yang, Song W Z, Wang Y. Localized topology control for heterogeneous wireless sensor networks. ACM Transactions on Sensor Networks, 2006, 2(1): 129–153.

    Article  MathSciNet  Google Scholar 

  30. Zou L, Lu M, Xiong Z. PAGER: A distributed algorithm for the dead-end problem of location-based routing in sensor networks. In Proc. the IEEE International Conference on Computer Communications and Networks (ICCCN), Chicago, Illinois, USA, 2004, pp.509–514.

  31. Chen S, Fan G, Cui J. Avoid voids in geographic routing for data aggregation in sensor networks. International Journal of Ad Hoc and Ubiquitous Computing, 2006, 1(4): 169–178.

    Google Scholar 

  32. Yu Y, Estrin D, Govindan R. Geographical and energy-aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical Report UCLA-CSD TR-01-0023, Department of Computer Science, UCLA, May 2001.

  33. Lim Menghow, Greenhalgh Adam, Chesterfield Julian, Crowcroft Jon. Landmark guided forwarding. In Proc. the IEEE International Conference on Network Protocols (ICNP), Boston, Massachusetts, USA, 2005, pp.169–178.

  34. Joa-Ng Mario, Lu I-Tai. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 1999, 17(8): 1415–1424.

    Article  Google Scholar 

  35. Stojmenovic Ivan, Lin Xu. Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems, 2001, 12(10): 1023–1032.

    Article  Google Scholar 

  36. Du X, Wu D. Adaptive cell-relay routing protocol for mobile ad hoc networks. IEEE Transactions on Vehicular Technology, 2006, 55(1): 278–285.

    Article  Google Scholar 

  37. Mathur Gaurav, Desnoyers Peter, Ganesan Deepak, Shenoy Prashant. Ultra-low power data storage for sensor networks. In Proc. the ACM International Conference on Information Processing in Sensor Networks (IPSN), Nashville, Tennessee, USA, 2006, pp.374–381.

  38. Cheng X, Thaeler A, Xue G, Chen D. TPS: A time-based positioning scheme for outdoor wireless sensor networks. In Proc. the IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 2004, pp.2685–2696.

  39. Hu L, Evans D. Localization for mobile sensor networks. In Proc. the ACM International Conference on Mobile Computing and Networking (MobiCom), Philadelphia, Pennsylvania, USA, 2004, pp.1–13.

  40. Karloff Howard. On the convergence time of a path-vector protocol. In Proc. the ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, 2004, pp.605–614.

  41. Prakash R. Unidirectional links prove costly in wireless ad-hoc networks. In Proc. the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), Seattle, Washington, USA, 1999, pp.15–22.

  42. Zhou Gang, He Tian, Krishnamurthy S, Stankovic J. Models and solutions for radio irregularity in wireless sensor networks. ACM Transactions on Sensor Networks, 2006, 2(2): 221–262.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, 210093, China

    Xue Zhang, Jue Hong, Sang-Lu Lu & Li Xie

  2. Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    Jian-Nong Cao

  3. Department of Electrical Engineering, College of Engineering, Nanjing Agricultural University, Nanjing, 210031, China

    Xue Zhang

Authors
  1. Xue Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jue Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sang-Lu Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Li Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jian-Nong Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xue Zhang.

Additional information

This work is partially supported by the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z199, the National Natural Science Foundation of China under Grant Nos. 90718031 and 60721002, and the National Basic Research 973 Program of China under Grant No. 2006CB303000.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 77.1 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, X., Hong, J., Lu, SL. et al. Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks. J. Comput. Sci. Technol. 23, 944–956 (2008). https://doi.org/10.1007/s11390-008-9197-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9197-9

Keywords

Search

Navigation