可充电无线传感网络能量均衡路由算法

针对可充电无线传感网络中的能量均衡路由问题,提出在稳定功率无线充电和监测数据收集网络场景下的多路径路由算法和机会路由算法,以实现网络的能量均衡。首先,通过电磁传播理论构建了无线传感节点的充电和接收功率关系模型;然后,考虑网络中无线传感节点的发送能耗和接收能耗,基于上述充电模型将网络能量均衡的路由问题转化为网络节点运行时间的最大最小化问题,通过线性规划得到的各链路流量用以指导路由中数据流量分配;最后,考虑一种更加现实的低功耗的场景,并提出了一种基于机会路由的能量均衡路由算法。实验结果表明,与最短路径路由（SPR）和期望周期最短路由（EDC）算法相比较,所提出的两种路由算法均能有效提高采集能量的利用率和工作周期内的网络生命周期。     

AdHoc网络中一种链路负载均衡的节能路由协议

传统AdHoc网络路由协议主要是基于“最短路径”来考虑,会在网络中造成对一些“热点节点”的过度使用和链路负载不均衡。针对AdHoc网络中移动节点能量有限和链路负载不平衡的问题,文中提出基于链路负载均衡的节能路由协议（1inkLoadBalancingandEnergySavingroutingprotocol,LBES）。该协议通过考虑网络中节点生存时间和节点间链路通信效率两个方面因素,基于这两方面性能重新定义和计算链路性能,以达到优化路由选择的效果的目的。仿真结果表明,与DSR和MRL相比,LBES有效地延长了网络寿命,降低了网络传输时延,提高了网络的可靠性。     

无线传感器网络基于树的能量有效路由协议*

摘要：能量有效性是无线传感器网络需要考虑的一个重要问题。针对无线传感器网的能量有效路由问题,提出了基于树的能量有效路由协议（TEERP）,TEERP同时考虑了路径的能量消耗最小化以及网络的能量均衡性能。该协议具有能量有效性以及简单性的优点。利用NS2,对其进行了性能仿真。     

An energy-saving routing architecture with a uniform clustering algorithm for wireless body sensor networks

Wireless body sensor networks are expected to extend human-centered applications in large-scale sensing and detecting environments. Energy savings has become one of the most important features of the sensor nodes to prolong their lifetime in such networks. To provide reasonable energy consumption and to improve the network lifetime of wireless body sensor network systems, new and efficient energy-saving schemes must be developed. An energy-saving routing architecture with a uniform clustering algorithm is proposed in this paper to reduce the energy consumption in wireless body sensor networks. We adopted centralized and cluster-based techniques to create a cluster-tree routing structure for the sensor nodes. The main goal of this scheme is to reduce the data transmission distances of the sensor nodes by using the uniform cluster structure concepts. To make an ideal cluster distribution, the distances between the sensor nodes are calculated, and the residual energy of each sensor node is accounted for when selecting the appropriate cluster head nodes. On the basis of the uniform cluster location, the data transmission distances between the sensor nodes can be reduced by employing an adaptive multi-hop approach. The energy consumption is reduced, and the lifetime is extended for the sensor nodes by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the energy consumption and the network lifetime for the wireless body sensor networks.     

无线传感器网络数据融合路由算法的改进

无线传感器网络能量有限,数据融合能通过合并冗余数据减少传输数据量,但其本身的代价不可忽略。针对该问题,研究数据融合代价和数据传输代价对数据融合路由的影响,在基于决策数据融合技术AFST中,对直传数据采用动态最短路径(DSPT)算法,动态识别网络环境和数据特征变化,以最小的代价调整路由。实验与分析结果表明,当网络结构发生变化时,DSPT算法比SPT算法效率更高、更节能。     

基于熵权系数法的无线传感器网络自适应QoS路由算法

针对无线传感器网络中不同业务对服务质量（QoS）指标的不同要求,以及QoS指标在网络运行过程中实时变化的特点,提出一种基于熵权系数法的自适应QoS路由（EAQR）算法。算法将路由建立过程抽象成多指标加权评分的问题,选取节点负载、平均能量势、通信时延作为QoS评价指标,采用熵权系数法自适应地确定指标的权重,选择最优节点转发数据。仿真实验显示,与有序分配路由(SAR)、能量感知QoS路由(EQR)算法相比,EAQR算法可以有效降低网络平均端到端延迟,减少丢包率,延长网络寿命。     

无线传感器网络中一种负载均衡的跳跃式路由协议

如何实现能量的高效利用,延长网络的生命周期一直是无线传感器网络研究的热点.在传统的路由协议中,靠近基站的节点由于要转发其它节点的数据容易过早耗尽能量而失效.本文基于传感器节点传输功率可调这一假设,提出了一种负载均衡的跳跃式路由协议(LBR).协议中每个节点维护K跳的路由表.在需要发送数据时,剩余能量较少的节点将数据发送给下一跳节点,而剩余能量较多的节点可以跨越多跳进行数据传输.从而均衡了节点的能量消耗.模拟结果表明,采用该协议建立的路由,不仅具有延时小,数据传送的路径长度短,维护简单等优点,并且能够改善网络的负载均衡,极大地延长网络的生命周期.     

能量高效的无线传感器网络非均匀分簇路由算法

针对无线传感器网络能量有限的问题,提出了一种能量高效的非均匀分簇路由算法.算法中首先通过在"热区"内选举传送节点,有效的解决了"热区"内负载不均衡的问题;非"热区"内的节点根据节点的剩余能量选举簇头,簇头选举结束后其余节点加入到距其最近的簇头中;节点入簇后,基于相似数据的收集策略,寻找符合条件的相似节点,休眠其中部分冗余的节点;改进的算法中不再每轮结束后都重新选举簇头,减少了能量的浪费;最后在数据传输阶段,采用改进的簇内单跳,簇间多跳的通信方式传输数据.仿真结果表明,本算法有效的降低了能量的消耗,改善了传感器网络的性能,提高了网络的生存时间.     

一种能量有效的WSN路由协议

无线传感器网络中节能是首要考虑的问题。有效地延长无线传感器网络的生存时间,达到传感器节点的负载均衡是无线传感器路由网络路由协议的设计目标。由于LEACH协议存在在簇头节点的选举中未考虑节点的能量因素、簇头节点在空间上分布不均及所有簇头节点直接与Sink进行远距离数据传输过程中能量消耗过多等不足,本文提出了一种改进型的节能路由协议LEACH-ZED。LEACH-ZED采用区域划分的方式,综合考虑节点能量与到Sink节点的距离,进行簇间的多跳传输,大大改善了LEACH协议的一些缺陷。仿真表明,改进后的协议有效延长了网络的生存时间,降低了整个网络的能耗,从总体性能上看优于LEACH协议。     

An efficient routing algorithm to preserve k-coverage in wireless sensor networks

One of the major challenges in the area of wireless sensor networks is simultaneously reducing energy consumption and increasing network lifetime. Efficient routing algorithms have received considerable attention in previous studies for achieving the required efficiency, but these methods do not pay close attention to coverage, which is one of the most important Quality of Service parameters in wireless sensor networks. Suitable route selection for transferring information received from the environment to the sink plays crucial role in the network lifetime. The proposed method tries to select an efficient route for transferring the information. This paper reviews efficient routing algorithms for preserving k-coverage in a sensor network and then proposes an effective technique for preserving k-coverage and the reliability of data with logical fault tolerance. It is assumed that the network nodes are aware of their residual energy and that of their neighbors. Sensors are first categorized into two groups, coverage and communicative nodes, and some are then re-categorized as clustering and dynamic nodes. Simulation results show that the proposed method provides greater efficiency energy consumption.     

Efficient energy conservation in MANET using Energy Conserving Advanced Optimised Link State Routing model

Mobile Ad-hoc Network (MANET) is formed dynamically by the independent organisation of the mobile nodes connected through wireless links without using any centralised administration. Energy consumption is the most significant issue in the MANETs, since most of the mobile hosts operate on limited battery resources. Reduction in the energy consumption results in the increase in the lifetime and throughput of the network. The performance of existing techniques was less in terms of energy conservation issues. To overcome these limitations, this paper proposes an energy conservation mechanism integrated with a proactive MANET routing scheme. The routing schema is based on the energy level and the mobility of the nodes. Calculation of energy cost is performed based on the prediction of the energy consumption level of the node, using Energy Conserving Advanced Optimised Link State Routing (ECAO) model. The performance of the proposed ECAO model is compared with the existing Optimised Link State Routing and Advanced Optimised Link State Routing models. From the comparison result, it is clearly observed that the proposed model achieves better performance in terms of number of TC messages, Packet Delivery Ratio, average time, end-to-end delay, and link delay and energy consumption.     

一种能量优化WSNs非均匀分簇路由协议

为解决无线传感器网络多跳路由协议的“热区”问题,基于对EEUC协议的分析,提出了一种能量优化的WSNs非均匀分簇路由协议EOUCR（Energy Optimized Uneven Clustering Routing protocol）。该协议在簇形成阶段以候选簇头的剩余能量、其邻居节点的平均剩余能量和该候选簇头与SINK节点的距离作为竞选簇头的参数,且簇头竞争半径的选取考虑了成簇能耗,在此基础上形成了不同几何尺寸的簇,可减少“热区”内簇的簇头轮换次数,均衡网络负载。EOUCR在簇间多跳路由通信中引入了唯一与SINK节点通信的根节点,其他簇头则通过中继节点或直接与根节点通信,克服了EEUC能耗大且不均衡的不足,从而有效地解决临近SINK节点的“热区”问题。仿真实验结果表明,EOUCR能够更有效地节约节点能量、均衡网络能耗、延长网络生存周期。     

Dynamic cluster head for lifetime efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.     

大规模无线传感网基于CFSFDP和泊松混合模型的分簇路由算法

针对无线传感网随规模的扩大其节点能量利用率较低的问题,提出了一种适用于大规模无线传感网的基于CFSFDP和泊松混合模型的分簇路由算法(CRCPMM).其核心思想是:在基站利用改进的CFSFDP算法自动估计簇的数目K值并选取聚类中心,然后运用泊松混合模型将节点合理聚类,以保证聚类效果最优;簇间采用多跳传输方式,综合考虑簇首等效剩余能量、簇首之间的距离以及多跳路径与理想最优路径之间的角度.仿真结果表明:与低功耗自适应集簇(LEACH)协议、分布式能量有效非均匀成簇(DEBUC)协议相比,CRCPMM协议在大规模网络中具有明显的优势,能够有效均衡节点能耗,延长网络生命周期.     

Multi-constraint multi-objective QoS aware routing heuristics for query driven sensor networks using fuzzy soft sets

In this paper, a fuzzy based distributed power aware routing scheme considering both energy and bandwidth constraints, especially for query driven applications in the asynchronous duty-cycled wireless sensor networks are devised. The proposed multi-constraint, multi-objective routing optimization approach under strict resource constraints guarantees reliability and fast data delivery along with efficient power management in spite of unreliable wireless links and limited power supply. In query driven applications, the request from the sink to the individual sensor node will be a broadcast message, whereas the individual sensor nodes replies back to sink as unicast messages. In the proposed work, the fuzzy approach and “A Star” algorithm are utilized for satisfying energy and bandwidth constraints to route the broadcast messages of the sink while querying all the sensor nodes in the network. Every node will be provided with a guidance list, which is used to decide the next best neighbor node with good route quality for forwarding the received multi-hop broadcast messages. The route quality of the every node is estimated with fuzzy rules based on the network parameters such as maximum remaining energy, minimum traffic load and better link quality to increase the network lifetime. The provision of overhearing the broadcast messages and acknowledgements within the transmission range minimizes the effort to search for the active time of nodes while routing the broadcast messages with asynchronous scheduling. Further, in the proposed work only the time slot of its nearest neighbor relay node (to which packets are to be forwarded) is learnt to reduce the number of message transmissions in the network. For the unicast message replies, the fuzzy membership function is modified and devised based on the routing metrics such as higher residual energy, minimum traffic loads and minimum hop count under energy and bandwidth constraints. Also, the multi-hop heuristic routing algorithm called Nearest Neighbor Tree is effectively used to reduce the number of neighbors in the guidance list that are elected for forwarding. This helps to increase the individual sensor node’s lifetime, thereby maximizes the network lifetime and guarantees increased network throughput. The simulation results show that the proposed technique reduces repeated transmissions, decreases the number of transmissions, shortens the active time of the sensor nodes and increases the network lifetime for query driven sensor network applications invariant to total the number of sensor nodes and sinks in the network. The proposed algorithm is tested in a small test bed of sensor network with ten nodes that monitors the room temperature.     

Maximizing energy utilization routing scheme in wireless sensor networks based on minimum hops algorithm

In this article, we study the gradient-based approaches for efficient data dissemination in wireless sensor networks. Based on the classical minimum hop algorithm, we develop a Maximizing Energy Utilization Routing Protocol (MEURP), which exploits local flooding mechanism to contact with multiple neighboring nodes. In contrast with the traditional flat-based algorithm, our MEURP solution enjoys a back-off waiting scheme to alleviate the flooding overhead in the course of gradient setup phase. For ease of implementation, we also introduce an IEEE 802.11 liked mechanism to cope with the channel contention, as well as the packet transmission errors. Together with employing a concise cost table associated with each intermediate node, MEURP makes use of a multiple routing selection mechanism to forward packets. In face of the frequent alteration of network topology, a compact gradient reconfiguration mechanism is also brought in. Simulation experiments demonstrate that MEURP significantly outperform traditional flat-based and energy aware algorithms in terms of network lifetime and data packet throughput, respectively.     

无线传感器网络中基于能量效率的多路径路由算法

针对无线传感器网络节点能量受限的特点,本文提出了一种能量有效、负载均衡的多路径路由算法(EMR)。该算法在按需路由协议AODV基础上,不单纯以最小跳数或者最小时延作为路由选择依据,充分考虑到了路由的能量消耗最小化,避开剩余能量过低的节点,数据沿着最小跳数或路径关键能量比较高的路径传输,降低了网络的能量消耗,也避免关键节点的过量负载。分析与仿真结果表明,与AODV协议相比较,EMR具有更好的分组投递率、端到端时延,推迟了网络中出现死亡节点的时间,从而延长了网络生命周期。     

无线传感器网络能量感知增强树型路由协议研究

现有的无线传感器网络路由协议普遍采用设定固定最小能量阈值的方法来避免低剩余能量的节点被选为数据转发节点,以防止因节点过早死亡而导致的网络结构破坏。然而这种方法缺乏应用灵活性。在本研究提出的能量感知增强树型路由协议中,设定了随着网络整体能量下降而动态变化的节点剩余能量阈值,以使得网络中所有节点的能量均衡下降,且采用了同质化加权求和的方法将邻居节点节省的路由跳数和剩余能量同时考虑进路由决策过程。最后,实验结果显示该协议可进一步提高网络稳定性。     

一种基于虚拟网格位置的分簇算法

为了延长无线传感器网络生命周期, 提出一种基于虚拟网格的分簇路由算法RPLG. 该算法将监测区域划分为若干虚拟网格, 同一网格内节点自组织成簇. 根据节点所在网格位置和剩余能量启动计时器选取本地簇首, 且簇内成员可以根据局部的信息调整簇的大小, 达到节省能量的目的. 仿真实验和分析表明: 该协议能均衡网络能量, 延长网络的生存时间.     

无线网络中基于编码感知的能量优化路由算法

由电池供应电量的无线通信网络中,数据需要通过作为路由的中间节点进行传输,所以这些中间节点的能量消耗对整个网络的生存有很大的影响。本文从延长网络生存时间的目的出发,提出了一种能量优化的编码感知路由协议COER(Coding-aware based Optimal Energy Routing),利用能量门限值以及相对剩余能量来均衡网络节点能量的消耗,同时用网络编码来减少能量的消耗,并将两者统一来实现网络能量的优化。仿真结果表明:COER能够减少传输能耗,均衡网络能量消耗,延长网络生存时间。