无线传感器网络中利用随机网络编码的低能耗可靠机会路由

无线传感器网络中节点大多采用电池供电,让节点以低能耗将采集的数据传递到信宿,对无线传感器网络有效运行极为重要.该文提出了能量有效的可靠机会路由EROR（Energy-efficient Reliable Opportunistic Routing）,它利用结合节点剩余能量和链路上收发双方的总能耗的转发代价,选择转发节点集合（简称“转发集”）、主转发节点和协助转发节点,让节点调节发射功率并利用随机线性编码把数据包分片编码发送到转发集,进而以多跳方式把数据可靠低能耗地传递到信宿.仿真结果表明：在网络生存时间和能耗方面,EROR比已有路由策略CodePower更优.     

网络多播路由的改进编码软件设计与实现

传统网络多播路由编码方法采用多播分布树进行编码,但链路容量遭遇瓶颈,致使编码节点较多,导致浪费带宽资源的问题。在此提出基于Koetter指数时间的网络多播路由改进编码算法对编码软件进行设计,分析多播路由的总体设计,通过数据包编码转发模块在多播拓扑不相交路径上进行编码和转发多播数据包,利用输入模块实现网络多播路由和上游节点的信息交换,通过开关仲裁模块判断能够向特定输出端口传输信息的输入端口,利用死锁控制模块对出现死锁现象的路由节点进行检测,一段时间后使多播路由恢复正常的数据交换,通过输出模块对数据的输出进行管理。以降低带宽资源为目的,采用Koetter指数时间算法实现网络多播路由编码,并给出编码的详细代码。实验结果表明,所提方法不仅节省网络资源,而且显著降低多播路由时延,增强网络吞吐量。     

一种基于信号机制的能量感知地理路由算法

在实际的无线传感器网络中,由于路由空洞的存在,采用边缘转发机制的地理路由算法容易使空洞边缘的节点由于负载较重,能量快速消耗从而过早的死亡,导致空洞进一步的扩大．为了使网络负载更加均衡,延长网络生命周期,提出了一种基于能量信号机制的地理路由算法SIENGR ．SIENGR将节点的初始能量划分3个能量区间,并用能量信号来标识节点的剩余能量所处的能量区间．SIENGR算法的边缘转发机制结合节点的能量信号,利用空洞边界节点的所有平面邻居节点来轮流承担边缘转发的数据量,使产生的路由能够根据节点能耗的情况,自适应地避开空洞边缘能量较少的热区节点,均衡热区附近节点的能量消耗,防止空洞扩大．仿真结果验证了SIENGR算法在网络生命周期、网络能耗均衡、数据包到达率等指标上的性能．     

面向智慧园区的WSN路由优化算法

为解决智慧园区中无线传感器网络(WSN)的能耗不均衡问题,构建了路由代价函数,并提出了一种新的能耗均衡路由算法.该算法结合智慧园区中无线传感器网络的特点,综合考虑节点地理位置和剩余能量来构建路由代价函数.传感器节点通过选择其邻居节点中路由代价最小的节点进行数据转发.仿真结果表明,该算法可以有效节约网络能耗,同时延长了网络的生命周期.     

无线传感器网络中的路由能耗优化策略的研究

无线传感器网络由于受到实际通信环境的限制,传感节点在进行路由计算与数据转发时所需的电力能源主要由一次性电池供给。为了能够有效的节约节点上的路由能耗,提出了基于网络编码及动态功率控制优化策略,通过优化节点路由的数据转发次数和发射功率,减少了传感节点的路由能耗,延长了网络的生命周期。     

基于分簇的无线传感器网络路由算法

在大规模无线传感器网络中以最节能的方式将数据发送到sink是该领域研究的热点之一。针对LEACH算法的不足之处,提出了一种能耗均衡的路由算法。此算法在考虑节点剩余能量的基础上采用两分法选举簇首,然后簇首通过能耗代价函数计算出一条能耗最小的路径,以多跳转发的方式将数据传送到sink.,为了进一步减少节点的能耗,算法在簇内采用了数据聚合机制。仿真结果表明,算法有效地均衡了网络能耗,延长了网络生存期。     

基于网络编码的多播路由算法性能分析

多播传输是目前通信系统中的一项关键技术,可以将相同的信息同时传向多个接收节点。该文提出一种基于网络编码的新的多播路由算法,该算法利用Dijkstra约简网络搜索源节点到各接收节点的路径族。仿真结果表明,该算法在资源消耗和负载均衡方面较传统的多播路由算法有更好的表现,同时性能也更接近基于网络编码的最小费用多播算法。最后,数学分析表明该算法具有较低的计算复杂度。     

k跳受限泛洪的能量平衡组播路由算法

组播路由算法(Energy-Balanced Multicast Routing,EBMR)把无线传感器网络节点的剩余能量作为建立组播路由的重要因子,在不引入过长路径的同时优先选择剩余能量高的节点作为组播数据转发节点,构建组播能量平衡树(EB-Tree),从网络能量均衡消耗的角度来延长了无线传感器网络的生存时间.针对EBMR算法路由开销较大的问题,提出了k跳受限泛洪的能量平衡组播路由算法k-EBMR,控制组播路由报文在k跳范围内传播,并且研究了影响算法性能的关键因子的选取.仿真实验表明,与EBMR算法相比,k-EBMR算法较大程度上降低了路由控制报文的传输,提高了节点能量有效使用性,进一步延长了网络生存时间.     

WSNs中基于转发区域调整的能效地理路由

针对无线传感网络(WSNs)的数据传输问题,提出基于转发区域调整的能效地理位置路由(FAEG)。FAEG限定了数据包的转发区域,构建候选转发节点集,并从节点集中选择权重大的节点传递数据包;通过节点剩余能量和离目的节点距离信息计算节点权重,使剩余能量大和离目的节点近的节点具有优先传递数据包的资格,提高了路由稳定性。节点遭遇路由空洞时,则调整转发区域,在更广范围内选择传输数据包的节点。仿真结果表明,提出的FAEG降低了能耗,并提高了数据包传递率。     

一种基于网络编码的移动自组网实时多播协议

针对移动自组网中的实时多播场景,提出一种基于网络编码的协议—NCRM.该协议可通过减少网络中数据包的转发次数降低节点能耗,并可改善网络吞吐量性能.为适应实时性要求,在NCRM中引入了严格的时延限制机制.仿真结果显示,与PUMA、MAODV等传统协议相比较,NCRM能更好地适应存在多接收节点、高移动性的环境,且在传输可靠性与节省能耗方面具有显著优势.     

Ad hoc网络中基于能量的AODV双径路由算法研究

在Ad hoc网络中AODV路由的健壮性、路由开销、网络的生存时间以及分组报文传送率等都是评价该算法优良的指标。为了提高该路由算法的各项指标本文提出了改进的路由算法协议,在Ad hoc网络中避免使用的低于能量阈值的节点作为路由节点以提高整体网络的生存时间,提供主次路径使报文的到达率、网络的健壮性得以提高,同时也减少了链路的修复,减少了路由开销。     

Multi‐cost routing for energy and capacity constrained wireless mesh networks

We propose a class of novel energy‐efficient multi‐cost routing algorithms for wireless mesh networks, and evaluate their performance. In multi‐cost routing, a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calculated using appropriate operators. In the end these parameters are combined in various optimization functions, corresponding to different routing algorithms, for selecting the optimal path. We evaluate the performance of the proposed energy‐aware multi‐cost routing algorithms under two models. In the network evacuation model, the network starts with a number of packets that have to be transmitted and an amount of energy per node, and the objective is to serve the packets in the smallest number of steps, or serve as many packets as possible before the energy is depleted. In the dynamic one‐to‐one communication model, new data packets are generated continuously and nodes are capable of recharging their energy periodically, over an infinite time horizon, and we are interested in the maximum achievable steady‐state throughput, the packet delay, and the energy consumption. Our results show that energy‐aware multi‐cost routing increases the lifetime of the network and achieves better overall network performance than other approaches. Copyright © 2011 John Wiley & Sons, Ltd.     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

Load balancing maximal minimal nodal residual energy ad hoc on-demand multipath distance vector routing protocol (LBMMRE-AOMDV)

Mobile ad hoc multipath routing protocols have attracted considerable research attention over the past decade, but the limited battery life of nodes remains a significant obstacle. Many researchers have designed multipath routing protocols that balance the data load between the generated paths, but there is always some tradeoff between conserving the nodes’ energy and delivering data. In this paper, I introduce a load balancing (LB) multipath routing protocol based on maximal minimal nodal residual energy (MMRE) in the ad hoc on-demand multipath distance vector (AOMDV) protocol. The proposed LBMMRE-AOMDV protocol evaluates the generated paths based on the maximal nodal residual energy and the actual number of packets that could be transmitted over that path without depleting the nodes’ energy. The performance of the proposed protocol was tested and evaluated using different scenarios and performance metrics, and achieved good results compared with MMRE-AOMDV and AOMDV. In particular, the proposed method can increase packet delivery and decrease the number of dead nodes, thus reducing the probability of network portioning.     

泛洪攻击对Epidemic机制下机会网络生命期的影响

机会网络应用中存在能量无法补充的场景,泛洪是机会网络中容易发生的攻击行为。从理论上分析了在Epidemic路由机制下,泛洪攻击导致的节点能量消耗以及对网络生命期的影响。分析表明恶意节点数量的增加会对网络生命期产生显著影响,而恶意节点注入的数据分组的数量仅能在特定的场景下产生影响,且影响轻微。使用ONE仿真平台对泛洪攻击进行了仿真实验,仿真结果与理论分析的结论一致。     

基于能量感知的Ad Hoc路由算法研究

针对移动adhoc网络终端能量资源受限对全网路由的影响,提出一种具有终端节点能量感知的路由协议(EARP,energy-awareroutingprotocol).该协议能够根据单个节点能量的使用情况以及全路径的能量消耗情况选择不同的传输路径,在路径断裂时,增加本地维护策略,有效减少了由此引起的发包重传情况,提高了路由效率.通过节点能级的设定,防止链路传输过程中由于能量耗尽而导致的路由断裂情况.经过NS2仿真实验与其他相关路由协议进行比较,结果表明在相同的实验环境下,该路由协议能够有效均衡负载,保护低能量节点,延长网络生存时间     

Performance Optimization Based on Compressive Sensing for Wireless Sensor Networks

A routing algorithm, based on a dual cluster head redundant mechanism combined with compressive sensing data fusion algorithm, is proposed to improve reliability and reduce data redundancy of the industrial wireless sensor networks. The Dual cluster head alternation mechanism is adopted to balance the energy consumption of cluster head nodes. Through the compressive sensing data fusion technology to eliminate redundancy, effectively improve the network throughput of the sensor network. The simulation results show that the proposed algorithm is able to enhance the networks performance, significantly reduces the number of lost packets and extend the network’s lifetime.     

Reinforcement learning movement path for multiple mobile sinks in wireless sensor networks

Mobile sink nodes play a very active role in wireless sensor network (WSN) routing. Because hiring these nodes can decrease the energy consumption of each node, end-to-end delay, and network latency significantly. Therefore, mobile sinks can soar the network lifetime dramatically. Generally, there are three movement paths for a mobile sink, which are as follows: (1) Random/stochastic, (2) controlled, and (3) fixed/ predictable/predefined paths. In this paper, a novel movement path is introduced as a fourth category of movement paths for mobile sinks. This path is based on deep learning, so a mobile sink node can go to the appropriate region that has more data at a suitable time. Thereupon, WSN routing can improve very much in terms of end-to-end delay, network latency, network lifetime, delivery ratio, and energy efficiency. The new proposed routing suggests a reinforcement learning movement path (RLMP) for multiple mobile sinks. The network in the proposed work consists of a couple of regions; each region can be employed for a special purpose, so this method is hired for any application and any size of the network. All simulations in this paper are done by network simulator 3 (NS-3). The experimental results clearly show that the RLMP overcomes other approaches by at least 32.48% in the network lifetime benchmark.     

Brad-OF: An Enhanced Energy-Aware Method for Parent Selection and Congestion Avoidance in RPL Protocol

The Internet of Things networks comprise a large number of resource-limited nodes, which often use multi-hop communications to transfer packets to the gateway. Thus, finding the proper forwarding path and managing limited resources have always been important. In this paper, the aim is to improve the approach of selecting the parent nodes to extend the network lifetime and also prevent congestion in nodes’ queues to prohibit network excessive traffic load. We address these issues in two ways. First, a linear combination equation is used to combine three crucial network metrics: ETX, delay, and node residual energy. Second, the “Node’s Traffic Intensity” metric is used to detect and prevent congestion in nodes’ queues. Results showed that by choosing appropriate nodes with higher battery-level for the paths toward the gateway and by avoiding numerous retransmissions, the nodes’ energy and network lifetime increased up to about 65%. Furthermore, by preventing congestion and queue overflow in network nodes, the amount of packet-loss decreased up to 81%. Also, through decreasing packet retransmissions and consequently increasing the number of original packets, the total number of sent original packets was improved. The proposed method is implemented and simulated by the NS-2.