You are here
Energy-efficient target coverage in heterogeneous wireless sensor networks
- Date Issued:
- 2006
- Summary:
- We consider a heterogeneous wireless sensor network, which has several supernodes for data relay and a large number of energy-constrained sensor nodes that are deployed randomly to cover certain targets. Since targets are covered by many sensors, we create several cover sets that are active successively to save power. We introduce the Heterogeneous Connected Set Covers (HCSC) which aims to find at least one cover set that covers all the targets and is connected to a data-relaying supernode. A sensor node can participate in different set covers but the sum of energy spent in all sets is constrained by the initial energy resources of that sensor node. This is the first solution proposed for the target coverage in heterogeneous wireless sensor networks. We show that the HCSC is an NP-Complete problem and propose three distributed algorithms for it and showing simulation results to verify the proposed approaches.
Title: | Energy-efficient target coverage in heterogeneous wireless sensor networks. |
114 views
29 downloads |
---|---|---|
Name(s): |
Awada, Wael Florida Atlantic University, Degree grantor Cardei, Mihaela, Thesis advisor |
|
Type of Resource: | text | |
Genre: | Electronic Thesis Or Dissertation | |
Issuance: | monographic | |
Date Issued: | 2006 | |
Publisher: | Florida Atlantic University | |
Place of Publication: | Boca Raton, Fla. | |
Physical Form: | application/pdf | |
Extent: | 65 p. | |
Language(s): | English | |
Summary: | We consider a heterogeneous wireless sensor network, which has several supernodes for data relay and a large number of energy-constrained sensor nodes that are deployed randomly to cover certain targets. Since targets are covered by many sensors, we create several cover sets that are active successively to save power. We introduce the Heterogeneous Connected Set Covers (HCSC) which aims to find at least one cover set that covers all the targets and is connected to a data-relaying supernode. A sensor node can participate in different set covers but the sum of energy spent in all sets is constrained by the initial energy resources of that sensor node. This is the first solution proposed for the target coverage in heterogeneous wireless sensor networks. We show that the HCSC is an NP-Complete problem and propose three distributed algorithms for it and showing simulation results to verify the proposed approaches. | |
Identifier: | 9780542576171 (isbn), 13342 (digitool), FADT13342 (IID), fau:10192 (fedora) | |
Collection: | FAU Electronic Theses and Dissertations Collection | |
Note(s): |
College of Engineering and Computer Science Thesis (M.S.)--Florida Atlantic University, 2006. |
|
Subject(s): |
Wireless communication systems Sensor networks Wireless LANs |
|
Held by: | Florida Atlantic University Libraries | |
Persistent Link to This Record: | http://purl.flvc.org/fcla/dt/13342 | |
Sublocation: | Digital Library | |
Use and Reproduction: | Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder. | |
Use and Reproduction: | http://rightsstatements.org/vocab/InC/1.0/ | |
Host Institution: | FAU | |
Is Part of Series: | Florida Atlantic University Digital Library Collections. |