煤矿采空区无线传感器网络路由协议研究

针对现有的基于能量均衡的无线传感器网络路由协议不适应煤矿采空区应用的问题,提出了一种非均匀分簇能量均衡路由协议,即UCEB-CMF协议。该协议原理如下:优化候选簇首的选择机制,有效保证剩余能量大的传感器节点优先成为候选簇首;改进非均匀竞争半径的计算公式和候选簇首的竞争方法,在考虑剩余能量的基础上,增加了对簇首节点到Sink节点距离的考量,从而实现能耗均衡;针对煤矿采空区传感器节点易消亡的特点,提出了一种多路径路由算法,从而实现数据传输的持续性。仿真结果表明,该协议能有效均衡传感器节点能耗,延长无线传感器网络的生存期,适用于煤矿采空区。     

基于蚁群算法的LEACH协议研究

针对LEACH协议中簇头节点与汇聚节点之间采用单跳通信造成能量损耗过快的问题,提出了一种基于蚁群算法的LEACH协议,该算法利用蚁群算法易实现、支持多路径的特点,结合节点的剩余能量及传输距离,通过对网络中信息素浓度的建立和更新,达到降低簇头节点能量消耗过快的问题.仿真实验结果表明,该算法在降低能耗、延长网络生命周期等方...     

一种基于分环的能量高效无线传感器网络分簇路由协议

针对现存分簇路由协议能耗不均衡和簇首节点死亡过早的缺陷,设计了一种基于分环模型的能量高效分簇路由协议.根据节点剩余能量和位置选举簇首,采用主次簇首轮换方式减低簇首节点能耗.仿真结果表明:该算法能够均衡网络能耗,延长无线传感器网络生命周期.     

无线传感器网络多路径簇头链分簇式路由算法

本文分析了无线传感器网络路由协议的研究现状,重点研究了分簇式路由算法,并提出一种改进的算法--基于能量和距离的多路径簇头链（MCBED）算法。该算法不仅改进了簇头节点的选取方法,而且根据需要产生替补簇头节点,形成多路径簇头链。理论分析和仿真实验表明,改进后的算法分簇更加合理,提高了网络健壮性,节省能量,均衡节点能量消耗,显著延长了网络生存时间。     

无线传感器网络跨层自适应周期分簇路由模型

分析了无线传感器网络传输信息位置相关性特点以及节点能耗模型,运用基于能量指标和距离指标的簇首选举方法,建立了一种基于节点剩余能量和传输距离的跨层自适应周期簇间路由性能模型。该模型均衡网络节点能耗和负载。簇间通信根据其下一跳簇节点的能量、能耗因子、RSSI以及能耗指数等进行选择。仿真结果表明,与已有的跨层设计和分簇协议相比,该模型有效地延长了网络寿命,提高了网络的吞吐量。该模型能效高,控制开销较低,能量负载均衡。     

能量高效的无线传感器网络分簇路由协议

无线传感器网络的路由协议设计要同时关注单个节点的能耗及整个网络能量的均匀消耗。在分析现有分簇路由协议的基础上,提出一种能量高效的分簇路由协议,通过结合节点能量选举簇头,采用限制簇规模的优化簇形成算法和改进的多跳簇间转发方式,节约节点能量,平衡簇间负载。仿真结果表明,该协议能有效降低网络能量消耗,延长网络生存周期。     

能量负载均衡的无线传感网分组成簇协议

针对无线传感网（WSN）中分簇路由协议在簇首分布及节点能耗不均问题,提出了一种节点能量负载均衡的分组成簇算法。根据节点能量分组,并随着节点能量的减少动态调整分组个数,组内根据能量重心进行簇首选举,利用簇首轮转和簇间多跳路由进一步均衡节点能耗。仿真结果表明,该算法有效实现了负载均衡,并显著延长了网络的稳定期。     

基于作用力模型的传感器网络簇型协议

现有的无线传感器网络簇型算法忽视了簇头和簇成员之间的通信代价不均衡和"孤立簇头"等问题.提出了一种基于作用力模型的移动簇型协议,该协议在簇头选举时兼顾节点剩余能量和节点密度;在簇头选举后,该协议使簇头节点根据基于簇成员剩余能量和距离的作用力模型自适应移动,以均衡簇头和簇成员之间的通信代价.另外,为了实现簇头节点之间的全连通,提出了中继节点选举算法.实验结果显示:该协议能够有效地均衡网络能耗,进一步提高网络稳定性.     

基于分区的能耗均衡路由协议

为了均衡无线传感器网络的节点能耗,增强网络稳定性,设计并实现了一种基于分区的能耗均衡路由协议.该协议设计了一种优化的分区算法,将节点基于分区划分而形成簇,解决了先前协议中簇的个数和分布的随机性问题;在选举簇首时,综合考虑了节点剩余能量、簇内节点能耗均衡、簇内部总能耗三个方面,采用三级簇首选择机制,选择的簇首既能均衡节点能耗,又可以降低簇群总能量消耗;在数据转发时,普通节点选择距离最近的簇首,在不超过通信距离阀值时,簇首可以隔层选择下一跳簇首,有利于缓解无线传感器网络的"热区效应".仿真结果表明:相比MEET和DREEM-ME路由协议,该协议能更好地均衡节点能耗、增强网络稳定性、改善网络服务质量.     

基于PSO的无线传感器网络节能分簇协议

针对如何最优化组簇、降低簇内节点能耗的同时均衡整个网络能耗的问题,提出一种基于PSO的紧凑且具有能量感知和基站距离感知能力的集中式网络分簇协议,粒子适应值函数基于簇头和簇内节点的欧氏距离、簇头节点能量、簇头与基站距离这3个因素定义。仿真结果表明,该协议能有效降低节点死亡速度,延长网络生存周期。     

基于蚁群算法的WSN多路径负载均衡路由

为使无线传感器网络节点能量消耗相对均衡,在定向扩散路由算法的基础上,结合蚁群算法,提出一种多路径负载均衡路由算法。该算法利用蚁群的自适应和动态寻优能力,在源节点和目的节点之间搜索建立多条传输路径,并将节点剩余能量引入启发因子,均衡节点能量消耗。同时,运用层次分析法,赋予每条路径一定的负载分配比例,使数据总能在链路性能较优的多路径中均衡传输,延长整个网络的生命期。仿真结果表明,与定向扩散路由算法相比,该算法能够均衡节点能耗,有效延长网络寿命。     

基于事件与能量感知的WMSNs节点不相交多路径算法

在无线传感器网络中建立从源节点到目标节点的多条不相交路径,提出了一种基于事件与能量感知的节点不相交多路径算法（ EEDMA）。建立了基于事件与能量感知的多路径模型,基于对事件类型和各路径中节点剩余能量的感知,为不同的事件类型的数据选择合适的路径进行传输。通过仿真结果验证：这种算法为实现异常事件提供了可靠、快速的传输路径,并且为平衡整个网络的能量消耗有重要意义。     

基于聚簇的多跳路由协议的研究

为适应大规模无线传感器网络的应用，进一步均衡网络中节点负载，提出一种基于聚簇的多跳路由协议（CBMRP）。协议基于聚簇的思想，簇首进行簇内数据融合后，结合一简单的启发函数和网关剩余能量选取合适的网关，将融合后的数据利用网关在簇首间转发，最终传送到基站。协议充分考虑了数据冗余性的消除及数据传输过程中节点能耗的均衡，可进一步延长网络生命周期。     

Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints

In this paper, we focus on maximizing network lifetime of a Wireless Sensor Network (WSN) using mobile Data Collectors (DCs) without compromising on the reliability requirements. We consider a heterogeneous WSN which consists of a large number of sensor nodes, a few DCs, and a static Base Station (BS). The sensor nodes are static and are deployed uniformly in the terrain. The DCs have locomotion capabilities and their movement can be controlled. Each sensor node periodically sends sensed event packets to its nearest DC. The DCs aggregate the event packets received from the sensor nodes and send these aggregate event packets to the static BS. We address the following problem: the DCs should send the aggregate event packets to the BS with a given reliability while avoiding the hotspot regions such that the network lifetime is improved. Reliability is achieved by sending each aggregate event packet via multiple paths to the BS. The network lifetime is maximized by moving the DCs in such a way that the forwarding load is distributed among the sensor nodes. We propose both centralized and distributed approaches for finding a movement strategy of the DCs. We show via simulations that the proposed approaches achieve the required reliability and also maximize the network lifetime compared to the existing approaches.     

Network coding based reliable disjoint and braided multipath routing for sensor networks

This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For further performance improvement of NC-RMR with disjoint multipath model, local nodes select their own backup nodes in neighbor nodes to form additional logical paths, which implement a braided multipath model. Security advantages of NC-RMR with multipath and network coding mechanisms are analyzed. Analytical and simulation results prove that braided multipath routing model has better performance over disjoint model, and NC-RMR protocol can reduce the required number of transmission paths, ensure load balance of sensor network system, reduce the energy consumption of nodes.     

Joint range assignment and routing to conserve energy in wireless ad hoc networks

In wireless ad hoc networks, energy utilization is perhaps the most important issue, since it corresponds directly to the operational network lifetime. Topology Control (TC) is a well-known energy saving technique which tries to assign transmission ranges of nodes to optimize their energy utilization while keeping the network connected. In current TC schemes, the transmission range of each node is mostly accounted as the exclusive estimator for its energy consumption, while ignoring the amount of data it forwards. Especially when such schemes are coupled with the popular shortest path routing, they usually create a highly-loaded area at the center of the network in which nodes deplete their battery very quickly. In this paper, we introduce efficient strategies that take both load and range into account to handle this problem. We first consider the simple strategy in which a proper transmission range is computed for all nodes of the network to optimize their energy utilization under the presence of the shortest path routing. Inspiring from the results of this strategy, we then propose our combined strategy and argue that a combination of circular paths and shortest paths could result in a much better solution. We also provide detailed analytical models to measure the forwarding load and interference of nodes and then corroborate them with simulation results. Using the combined strategy, the achieved improvement in terms of traffic load, interference, and maximum energy consumption is about 50%, as compared with the simple strategy.     

Green computing for wireless sensor networks: Optimization and Huffman coding approach

Lifetime maximization has witnessed continuous attention from academia as well as industries right from the inception of Wireless Sensor Networks (WSNs). Recently, mobile sink, trajectory based forwarding and energy supply based node selection have been suggested in literature for optimizing residual energy of nodes. In the most of these approaches, energy consumption has been minimized focusing on the optimization of one particular parameter. The consideration of impact of more than one parameters on energy consumption is lacking in literature. In this context, this paper proposes Huffman coding and Ant Colony Optimization based Lifetime Maximization (HA-LM) technique for randomly distributed WSNs. In particular, ACO based multiple paths exploration and Huffman based optimal path selection consider the impact of two network parameters on energy consumption. The parameters include path length in terms of hop count and residual energy in terms of load of nodes of the path and the least energy node. The construction of multiple paths from source to the sink is mathematically derived based on the concept of two types of ants; namely, Advancing Ant (A-ANT) and Regressive Ant (R-ANT) in ACO. The optimal path is identified from the available multiple paths using Huffman coding. Analytical and simulation results of HA-LM are comparatively evaluated with the state-of-the-art techniques considering four performance metrics; namely, average residual energy, energy consumption, number of alive sensors and standard deviation of energy. The comparative performance evaluation attests the superiority of the proposed technique to the state-of-the-art techniques.     

WSN中一种负载均衡的动态非均匀分簇方案

无线传感器网络(WSN)是由资源受限的传感器节点构成,节点能耗对网络的性能有着重要影响,对网络进行分簇可以有效地控制节点整体能耗。针对网络实际运行时节点状态和事件位置动态变化等特点,提出了一种负载均衡的动态非均匀分簇方案。方案主体思路是:首先网络利用O-LEACH算法自组织地进行非均匀分簇,接着动态地从簇头中选举出一定数量的决策节点用于网络的数据汇聚,并根据事件发生位置和节点状态变换而动态更改决策节点角色。仿真结果表明,与CAPNet方案相比,该方案均衡了网络能耗,提高了传输效率,延长了网络生命周期。     

基于虚拟网格的拥塞控制及能耗均衡路由协议

本文提出了一种基于虚拟网格划分的拥塞控制和能量平衡路由协议(congestion control and energy balance,CCEB),该协议利用多主节点、多路径地选取和更新方法,有效地均衡了网络能耗,延长了网络生命周期.在路径选择过程中,该协议综合考虑了下一跳节点的剩余能量、队列占有率以及前向度量指标,使靠近Sink节点的网格内拥有更多的转发主节点.在数据转发阶段,利用预测的方法对各节点进行拥塞检测和能量判断,避免使用发生拥塞或者剩余能量较少的节点转发数据.最后,通过NS2仿真平台实验,验证了CCEB协议在均衡能耗和缓解拥塞方面的有效性.