共查询到19条相似文献,搜索用时 78 毫秒
1.
为了提高无线传感器网络的稳定期,提出了一种高效节能的加权选举协议。该协议使用集群策略结合链状路由算法,在异构的无线传感器网络环境下改善节能并且延长稳定期。仿真结果表明该协议在网络寿命和稳定期方面的性能都优于LEACH,SEP和HEARP。另外,实验表明在异构环境下稳定期依赖于节点的额外能量。 相似文献
2.
路由是无线传感器网络的关键问题之一。通过分析TinyOS系统中MintRoute路由协议的主要结构和路由策略。提出一种能量有效的路由协议MintRouteEE。模拟结果表明,MintRouteEE能够较大地降低网络的能耗,从而达到延长网络生存时间的目的。 相似文献
3.
近年来,作为物联网重要支撑的无线传感器网络受WiFi等异构系统的干扰日益严重,传统路由协议在该干扰环境下的性能急剧下降。针对该问题,本文在引入动态簇的多信道策略的基础上,综合考虑信道切换代价、频谱受干扰程度、节点剩余能量、距离等因素提出了一种认知频谱干扰的能量有效的路由(CSIEE)算法。仿真结果表明,该路由与EEPA、AODV、AODV-EA路由相比,有效地节约了传感器节点能量,延长了网络生命周期。 相似文献
4.
本文根据井下作业的复杂环境及其对QoS的要求,设计了相应的无线传感器网络路由协议。该协议法求出了每个节点到Sink节点的最少跳数,并存储在每个节点中,在能量有效性、能量均衡性、减小延迟性和投递率方面均都具有很好的性能。 相似文献
5.
无线传感器网络能量均衡路由算法 总被引:5,自引:3,他引:2
设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间. 相似文献
6.
7.
8.
为了延长采用电池供电的无线传感器网络的生命周期,提出了一种综合考虑单个节点能耗和节点传输信息至汇集节点所需总能耗的路由算法.该算法首先根据网络中节点到汇集节点从小到大的距离顺序选择待规划节点,然后计算各对应候选节点的评价参数,该参数由单节点能耗和节点传输信息至汇集节点所需总能耗加权得到,最后选择评价参数最小的候选节点作为待规划节点的中继节点.仿真结果表明,该算法的生命周期明显长于LEACH(Low Energy Adaptive Clustering Hier-archy)算法. 相似文献
9.
无线传感器网络是一种全新的信息获取和处理技术,本文介绍了无线传感器网络的节点和网络结构,对最受关注的参耗策略及相关数据链路层协议,网络层路由协议做了比较详细的叙述。 相似文献
10.
11.
12.
13.
Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks (WSN), the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing 相似文献
14.
15.
DBR(Depth Based Routing)协议是水下无线传感器网络中第一个基于深度信息的路由协议。分析了水下无线传感器网络中DBR路由协议特性,详细阐述了DBR协议中的网络拓扑结构、数据转发机制及其存在的一些问题。并简单介绍了目前有关DBR的改进路由协议。 相似文献
16.
Lei Shi Zheng Yao Baoxian Zhang Cheng Li Jian Ma 《International Journal of Communication Systems》2015,28(11):1789-1804
Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
17.
18.
基于认知的无线传感器网络抗干扰路由算法 总被引:2,自引:0,他引:2
针对无线传感器网络受Wi—Fi等异构系统干扰日益严重的问题,在引入基于簇的动态多信道组网策略的基础上,综合考虑频谱受干扰程度、信道切换代价、节点剩余能量等因素,提出了一种认知频谱干扰的能量有效的路由(CSIEE)算法。仿真结果表明,该路由与EEPA,AODV,AODV—EA路由相比,有效地节约了传感器节点能量,延长了网络生命周期。 相似文献
19.
Lei Shi Baoxian Zhang Hussein T. Mouftah Jian Ma 《International Journal of Communication Systems》2013,26(10):1341-1355
Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献