File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On perimeter coverage in wireless sensor networks with minimum cost

TitleOn perimeter coverage in wireless sensor networks with minimum cost
Authors
KeywordsCircular-Arc Graph
Distributed Algorithm
Minimum Cost
Perimeter Coverage
Sensor Networks
Issue Date2011
PublisherInderscience Publishers. The Journal's web site is located at http://www.inderscience.com/ijsnet
Citation
International Journal of Sensor Networks, 2011, v. 9 n. 2, p. 76-88 How to Cite?
AbstractOne of the major applications of sensor networks is tracking and surveillance. Very often, a single sensor is sufficient to monitor a single target. However, when the object is very large, several sensors have to work together to monitor the object continuously. In this paper, we study how to identify a set of sensors that can cover the perimeter of a large target with the minimum cost. We develop a novel distributed algorithm that requires fewer messages than existing mechanisms. Our algorithm can be extended to solve the problem when the sensor range is adjustable. We provide a formal proof of correctness and convergence time analysis of our algorithm. We further demonstrate the performance through extensive simulations. © 2011 Inderscience Enterprises Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/155633
ISSN
2015 Impact Factor: 0.454
2015 SCImago Journal Rankings: 0.328
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHung, KSen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T08:34:28Z-
dc.date.available2012-08-08T08:34:28Z-
dc.date.issued2011en_US
dc.identifier.citationInternational Journal of Sensor Networks, 2011, v. 9 n. 2, p. 76-88en_US
dc.identifier.issn1748-1279en_US
dc.identifier.urihttp://hdl.handle.net/10722/155633-
dc.description.abstractOne of the major applications of sensor networks is tracking and surveillance. Very often, a single sensor is sufficient to monitor a single target. However, when the object is very large, several sensors have to work together to monitor the object continuously. In this paper, we study how to identify a set of sensors that can cover the perimeter of a large target with the minimum cost. We develop a novel distributed algorithm that requires fewer messages than existing mechanisms. Our algorithm can be extended to solve the problem when the sensor range is adjustable. We provide a formal proof of correctness and convergence time analysis of our algorithm. We further demonstrate the performance through extensive simulations. © 2011 Inderscience Enterprises Ltd.en_US
dc.languageengen_US
dc.publisherInderscience Publishers. The Journal's web site is located at http://www.inderscience.com/ijsneten_US
dc.relation.ispartofInternational Journal of Sensor Networksen_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCircular-Arc Graphen_US
dc.subjectDistributed Algorithmen_US
dc.subjectMinimum Costen_US
dc.subjectPerimeter Coverageen_US
dc.subjectSensor Networksen_US
dc.titleOn perimeter coverage in wireless sensor networks with minimum costen_US
dc.typeArticleen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturepostprinten_US
dc.identifier.doi10.1504/IJSNET.2011.038761en_US
dc.identifier.scopuseid_2-s2.0-79960543821en_US
dc.identifier.hkuros210663-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79960543821&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume9en_US
dc.identifier.issue2en_US
dc.identifier.spage76en_US
dc.identifier.epage88en_US
dc.identifier.isiWOS:000289017000003-
dc.publisher.placeUnited Kingdomen_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