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

Author

Weiren, Shi ; Pengcheng, Deng ; Yang, Zhang

Author_Institution

Chongqing Univ., Chongqing

fYear

2007

Firstpage

615

Lastpage

618

Abstract

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.

Keywords

dynamic programming; greedy algorithms; routing protocols; wireless sensor networks; Floyd algorithm; dynamic programming algorithm; energy consumption reduction; greedy algorithm; route protocol; transmission delay; wireless sensor network; Automation; Dynamic programming; Educational institutions; Electronic mail; Energy consumption; Greedy algorithms; Heuristic algorithms; Testing; Wireless application protocol; Wireless sensor networks; Dynamic Programming Algorithm; Low-power; Wireless Sensor Network;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference, 2007. CCC 2007. Chinese

Conference_Location

Hunan

Print_ISBN

978-7-81124-055-9

Electronic_ISBN

978-7-900719-22-5

Type

conf

DOI

10.1109/CHICC.2006.4347253

Filename

4347253