Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2008, Vol. 34 ›› Issue (16): 99-101. doi: 10.3969/j.issn.1000-3428.2008.16.035

• Networks and Communications • Previous Articles     Next Articles

Survivable Routing Algorithm for Wireless Sensor Network

DU Jun, LI Wei-hua   

  1. (School of Computer, Northwestern Polytechnical University, Xi’an 710072)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-08-20 Published:2008-08-20

无线传感器网络可生存路由算法

杜 君,李伟华   

  1. (西北工业大学计算机学院,西安 710072)

Abstract: This paper provides the best relationship between the transmission distance and the deploy density of the nodes to prolong the survivable time of the whole network. It analyzes the distance between nodes under ideal conditions when every pair of the nearby nodes has the same distance. In an area of 100 m ×100 m deployed by 1 000 nodes, the best distance of nodes is 3.92 m Simulation results in the condition of stochastic deployment are given. The best transmission distance is from 4 m to 6 m which meets the calculation To overcome the problem of network partition and useless transmission, feedback algorithm and appropriative cluster head are introduced to reduce the energy consumption while ensuring data sending. The method can increase the survivable time of network and can recover while some nodes fail.

Key words: Wireless Sensor Network(WSN), survivability, power control, routing

摘要: 提出基于功率控制的分布式可生存路由算法,通过节点分布密度确定初始发射功率,利用转发数据进行实时反馈以动态调整节点覆盖范围,引入专用转发簇头减少普通节点的能耗。实验证明,该算法在节点分布不均、部分节点失效等情况下仍能保证低能耗和可靠传输,具有良好的可生存性。

关键词: 无线传感器网络, 可生存性, 功率控制, 路由

CLC Number: