Scoped bellman-ford geographic routing for large dynamic wireless sensor networks

Xue Zhang, Jue Hong, Sang Lu Lu, Li Xie, Jiannong Cao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)944-956
Number of pages13
JournalJournal of Computer Science and Technology
Volume23
Issue number6
DOIs
Publication statusPublished - 1 Nov 2008

Keywords

  • Bellman-Ford
  • Geographic routing
  • Scalability
  • Void (hole)
  • Wireless sensor network

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this