Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16322
Title: Scoped bellman-ford geographic routing for large dynamic wireless sensor networks
Authors: Zhang, X
Hong, J
Lu, SL
Xie, L
Cao, JN 
Issue Date: 2008
Source: Journal of computer science and technology, 2008, v. 23, no. 6, p. 944-956
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.
Keywords: Bellman-Ford
Geographic routing
Scalability
Void (hole)
Wireless sensor network
Journal: Journal of Computer Science and Technology 
ISSN: 1000-9000
DOI: 10.1007/s11390-008-9197-9
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Sep 3, 2020

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 21, 2020

Page view(s)

167
Last Week
0
Last month
Citations as of Sep 15, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.