检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:顾云丽[1,2] 徐昕[1,2] 张嫣娟[2] GU Yunli;XU Xin;ZHANG Yanjuan(Jiangsu Engineering Center of Network Monitoring,Nanjing University of Information Science and Technology,Nanjing 210044,China;College of Computer and Software,Nanjing University of Information Science and Technology,Nanjing 210044,China)
机构地区:[1]南京信息工程大学江苏省网络监控中心,南京210044 [2]南京信息工程大学计算机与软件学院,南京210044
出 处:《传感技术学报》2018年第3期436-441,共6页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目(61403206);南京信息工程大学大学生科技创新项目(201610300212)
摘 要:在无线传感器网络WSN(Wireless Sensor Networks)中存在无线链路容易失效的现象,但大多数学者在设计路由算法时较多地关注网络生存期问题,而忽略路由健壮性问题。提出一种基于进化算法的WSN任播路由算法。该算法以网络生存期和路由健壮性为优化目标,并通过多目标进化算法寻找到两者的最佳适应值。实验验证了该算法的有效性,实验数据表明:相比较基于单目标优化(网络生存期)的任播路由算法,所提算法的网络生存期及路由健壮性两个性能的综合优化值优于前者;相比较传统单路径任播路由算法,所提算法的网络生存期、路由健壮性和可扩展性优于前者。In wireless sensor networks(WSN),there exists the question about wireless link failure.However,most scholars pay more attention to the network lifetime while designing routing algorithms,but ignore the routing robustness problem.In this paper,an anycast routing algorithm based on evolutionary algorithm for WSN is proposed.The algorithm takes both the network lifetime and routing robustness as the optimization objectives,and finds the best fitness of them by multi-objective evolutionary algorithm.Experimental results show that the algorithm is effective,and experimental data show that:compared with anycast routing algorithm based on single-objective(network lifetime)optimization,the proposed algorithm can balance network lifetime and routing robustness better;compared with traditional single-path anycast routing algorithm,the performances of the proposed algorithm are better in terms of network lifetime,routing robustness and scalability.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.250.255