Virtual‐coordinate‐based delivery‐guaranteed routing protocol in three‐dimensional wireless sensor networks

Because of the wide range of applications, many geographic routing protocols have been proposed in three‐dimensional (3D) wireless sensor networks. However, all the methods require assistance from a global positioning system (GPS), which is not always available. In this paper, we propose a method of constructing an axis‐based virtual coordinate assignment in 3D wireless sensor networks (ABVCap_3D) that requires no GPS assistance. We also propose a routing protocol based on ABVCap_3D, which guarantees packet delivery in 3D networks. Using simulations, we evaluate the performance of ABVCap_3D routing and other well‐known routing protocols, such as greedy‐random‐greedy routing, greedy‐hull‐greedy routing, and the routing based on axis‐based virtual coordinate assignment in 2D wireless sensor networks (ABVCap routing). Simulations show that ABVCap_3D routing requires significantly relative lower cost for guaranteeing packet delivery in comparison with ABVCap routing. Simulations also demonstrate that ABVCap_3D routing ensures a moderate ratio for routing path length to the shortest (ideal) path length. Copyright © 2012 John Wiley & Sons, Ltd.     

Contention‐based geographic forwarding in asynchronous duty‐cycled wireless sensor networks

In asynchronous duty‐cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contention‐based forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention‐based geographic forwarding (CGF) for two asynchronous duty‐cycling (ADC) models, which we refer to as uninterruptible ADC (U‐ADC) and interruptible ADC (I‐ADC). We propose a new residual time‐aware routing metric for CGF in the I‐ADC model and present a residual time‐aware forwarding scheme using this metric. We evaluate the performance of CGF in both asynchronous duty‐cycling models. Simulation results show that CGF in the U‐ADC model provides a shorter delivery delay while suffering from a high sender effective duty cycle problem. CGF in the I‐ADC model incurs a very long data delivery delay, but it can achieve a good load balancing among nodes. It is also demonstrated that the proposed residual time‐aware forwarding scheme lowers the effects of the performance degradation caused by the pure asynchronous duty‐cycling operation. Copyright © 2011 John Wiley & Sons, Ltd.     

Lightweight,latency‐aware routing for data compression in wireless sensor networks with heterogeneous traffics

In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence in the sensing field. An in‐network data reduction technique, such as data aggregation and data compression, can help diminish the amount of data sent from sensors, which not only saves the network bandwidth but also preserves sensors' energy. However, such technique does not consider packet latency because of the aggregation or compression operation. When some sensors generate regular reports in lower data rates, their packets have to spend longer time to be aggregated or compressed, resulting in higher packet delays. Besides, when events occur, the network could suffer from instant congestion due to the generation of numerous event notifications. Motivated with the aforementioned observations, the paper develops a lightweight, latency‐aware routing for data compression (L2DC) scheme to reduce packet latency when applying the compression technique, to reduce the amount of data generated from sensors. L2DC gives event notifications a higher priority over regular reports and eliminates unnecessary notifications to avoid bursty network congestion. In addition, L2DC facilitates the data compression process by allowing each sensor to determine whether to keep packets for compression locally or to send them to a neighbor to be compressed in a distributed manner. Our L2DC scheme can be easily built on most ad hoc and sensor routing protocols because it provides auxiliary redundant packet elimination and relay node selection mechanisms to reduce packet latency. By using the ad hoc on‐demand distance vector protocol as the example, simulation results demonstrate the effectiveness of the L2DC scheme. Copyright © 2015 John Wiley & Sons, Ltd.     

Energy‐efficient void avoidance geographic routing protocol for underwater sensor networks

Underwater wireless sensor networks (UWSNs) consist of a group of sensors that send the information to the sonobuoys at the surface level. Void area, however, is one of the challenges faced by UWSNs. When a sensor falls in a void area of communication, it causes problems such as high latency, power consumption, or packet loss. In this paper, an energy‐efficient void avoidance geographic routing protocol (EVAGR) has been proposed to handle the void area with low amount of energy consumption. In this protocol, a suitable set of forwarding nodes is selected using a weight function, and the data packets are forwarded to the nodes inside the set. The weight function includes the consumed energy and the depth of the candidate neighboring nodes, and candidate neighboring node selection is based on the packet advancement of the neighboring nodes toward the sonobuoys. Extensive simulation experiments were performed to evaluate the efficiency of the proposed protocol. Simulation results revealed that the proposed protocol can effectively achieve better performance in terms of energy consumption, packet drop, and routing overhead compared with the similar routing protocol.     

基于簇结构的无线传感器网络路由研究综述

介绍了典型分簇无线传感器网络路由协议的分类,总结了分簇路由协议的研究进展。针对无线传感器网络从同构型网络向异构型网络发展的趋势和特点,指出了路由协议向节点间相互协作的发展方向,并且在设计路由协作算法时可采用与无线传感器网络极为相似的多Agent系统模型。     

EFFORT: energy‐efficient opportunistic routing technology in wireless sensor networks

The utilization of limited energy in wireless sensor networks (WSNs) is the critical concern, whereas the effectiveness of routing mechanisms substantially influence energy usage. We notice that two common issues in existing specific routing schemes for WSNs are that (i) a path may traverse through a specific set of sensors, draining out their energy quickly and (ii) packet retransmissions over unreliable links may consume energy significantly. In this paper, we develop an energy‐efficient routing scheme (called EFFORT) to maximize the amount of data gathered in WSNs before the end of network lifetime. By exploiting two natural advantages of opportunistic routing, that is, the path diversity and the improvement of transmission reliability, we propose a new metric that enables each sensor to determine a suitable set of forwarders as well as their relay priorities. We then present EFFORT, a routing protocol that utilizes energy efficiently and prolongs network lifetime based on the proposed routing metric. Simulation results show that EFFORT significantly outperforms other routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

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

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks

Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

Designing robust routing protocols to protect base stations in wireless sensor networks

A base station is the controller and the data‐receiving center of a wireless sensor network. Hence, a reliable and secure base station is critical to the network. Once an attacker locates the base station, he or she can do many damages to the network. In this paper, we examine the base station location privacy problem from both the attack and defense sides. First, we present a new attack on base station: parent‐based attack scheme (PAS). PAS can locate a base station within one radio (wireless transmission) range of sensors in high‐density sensor networks. Different from existing methods, PAS determines the base station location on the basis of parent–child relationship of sensor nodes. Existing base station protection schemes cannot defend against PAS. Second, on the basis of PAS, we propose a two‐phase parent‐based attack scheme (TP‐PAS). Our simulation results demonstrate that TP‐PAS is able to determine the base station successfully in both low‐density and high‐density sensor networks. Then, to defend against PAS and TP‐PAS, we design a child‐based routing protocol and a parent‐free routing protocol for sensor networks. Our theory analysis and experiment results show that the parent‐free routing protocol has more communication cost and less end‐to‐end latency compared with the child‐based routing protocol. Copyright © 2012 John Wiley & Sons, Ltd.     

一种能量均衡的无线传感器网络协议

提出了一种能量均衡的无线传感器网络协议。在此协议中,用以基站为圆心一定距离为半径的环状带将目标网络覆盖区域分为三部分,靠近圆心的节点和环状带内节点采用单跳方式直接跟基站通信,环状带以外的节点采用多跳方式跟环状带内节点通信;节点保存多条到基站的最短路由,采用轮循机制选择一条路由传输数据,从而将数据传输任务均衡的分配到多条线路上;当环状带内节点的能量值达到一个阀值时修改环状带的半径和宽度,重新组网,从而将即将形成的"热区"转移到其他区域,达到延长无线传感器网络的生命周期。     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

基于认知的无线传感器网络抗干扰路由算法

针对无线传感器网络受Wi—Fi等异构系统干扰日益严重的问题,在引入基于簇的动态多信道组网策略的基础上,综合考虑频谱受干扰程度、信道切换代价、节点剩余能量等因素,提出了一种认知频谱干扰的能量有效的路由（CSIEE）算法。仿真结果表明,该路由与EEPA,AODV,AODV—EA路由相比,有效地节约了传感器节点能量,延长了网络生命周期。     

An efficient distributed routing protocol for wireless sensor networks with mobile sinks

Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd.     

基于最小跳数的无线传感器网络路由协议

在分析了最小跳数路由算法局限性的基础上对该算法进行了改进,充分考虑了无线传感器网络的跳数、能量、负载均衡等问题。改进后的算法使得传感器的某些节点不会因为频繁使用而迅速死亡,数据包可以沿着最优的路径向网关节点发送。仿真结果显示,改进后的算法可以有效地提高无线传感器网络的可靠性和稳定性,延长了网络的通信时间。     

基于Beta分布的无线传感器网络分簇路由信任管理机制研究

信任管理机制为保障无线传感器网络安全提供了一种有效方案,通过对节点的行为进行评价,建立整个网络的信任管理机制,对判断的恶意节点采用相应的限制措施来保障安全。文章以Beta概率密度分布函数的期望值作为信任值,优化网络分簇路由协议,可在保障网络能量高效利用的同时,有效提升整个网络的安全性。     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

Combining trust with location information for routing in wireless sensor networks

As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against routing attacks. Once trust information is available for all network nodes, the routing decisions can take it into account, i.e. routing can be based on both location and trust attributes. In this paper, we investigate different ways to incorporate trust in location‐based routing schemes and we propose a novel way of balancing trust and location information. Computer simulations show that the proposed routing rule exhibits excellent performance in terms of delivery ratio, latency time and path optimality. Copyright © 2010 John Wiley & Sons, Ltd.     

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

无线传感器网络是目前网络研究的热点,其路由协议的设计是最具挑战性的问题之一,对目前典型的无线传感器网络的路由协议进行分类研究和性能分析,设计并实现了在NS2环境下典型协议的仿真场景和性能分析比较。对无线传感器网络路由协议的研究和组网具有参考指导意义。