A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Energy consumption in Wireless Sensor Networks (WSNs) is of paramount importance, which is demonstrated by the large number of algorithms, techniques, and protocols that have been developed to save energy, and thereby extend the lifetime of the network. However, in the context of WSNs routing and dissemination, Connected Dominating Set (CDS) principle has emerged as the most popular method for energy-efficient topology control (TC) in WSNs. In a CDS-based topology control technique, a virtual backbone is formed, which allows communication between any arbitrary pair of nodes in the network. In this paper, we present a CDS based topology control algorithm, A1, which forms an energy efficient virtual backbone. In our simulations, we compare the performance of A1 with three prominent CDS-based algorithms namely energy-efficient CDS (EECDS), CDS Rule K and A3. The results demonstrate that A1 performs better in terms of message overhead and other selected metrics. Moreover, the A1 not only achieves better connectivity under topology maintenance but also provides better sensing coverage when compared with other algorithms.     

Poly: A reliable and energy efficient topology control protocol for wireless sensor networks

Energy efficiency and reliability are the two important requirements for mission-critical wireless sensor networks. In the context of sensor topology control for routing and dissemination, Connected Dominating Set (CDS) based techniques proposed in prior literature provide the most promising efficiency and reliability. In a CDS-based topology control technique, a backbone - comprising a set of highly connected nodes - is formed which allows communication between any arbitrary pair of nodes in the network. In this paper, we show that formation of a polygon in the network provides a reliable and energy-efficient topology. Based on this observation, we propose Poly, a novel topology construction protocol based on the idea of polygons. We compare the performance of Poly with three prominent CDS-based topology construction protocols namely CDS-Rule K, Energy-efficient CDS (EECDS) and A3. Our simulation results demonstrate that Poly performs consistently better in terms of message overhead and other selected metrics. We also model the reliability of Poly and compare it with other CDS-based techniques to show that it achieves better connectivity under highly dynamic network topologies.     

基于反向生成CDS树的无线传感器网络拓扑控制算法研究

拓扑控制是无线传感器网络中一种有利于节约能量、延长网络生命周期的策略。作为一种著名的基于CDS树的拓扑控制机制,A3算法的目标是在保证网络连通和通信覆盖的前提下,通过关闭一些非必要节点来获得一个次优连通支配集(CDS)。针对A3算法在构建连通支配集时通信开销较大的问题,提出了一种基于叶节点反向生成CDS树的改进型算法A3G。该算法利用反向拓扑方法来寻找连通支配集,减少了节点间的信息交换。仿真结果显示,相对于A3算法和一些其他著名的拓扑控制算法,A3G算法在活动节点数和能效方面具有明显的优越性。     

Distributed topology control algorithm on broadcasting in wireless sensor network

Topology control can enhance energy efficiency and prolong network lifetime for wireless sensor networks. Several studies that attempted to solve the topology control problem focused only on topology construction or maintenance. This work designs a novel distributed and reliable energy-efficient topology control (RETC) algorithm for topology construction and maintenance in real application environments. Particularly, many intermittent links and accidents may result in packet loss. A reliable topology can ensure connectivity and energy efficiency, prolonging network lifetime. Thus, in the topology construction phase, a reliable topology is generated to increase network reachable probability. In the topology maintenance phase, this work applies a novel dynamic topology maintenance scheme to balance energy consumption using a multi-level energy threshold. This topology maintenance scheme can trigger the topology construction algorithm to build a new network topology with high reachable probability when needed. Experimental results demonstrate the superiority of the RETC algorithm in terms of average energy consumption and network lifetime.     

基于蚁群优化的无线传感器网络路由算法

如何在资源受限的无线传感器网络中进行高效的数据路由是无线传感器网络研究的热点之一。基于群智能优化技术的蚁群优化算法被广泛应用于网络路由算法。提出一种无线传感器网络蚁群优化路由算法,能够保持网络的生存时间最长,同时能找到从源节点到基站节点的最短路径;采用的多路数据传输也可提供高效可靠的数据传输,同时考虑节点的能量水平。仿真结果表明:提出的算法延长了无线传感器网络的寿命,实现无线传感器网络在通信过程中快速、节能的路由。     

A decentralized energy-based diffusion algorithm to increase the lifetime of MANETs

In this paper, we introduce a novel approach to improve overall lifetime in mobile ad hoc networks. Given the energy constraint on each node, this problem is formulated as an energy-controlled load balancing problem. Thus, our approach is quite different from usual energy-efficient routing or topology control methods. The proposed algorithm is fully distributed and ensures that each node will cooperate in proportion to its remaining energy, increasing the network lifetime. The relevance of the algorithm is evaluated through both theoretical analysis and simulations.     

无线传感器/执行器网络中能量有效的实时分簇路由协议

无线传感器/执行器网络(WSANs)主要应用于自动控制领域,实时性问题是其面临的首要挑战.根据实际环境中的节点部署情况,建立了系统模型;研究了分簇策略与功率控制技术对于自组织网络实时性的影响,提出了一种可适用于WSANs的能量有效的实时分簇路由协议——RECRP协议.该协议采用二级成簇策略使网络中的各类节点稳定分簇.分簇后的各类节点具有不同发射功率,利用执行器节点的强大通信能力有效降低网络延时.采用能量有效性算法使网络中的传感器节点轮换担任簇首,从而使网络能量均匀消耗,延长网络的生存时间.实验结果证明,在WSANs中RECRP协议可使网络稳定分簇,并且在网络的实时性与能量有效性方面与现有典型路由协议相比具有更优越的性能.     

J-Sim下WSNs仿真框架的扩展设计与实现

随着无线传感器网络(WSNs)的应用,如何延长网络生命周期,对路由协议的研究提出了挑战。为了更好地研究能量高效利用的WSNs路由协议,建立对WSNs能耗支持较好的仿真平台具有十分重要的现实意义。针对J-Sim下WSNs框架对能耗仿真支持不好的问题,在现有的WSNs框架基础上提出了一种支持能耗仿真的WSNs仿真框架并在该框架上扩展实现LEACH协议。实验结果表明改进后的WSNs框架可以真实地仿真WSNs,获取有价值的仿真结果。     

能量高效的WSNs分簇数据融合算法

针对无线传感器网络(WSNs)中多跳通信造成的“热区”以及数据冗余问题,提出了一种能量高效的分簇数据融合算法(EECDA).该算法在分簇阶段综合考虑节点的剩余能量、到基站的距离和邻居节点的数目,周期性地选择簇首和划分不同规模的簇;对簇内数据进行融合,利用辛普森积分法则计算预测接收数据,在保证采集数据实时性和准确性的前提下,降低数据的冗余性,减少通信负载,提高网络的能量利用率.仿真结果表明:该算法能够对数据进行高效预测,减少网络通信量,相较已有的算法,能够有效延长网络的生存周期.     

一种基于蚁群算法的能量有效WSN分簇算法

由于无线传感器网络节点的能量限制,如何延长网络和节点的寿命成为其核心问题之一。LEACH协议是WSN中的低功耗白适应分层路由算法,但由于其随机性的特点,难以形成最优拓扑结构,同时分簇时未考虑簇头节点剩余能量,节点能耗分布不平均。本文提出一种考虑能量有效的基于ACO的分簇算法,通过群集作用动态选择簇头节点,延长了网络寿命,仿真结果表明其性能优于LEACH。     

求解传感器网络生存时间最大化问题的遗传算法编码设计

求解传感器网络最大生存时间是设计高性能路由协议和拓扑控制协议的理论基础,在实践上有很重要的意义。目前主要通过近似算法求解,而且没有考虑到接收功耗。本文对生存时间优化问题进行了形式化描述,给出了最佳传输方案和最大生存时间的定义,从遗传算法角度给出了求解该问题的两个编码方案并进行了比较。     

节能高效的无线传感器网络非均匀分簇路由协议

为了有效均衡无线传感器网络能耗、缓解能量洞问题、延长网络生命周期,提出了一种节能高效的非均匀分簇路由协议,其核心思想是采用结合计时广播和簇头轮换机制的非均匀分簇（BR—EEUC）算法对网络分簇,并根据代价函数选择代价较低的簇头作为中继节点,形成以汇聚节点为根节点的多跳路由,从而大大降低了能量开销。通过在OMNet＋＋平台上的仿真实验结果表明：与LEACH和EEUC等路由协议相比,该协议有效地均衡了网络能量消耗,延长了网络寿命。     

无线传感器网络能量最优的QoS路由发现方法

针对无线传感器网络的动态网络环境和节点能源受限,且通常无法补充的能源特性等不利因素,提出了一种可以实现能量最优的QoS路由发现方法。该方法利用节点选择机制和节点邻居表来建立满足QoS带宽需求的可供选择的节点集合,从而减少路由发现过程中的所要监测的节点数量。所提方法还构建了无线传感器网络的能量评价模型和节点能耗权重模型,使用遗传算法从可供选择的节点集合中构建可实现能量最优的QoS路由,自适应的实现对节点调度,从而延长无线传感器网络的寿命。通过实验仿真与分析,给出了实现无线传感器网络能量最优的遗传算法控制参数的选择区间。实验结果显示:该方法对无线传感器网络具有更好的适应性,且能保证其有更长的寿命。     

Energy-aware self-organisation algorithms with heterogeneous connectivity in wireless sensor networks

Heterogeneity of node energy is a common phenomenon in wireless sensor networks. In such node energy heterogeneous sensor network, how to balance the energy consumption is the key problem on extending the lifetime of the sensor network system. An energy-efficient self-organisation algorithm with heterogeneous connectivity based on energy-awareness is proposed. Each sensor node in the network adjusts its own transmission radius based on the local energy information during the constructing and operating phase. Thus heterogeneous network topology, in which the nodes can choose different transmission radius, is formed. In contrast to the homogeneous network model, in which the node carries the same radius, simulation and analysis are conducted to explore the topology characteristics and robustness with different node energy distribution. The degree distribution shows the scale-free property in the heterogeneous model. The proposed network model enjoys higher efficiency of transmitting data, less clustering, higher robustness under node random failures and longer network lifetime than those in the homogeneous ones.     

无线传感器网络虚拟骨干近似算法综述

在无线传感器网络中应用虚拟骨干,可以有效地节约能量、减少干扰、延长网络寿命,在几何路由算法和网络拓扑控制等方面具有广泛的应用.虚拟骨干可以模型化为图中的连通控制集.主要从近似算法角度介绍连通控制集及其各种变形在国内外的研究现状及最新进展,侧重于研究方法和理论结果,为相关研究人员提供参考.     

基于最优刚性图的链路质量与能量的拓扑控制算法

针对目前无线传感器网络研究中网络能量利用率低和通信链路不可靠等问题, 提出一种基于最优刚性图的网络拓扑优化算法. 该算法通过建立包含链路质量和能量两方面内容的链路权值函数来构建链路可靠性强、能量利用率高的网络拓扑结构. 研究结果表明, 所构建的拓扑具有平均节点度低和链路性能好等优越特性. 仿真结果表明, 与现有拓扑控制算法相比, 所提出的算法能够更有效地减少能量消耗, 从而延长网络寿命.

     

基于模糊逻辑的多跳WSNs分簇算法

针对无线传感器网络节点能量消耗不均衡和网络寿命过短的问题,提出一种基于模糊逻辑的多跳WSNs分簇算法(FLCMN).该算法综合考虑节点剩余能量、节点邻居个数、邻居节点的平均剩余能量.根据预先设定模糊规则库,利用模糊系统评估出当选簇头的满意度.额外考虑邻居节点平均剩余能量,改善了簇内热点问题,均衡了簇内能量的消耗;同时,为了改善簇间热点问题,提出一种基于斐波那契序列的多跳传输方式,延长了网络的生存时间.通过仿真验证,FLCAMN算法在网络生存时间和能量消耗方面的性能都优于LEACH、EAMMH和DFLC算法.     

一种能量高效的无线传感器网络拓扑控制算法

通过对现有拓扑控制算法的研究,针对无线传感器网络中节点能耗分布不均匀的问题,提出了一种能量高效的拓扑控制算法(EETCA)。该算法以均衡全局能耗为目标,综合考虑了节点的剩余能量、簇的规模、数据最优传输跳数等因素,避免了部分节点能量消耗过快,从而有效地均衡网络负载。仿真结果表明:EETCA在能耗均衡方面均优于原来的算法,延长了无线传感器网络的生命周期。     

无线传感器网络中一种高能效数据收集协仪

针对大规模无线传感器网络中收集数据的需要,提出一种基于簇的高能效数据收集协议CEDGP(Cluster-basedEnergy-efficient Data Gathering Protocol).在该协议中,首先,节点根据自身剩余能量竞争簇首;然后,为了均衡节点的能耗,簇首节点将收集到的数据通过多跳方式传送至sink...     

Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms

A fundamental challenge in the design of Wireless Sensor Networks (WSNs) is to maximize their lifetimes especially when they have a limited and non-replenishable energy supply. To extend the network lifetime, power management and energy-efficient communication techniques at all layers become necessary. In this paper, we present solutions for the data gathering and routing problem with in-network aggregation in WSNs. Our objective is to maximize the network lifetime by utilizing data aggregation and in-network processing techniques. We particularly focus on the joint problem of optimal data routing with data aggregation en route such that the above mentioned objective is achieved. We present Grid-based Routing and Aggregator Selection Scheme (GRASS), a scheme for WSNs that can achieve low energy dissipation and low latency without sacrificing quality. GRASS embodies optimal (exact) as well as heuristic approaches to find the minimum number of aggregation points while routing data to the Base-Station (BS) such that the network lifetime is maximized. Our results show that, when compared to other schemes, GRASS improves system lifetime with acceptable levels of latency in data aggregation and without sacrificing data quality.