## Coverage preserving redundancy elimination in sensor networks (2004)

Venue: | in Proceedings of IEEE International Conference on Sensor and Ad hoc Communications and Networks (SECON’04 |

Citations: | 14 - 1 self |

### BibTeX

@INPROCEEDINGS{Cărbunar04coveragepreserving,

author = {Bogdan Cărbunar and Ananth Grama and Jan Vitek},

title = {Coverage preserving redundancy elimination in sensor networks},

booktitle = {in Proceedings of IEEE International Conference on Sensor and Ad hoc Communications and Networks (SECON’04},

year = {2004},

pages = {377--386}

}

### OpenURL

### Abstract

Abstract — In this paper we study the problem of detecting and eliminating redundancy in a sensor network with a view to improving energy efficiency, while preserving the network’s coverage. We also examine the impact of redundancy elimination on the related problem of coverage-boundary detection. We reduce both problems to the computation of Voronoi diagrams, prove and achieve lower bounds on the solution of these problems, and present efficient distributed algorithms for computing and maintaining solutions in cases of sensor failures or insertion of new sensors. We prove the correctness and termination properties of our distributed algorithms, and analytically characterize the time complexity and the traffic generated by our algorithms. Our simulations show that the traffic generated per sensor insertion or removal (failure) experiences a dramatic decrease with increase in sensor density, (up to 300 % when the number of sensors deployed in the same 1000 × 1000m 2 area increases from 150 to 800), and with increase in radio transmission range (up to 200 % when the sensor’s transmission range increases from 70m to 200m). I.

### Citations

1776 | GPSR: Greedy perimeter stateless routing for wireless networks
- Karp, Kung
- 2000
(Show Context)
Citation Context ...umed that routing is done along the edges of the Delaunay triangulation. However, two Voronoi neighbors may not be within each other’s range, requiring a routing protocol. LAR [7], DREAM [8] and GPSR =-=[9]-=- are examples of location based routing protocols that can be used for routing between non-adjacent Voronoi neighbors. However, in the following theorem, based on [10], we provide a lower bound on the... |

739 | Location-aided routing (lar) in mobile ad hoc networks
- Ko, Vaidya
- 1998
(Show Context)
Citation Context ...other words, we have assumed that routing is done along the edges of the Delaunay triangulation. However, two Voronoi neighbors may not be within each other’s range, requiring a routing protocol. LAR =-=[7]-=-, DREAM [8] and GPSR [9] are examples of location based routing protocols that can be used for routing between non-adjacent Voronoi neighbors. However, in the following theorem, based on [10], we prov... |

460 |
A distance routing effect algorithm for mobility (DREAM
- Basagni, Chlamtac, et al.
- 1998
(Show Context)
Citation Context ..., we have assumed that routing is done along the edges of the Delaunay triangulation. However, two Voronoi neighbors may not be within each other’s range, requiring a routing protocol. LAR [7], DREAM =-=[8]-=- and GPSR [9] are examples of location based routing protocols that can be used for routing between non-adjacent Voronoi neighbors. However, in the following theorem, based on [10], we provide a lower... |

381 | A simple parallel algorithm for the maximal independent set problem
- Luby
- 1986
(Show Context)
Citation Context ...d by Tian and Georganas [1], uses a random back-off scheme. We propose a different solution, based on a slight modification of a distributed approximation of the maximal independent set (MIS) problem =-=[5]-=-. Let GR = (VR, ER) be the redundant graph of the network, where VR is the set of redundant sensors. There is an edge e ∈ ER between two redundant sensors if and only if they are Voronoi neighbors. Th... |

285 | Peas: A robust energy conserving protocol for long-lived sensor networks
- Ye, Zhong, et al.
- 2003
(Show Context)
Citation Context ...Since communication is generally much more energy consuming than local computation, the protocols themselves need to be energy efficient. Prior work in the area of energy-efficient coverage [1], [2], =-=[3]-=- provides solutions that are either less efficient, do not maintain the initial network coverage, or detect only a subset of the redundant sensors (see Section VII). This paper makes the following spe... |

133 | Exposure in wireless ad-hoc sensor networks
- Meguerdichian, Koushanfar, et al.
- 2001
(Show Context)
Citation Context ...] introduce a centralized algorithm for finding the maximum number of disjoint subsets of sensors, where each subset completely covers the same area as the entire set of sensors. Meguerdichian et al. =-=[12]-=- define the coverage using as metrics the best covered and least covered paths between two sensors in the network. Haas [13] presents algorithms for optimizing coverage under constraints on message pa... |

122 |
Coverage for robotics - a survey of recent results
- Choset
- 2001
(Show Context)
Citation Context ...edundant sensors. Moreover, our approach is distributed, that is, we do not assume global knowledge of the network. The problem of sensor coverage has also received considerable attention in robotics =-=[16]-=-. Given a bounded environment the problem requires a robot equipped with a sensor to build a complete map of the environment without any initial knowledge. the robot to pass through specified points o... |

112 | Locating and bypassing routing holes in sensor networks
- Fang, Gao, et al.
(Show Context)
Citation Context ...trics the best covered and least covered paths between two sensors in the network. Haas [13] presents algorithms for optimizing coverage under constraints on message path length. Fang, Gao and Guibas =-=[14]-=- presentsnumber of messages 50 45 40 35 30 25 20 15 number of messages per new sensor Join Leave 10 100 200 300 400 500 600 700 800 number of sensors number of messages 35 30 25 20 15 number of messag... |

104 |
Topology control for multihop packet radio networks
- Hu
- 1993
(Show Context)
Citation Context ... of coverage problems in sensor networks, please consult [4], [17]. Distributed computation of Voronoi diagrams is addressed by Stojmenovic [18] in the context of routing in ad-hoc networks and by Hu =-=[19]-=- in the context of topology control of ad-hoc networks. In their approach, a sensor builds a Voronoi diagram of itself and its neighbors. This computes only an approximation of the correct Voronoi cel... |

63 | Voronoi diagram and convex hull based geocasting and routing in wireless networks
- Stojmenovic
- 1999
(Show Context)
Citation Context ...e map using only line of sight data. For an extensive survey of coverage problems in sensor networks, please consult [4], [17]. Distributed computation of Voronoi diagrams is addressed by Stojmenovic =-=[18]-=- in the context of routing in ad-hoc networks and by Hu [19] in the context of topology control of ad-hoc networks. In their approach, a sensor builds a Voronoi diagram of itself and its neighbors. Th... |

45 | Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
- Even, Lotker, et al.
(Show Context)
Citation Context ...ployment of new sensors. an algorithm for routing around connectivity holes in a sensor network. The problem of network coverage is related to the problem of frequency assignment in cellular networks =-=[15]-=-, whose purpose is to assign a frequency for every base station in a centralized manner, such that no two base stations with the same frequency cover the same device. Our goal is quite different from ... |

38 | Fully dynamic Delaunay triangulation in logarithmic expected time per operation
- Devillers, Meiser, et al.
- 1992
(Show Context)
Citation Context ... All the sensors in Fig. 6 are notifiable with regard to ns. Before proceeding with the description of the join algorithm, we present two useful lemmas, direct consequences of Lemmas 4.3 and 4.4 from =-=[6]-=-. Lemma 5.1: Given a randomly deployed sensor network of size n, the expected number of sensors affected by the random deployment of a new sensor is O(log n). Lemma 5.2: The expected number of Voronoi... |

37 | The bin-covering technique for thresholding random geometric graph properties
- Muthukrishnan, Pandurangan
- 2005
(Show Context)
Citation Context ...ocol. LAR [7], DREAM [8] and GPSR [9] are examples of location based routing protocols that can be used for routing between non-adjacent Voronoi neighbors. However, in the following theorem, based on =-=[10]-=-, we provide a lower bound on the radio transmission range of sensors, that ensures that sensors that are Voronoi neighbors are almost surely within each other’s range. Theorem 5.1: Let n be the numbe... |

36 |
Maintaining coverage and connectivity in large sensor networks
- Zhang, Hou
- 2004
(Show Context)
Citation Context ...ing. Since communication is generally much more energy consuming than local computation, the protocols themselves need to be energy efficient. Prior work in the area of energy-efficient coverage [1], =-=[2]-=-, [3] provides solutions that are either less efficient, do not maintain the initial network coverage, or detect only a subset of the redundant sensors (see Section VII). This paper makes the followin... |

23 | A coverage-preserving node scheduling scheme for large wireless sensor networks
- Tian, Georganas
- 2002
(Show Context)
Citation Context ... routing. Since communication is generally much more energy consuming than local computation, the protocols themselves need to be energy efficient. Prior work in the area of energy-efficient coverage =-=[1]-=-, [2], [3] provides solutions that are either less efficient, do not maintain the initial network coverage, or detect only a subset of the redundant sensors (see Section VII). This paper makes the fol... |

18 | On The Relaying Capability Of The Reconfigurable Wireless Networks
- Haas
- 1997
(Show Context)
Citation Context ...ely covers the same area as the entire set of sensors. Meguerdichian et al. [12] define the coverage using as metrics the best covered and least covered paths between two sensors in the network. Haas =-=[13]-=- presents algorithms for optimizing coverage under constraints on message path length. Fang, Gao and Guibas [14] presentsnumber of messages 50 45 40 35 30 25 20 15 number of messages per new sensor Jo... |

15 |
Coverage in wireless sensor networks”, handbook of sensor networks: Compact Wireless and Wired Sensing Systems
- Cardei, Wu
- 2004
(Show Context)
Citation Context ...a hierarchical generalized Voronoi graph is used to incrementally construct the map using only line of sight data. For an extensive survey of coverage problems in sensor networks, please consult [4], =-=[17]-=-. Distributed computation of Voronoi diagrams is addressed by Stojmenovic [18] in the context of routing in ad-hoc networks and by Hu [19] in the context of topology control of ad-hoc networks. In the... |

1 |
Coverage problems in sensor networks
- Carbunar, Grama, et al.
- 2004
(Show Context)
Citation Context ...alone). Extensions of these schemes to non-identical sensing ranges are possible using multiplicative weighted Voronoi diagrams. We demonstrate this in the context of the coverage-boundary problem in =-=[4]-=-. We now formally describe the coverage of a sensor. Definition 3.1: The coverage of a sensor s with planar coordinates (x, y) and sensing range r is a disk with center (x, y) and radius r. We call th... |