Location-free boundary detection in mobile wireless sensor networks with a distributed approach

Chu, Wei-Cheng; Ssu, Kuo‐Feng

doi:10.1016/j.comnet.2014.05.005

Cited by 29 publications

(17 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chu and Ssu [19] proposed a decentralized boundary detection (DBD) algorithm to identify sensor nodes near a hole or obstacle in WSN using topological approach. Each node knows its three-hop neighbors by exchanging HELLO messages and one-hop and two-hop node information.…”

Section: Topological Approachmentioning

confidence: 99%

See 1 more Smart Citation

Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

Antil

Malik

2014

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Owing to random deployment, environmental factors, dynamic topology, and external attacks, emergence of holes in wireless sensor networks is inescapable. Hole is an area in sensor network around which sensors cease to sense or communicate due to drainage of battery or any fault, either temporary or permanent. Holes impair sensing and communication functions of network; thus their identification is a major concern. This paper discusses different types of holes and significance of hole detection in wireless sensor networks. Coverage hole detection schemes have been classified into three categories based on the type of information used by algorithms, computation model, and network dynamics for better understanding. Then, relative strengths and shortcomings of some of the existing coverage hole detection algorithms are discussed. The paper is concluded by highlighting various future research directions.

show abstract

Section: Topological Approachmentioning

confidence: 99%

“…High scalability, outdoor performance, robustness, difficult localization, long network lifetime, and high energy efficiency [18,19,23,27,30] Home (home automation)…”

Section: Journal Of Computer Network and Communicationsmentioning

confidence: 99%

Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

Antil

Malik

2014

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…To decide if sensor nodes are near a hole or an obstacle, the authors in [16] designed a decentralized boundary detection (DBD) algorithm using a topological approach. By exchanging HELLO messages each node will construct a 2-hop neighbor graph to detect the coverage holes.…”

Section: Related Workmentioning

confidence: 99%

A Recovery Algorithm to Detect and Repair Coverage Holes in Wireless Sensor Network System

Khamlichi¹,

Mesmoudi²,

Tahiri³

et al. 2018

jcm

View full text Add to dashboard Cite

Nowadays, wireless sensor network (WSN) systems are widely used in various applications designed to monitor real world physical or environmental phenomena, in more than a few disciplines such as healthcare and habitat monitoring. The position of the sensor nodes significantly affects the accuracy of the information collected, which decides the quality of service offered by the application system. Hence, the deployment strategy is one of the key issues to be solved in WSN. Generally, to reach the end for which the WSN system is designed, full coverage and connectivity must be provided, so each and every event can be detected, and then, guarantee that all the collected information is transmitted to the desired base station for processing and analyzing. When the deployment is not optimally achieved, coverage holes and serious coverage overlapping can occur, which creates uncovered areas and undetected application key events, leading to system mission failure. In this paper, we propose a recovery method based on a gradient algorithm combined with a clustering technique in order to detect the redundant sensor nodes in the whole WSN system and relocates them to heal the identified coverage holes.

show abstract

“…In [19] , an algorithm called Distributed Boundary Detection (DBD) is developed for identifying the boundaries of obstacles and networks. Each node requires only the information of its three-hop neighbors.…”

Section: Related Workmentioning

confidence: 99%

D-LPCN: A distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network

et al. 2017

View full text Add to dashboard Cite

A boundary of wireless sensor networks (WSNs) can be used in many fields, for example, to monitor a frontier or a secure place of strategic sensitive sites like oil fields or frontiers of a country. This situation is modeled as the problem of finding a polygon hull in a connected Euclidean graph, which represents a minimal set of connected boundary nodes. In this paper we propose a new algorithm called D-LPCN (Distributed Least Polar-angle Connected Node) which represents the distributed version of the LPCN algorithm introduced in [1]. In each iteration, any boundary node, except the first one, chooses its nearest polar angle node among its neighbors with respect to the node found in the previous iteration. The first starting node can be automatically determined using the Minimum Finding algorithm, which has two main advantages. The first one is that the algorithm works with any type of a connected network, given as planar or not. Furthermore, it takes into account any blocking situation and contains the necessary elements to avoid them. The second advantage is that the algorithm can determine all the boundaries of the different connected parts of the network. The proposed algorithm is validated using the CupCarbon, Tossim and Contiki simulators. It has also been implemented using real sensor nodes based on the TelosB and Arduino/XBee platforms. We have estimated the energy consumption of each node and we have found that the consumption of the network depends on the number of the boundary nodes and their neighbors. The simulation results show that the proposed algorithm is less energy consuming than the existing algorithms and its distributed version is less energy consuming than the centralized version.

show abstract

Location-free boundary detection in mobile wireless sensor networks with a distributed approach

Cited by 29 publications

References 30 publications

Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

A Recovery Algorithm to Detect and Repair Coverage Holes in Wireless Sensor Network System

D-LPCN: A distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network

Contact Info

Product

Resources

About