A Multiple Constrained QoS Routing Algorithm for the wireless sensor networks
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 networks 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 muiticast routing,and adapt to all kinds of the topology networks,and have better expansibility.
WSN QoS multicast routing energy
Zhou Zeshun Xu Yi Yah Junjie Nie Zhongwei Li Layuan
School of Computer Science and Technology, Wuhan University of Technology Wuhan,China 430063
国际会议
太原
英文
45-49
2013-04-06（万方平台首次上网日期，不代表论文的发表时间）