File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On perimeter coverage in wireless sensor networks

TitleOn perimeter coverage in wireless sensor networks
Authors
KeywordsMinimum Cover
Perimeter Coverage
Sensor Network
Issue Date2010
PublisherIEEE
Citation
IEEE Transactions on Wireless Communications, 2010, v. 9 n. 7, p. 2156-2164 How to Cite?
AbstractMany sensor network applications require the tracking and the surveillance of target objects. However, in current research, many studies have assumed that a target object can be sufficiently monitored by a single sensor. This assumption is invalid in some situations, especially, when the target object is so large that a single sensor can only monitor a certain portion of it. In this case, several sensors are required to ensure a 360 coverage of the target. To minimize the amount of energy required to cover the target, the minimum set of sensors should be identified. Centralized algorithms are not suitable for sensor applications. In this paper, we describe our novel distributed algorithm for finding the minimum cover. Our algorithm requires fewer messages than earlier mechanisms and we provide a formal proof of correctness and time of convergence. We further demonstrate our performance improvement through extensive simulations. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155573
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
Funding AgencyGrant Number
University of Hong Kong200811159057
Funding Information:

This work was supported in part by the University of Hong Kong Seed Funding Programme for Basic Research, Project No. 200811159057.

References

 

DC FieldValueLanguage
dc.contributor.authorHung, KSen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T08:34:09Z-
dc.date.available2012-08-08T08:34:09Z-
dc.date.issued2010en_US
dc.identifier.citationIEEE Transactions on Wireless Communications, 2010, v. 9 n. 7, p. 2156-2164en_US
dc.identifier.issn1536-1276en_US
dc.identifier.urihttp://hdl.handle.net/10722/155573-
dc.description.abstractMany sensor network applications require the tracking and the surveillance of target objects. However, in current research, many studies have assumed that a target object can be sufficiently monitored by a single sensor. This assumption is invalid in some situations, especially, when the target object is so large that a single sensor can only monitor a certain portion of it. In this case, several sensors are required to ensure a 360 coverage of the target. To minimize the amount of energy required to cover the target, the minimum set of sensors should be identified. Centralized algorithms are not suitable for sensor applications. In this paper, we describe our novel distributed algorithm for finding the minimum cover. Our algorithm requires fewer messages than earlier mechanisms and we provide a formal proof of correctness and time of convergence. We further demonstrate our performance improvement through extensive simulations. © 2006 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE-
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_US
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE-
dc.rightsIEEE Transactions on Wireless Communications. Copyright © IEEE-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectMinimum Coveren_US
dc.subjectPerimeter Coverageen_US
dc.subjectSensor Networken_US
dc.titleOn perimeter coverage in wireless sensor networksen_US
dc.typeArticleen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TWC.2010.07.080817en_US
dc.identifier.scopuseid_2-s2.0-77954739020en_US
dc.identifier.hkuros210666-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77954739020&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume9en_US
dc.identifier.issue7en_US
dc.identifier.spage2156en_US
dc.identifier.epage2164en_US
dc.identifier.isiWOS:000282404600007-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridHung, KS=23008935900en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats