Detecting gaps and voids in WSNs and IoT networks: the angle-based method

A random deployment of Wireless Sensor Networks (WSNs) is often the basic structure used in the context of fire forest detection, military applications or any situation where the zone-of-interest is not accessible by humans. The main problematic in this kind of deployment is the formation of gaps or voids, which represent a zone which is not covered in the network. This reduces significantly its Quality of Service and can lead to serious problems, like a non-detected starting fire, the presence of unexpected persons or attacks, etc. Therefore, detecting zones that are not covered by the WSN is of great importance. In this paper, we present a new method allowing to detect gaps and voids in WSNs or in IoT networks by using some characteristics of the angles of the polygon formed by the boundary as determined by the D-LPCN algorithm. These angles can be interior or exterior. Characterizing the angles of the polygon formed by these boundary nodes allows to specify whether this boundary is a gap or a void, in case where the obtained polygon is interior. Since D-LPCN is fault-tolerant, the simulation results show that it is possible to use it for the detection of faulty nodes and intrusions.1

[1]  Kyung-Joon Park,et al.  EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks , 2017, Sensors.

[2]  Ahcène Bounceur,et al.  CupCarbon: A New Platform for Designing and Simulating Smart-City and IoT Wireless Sensor Networks (SCI-WSN) , 2016, ICC 2016.

[3]  Prasun Sinha,et al.  Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[4]  Yunhao Liu,et al.  Topological detection on wormholes in wireless ad hoc and sensor networks , 2009, IEEE/ACM Transactions on Networking.

[5]  Mohammad Hammoudeh,et al.  Intrusion Detection and Countermeasure of Virtual Cloud Systems - State of the Art and Current Challenges , 2015 .

[6]  M. Tahar Kechadi,et al.  D-LPCN: A distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network , 2017, Ad Hoc Networks.

[7]  Jing Liu,et al.  Secure Routing for Mobile Ad Hoc Networks , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[8]  M. Tahar Kechadi,et al.  LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph , 2017, J. Netw. Comput. Appl..

[9]  Abdelhamid Mellouk,et al.  A Preventive Rerouting Scheme for Avoiding Voids in Wireless Sensor Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[10]  Mohammad Hammoudeh Applying Wireless Sensor Networks to Solve Real-world Problems , 2015 .

[11]  Donal O'Mahony,et al.  Secure routing for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[12]  M. Tahar Kechadi,et al.  CupCarbon: a multi-agent and discrete event wireless sensor network design and simulation tool , 2014, SimuTools.

[13]  Enqing Dong,et al.  An Efficient Bypassing Void Routing Protocol Based on Virtual Coordinate for WSNs , 2015, IEEE Communications Letters.

[14]  Bharat K. Bhargava,et al.  Visualization of wormholes in sensor networks , 2004, WiSe '04.

[15]  Ahcène Bounceur,et al.  A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT , 2017, 2017 IEEE SENSORS.

[16]  Chenyang Lu,et al.  RAP: a real-time communication architecture for large-scale wireless sensor networks , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[17]  Minyi Guo,et al.  Hole Avoiding in Advance Routing in Wireless Sensor Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[18]  Tahar Kechadi,et al.  Finding the polygon hull in wireless sensor networks , 2015 .