Detecting coverage holes in wireless sensor networks

Kanno, Jinko; Šelmić, Rastko R.; Phoha, Vir V.

doi:10.1109/med.2009.5164583

Cited by 34 publications

(18 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This definition is similar to the one of the Rips complexes is very similar to the one of the sensing disks. [5], [6] Figure 2. The wireless sensor network.…”

Section: Rips Complexesmentioning

confidence: 99%

Identification and description of coverage holes in a wireless sensor network using graph theory and homology

Peláez

2010

SPIE Proceedings

View full text Add to dashboard Cite

Identifying coverage holes makes an important topic for optimization of quality service for wireless sensor network hosts. This paper introduces a new way to identify and describe how is the network's structure, its number of holes and its components, assuming there's a sensor covering an area where a network communication exists. The simplicial complex method and algebraic graph theory will be applied. Betti numbers and Euler characteristics will be used for a sensor network represented by a simplicial complex, and the Tutte polynomial will be used for describing visual graphs algebraically, for a complete identification.

show abstract

“…This definition is similar to the one of the Rips complexes is very similar to the one of the sensing disks. [5], [6] Figure 2. The wireless sensor network.…”

Section: Rips Complexesmentioning

confidence: 99%

Identification and description of coverage holes in a wireless sensor network using graph theory and homology

Peláez

2010

SPIE Proceedings

View full text Add to dashboard Cite

show abstract

“…Authors in [2] introduce a novel idea of using the mathematical field of homology to solve coverage holes problem. In [3] two methods, divide-and-conquer strategy and triangle collapsing algorithm, are proposed to determine the location and the number of the coverage holes. The method, in [4], is also based on a divide-and-conquer method, but the computing complexity is less than [3].…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…In [3] two methods, divide-and-conquer strategy and triangle collapsing algorithm, are proposed to determine the location and the number of the coverage holes. The method, in [4], is also based on a divide-and-conquer method, but the computing complexity is less than [3]. However methods which are centralized require an overview of the entire network.…”

Section: Introduction and Related Workmentioning

confidence: 99%

Recovering Coverage Holes by Using Mobile Sensors in Wireless Sensor Networks

Xiong

Wang

2011

2011 Seventh International Conference on Computational Intelligence and Security

View full text Add to dashboard Cite

Coverage holes often exist in wireless sensor networks deployed with static nodes. In order to patch the holes and recover the network performance, an algorithm based on mobile nodes is presented, which guides the mobile nodes to the position of holes, and then get the resilient coverage. The static sensors bound a coverage hole can compute the optimum position for the mobile sensors which, after moving, can get the maximal recovering coverage and avoid presenting scatter and little coverage holes . We do some simulations to show the coverage, stability and redundancy of the proposed method, then the related work are analyzed and some performance comparisons in availability are given.

show abstract

“…The underlying principle of interaction between the UGV and WSAN is that the WSAN serves as a medium to guide the UGV. As in [1], for simplicity, we treat the network as an unweighted, undirected communication graph, where two nodes in the network are connected by an edge if and only if they can communicate directly. Hole boundary nodes are located on the boundary of the coverage hole.…”

Section: Introductionmentioning

confidence: 99%

“…Buchart and Yao et al [2], [3] propose centralized and distributed algorithms to identify the coverage hole boundary nodes, respectively. We consider the problem of a UGV navigation to the hole boundary nodes, which is triggered after the detection and identification of hole boundary nodes [2], [1] and which occurs before the patching of the coverage holes [3]. Since we treat the hole boundary nodes simply as target destinations for the purpose of UGV navigation, this problem can be generalized to any navigation of a UGV to a pre-determined set of target nodes within a WSAN.…”

Section: Introductionmentioning

confidence: 99%

Distributed unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks

Zhang

Duncan

Kanno

et al. 2011

IEEE Conference on Decision and Control and European Control Conference

Self Cite

View full text Add to dashboard Cite

We present a distributed algorithm for the navigation of an Unmanned Ground Vehicle (UGV) towards a set of identified target nodes in coordinate-free and localization-free wireless sensor and actuator networks. The navigation algorithm proceeds in two phases: first, a node level is determined based on a hop distance from the target nodes, which is accomplished by the network nodes without the need for any UGV action; and second, the UGV uses potential fields created by the network actuators to move towards the target nodes, requiring cooperation between certain actuator nodes and the UGV. The hop distance to the target nodes is used to control the main moving direction while the potential field, which can be measured by listeners on the UGV, is used to determine the UGV's movement. The major contribution of this paper is that the algorithm is fully distributed compared to the existing results in the field, which is suitable for real-time implementation. Meanwhile, the presenting algorithm uses three actuators to generate a potential field, which makes the algorithm more robust and flexible. A study on the communication complexity of the algorithm is presented as well as simulation examples that verify the presented algorithm.

show abstract

Detecting coverage holes in wireless sensor networks

Cited by 34 publications

References 16 publications

Identification and description of coverage holes in a wireless sensor network using graph theory and homology

Identification and description of coverage holes in a wireless sensor network using graph theory and homology

Recovering Coverage Holes by Using Mobile Sensors in Wireless Sensor Networks

Distributed unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks

Contact Info

Product

Resources

About