Greedy Anti-Void Routing Protocol for Wireless Sensor Networks

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the greedy anti-void routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.     

Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks

The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads. In this paper, a greedy anti-void routing (GAR) protocol is proposed to solve the void problem with increased routing efficiency by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node under the UDG network. The boundary map (BM) and the indirect map searching (IMS) scheme are proposed as efficient algorithms for the realization of the RUT technique. Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor's traffic, while the intersection navigation (IN) mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion. In order to maintain the network requirement of the proposed RUT scheme under the non-UDG networks, the partial UDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodes that facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance the routing performance with reduced communication overhead. The proofs of correctness for the GAR scheme are also given in this paper. Comparing with the existing localized routing algorithms, the simulation results show that the proposed GAR-based protocols can provide better routing efficiency.     

无线传感器网络的路由协议研究

微机电系统、处理器、无线通信及存储技术的进步促进了无线传感器网络的飞速发展,使得无线传感器网络成为一种全新的信息获取和处理技术。在对其网络特点进行分析的基础上,介绍了无线传感器网络体系结构。路由技术是无线传感器网络通信层的核心技术,也是其组网的基础,着重讨论了无线传感器网络的路由协议的特点及其相关问题。     

Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks

In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.     

Energy Efficient Fuzzy Routing Protocol for Wireless Sensor Networks

Wireless Personal Communications - Energy efficiency to route data in wireless sensor networks is key concern to enhance network lifetime. In this paper, an energy efficient routing protocol has...     

无线传感器网络LEACH路由协议改进

由于无线传感器网络(Wireless Sensor Networks,WSN)中节点能量有限,需要设计能量有效的协议,以延长网络的生存时间。在LEACH路由协议的基础上,综合考虑节点已经充当簇头的次数、剩余能量和地理位置参数来优化簇头的选择机制,提出了LEACH-W路由协议算法。实验结果表明,LEACH-W算法具有更长的网络生命周期。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

一种改进的无线传感器网络分簇路由协议

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

一种无线传感器网络简单按需路由协议

对被监测对象进行实时监测,在有敏感事件突然发生时,由监测传感器及时向监测者报告被监测对象的相关信息是一类非常重要的无线传感器网络应用.针对这类应用,文章提出了一种无线传感器网络简单按需路由协议:SOD.协议通过动态汇聚节点生成协议使得节点能量消耗尽可能均衡化;利用扩散算法减少路由建立和恢复过程中消息的发送.考虑到此类应用的数据突发性和实时性特点,协议采取紧凑设计的原则,将路由请求消息与最初的突发数据相绑定,在路由建立的同时很好地保证了监测的实时性.仿真和实验表明该协议具有简单性、能量有效性和实时性等特点.     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

Routing Protocol for Heterogeneous Hierarchical Wireless Multimedia Sensor Networks

Recently, wireless multimedia sensor networks (WMSNs) have emerged as one of the most important technologies, driven by the development of powerful multimedia device such as CMOS. WMSNs require several factors such as resource constraints, specific QoS, high bandwidth and so on. In this paper, we propose a hierarchical heterogeneous network model based routing protocol for WMSNs. In our proposal, proposed network model is classified into monitoring class, delivery class and aggregation class. Also we define two kinds of the routing path in order to ensure bandwidth and QoS. In simulation results, we illustrate the performance of our proposal.     

Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks

In this paper, we first propose a method, ABVCap, to construct a virtual coordinate system in a wireless sensor network. ABVCap assigns each node multiple 5-tuple virtual coordinates. Subsequently, we introduce a protocol, ABVCap routing, to route packets based on the ABVCap virtual coordinate system. ABVCap routing guarantees packet delivery without the computation and storage of the global topological features. Finally, we demonstrate an approach, ABVCap maintenance, to reconstruct an ABVCap virtual coordinate system in a network with node failures. Simulations show ABVCap routing ensures moderate routing path length, as compared to virtual-coordinate-based routing, GLIDER, Hop ID, GLDR, and VCap.      

能量高效的无线传感器网络AODV路由协议研究

针对传统AODV路由协议在路由发现过程中采用洪泛机制会带来很大的通信开销这一问题,提出了一种基于路径深度的AODV路由协议,减少了参与路由发现过程的节点数,以减少通信开销。在节点转发路由请求时,引入一个时间延时,最大可能地选择最短路径实现通信。实验结果表明:改进的协议有效地减少了能量消耗,减少通信冲突。     

MintRouteEE:一种无线传感器网络能量有效的路由协议

路由是无线传感器网络的关键问题之一。通过分析TinyOS系统中MintRoute路由协议的主要结构和路由策略。提出一种能量有效的路由协议MintRouteEE。模拟结果表明，MintRouteEE能够较大地降低网络的能耗，从而达到延长网络生存时间的目的。     

一种无线传感器网络自适应协同通信路由协议

无线传感器网络的重要应用特性是具有感测信息的传感节点形成一个自适应本地网络,由中心节点执行不同的协作信息处理任务。该文基于互信息量分析了不同中心节点选择机制的开销性能,证明了基于扩散计算的选择机制的开销有效性;提出一种自适应协同通信路由协议(ACCRP)：节点以分布式的方式选择中心节点并建立传输路径;分析讨论了ACCRP的性能参数;并通过实验验证了ACCRP是能源有效的、可扩展的自适应路由协议。     

RK-Energy Efficient Routing Protocol for Wireless Body Area Sensor Networks

Wireless Body Area Sensor Networks are related to the monitoring of human physiological parameters. In these small sized machines called sensors are used to observe the physiological parameters. They are small in size which makes them easy to carry around but on the same time they have a serious problem that they can carry with them a very small sized battery. The sensors deplete their energy while sensing the parameter, communication of the sensed data to the base station and also in processing of the observed data. The sensors cannot be charged on regular intervals because they are attached to human body and charging them may not be an easy option. In this paper an energy efficient routing protocol is presented which uses sensors in WBASN to observe parameter in much efficient way. The concept of multi hopping has been utilized with forwarder node. Forwarder node accepts data from sensor nodes which are far from the sink. After accepting data the forwarder node forwards this data to the sink node. This scheme is compared with an existing scheme with which it has been compared in terms of four parameters which are residual energy, network stability and life time, throughput and path loss.

     

Clustering with Load Balancing-Based Routing Protocol for Wireless Sensor Networks

In this paper we propose a routing protocol based on clustering (IGP-C Protocol) to extend the lifetime in the context of wireless sensor networks while optimizing other resources (memory and processor). Firstly, a clustering algorithm and a load balancing technique are used together in order to reap the benefits of both approaches. The proposed clustering algorithm with load balancing (CALB Algorithm) is a fully distributed algorithm performed by each sensor and requires only communication with its immediate neighbors. Secondly, an Improved Gossiping Protocol (IGP) is proposed to extend the CALB algorithm to the data routing. The simulation results demonstrate the better and promising performances of the IGP-C protocol compared with the other protocols proposed in the literature. The IGP-C protocol allows a better distribution of energy, memory and processing capabilities of cluster-heads and reduces the number of clusters consisting of a single sensor along with the number of iterations. This demonstrates the effectiveness of the cluster-heads election process which improves the load balancing in the wireless sensors network in terms of cluster-heads load and clusters size. Furthermore, the proposed routing strategy builds around the clustering algorithm, is effective since it reduces the data transmission delay and prolongs the network lifetime.     

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.     

A Scalable Priority-Based Multi-Path Routing Protocol for Wireless Sensor Networks

In this paper, a scalable priority-based multi-path routing protocol (PRIMP) is proposed for wireless sensor networks to offer extended network lifetime and robust network fault tolerance, under the context of stringent energy constraint and vulnerability of sensors to dynamic environmental conditions. A novel interest dissemination strategy which invokes an on-demand virtual source technique is designed in PRIMP to minimize communication overheads and energy wastage. In routing, data traffic is distributed over multiple braided data paths simultaneously by a priority-based probabilistic approach at each hop to achieve the robustness against the unreliable transmission due to frequent node failures. Extensive simulations validate that PRIMP exhibits significantly better performance in energy conservation, load-balancing and data delivery than comparable schemes, while at the same time PRIMP achieves a nice scalability feature in terms of energy dissipation with various network sizes and network densities. Last but not least, PRIMP addresses the slow startup problem that is prevalent in data-centric routing schemes.     

Routing Protocol Based on Tabu Search for Wireless Sensor Networks

This paper investigates the proposition of a new routing protocol for wireless sensor networks called TSRP (Tabu Search based Routing Protocol). In this protocol, we use the mechanism of the meta-heuristic Tabu search to route the data from the sensor (that has sense the events) to the sink. This mechanism is used to select the next sensor that will route the data based on a cost function (considering the energy and the visibility of this sensor compared to the sink). Simulation results, on a car parking application, show that TSRP prolongs the network lifetime than the existing protocols.