摘要
无线传感器网络存在拓扑规模庞大、Mesh组网及传感器结点能量有限和处理能力差的缺点。为提高无线传感器网络路由效率,提出一种简单的全局路由最优算法。该算法根据变量r的不同取值,使算法输出路径不同,进而预防网络拥塞的发生。仿真实验表明,并行近似最短路由算法所耗时间是Dijkstra算法的1/3,该算法既能满足无线传感器路由需求,又能解决无线传感器网络拥塞的问题。
Wireless sensor network has the following features,such as large-scale topology,Mesh networking,the limited energy of nodes,poor processing ability.Global routing optimization algorithm is presented in this paper.The proposed algorithm can prevent the occurrence of network congestion by selecting the different value of the variable r to get different output-path.Simulation results show that the processing time of this algorithm is only the third of that of Dijkstra algorithm.At the same time,it can not only meet the routing requirements of wireless sensor networks,but also solve the congestion problem of wireless sensor networks
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第13期92-94,共3页
Computer Engineering
基金
国家科技重大专项基金资助项目(2009ZX03004-001)
中国科学院知识创新工程方向性基金资助项目(KGCX1-YW-19
KGCX2-YW-149)
关键词
无线传感器网络
路由算法
拥塞
全局路由最优算法
拓扑优化
wireless sensor network
routing algorithm
congestion
global routing optimization algorithm
topology optimization
