Integrated coverage and connectivity configuration in wireless sensor networks

Published on Nov 5, 2003
路 DOI :10.1145/958491.958496
Xiaorui Wang40
Estimated H-index: 40
(WashU: Washington University in St. Louis),
Guoliang Xing46
Estimated H-index: 46
(WashU: Washington University in St. Louis)
+ 3 AuthorsChristopher Gill33
Estimated H-index: 33
(WashU: Washington University in St. Louis)
Sources
Abstract
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs from existing connectivity or coverage maintenance protocols in several key ways: 1) We present a Coverage Configuration Protocol (CCP) that can provide different degrees of coverage requested by applications. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. 2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity in a unified framework: this is in sharp contrast to several existing approaches that address the two problems in isolation. 3) Finally, we integrate CCP with SPAN to provide both coverage and connectivity guarantees. We demonstrate the capability of our protocols to provide guaranteed coverage and connectivity configurations, through both geometric analysis and extensive simulations.
馃摉 Papers frequently viewed together
2001MOBICOM: ACM/IEEE International Conference on Mobile Computing and Networking
3 Authors (Ya Xu, ..., Deborah Estrin)
2003
3 Authors (Ting Yan, ..., John A. Stankovic)
References17
Newest
May 19, 2003 in ICDCS (International Conference on Distributed Computing Systems)
#1Fan Ye (UCLA: University of California, Los Angeles)H-Index: 33
#2Gary Zhong (UCLA: University of California, Los Angeles)H-Index: 6
Last. Lixia Zhang (UCLA: University of California, Los Angeles)H-Index: 101
view all 5 authors...
In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning off redundant ones. PEAS operations are based on individual node's observation of the local environment and do not require any node to maintain per neighbor node state. PEAS performance possesses a high degree of r...
Source
#1A. D'Costa (UW: University of Wisconsin-Madison)H-Index: 5
#2Akbar M. Sayeed (UW: University of Wisconsin-Madison)H-Index: 48
Sensor networks provide virtual snapshots of the physical world via distributed wireless nodes that can sense in different modalities, such as acoustic and seismic. Classification of objects moving through the sensor field is an important application that requires collaborative signal processing (CSP) between nodes. Given the limited resources of nodes, a key constraint is to exchange the least amount of information between them to achieve desired performance. Two main forms of CSP are possible....
Source
#1Sundeep Pattem (SC: University of Southern California)H-Index: 13
#2Sameera Poduri (SC: University of Southern California)H-Index: 12
Last. Bhaskar Krishnamachari (SC: University of Southern California)H-Index: 81
view all 3 authors...
We study the tradeoffs involved in the energy-efficient localization and tracking of mobile targets by a wireless sensor network. Our work focuses on building a framework for evaluating the fundamental performance of tracking strategies in which only a small portion of the network is activated at any point in time. We first compare naive network operation with random activation and selective activation. In these strategies the gains in energy-savings come at the expense of increased uncertainty ...
Source
#1Krishnendu Chakrabarty (Duke University)H-Index: 93
Last. Eungchun ChoH-Index: 8
view all 4 authors...
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimensional) of points (coordinates) and use the term target location to refer to the problem of locating a target at a grid point at any instant in time. We first present an integer linear programming (ILP) solution for minimizing the cost of sensors for complete coverage of the sensor field. We solve the ILP model using a...
Source
Nov 7, 2002 in INFOCOM (International Conference on Computer Communications)
#1Alberto E. Cerpa (UCLA: University of California, Los Angeles)H-Index: 26
#2Deborah Estrin (UCLA: University of California, Los Angeles)H-Index: 131
Advances in micro-sensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low per-node cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks will coordinate to perform the distributed sensing tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density, so as to extend overall...
Source
#1Di Tian (U of O: University of Ottawa)H-Index: 5
#2Nicolas D. Georganas (U of O: University of Ottawa)H-Index: 27
In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime, as well as maintain sufficient sensing coverage and reliability. In this paper, we propose a node-scheduling scheme, which can reduce system overall energy consumption, therefore increasing system lifetime, by turning off some redundant nodes. Our coverage-based off-duty eligibility rule and backoff-based node-scheduling sc...
Source
#1Thomas Clouqueur (UW: University of Wisconsin-Madison)H-Index: 6
#2Veradej Phipatanasuphorn (UW: University of Wisconsin-Madison)H-Index: 3
Last. Kewal K. Saluja (UW: University of Wisconsin-Madison)H-Index: 39
view all 4 authors...
In order to monitor a region for traffic traversal, sensors can be deployed to perform collaborative target detection. Such a sensor network achieves a certain level of detection performance with an associated cost of deployment. This paper addresses this problem by proposing path exposure as a measure of the goodness of a deployment and presents an approach for sequential deployment in steps. It illustrates that the cost of deployment can be minimized to achieve the desired detection performanc...
Source
#1Dan LiH-Index: 4
#2Kerry D. WongH-Index: 1
Last. Akbar M. SayeedH-Index: 48
view all 4 authors...
We outline a framework for collaborative signal processing in distributed sensor networks. The ideas are presented in the context of tracking multiple moving objects in a sensor field. The key steps involved in the tracking procedure include event detection, target classification, and estimation and prediction of target location. Algorithms for various tasks are discussed with an emphasis on classification. Results based on experiments with real data are reported which provide useful insights in...
Jul 16, 2001 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Benjie Chen (MIT: Massachusetts Institute of Technology)H-Index: 9
#2Kyle Jamieson (MIT: Massachusetts Institute of Technology)H-Index: 30
Last. Robert Morris (MIT: Massachusetts Institute of Technology)H-Index: 81
view all 4 authors...
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network bag a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whe...
Source
Jul 16, 2001 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Seapahn Meguerdichian (UCLA: University of California, Los Angeles)H-Index: 6
#2Farinaz Koushanfar (University of California, Berkeley)H-Index: 63
Last. Miodrag Potkonjak (UCLA: University of California, Los Angeles)H-Index: 77
view all 4 authors...
Wireless ad-hoc sensor networks will provide one of the missing connections between the Internet and the physical world. One of the fundamental problems in sensor networks is the calculation of coverage. Exposure is directly related to coverage in that it is a measure of how well an object, moving on an arbitrary path, can be observed by the sensor network over a period of time. In addition to the informal definition, we formally define exposure and study its properties. We have developed an eff...
Source
Cited By1204
Newest
#1Pooja Chaturvedi (NU: Nirma University of Science and Technology)
#2A. K. Daniel (Madan Mohan Malaviya University of Technology)H-Index: 7
Wireless sensor network (WSN) is an emerging research field in recent years. The advancement in sensory device and communication technologies has enabled the deployment of diverse sensor networks such as random network consisting of thousand sensors or carefully deployed deterministic network. Despite the plethora of applicability of sensor networks, there are some limitations too such as energy efficiency, lifetime, coverage, localization etc. As the sensor nodes are battery driven so conservat...
Source
Source
#1Xili Wan (Nanjing Tech University)H-Index: 7
#2Ji Tingxiang (Nanjing Tech University)H-Index: 1
Last. Yi-Feng Li (Nanjing Tech University)H-Index: 2
view all 5 authors...
Source
#1Aris Papasavvas (Edin.: University of Edinburgh)H-Index: 3
Any industrial system goes along with objectives to be met (e.g. economic performance), disturbances to handle (e.g. market fluctuations, catalyst decay, unexpected variations in uncontrolled flow rates and compositions,...), and uncertainties about its behavior. In response to these, decisions must be taken and instructions be sent to the operators to drive and maintain the plant at satisfactory, yet potentially changing operating conditions. Over the past thirty years many methods have been cr...
#1Ankita Srivastava (BHU: Banaras Hindu University)H-Index: 12
#2Pramod Kumar Mishra (BHU: Banaras Hindu University)H-Index: 12
A wireless sensor networks (WSN鈥檚) has stimulated significant research work among the researchers in monitoring and tracking tasks. It鈥檚 a quite challenging task that needs to cope up with various conflicting issues such as energy efficiency, network lifetime, connectivity, coverage, etc. in WSN鈥檚 for designing various applications. This paper explores the recent work and efforts done in addressing the various issues in WSN鈥檚. This paper focused聽on basic concepts regarding the WSN鈥檚 and discusse...
Source
#1Elham Golrasan (MUT: Malek-Ashtar University of Technology)H-Index: 1
#2Hossein Shirazi (MUT: Malek-Ashtar University of Technology)H-Index: 13
Last. Kourosh Dadashtabar (MUT: Malek-Ashtar University of Technology)H-Index: 1
view all 3 authors...
In this paper, the problem of full area coverage in wireless sensor networks is investigated by keeping the minimum number of heterogeneous sensor nodes. The coverage problem is considered for both deterministic and probabilistic heterogeneous sensors. We propose a new distributed game theory-based algorithm to maximize the area coverage while minimizing the number of activated sensors. Due to the energy limitations in sensor networks, we formulate the area coverage problem as a multi-player gam...
Source
#1Lili Zhang (Soochow University (Suzhou))H-Index: 2
#2Cheng-Kuan Lin (FZU: Fuzhou University)H-Index: 10
Last. Yuan-Hsiang Teng (Providence University)H-Index: 8
view all 5 authors...
Target traversing is an important research topic in wireless sensor networks, with most studies examining coverage issues of the target鈥檚 moving paths. The best coverage path is one that minimizes the target support to the sensors. Most existing algorithms either ensure that the target remains as close as possible to the sensors or deploy sensors to enhance coverage. In this paper, we consider a scenario where the target must traverse the sensor network within a certain time constraint. Furtherm...
Source
#1Ruoqi DengH-Index: 3
#2Boya DiH-Index: 23
Last. Lingyang SongH-Index: 69
view all 5 authors...
Recently, the ultra-dense low Earth orbit (LEO) satellite constellation over high-frequency band has served as a potential solution for high-capacity backhaul data services. In this paper, we consider an ultra-dense LEO-based terrestrial-satellite network where terrestrial users can access the network through the LEO-assisted backhaul. We aim to minimize the number of satellites in the constellation while satisfying the backhaul requirement of each user terminal (UT). We first derive the average...
Source
#1Moumita Deb (RCC Institute of Information Technology)H-Index: 3
#2Sarbani RoyH-Index: 13
Energy harvesting facilitates Wireless Sensor Networks (WSN) to work in perpetual mode. But, the amount and duration of green energy depend on the unpredictable behavior of ambient energy sources. Limited knowledge of future energy availability is the main constraint in designing routing and MAC (Medium Access Control) protocol. If the prediction of future energy availability can be done with fine accuracy, then energy management strategies can be designed accordingly. Predicting solar irradianc...
Source
In this article, the coverage reliability of wireless sensor network is evaluated from a new perspective. Based on the D鈥揝 evidence theory, we define the concept of belief degree of sensing result, establish a belief-degree-coverage model considering common cause failures, and define three indexes to evaluate the reliability of the above coverage model. In order to calculate the belief degree of the sensor's sensing result considering common cause failures, we use a membership function to obtain...
Source
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.