Advertisement

Algorithms for Delay Constrained and Energy Efficiently Routing in Wireless Sensor Network

  • Yuanli Wang
  • Xianghui Liu
  • Jing Ning
  • Jianping Yin
  • Yongan Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)

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.

Keywords

Sensor Node Wireless Sensor Network Relay Node Knapsack Problem Delay Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., et al.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Sohrabi, K., et al.: Protocols for self-organization of a wireless sensor network. IEEE Personal Communications 7(5), 16–27 (2000)CrossRefGoogle Scholar
  3. 3.
    Rabaey, J.M., et al.: PicoRadio supports ad hoc ultra low power wireless networking. IEEE Computer 33, 42–48 (2000)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Rodoplu, V., Ming, T.H.: Minimum energy mobile wireless networks. IEEE Journal of Selected Areas in Communications 17(8), 1333–1344 (1999)CrossRefGoogle Scholar
  9. 9.
    Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17(1), 36–42 (1992)CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yuanli Wang
    • 1
  • Xianghui Liu
    • 1
    • 2
  • Jing Ning
    • 2
  • Jianping Yin
    • 1
  • Yongan Wu
    • 1
  1. 1.School of Computer ScienceNational University of Defense TechnologyChangsha CityPRC
  2. 2.School of Electronic Science & TechnologyNational University of Defense TechnologyChangsha CityPRC

Personalised recommendations