Abstract
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 discussed. CBGR is a distributed routing strategy and easy to implementation. By selecting multiple forwarding curves, CBGR can balance the energy consumption of the nodes effectively. The analysis and simulation also show that CBGR has better performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM 2000 (2000)
Crawley, E., et al.: A Framework for QoS-based Routing in the Internet. RFC 2386 (August 1998)
Niculescu, D., Nath, B.: Routing on a curve. In: Proceedings of Workshop on Hot Topics in Networks, HOTNETS-I (2002)
Yuksel, M., Pradhan, R., Kalyanaraman, S.: Trajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks. In: Proc. of the IEEE 2nd Upstate New York Workshop on Sensor Networks, Syracuse, NY (October 2003)
Johnson, D., Maltz, D.: Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing 353 (1996)
Niculercu, D., Nath, B.: Position and Orientation in Ad Hoc Networks. Elrevier Ad Hoc Nehwrkr 2(2), 133–151 (2004)
Braginsky, D., Estrin, D.: Rumor Routing Algorthim for Sensor Networks. In: Proc. of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (September 2002)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: Proc. of Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, June 23-27, vol. 3, pp. 1597–1604 (2002)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Proc ACM MobiCom 2000, Boston, MA, pp. 56–57 (2000)
Heinzelman, W.: Application-Specific Protocol Architectures for Wireless Networks, Ph.D. thesis, Massachusetts Institute of Technology (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Lin, Yp., Lin, M., Li, P., Zhou, Sw. (2005). Curve-Based Greedy Routing Algorithm for Sensor Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_117
Download citation
DOI: https://doi.org/10.1007/11534310_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)