A Coverage Algorithm in 3D Wireless Sensor Networks

Watfa, Mohamed K.; Commuri, Sesh

doi:10.1109/iswpc.2006.1613560

Cited by 30 publications

(20 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides the efforts focused on the optimal deployment strategy, there are some works in 3D sensor deployment addressing other issues related to coverage. In [22], a deployment algorithm is proposed to "repair" coverage holes once they are discovered in a 3D volume. In [23], some sufficient conditions are presented for sensors in a given deployment to check if every points in a 3D volume is covered by at least k sensors.…”

Section: Related Workmentioning

confidence: 99%

Low-connectivity and full-coverage three dimensional wireless sensor networks

Bai

Zhang

Xuan

et al. 2009

Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint paths between any two sensor nodes in a WSN, where k ≤ 4. In this paper, we design a set of patterns for these networks. In particular, we design and prove the optimality of 1-and 2-connectivity patterns under any value of the ratio of communication range rc over sensing range rs, among regular lattice deployment patterns. We further propose a set of patterns to achieve 3-and 4-connectivity patterns and investigate the evolutions among all the proposed low-connectivity patterns. Finally, we study the proposed patterns under several practical settings.

show abstract

Section: Related Workmentioning

confidence: 99%

Low-connectivity and full-coverage three dimensional wireless sensor networks

Bai

Zhang

Xuan

et al. 2009

Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

show abstract

“…A 3D coverage algorithm is proposed in [6]. They consider providing coverage while minimizing the energy consumed by the sensors, thus increasing the network lifetime.…”

Section: Related Workmentioning

confidence: 99%

“…Much of the research on sensor deployment, including [4]- [6] has focused on two dimensional coverage, and this is not applicable to our case. In our situation, there were restrictions on where sensors could be placed, such as: sensors could only be placed on the walls and ceilings of a corridor, they could not be placed on the ground, and could not be suspended in mid air!…”

Section: Introductionmentioning

confidence: 99%

Wireless sensor deployment for 3D coverage with constraints

Andersen

Tirthapura

2009

2009 Sixth International Conference on Networked Sensing Systems (INSS)

View full text Add to dashboard Cite

Abstract-We consider the problem of deploying wireless sensors in a three dimensional space to achieve a desired degree of coverage, while minimizing the number of sensors placed. Typical sensor deployment scenarios impose constraints on possible locations of the sensors, and on the desired coverage, but currently there is no unified way to handle these constraints in optimizing the number of sensors placed. We present a novel approach called discretization which allows us to cast the sensor deployment problem as a discrete optimization problem, and hence apply well-understood and flexible discrete optimization techniques for sensor deployment. Our results show that this approach yields solutions that nearly minimize the number of sensors used, while providing a high degree of coverage. Further, unlike typical approaches to sensor deployment, where 3D coverage is significantly more complex than 2D coverage, discretization is equally easy to apply for 2D as well as 3D coverage.

show abstract

“…Our previous work [13]- [15] focused on the full coverage problem in 2D and 3D regions and provided algorithms to locate redundant sensor nodes in the region and deactivate them using simple geometric techniques. There, it was shown that eliminating coverage redundant sensor nodes increases the overall lifetime of the WSN.…”

Section: Introductionmentioning

confidence: 99%

“…In barrier coverage the goal is to achieve a static arrangement of nodes that minimizes the probability of undetected penetration through the barrier, whereas the sweep coverage is more or less equivalent to a moving barrier. One might wonder why we can not simply apply full coverage algorithms developed in our previous research work [13]- [15] and in many others [9], [16]- [18] since border coverage could be analyzed as applying full coverage algorithms on a line. That would result in unnecessary computations and also we propose further extensions to our algorithms to not only find the sensor nodes covering a border of a given region of interest but to also find the sensor nodes on the boundary of coverage and therefore the nodes on the boundary of the coverage holes.…”

Section: Introductionmentioning

confidence: 99%

Self organization of sensor networks for energy-efficient border coverage

Watfa

Commuri

2009

J. Commun. Netw.

View full text Add to dashboard Cite

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.Index Terms: Ad-hoc and sensor networks, border coverage, energy savings, intrusion detection, optimal deployment, self organization, surveillance, three dimensional (3D) modeling.

show abstract

A Coverage Algorithm in 3D Wireless Sensor Networks

Cited by 30 publications

References 12 publications

Low-connectivity and full-coverage three dimensional wireless sensor networks

Low-connectivity and full-coverage three dimensional wireless sensor networks

Wireless sensor deployment for 3D coverage with constraints

Self organization of sensor networks for energy-efficient border coverage

Contact Info

Product

Resources

About