Abstract
The growing popularity of wireless sensor network applications has stimulated strong interest in extending quality of service support to existing routing protocols. Conventional wireless sensor network routing protocols usually concentrate on the constrained condition of ‘shortest path’ with minimum used energy. However, the path with minimum used energy can’t provide the minimum end to end delay guarantee. Moreover, wireless sensor network is required to support the delay-sensitive traffic. So the reduction of the end to end delay is a new challenge for wireless sensor network. To this point, this paper mainly focuses on the node delay constrained energy efficiently routing algorithm.
Supported by the National Natural Science Foundation of China under Grant No.60373023.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., et al.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)
Sohrabi, K., et al.: Protocols for self-organization of a wireless sensor network. IEEE Personal Communications 7(5), 16–27 (2000)
Rabaey, J.M., et al.: PicoRadio supports ad hoc ultra low power wireless networking. IEEE Computer 33, 42–48 (2000)
Katz, R.H., Kahn, J.M., Pister, K.S.J.: Mobile Networking for Smart Dust. In: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1999), Seattle, WA (August 1999)
Youssef, M., Younis, M., Arisha, K.: A constrained shortest-path energy-aware routing algorithm for wireless sensor networks. In: Proceedings of the IEEE Wireless Communication and Networks Conference (WCNC 2002), Orlando, FL (March 2002)
Younis, M., Munshi, P., Al-Shaer, E.: Architecture for Efficient Monitoring and Management of Sensor Networks. In: Proceedings of the IFIP/IEEE Workshop on End-to-End Monitoring Techniques and Services (E2EMON 2003), Belfast, Northern Ireland (September 2003)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (July 2001)
Rodoplu, V., Ming, T.H.: Minimum energy mobile wireless networks. IEEE Journal of Selected Areas in Communications 17(8), 1333–1344 (1999)
Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17(1), 36–42 (1992)
Zhang, B., Krunz, M.: Algorithms and Protocols for Stateless Constrained-Based Routing. In: Proceddings of IEEE GLOBECOM 2001 – Global Internet Symposium, San Antonio (December 2001)
Yih-Chun, H., Johnson, D.B., Perrig, A.: SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks 1(1), 175–192 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Liu, X., Ning, J., Yin, J., Wu, Y. (2006). Algorithms for Delay Constrained and Energy Efficiently Routing in Wireless Sensor Network. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_59
Download citation
DOI: https://doi.org/10.1007/11814856_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37189-2
Online ISBN: 978-3-540-37190-8
eBook Packages: Computer ScienceComputer Science (R0)