By Topic

MultiPath Routing Algorithm for Wireless Multimedia Sensor Networks within Expected Network Lifetime

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mande Xie ; Coll. of Comput. Sci. & Inf. Eng., Zhejiang Gongshang Univ., Hangzhou, China ; Yuanyan Gu

Wireless multimedia sensor networks (WMSNs) are often used for rescue in heavy disasters, including a sudden earthquake, flood disaster and construction site collapse. Because the best time to rescue in these heavy disasters can be predicted, the network lifetime can be expected. According to this feature, this paper proposes a multipath routing algorithm for WMSNs. Firstly, a set of node-disjoint routing paths is found by the method similar to a mazing search algorithm to reduce the number of energy consumption gathering nodes and high risk nodes of network congestion. At the same time, it is easy to support hole-bypass for the nature feature of a mazing search algorithm. Then, a multipath selection strategy is introduced. It employs a new type of congestion control message, a gradual increase strategy based on a path and a gradual increase strategy based on a flow to balance load and energy. These systems integrating the algorithm can maximize the data gathering performance.

Published in:

Communications and Mobile Computing (CMC), 2010 International Conference on  (Volume:3 )

Date of Conference:

12-14 April 2010