首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 46 毫秒
1.
WSNs中基于能量代价的最小权和支配集拓扑控制算法   总被引:1,自引:0,他引:1       下载免费PDF全文
该文针对无线传感器网络中最小连通支配集拓扑并非网络耗能最小拓扑的问题,定义由节点剩余能量,邻居个数和通信代价构建的能量代价函数综合反映支配节点的能量效率以及对降低网络整体能耗的贡献,进而以其作为拓扑权值,提出一种基于能量代价的最小权和连通支配集拓扑控制算法。算法选取局部最小权值节点担负支配任务,搭建整体权和最小的支配集,最小化网络整体能耗。实验结果表明,算法不仅具有节能的特点,还确保了通信链路的可靠性,有效延长了网络生命周期。  相似文献   

2.
徐丽  巨永锋  李雪 《现代电子技术》2011,34(17):160-162
针对异构监测传感器网络结构,设计了一个容错拓扑控制方案,在可以减少网络冗余的同时,兼顾了网络的稳定性,并且保证生成拓扑具有最小的能量消耗。该方案首先将异构监测传感器网络简化为同构传感器网络以简化计算,然后根据节点的位置信息,建立各监测节点到簇节点的能量消耗最小,并且可以保证K容错的K连通子图。该方案在保证传感器网络K连通的前提下,可以最大限度减少传感器网络中的冗余路径,且可以较好地均衡无线传感器网络能耗,延长网络生命周期。  相似文献   

3.
针对当前算法主要对拓扑构建或拓扑维护单独研究的问题,提出了一种将两个过程组合的拓扑控制算法,可以适应于通信和能量异构的网络。拓扑构建以较少的通信开销构建连通支配集,而拓扑维护由sink节点基于时间、能量或故障机制执行局部或全局修复策略以节约能量。理论分析和仿真实验证实,算法能以较少的时间和通信开销构建拓扑并延长网络生命时间。  相似文献   

4.
侯忠伟 《信息通信》2011,(6):111-112
无线传感器网络已成为当今的一个研究热点,由于无线传感器网络是一个能量受限网络,需要采取措施延长网络的正常使用寿命,负载均衡策略正是延长网络生命期的重要手段.本文介绍无线传感器网络中的节点负载问题,提出了一种基于拓扑控制的无线传感器网络节点负载均衡策略,有助于延长无线传感器网络的使用寿命.  相似文献   

5.
由于当前的无线传感器网络能量均衡路由方法未能考虑最优发射功率问题,导致无线传感器网络能量消耗较多、网络使用寿命较低以及网络节点能量不均衡,因此提出基于拓扑控制的无线传感器节能路由优化方法.将无线传感器节点的功率控制抽象为一个多人的非合作博弈问题,利用节点之间的博弈进行拓扑控制,从而获取最佳发射功率,并将蚁群算法应用于无...  相似文献   

6.
能量有效的分布式粒子滤波   总被引:2,自引:0,他引:2       下载免费PDF全文
该文根据无线传感器网络节点能量有限的特点,从节能的角度提出了能量有效的分布式粒子滤波算法.该文首先给出了算法的一个总体框架,然后从大数定理出发,研究粒子数对算法性能的影响.接着,基于节点的位置信息和测量方程,提出了一种节点选择算法.通过节点选择,可以把粒子滤波算法的计算复杂度分布到各个节点,进行分布式处理.最后,通过仿真验证算法的有效性.  相似文献   

7.
拓扑控制对于延长网络寿命,减小通信干扰,提高路由协议效率等具有重要的意义。睡眠调度和功率控制是现在研究的主流方向。全文首先阐述了无线传感器拓扑控制算法的研究进展,接着提出了一个混合型拓扑控制算法HTC,叙述了HTC算法的实现过程,它融合了睡眠调度和功率控制算法的优点,克服了它们的缺点,在提高网络性能和延长网络寿命方面起到很好的作用。  相似文献   

8.
稳定的编队通信网络能提高无人机(UAV)集群执行任务的能力,因此需要为编队设计一个信息交互拓扑,使无人机在保持编队队形的同时通信代价最小.针对无人机编队网络的拓扑优化问题,结合紫外光通信的优点,提出一种基于紫外光通信的无人机最优刚性编队生成算法.在分析机间紫外光通信链路模型的基础上,利用紫外半球形LED阵列协助无人机发...  相似文献   

9.
针对无线传感器网络中存在的能量空洞问题,该文提出一种能量均衡的层次型数据转发策略。根据节点可用能量、节点之间相对位置及不同网络区域簇头能量消耗速率构建非均匀层次化结构。进而,综合考虑节点簇内通信开销和节点关系选取中继转发节点,并在多跳簇间数据转发时执行数据融合进一步降低转发数据量以实现簇间多跳通信的能量有效性。数值结果表明,所提机制可以有效地均衡网络负载,延长网络生命周期,改善网络数据转发性能。  相似文献   

10.
无线传感器网络的可定性研究系统的回答了在测距条件下网络是否能够被定位。本文对无线传感网络定位技术的概念、算法和理论进行了综述,着重介绍了刚性理论在网络可定位性方面的基本理论,对无线传感器网络的研究具有重要意义。  相似文献   

11.
目前,大多数的拓扑控制算法采用的能耗模型不符合实际,仅仅只考虑了发送能耗,忽略了不同接收能耗对底层拓扑结构的影响。其次,通过构建最小能耗拓扑子图的拓扑控制算法并不能最大化网络生存期。基于真实的能耗模型主要研究异构传感器网络的拓扑控制问题,提出了一种适用于异构传感器网络生存期可延长的可调节结构(ALPH)来控制网络拓扑。理论和仿真实验表明:通过ALPH构造的拓扑图保持了网络的连通性和双向性;在不同的射频模块下,ALPH以最小能耗保留了任意节点对之间的最大生存期路径;ALPH可以依据不同电路能耗参数P R0进行调整,使得所生成的拓扑图在DRNG与MaxPower之间调节变化,并且允许节点有不同的路径损耗指数;基于网络设备的真实参数值,与先前的拓扑结构DRNG、DGG、EYG和MaxPower相比,ALPH可以有效地延长网络生存期。  相似文献   

12.
    
Clustering is one of the essential operations in wireless sensor network (WSN) to ensure organized data aggregation followed by energy efficiency. However, obtaining optimal clustering performance is yet an unsolved problem in WSN. Review of existing approaches towards cluster optimization shows that effective balance between energy efficiency and topology control is still missing. Therefore, the proposed system presents a unique topology control mechanism using a novel concept of interstellar orientation toward optimizing the clustering performance in WSN. Adopting an analytical research methodology, the proposed system introduces two interstellar‐based topology control system, which targets the maximum saving of resource consumption of the cluster head. The simulated outcome of the study shows that the proposed topology control system offers significant energy conservation performance in comparison to the existing hierarchical clustering scheme in WSN.  相似文献   

13.
无线传感器网络拓扑控制策略研究   总被引:1,自引:1,他引:1  
吴雪  马兴凯 《通信技术》2009,42(3):161-163
节能设计是无线传感器网络的首要设计目标,拓扑控制是实现该目标的重要技术之一,其主要目标是在保证网络连通和覆盖的前提下剔除不必要的通信链路,降低节点能耗和减少通信干扰,为MAC协议和路由协议的顺利执行提供基础。文中对传感器网络拓扑控制策略进行了的分析。最后针对目前传感器节点成本仍然很高这一特点,通过仿真得出了在节点随机配置的情况下,保证网络连通和覆盖所需的至少节点数目。并通过仿真分析证明了方案的可行性。  相似文献   

14.
    
In a multi‐hop sensor network, sensors largely rely on other nodes as a traffic relay to communicate with targets that are not reachable by one hop. Depending on the topology and position of nodes, some sensors receive more relaying traffic and lose their energy faster. Such imbalanced energy consumption may lead to server problems like network partitioning. In this paper, we study the problem of energy consumption balancing (ECB) in heterogeneous sensor networks by assuming general any‐to‐any traffic pattern. We consider both factors of transmission power and forwarding load in measuring energy consumption. To find a solution, we formulate the problem as a strategic network formation game with a new utility function. We show that this game is guaranteed to converge to strongly connected topologies which have better ECB and bounded inefficiency. We propose a localized algorithm in which every node knows only about its k‐hop neighbourhood. Through simulations on uniform and clustered networks with various densities, we show that the performance of our algorithm is comparable with global and centralized algorithms. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

15.
    
Energy allocation problems and routing problems are both important research issues in the wireless sensor network (WSN) field. The former usually aims at considering how to allocate a certain number of sensor devices in a sensing region to form a WSN so that the objective function value (e.g., the network connectivity or the network lifetime) of the constructed network is optimized. For the message routing problem in WSNs, researchers tend to consider how to find an energy conservable message transmission routing scheme for notifying the supervisor of the WSN when an event occurs. Till now, many solutions have been proposed for the above two categories of optimization problems. However, unifying the above two network optimization problems to maximize the network lifetime, to the best of our knowledge, still lacks related research. This paper considers a joint optimization problem for energy allocation and energy‐aware routing called the joint optimization of energy allocation and routing problem (JOEARP) for a hierarchical cluster‐based WSN. We propose an exact algorithm to provide the optimum solution for the JOEARP. The simulation results show that this solution performed better in prolonging the network lifetime of a WSN in a real situation, compared to other compositions of conventional energy allocation schemes with some known routing algorithms. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

16.
无线传感器网络中网络拓扑的动态调整对于提高路由协议和MAC协议的效率,延长网络的生存期,提高网络通信效率等方面具有重要的作用.本文在分析了一些拓扑控制算法的基础上,提出了一种新的层次型拓扑生成算法,该算法引入了时间门限值和节点剩余能量两个参数,在解决能耗不均衡问题上采取相对主动的方法.能够有效地均衡网络节点的能耗并延长网络的生存周期.  相似文献   

17.
Code dissemination is an important building block of wireless reprogramming. We notice that current code dissemination protocols fails to consider page selection and energy balancing. In this paper, we present an integrated mutual selection based code dissemination protocol (MSD). The key idea of MSD is mutual selection comprising sender selection and page selection. By exploiting link quality information in mutual selection, MSD enhances the propagation. Further, MSD takes energy level information in the sender selection, thus avoiding low power nodes’ over-consumption. We simulate MSD by settings of Mica-Z motes. Simulation results show that MSD can reduce the completion time and average transmission, and help low power nodes avoid unnecessary transmission and energy consumption.  相似文献   

18.
    
In this paper, we address the energy‐efficient connectivity problem of a wireless sensor network (WSN) that consists of (1) static sensor nodes that have a short communication range and limited energy level, and (2) relay nodes that have a long communication range and unlimited power supply, and that can be added or relocated arbitrarily. For such a WSN, existing studies have been focused on the design of efficient approximation algorithms to minimize the number of relay nodes. By contrast, we propose a unified backbone construction framework that can be performed in a centralized manner with two objectives: (1) to minimize the number of nodes in the backbone and (2) to maximize the lifetime of the network. To solve such a challenging problem, we formulate three subproblems: (1) partial dominating set with energy threshold (PDSET); (2) partial dominating set with largest residual energy (PDSLE); and (3) minimum relay node placement (MRNP). For these three subproblems, we develop polynomial‐time algorithms. We also prove that our algorithm for PDSLE is optimal, and our algorithm for the PDSET and MRNP problems have small approximation ratios. Numerical results show that the proposed framework can significantly improve energy efficiency and reduce backbone size. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号