Sciweavers

Share
ICCNMC
2005
Springer

Curve-Based Greedy Routing Algorithm for Sensor Networks

9 years 9 months ago
Curve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in implementing many networking functions when standard bootstrapping or configuration services are not available, as will be the case in sensor networks where nodes are thrown or dropped to form a one-time use network. In this paper, investigating Trajectory-Based Forwarding (TBF), we propose a novel curve-based greedy routing algorithm (CBGR) for sensor networks. In CBGR, by using the location information of a source node and the sink, the source constructs a B-spline curve as forwarding trajectory and encodes the curve into the packets. Upon receiving each packet, the intermediate nodes decode it and construct a simple dynamic forwarding table (DFT) by different greedy forwarding strategies. Then, the packets are forwarded along the selected curve based on DFT. Several greedy forwarding strategies are discus...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICCNMC
Authors Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zhou
Comments (0)
books