基于小世界的无线传感器网络的路由算法  

Small world routing algorithm of wireless sensor network

作　　者：任秀丽[1] 董姜颖[1] 薜建生[1] 

机构地区：[1]辽宁大学信息学院,沈阳110036

出　　处：《计算机应用》2010年第9期2497-2500,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60704046);辽宁大学"211工程"三期建设项目;辽宁省教育厅2008年度高等学校科研项目(253)

摘　　要：针对小世界的拓扑特性,提出一种基于小世界的无线传感器网络(WSN)的路由算法。该路由算法引入超级节点环概念,将超级节点环视为无向图,利用改进的Floyd算法计算出最短传输路径,缩短路由建立时间,进而提高网络的传输效率,降低无线传感器网络的能耗。仿真结果表明,该算法与针对小世界提出的路由算法PSCF、SWRP和MH相比,在路由建立时间、能量消耗和网络吞吐量方面效果显著。Concerning the small-world topology characteristics, Small World Routing Algorithm （ SWRA） of wireless sensor network was proposed in this paper. The algorithm introduced super-node ring which was considered as an undirected graph. The improved Floyd algorithm was used to calculate the shortest transmission path and shorten the route setup time in order to increase transmission efficiency and reduce energy consumption in wireless sensor networks. The simulation results show that the proposed algorithm is more effective and available than the others in the routing setup time, energy dissipation and network throughput.

关 键 词：小世界 无线传感器网络 路由算法 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]