File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range

TitlePerimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range
Authors
Issue Date2010
PublisherHindawi Publishing Corp. The Journal's web site is located at http://www.hindawi.com/journals/wcn/index.html
Citation
Eurasip Journal On Wireless Communications And Networking, 2010, v. 2010, article no. 926075 How to Cite?
AbstractIn target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem. We formally prove that the perimeter coverage scheduling problem is NP-hard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead. Copyright © 2010 K.-S. Hung and K.-S. Lui.
Persistent Identifierhttp://hdl.handle.net/10722/155571
ISSN
2015 SCImago Journal Rankings: 0.326
ISI Accession Number ID
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.citationEurasip Journal On Wireless Communications And Networking, 2010, v. 2010, article no. 926075en_US
dc.identifier.issn1687-1472en_US
dc.identifier.urihttp://hdl.handle.net/10722/155571-
dc.description.abstractIn target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem. We formally prove that the perimeter coverage scheduling problem is NP-hard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead. Copyright © 2010 K.-S. Hung and K.-S. Lui.en_US
dc.languageengen_US
dc.publisherHindawi Publishing Corp. The Journal's web site is located at http://www.hindawi.com/journals/wcn/index.htmlen_US
dc.relation.ispartofEurasip Journal on Wireless Communications and Networkingen_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titlePerimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover rangeen_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.1155/2010/926075en_US
dc.identifier.scopuseid_2-s2.0-77953497399en_US
dc.identifier.hkuros210667-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77953497399&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume2010en_US
dc.identifier.isiWOS:000278611000001-
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