WSNs中基于能量代价的最小权和支配集拓扑控制算法

该文针对无线传感器网络中最小连通支配集拓扑并非网络耗能最小拓扑的问题,定义由节点剩余能量,邻居个数和通信代价构建的能量代价函数综合反映支配节点的能量效率以及对降低网络整体能耗的贡献,进而以其作为拓扑权值,提出一种基于能量代价的最小权和连通支配集拓扑控制算法。算法选取局部最小权值节点担负支配任务,搭建整体权和最小的支配集,最小化网络整体能耗。实验结果表明,算法不仅具有节能的特点,还确保了通信链路的可靠性,有效延长了网络生命周期。     

基于多簇点简化的K容错能量均衡拓扑控制方案

针对异构监测传感器网络结构,设计了一个容错拓扑控制方案,在可以减少网络冗余的同时,兼顾了网络的稳定性,并且保证生成拓扑具有最小的能量消耗。该方案首先将异构监测传感器网络简化为同构传感器网络以简化计算,然后根据节点的位置信息,建立各监测节点到簇节点的能量消耗最小,并且可以保证K容错的K连通子图。该方案在保证传感器网络K连通的前提下,可以最大限度减少传感器网络中的冗余路径,且可以较好地均衡无线传感器网络能耗,延长网络生命周期。     

带有能量补给的异构无线传感器网络拓扑控制算法

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

基于拓扑控制的无线传感器网络节点负载均衡策略

无线传感器网络已成为当今的一个研究热点,由于无线传感器网络是一个能量受限网络,需要采取措施延长网络的正常使用寿命,负载均衡策略正是延长网络生命期的重要手段.本文介绍无线传感器网络中的节点负载问题,提出了一种基于拓扑控制的无线传感器网络节点负载均衡策略,有助于延长无线传感器网络的使用寿命.     

基于拓扑控制的无线传感器节能路由优化方法

由于当前的无线传感器网络能量均衡路由方法未能考虑最优发射功率问题,导致无线传感器网络能量消耗较多、网络使用寿命较低以及网络节点能量不均衡,因此提出基于拓扑控制的无线传感器节能路由优化方法。将无线传感器节点的功率控制抽象为一个多人的非合作博弈问题,利用节点之间的博弈进行拓扑控制,从而获取最佳发射功率,并将蚁群算法应用于无线传感器网络的路径选择,通过蚁群的动态适应和寻优能力平衡网络最短路径和能量均衡消耗,以达到无线传感器网络能量均衡路由优化的目的。仿真结果表明,所提方法能够有效降低能量消耗,提升网络使用寿命,使无线传感器网络能量达到均衡。     

能量有效的分布式粒子滤波

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

WSN中一种混合型拓扑控制算法

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

分布式能量均衡的WSN动态数据转发策略

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

紫外光通信协作无人机最优刚性编队生成算法

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

基于休眠和扇区的传感器网络拓扑控制算法

拓扑控制算法对节省无线传感器网络节点能量、延长网络寿命具有重要意义。无线传感器网络节省节点能量有两种方法：层次型拓扑结构控制和功率控制；但目前还没有算法将以上两种方法相结合。丈中是结合周期性休眠和拓扑控制的一种新型拓扑控制策略：基于休眠和扇区的无线传感器网络拓扑控制算法，将拓扑控制算法和节点的休眠结合起来。仿真结果表明：算法在不降低网络吞吐量条件下节省了网络能量消耗，有效延长网络寿命。     

具有路径能耗优化特性的WSN无标度容错拓扑控制算法

针对数据传输型的大规模无线传感网络中路径能量损耗问题,建立在多跳模式下的网络路径能耗优化模型,得出可以使网络通信能耗最小的节点度取值规律。依据节点度的最优取值,通过控制网络平均节点度的适应度模型来构建网络拓扑,提出一种具有路径能耗优化特性的无标度容错拓扑控制算法EETA(energy efficiency topology algorithm)。动态性能分析表明,由该算法生成的网络拓扑,其节点的度分布服从幂律,具有无标度拓扑的强容错能力。仿真实验结果显示,该算法同时也降低了网络路径能量消耗,具有路径节能性。     

异构传感器网络的一种生存期可延长的可调节拓扑结构

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

Interstellar‐based topology control scheme for optimal clustering performance in WSN

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.     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

An energy‐efficient localized topology control algorithm for wireless ad hoc and sensor networks

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy‐draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose a localized energy‐efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy‐efficient routing. Through theoretical analysis and simulation results, we prove that the proposed topology control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi‐hop wireless network as compared with existing topology control algorithms with little additional protocol overhead. Copyright © 2008 John Wiley & Sons, Ltd.     

An efficient topology reconfiguration algorithm for high speed connection-oriented LANs

This paper deals with the design and performance issues of a protocol, proposed for dynamic topology reconfiguration in high-speed connection-oriented local area networks (LANs). A distributed reconfiguration algorithm is introduced where each network node maintains the minimum-hop-tree connectivity information, corresponding to all the physically reachable network interfaces within the local subnetwork. An incremental and adaptive tree-maintenance strategy is designed for keeping a reconfiguration process isolated from the unaffected parts of the network. A call-by-call routing algorithm, working on top of this reconfiguration protocol, is also proposed with multiple heuristics for optimizing the end-to-end connection hop-count and network load distribution. Simulation results illustrating the correctness and performance of these protocols are included in this paper. Issues regarding a prototype implementation of the presented protocols are also discussed. © 1997 John Wiley & Sons, Ltd.     

Efficient distributed address assignment algorithm based on topology maintenance in ZigBee networks

Adopting the borrowed address algorithm can decrease the orphan nodes in ZigBee networks that use distributed address assignment mechanism （DAAM）. The existing borrowed address algorithms can increase the success rate of address assignment, but they have defects such as greater cost of overhead and time in founding network caused by breaking topology. To solve such problems, we propose an more efficient distributed borrowed address assignment algorithm based on topology maintenance （A2BTM） that has a topology maintenance function. It borrows address firstly from the offspring nodes in the same branch for the orphan nodes and replies distributed the request of the borrowed address message immediately, to maintain the network topology and decrease the overhead and time spent on the mechanism of borrowed address. Theoretical and simulation analyses manifest that AZBTM algorithm outperforms DAAM and its improved algorithms in terms of the overhead and time spent in founding network, on the premise of keeping a higher success rate of address assignment. Furthermore, A2BTM can lessen the influence from detour phenomenon efficiently.     

A distributed battery recovery aware topology control algorithm for wireless sensor networks

Battery recovery effect is a phenomenon that the available capacity of a battery could increase if the battery can sleep for a certain period of time since its last discharging. Accordingly, the battery can work for a longer time when it takes some rests between consecutive discharging processes than when it works all the time. However, this effect has not been considered in the design of energy‐efficient topology control algorithms for wireless sensor networks. In this paper, we propose a distributed battery recovery effect aware connected dominating set constructing algorithm (BRE‐CDS) for wireless sensor networks. In BRE‐CDS, each network node periodically decides to join the connected dominating set or not. Nodes that have slept in the preceding round have priority to join the connected dominating set in the current round while nodes that have worked in the preceding round are encouraged to take sleep in the current round for battery recovery. Detailed algorithm design is presented. The computational complexity of BRE‐CDS is deduced to be O(D²), where D is node degree. Simulation results show that BRE‐CDS can significantly prolong the network lifetime as compared with existing work. Copyright © 2016 John Wiley & Sons, Ltd.     

IEEE 802.15.6中能量有效的无线体域网拓扑结构优化研究

提出一种无线体域网(WBAN, wireless body area network)的网络拓扑结构设计方案。该方案针对IEEE 802.15.6标准的2跳扩展星型拓扑结构,建立基于混合整数非线性规划的能耗成本优化模型,通过调整中继节点的位置和数量,以及数据到汇聚节点的路由,获得优化的网络拓扑结构。实验结果分析表明,与Elias提出的EAWD(energy aware WBAN design) 模型相比,所提出的方案能使网络能耗减少40.5%,网络时延平均降低52.4%,网络寿命提高了一倍。