A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

Article Preview

Abstract:

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

553-558

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Li Layuan and Li ChunLin. A Multicast Routing Protocol with Multiple QoS constrains, Proc ofWCC Aug. 20021345-1350.

Google Scholar

[2] YANG Yun, GAO Feng, LIBin, TAO Bi-lei. Based on W SN Network the Largest Remaining Energy QoS Multicast Routing Algorithm. International Forum on Information Technology and Application. 2009, 732-736.

DOI: 10.1109/ifita.2009.538

Google Scholar

[3] Huang Yourui, Tian Yiming, Tang Chaoli. Simulation Research of the QoS Multicast Routing in WSN Based on QPSO Algorithm. Third International Symposium on Intelligent Information Technology Application. Third International Symposium on Intelligent Information Technology Application. 2009, 39-43.

DOI: 10.1109/iita.2009.364

Google Scholar

[4] Debasish Chakraborty, Goutam Chakraborty, and Norio Shiratori A Dynamic Multicast Routing Satisfying Multiple QoS Constrains,. International Journal of Network Management. Volume13 ,  Issue5  (September 2003). pp.321-335.

DOI: 10.1002/nem.485

Google Scholar

[5] Huimei Lu, Meilin Shi, Yong Xiang, Min Yang A New Distributed Scheme for Bandwidth- and Delay-constrained MulticastRouting,. http: /cscw. cs. tsinghua. edu. cn/cscwpapers/2002/ICACT2002-QDMR-tsinghua-finalversion. pdf.

Google Scholar

[6] Wang Jianxin QoS Routing Algorithms with Inaccurate Network State Information,. Adissertation Submitted for the Degree of Doctor Of Philosophy. October 2001, pp, 58~65.

Google Scholar

[7] Wang Jianxin, Wang Weiping, Chen Jianer, Chen Songqiao. A Randomized QoS Routing Algorithm On Networks with Inaccurate Link-State Information,. Journal of Computer Science and Technology. Volume 17 ,  Issue 1  (January 2002). pp.38-46.

DOI: 10.1109/icct.2000.890970

Google Scholar

[8] Mohamed F. Mokbel Wafaa A. El-Haweet M. Nazih El-Derini AN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS,. www. cs. purdue. edu/ homes/mokbel/ SPECTS2000. pdf.

Google Scholar

[9] Turgay Korkmaz and Marwan Krunz, A Dynamic Algorithm for Finding a Path Subject to Multiple QoS Constrains, http: /citeseer. nj. nec. com.

Google Scholar