By Topic

The Application of Dynamic Programming Algorithm In Route Protocol of Wireless Sensor Network (WSN)

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

3 Author(s)
Shi Weiren ; Chongqing Univ., Chongqing ; Deng Pengcheng ; Zhang Yang

The main body of this paper is studied specifically for the problem of low-power consumption in wireless sensor network (WSN), and then carries out an experiment. On comparing greedy algorithm and Floyd algorithm with dynamic programming algorithm, finally we adopt the dynamic programming algorithm to improve the route protocol of WSN, and explore an optimal route from Resource node to SINK node, on the purpose of reducing energy consumption of WSN. At last we use NS2 to testify the improved route algorithm, the result shows that it has a huge development in route overhead and end to end transmission delay.

Published in:

Control Conference, 2007. CCC 2007. Chinese

Date of Conference:

July 26 2007-June 31 2007