Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the convergence time of a path-vector protocol
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
FAR: Face-aware routing for mobicast in large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Ultra-low power data storage for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Impact of Sensing Coverage on Greedy Geographic Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Models and solutions for radio irregularity in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Geographical Cluster-Based Routing in Sensing-Covered Networks
IEEE Transactions on Parallel and Distributed Systems
On-demand Geographic Forwarding for data delivery in wireless sensor networks
Computer Communications
Robust and compact geographic/topological structures for routing and information dissemination in wireless sensor networks
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
Adaptive location updates for mobile sinks in wireless sensor networks
The Journal of Supercomputing
An unequal cluster-based routing protocol in wireless sensor networks
Wireless Networks
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.