Reliable routing scheme for indoor sensor networks

Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance

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)

Greedy Routing Recovery Using Controlled Mobility in Wireless Sensor Networks

International audienceOne of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally ap- ply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such re- covery mechanisms are mainly based on graph planarization and face traversal or on a tree construction. Nevertheless real-world network pla- narization is very difficult due to the dynamic nature of wireless links and trees are not so robust in such dynamic environments. Recovery steps generally provoke huge energy overhead with possibly long inefficient paths. In this paper, we propose to take advantage of the introduction of controlled mobility to reduce the triggering of a recovery process. We propose Greedy Routing Recovery (GRR) routing protocol. GRR en- hances greedy routing energy efficiency as it adapts network topology to the network activity. Furthermore GRR uses controlled mobility to relocate nodes in order to restore greedy and reduce energy consuming recovery step triggering. Simulations demonstrate that GRR successfully bypasses topology holes in more than 72% of network topologies avoid- ing calling to expensive recovery steps and reducing energy consumption while preserving network connectivity

Pengembangan Metode Routing Menggunakan Mekanisme Swing Routing dengan Penanganan Routing Hole Sebagai Peningkatan Kinerja Wireless Sensor Network

WSN menggunakan jaringan nirkabel untuk menghubungkan node sensor dan sink node. Node sensor bertugas mengumpulkan informasi dengan melakukan sensing terhadap target seperti panas, cahaya, dan suhu. Namun, node sensor memiliki keterbatasan dalam hal memori, sumber daya pengolahan, energi, dan masa pakai, yang dapat mempengaruhi kinerja jaringan, termasuk network lifetime dan packet delivery ratio. Oleh karena itu, diperlukan protokol yang efektif untuk meningkatkan kinerja jaringan WSN. Salah satu penelitian untuk meningkatkan kinerja jaringan adalah menggunakan Shortest Geopath Routing (SGP) berbasis tetangga terdekat dan lokasi. Namun, SGP memiliki permasalahan seperti seringnya terjadi kongesti yang menyebabkan packet drop dan kegagalan pengiriman data saat terjadi Routing hole. Untuk mengatasi permasalahan tersebut, penelitian ini melakukan protokol SGP dengan mekanisme Swing routing untuk meningkatkan kinerja jaringan WSN. Dalam mengatasi Routing hole, Swing routing Protocol juga melakukan pencarian jalur alternatif dengan memilih node berdasarkan lokasi koordinat terdekat dengan sink node. Hasil simulasi menggunakan simulator SIDnet-SWAN menunjukkan bahwa penggunaan Swing routing Protocol dapat mengurangi warning congestion dalam jaringan sebesar rata-rata 10 node, meningkatkan network lifetime sebesar 5.27% (14 menit), dan meningkatkan packet delivery ratio sebesar 8.27% dibandingkan dengan protokol SGP. Dalam penanganan Routing hole, Swing routing Protocol mendapatkan rata-rata packet delivery ratio sebesar 21.77% dibandingkan dengan protokol SGP

Routing Hole Mitigation by Edge based Multi-Hop Cluster-based Routing Protocol in Wireless Sensor Network

In Wireless sensor network (WSNs) due to the harsh environments the degradation of energy is major issue. For addressing this issue, clustering techniques equalize energy utilization by distributing the workload among different clusters but energy-unaware path selection in multi-hop clustering technique leads to routing hole problem. To reduce the routing hole problem in WSNs, an energy-efficient least-edge computation (ELEC) cluster-based algorithm is proposed, which consider the value of edge count, link cost and energy level in selecting the next hope neighbor in data transmission. Results of our simulation reveal that ELEC achieves nearly double network lifetime by equal energy consumption in various parts of the network in addition just 5% energy left unused, as compared to existing routing strategies such as LEACH, GRACE, and AODV-EHA. Furthermore the percentage of node failure is half of the other existing routing strategies and 60% of packet drop noticeable decrease is noticed in ELEC as compared to GRACE, LEACH, and AODV-EHA