SEEL:无线传感器网络下自适应、低延迟的节能媒质接入控制协议

无线传感器网络有着广泛的应用前景,然而由于传感器节点能量有限,因此传感器网络上运行的协议必须具备能量有效性以获得较长的生命周期.而媒质接入控制子层是节点能量消耗的主要所在,因此无线传感器网络设计的关键问题之一是媒质的接入控制.提出了一种自适应低延迟的节能MAC协议——SEEL协议,根据当前的网络负载自适应地调节竞争窗口的大小,从而减小节点数据传送的碰撞几率和由于碰撞而导致的能量消耗;采用了快速退避机制,减少了节点在退避过程中的空闲监听时间;扩展了RTS/CTS消息机制,可减少节点在每帧活动阶段的时间以及减小数据的延迟,两者都能节约能量的使用.实验结果显示,SEEL协议具有比S-MAC和TEEM协议更好的性能.     

负载相似节点分布解决传感器网络能量洞问题

基于多跳路由的传感器网络,靠近sink的节点由于要转发更多的数据,其能量消耗较快.能量消耗的不平衡导致了sink周围产生能量洞(energy hole),造成能量浪费,远离sink的节点还有大量的能量,但产生的数据不能传送到sink.研究了传感器网络的能量洞问题.在网络的连续空间状态下分析节点的负载分布特性,并研究空闲侦听(idle listening)对能量消耗的影响.基于分析结果,提出负载相似节点分布(load-similar node distribution)策略,即根据负载分布特性配置节点,负载重的区域配置较多的节点,以平衡各区域节点的能量消耗,解决能量洞问题.仿真结果显示,在不考虑空闲侦听能量消耗的情况下,与已有的一种非均匀节点分布和均匀节点分布相比,负载相似节点分布策略对网络寿命有显著改善;当考虑空闲侦听时,由于空闲侦听的能量消耗在总能量消耗中占较大比重,影响了网络寿命,但与其他两种节点分布策略相比,负载相似节点分布对网络寿命仍然有所改善.该分析模型和提出的负载相似节点分布策略可适用于其他多跳传感器网络.     

HDEEC：面向异构网络的一种基于簇路由协议

有效地使用传感节点的能量进而延长网络寿命成为设计无线传感网路由协议的一项挑战性的工作.为了延长网络,现存的多数簇方案是面向同构网络.为此,面向异构网络,提出基于簇的分布式能量有效路由HDEEC(heterogeneous WSN distributed energy-efficient clustering)协议.HDEEC协议首先提出异构网络模型,考虑了普通节点、特优节点和超特优节点三级能量节点;然后,提出能量消耗模型;最后依据这两个模型,提出了簇头选择方案.HDEEC协议以平衡、有效方式动态改变节点被选为簇头的概率.仿真结果表明,提出的HDEEC协议能够有效延长网络寿命,比DEEC、DDEEC的网络寿命分别提高了72％、68％.     

面向异构WSNs的基于能量感知的簇路由算法

有效地使用传感节点的能量,进而延长网络寿命成为设计无线传感网路由协议的一项挑战性的工作.为了延长网络,现存的多数簇路由是面向同构网络.为此,提出分布式能量感知的异构WSNs非均匀分簇路由DEAC(Distributed Energy Aware unequal Clustering)算法.DEAC算法是以EADUC(Energy Aware Distributed Unequal Clustering)为基础,并进行优化.与EADUC不同,DEAC算法从簇头竞选机制、簇间多跳通信中的下一跳转发节点的选择策略以及自适应的节点通信半径的设置三方面进行优化.在簇头竞选机制中,采用退避算法,利用节点的剩余能量以及邻居节点的平均能量设置延时时间;在选择下一跳转发节点时,建立节点的关于能量的度量函数,选择具有最大剩余能量的节点作为下一跳;而在设置节点通信半径时,考虑了距离、剩余能量以及邻居节点数信息.仿真结果表明,与EADUC协议相比,提出的DEAC算法能够有效地延缓第1个节点失效的时间,减少了能耗,扩延网络寿命.     

Maximizing network lifetime in wireless sensor networks with regular topologies

Limited energy supply (battery-powered) is a crucial problem in wireless sensor networks (WSNs). Sensor node placement schemes and routing protocols are mostly proposed to address this problem. In this paper, we first present how to place sensor nodes by use of a minimal number of them to maximize the coverage area when the communication radius of the sensor node is different from the sensing radius, which results in the application of regular topology to WSNs deployment. With nodes placed at an equal distance and equipped with an equal power supply, the problem of unbalanced energy consumption in 2-D regular topologies becomes more severe and much more difficult to tackle than that in 1-D chains, though the latter is known as an already quite hard problem. We address this problem and propose an adaptive data collection scheme by employing different communication radii for nodes in different locations to balance the energy consumption in WSNs. In order to achieve the ultimate goal of maximizing network lifetime in grid-based WSNs, we give a mathematical formulation, which shows the problem of maximizing network lifetime is a nonlinear programming problem and NP-hard even in the 1-D case. We discuss several heuristic solutions and show that the halving shift data collection scheme is the best solution among them. We also generalize the maximizing network lifetime problem to the randomly-deployed WSNs, which shows the significance of our mathematical formulation for this crucial problem in WSNs.     

HACH: Heuristic Algorithm for Clustering Hierarchy protocol in wireless sensor networks

Wireless sensor networks (WSNs) require energy management protocols to efficiently use the energy supply constraints of battery-powered sensors to prolong its network lifetime. This paper proposes a novel Heuristic Algorithm for Clustering Hierarchy (HACH), which sequentially performs selection of inactive nodes and cluster head nodes at every round. Inactive node selection employs a stochastic sleep scheduling mechanism to determine the selection of nodes that can be put into sleep mode without adversely affecting network coverage. Also, the clustering algorithm uses a novel heuristic crossover operator to combine two different solutions to achieve an improved solution that enhances the distribution of cluster head nodes and coordinates energy consumption in WSNs. The proposed algorithm is evaluated via simulation experiments and compared with some existing algorithms. Our protocol shows improved performance in terms of extended lifetime and maintains favourable performances even under different energy heterogeneity settings.     

Using a dynamic backbone for efficient data delivery in solar-powered WSNs

The periodic nature of solar power requires a different approach to energy consumption in wireless sensor networks (WSNs) from battery-based WSNs. Based on the energy model of a solar-powered node, we develop efficient energy-aware topology-control and routing schemes which utilize a backbone network consisting of energy-rich nodes within the WSN. This backbone handles most of the traffic with low latency, while reconfiguring itself dynamically in response to changes in the availability of energy at each node. Simulation results demonstrate that our schemes can achieve a balance between latency and energy consumption.     

基于萤火虫算法的无线传感器网络节点重部署策略

节点部署是无线传感器网络研究的重要问题之一。针对节点部署过程中的能量空洞问题,提出了一种基于萤火虫算法（FA）的节点重部署（NRBFA）策略。首先,在节点随机部署的传感器网络中,利用k-means算法进行分簇并引入冗余节点;然后,利用FA移动冗余节点,以分担簇头（CH）负载并均衡网络中节点的能耗;最后,再次利用FA寻找目标节点,从而更新冗余节点。该策略通过有效地移动冗余节点,减小了节点移动距离并降低了网络能耗。实验结果表明,该策略能够有效地缓解“能量空洞”问题,并且与基于虚拟力的分区节点重部署算法相比降低了算法的复杂性,且能更好地提高网络的能量效率,均衡网络负载,并将网络生命周期延长近10倍。     

基于能耗量化传导的WSN路由探测算法

为了降低无线传感器网络(WSN)路由节点的能量损耗,提高网络的寿命周期,需要进行路由节点的优化分布设计。传统方法采用CSMA/CA有限竞争的信道分配模型进行WSN的路由探测算法设计,实现能量均衡,在节点规模较大和干扰较强时,节能的能耗开销较大。提出一种基于能耗量化传导的WSN路由探测算法,首先建立WSN的分簇能耗调度模型,以能量控制开销、丢包率、传输时延等为约束参量指标进行路由探测的控制目标函数的构建,然后采用路由冲突协调机制进行能耗量化分配,结合WSN传输信道的能量传导均衡模型实现WSN路由的优化探测和WSN节点的优化部署。仿真结果表明,采用该方法进行WSN路由探测设计时网络的能效较高,传输时延和误码率等参量指标的表现优于传统方法。     

基于能量优化的无线传感器网络分簇路由算法研究

无线传感器网络的路由协议设计要同时关注单个节点的能耗及整个网络能量的均衡消耗.分簇算法能有效解决节点能耗受限与不同节点能量开销不平衡问题.在分析了传统分簇路由LEACH(low energy adaptive clustering hierarchy)协议中选择簇头算法不足和当前一些典型基于LEACH思想的路由改进算法...     

限制链路数量对无线传感器网络寿命的影响

由于传感器节点能量受限,如何优化无线传感器网络(WSN)寿命是一项重要任务。借助混合二元线性规划(MBLP)框架,对限制传入/传出链路数量的WSN寿命影响进行了研究。利用MBLP最大化WSN寿命,并给出对应约束条件;通过线性网络拓扑结构,分析了节点数量、节点面积对WSN寿命的影响。性能分析表明,如果传入/传出链路数量至少为3时,网络寿命降低小于1.0%,从而进一步证明了分割流量为三部分足以平衡传感器节点间的能耗。     

无线传感器网络分簇路由节能研究

在大规模传感和环境监测中,节约能源延长传感器节点生命已成为无线传感器网络最重要的研究课题之一。提供合理的能源消耗和改善无线网络生命周期的传感器网络系统,必须设计一种新的有效的节能方案和节能路由体系。方案采用一种聚类算法减少无线传感器网络的能量消耗,创建一种cluster-tree分簇路由结构的传感器网络。该方案主要目标是做一个理想的分簇分配,减少传感器节点之间的数据传输距离,降低传感器节点能源消耗,延长寿命。实验结果表明,该方案有效地降低了能源消耗从而延长无线传感器网络生命。     

LPR-MAC:一种采用并行协商机制的低功耗多信道MAC协议

本文通过分析不同类型的多信道MAC协议的特点,指出了并行协商类多信道MAC协议存在的消失节点问题和通信竞争问题。针对上述问题,基于无线传感器网络节点的能量有效性,本文提出了一种新的多信道MAC协议:LPR-MAC。本协议采用全网同步,时间上划分为多个时间片,节点在网络建立时随机选择某个时间片作为自己的固定接收周期,在接收周期按各自的伪随机序列在多个信道之间进行跳跃,并行协商,在其余时间片休眠。仿真结果表明,该协议减少了通信竞争程度,降低了能量消耗。     

Distributed optimal dynamic base station positioning in wireless sensor networks

Base station (BS) positioning is an effective method for improving the performance of wireless sensor networks (WSNs). A metric-aware optimal BS positioning and relocation mechanism for WSNs is proposed. This technique locates the BS with respect to the available resources and the amount of traffic traveling through the sensor nodes. The BS calculates its own position over time in response to the dynamic environment in which the sensor nodes operate. In most WSN environments, communication channel experiences nonlinearity that is influenced by path loss, attenuation of signal as it propagated through space, greater than 2. In this work, we solved the problem of BS positioning in nonlinear environments. We propose a weighted linear or nonlinear least squares optimization depending on the value of the path loss exponent. We also propose a distributed algorithm that can effectively handle the required computation by exploiting node cooperation. The goal is to minimize the total energy consumption and to prolong lifetime of the WSNs. The performance of the proposed technique is evaluated for various network setups and conditions. Our simulation results demonstrate that BS positioning and relocation can significantly improve the lifetime and power efficiency in WSNs.     

基于网络效用最大化与冲突避免的无线传感器网络MAC协议

针对周期汇报型无线传感器网络(WSN)中的无线信号冲突和能量利用效率问题,提出了一种基于网络效用最大化与冲突避免的媒体访问控制(UM-MAC)协议。该协议基于时分多路复用(TDMA)调度机制,将效用模型引入无冲突的节点工作时隙分配过程中,把链路可靠性、网络能耗归纳到一个统一的效用优化框架中;进而提出了一个启发式算法,使网络能够快速找到一个基于网络效用最大化与冲突避免的节点工作时隙调度方案。将UM-MAC协议与S-MAC协议和冲突避免MAC(CA-MAC)协议进行比较,在不同节点数量的网络环境中,UM-MAC获得的网络效用较大,平均数据包成功发送率较高,生命周期介于S-MAC与CA-MAC之间,在不同的网络负载下所有节点发数据包到汇聚节点的平均时延有所增加。仿真实验结果表明:UM-MAC协议较好地解决了冲突干扰问题,提高了网络的数据包成功发送率和能量利用效率等性能;在低网络负载时,TDMA类协议的性能并不比竞争类协议好。     

LPR MAC:一种采用并行协商机制的低功耗多信道MAC协议

本文通过分析不同类型的多信道MAC协议的特点,指出了并行协商类多信道MAC协议存在的消失节点问题和通信竞争问题。针对上述问题,基于无线传感器网络节点的能量有效性,本文提出了一种新的多信道MAC协议：LPR MAC。本协议采用全网同步,时间上划分为多个时间片,节点在网络建立时随机选择某个时间片作为自己的固定接收周期,在接收周期按各自的伪随机序列在多个信道之间进行跳跃,并行协商,在其余时间片休眠。仿真结果表明,该协议减少了通信竞争程度,降低了能量消耗。     

无线传感器网络权衡生存时间与数据分组跳数的分流路由算法*

无线传感器网络的节点大多采用电池供电.因而节能对无线传感器网络就显得至关重要.该文提出一种能耗感知的优化网络生存时间的路由算法,称之为分流路由算法(DTRA,Diffluent Traffic Routing Algorithm).DTRA算法采用一个优化模型以优化每个节点发出的数据比例,从而达到权衡网络生存时间和数据分组跳数.此外,采用一个简单的遗传算法求解该优化问题.仿真结果表明:DTRA算法能显著地提高网络的生存时间,同时将数据分组平均跳数保持在一个较低的水平;在网络生存时间上,DTRA算法比一些已有的知名算法更优.     

Distributed duty cycle control for delay improvement in wireless sensor networks

Dynamically adjusting the time duration of a node to stay active in one data collection period, i.e., duty cycle, is an efficient strategy to save energy and prolong the lifetime of network. In this paper, we propose a novel Adaptation Duty Cycle Control (ADCC) scheme based on feedback signals for wireless sensor networks (WSNs) which can reduce to-sink data transmission delay while lifetime is also improved. In ADCC, every node adaptively adjusts its duty cycle by comparing its own energy consumption with the largest energy consumption of the entire packet delivery flow, which is stored in a feedback ACK packet generated by sink node. Since in WSNs, a huge number of sensor nodes in the area far from the sink node have much remaining energy when network dies, even up to 90 %, these nodes have much larger duty cycles in ADCC compared with previous schemes, therefore the data transmission delay can be reduced to a great extent. Additionally, ADCC provides a largest-energy notification mechanism in order to determine the appropriate duty cycle of nodes in each data collection flow according to the application-dependent requirements. Comparing with the Wake on Idle, Dual-QCon and the Same Duty Cycle (SDC) schemes, ADCC can reduce the delay by more than 59.5 % under the same network lifetime, or increase the lifetime by 32.8 %–63.4 % under the same delay requirements, while also increase energy efficiency as much as 43.1 %.     

无线传感网优化生存时间的分布式功率控制

为延长无线传感网的生存时间,提出优化生存时间的分布式功率控制算法(DPCOL).该算法分析节点发送功率变化下的链路流量平衡约束,链路最大传输速率约束,节点能耗约束等条件,建立最大化生存时间的网络模型.采用分布式功率迭代和次梯度算法求解该模型.节点获知与各邻居节点通信所需要的最低发送功率集,随机选择发送功率集中的功率作为...     

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

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