Energy-aware Dual-path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.This work has been partially supported by the National Natural Science Foundation of China (No. 61402343, No. 61672318, No. U1504614, No. 61631013, and No. 61303241), the National Key Research and Development Program (No. 2016YFB1000102), the Natural Science Foundation of Suzhou/Jiangsu Province (No. BK20160385), the EU FP7 QUICK Project (No. PIRSESGA- 2013-612652), and the projects of Tsinghua National Laboratory for Information Science and Technology (TNList)

Review Paper on Reliability and Lifetime Optimization in Wireless Sensor Network

A wireless sensor network (WSN) is a computer network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants, at different locations.[1] The development of wireless sensor networks was originally motivated by military applications such as battlefield surveillance. However, wireless sensor networks are now used in many civilian application areas, including environment and habitat monitoring, healthcare applications, home automation, and traffic control.[1

Energy Balance Control and Security for Wireless Sensor Network by Using Cost-Aware Secure Routing protocol

Reliability, Energy balance and security are con?icting design issues for wireless sensor networks (WSNs) with non-replenishable energy resources. In this paper, we ?rst propose a novel secure and ef?cient Cost-Aware SEcure Routing (CASER) protocol to address these con?icting issues through two adjustable parameters: energy balance control (EBC) and probabilistic- based random walking. To solve this problem, we propose an ef?cient non-uniform energy deployment strategy to optimize the lifetime and message delivery ratio under the same energy resource and security requirement. We also provide a quantitative security analysis on the proposed routing protocol. For the non-uniform energy deployment, our analysis shows that we can increase the lifetime and the total number of messages that can be delivered by more than four times under the same assumption. We also demonstrate that the proposed CASER protocol can achieve a high message delivery ratio while preventing routing traceback attacks

Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks

Abstract — It has been a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. Basing their forwarding decisions only on the local topology, geographic routing protocols have drawn a lot of attentions in recent years. However, inaccurate local topology knowledge and the outdated destination position information can lead to inefficient geographic forwarding and even routing failure. Proactive local position distribution can hardly adapt to the traffic demand. It is also difficult to pre-set protocol parameters correctly to fit in different environments. We have developed two self-adaptive on-demand geographic routing schemes. The local topology is updated in a timely manner according to network dynamics and traffic demands. Our route optimization scheme adapts the routing path according to both topology changes and actual data traffic requirements. Each node can determine and adjust the protocol parameter values independently according to different network environments, data traffic conditions and node’s own requirements. Our simulation studies have shown that the proposed routing protocols are more robust and outperform the existing geographic routing protocol. Specifically, the packet delivery latency is reduced almost four times as compared to GPSR at high mobility

Link Quality and Energy Aware Geographical Routing in MANETs using Fuzzy Logics, Journal of Telecommunications and Information Technology, 2016, nr 3

In literature, varieties of topology and geographical routing protocols have been proposed for routing in the MANETs. It is widely accepted that the geographical routings are a superior decision than topological routings. Majority of geographical routing protocols assume an ideal network model and choose the route that contains minimum number of hops. However, in reality, nodes have limited battery power and wireless links are additionally unreliable, so they may highly affect the routing procedure. Thus, for reliable data transmission, condition of the network such as link quality and residual energy must be considered. This paper aims to propose a novel multi-metric geographical routing protocol that considers both links-quality and energy metric along with progress metric to choose the next optimal node. The progress is determined by utilizing greedy as well as compass routing rather than pure greedy routing schemes. To combine these metrics, fuzzy logics are used to get the optimal result. Further, the protocol deals with “hole” problem and proposes a technique to overcome it. Simulations show that the proposed scheme performs better in terms of the packet delivery ratio, throughput and residual energy than other existing protocols