File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On perimeter coverage scheduling in wireless sensor networks

TitleOn perimeter coverage scheduling in wireless sensor networks
Authors
Issue Date2009
Citation
2009 9Th International Symposium On Communications And Information Technology, Iscit 2009, 2009, p. 75-80 How to Cite?
AbstractMany sensor network applications require the tracking and the surveillance of target objects. We are specifically interested in the coverage problem known as perimeter coverage that the perimeter of the whole target has to be monitored while a single sensor can only monitor a certain portion of the perimeter. In this case, several sensors are required to ensure the perimeter coverage of the target, and our main focus is to monitor the whole target object as long as possible. In this paper, we first discuss the sufficient conditions in which a linear or a polynomial time optimal solution exists. Since no known polynomial time solution exists for configurations that do not satisfy the conditions, we study the dynamic duration technique to enhance the performance of existing heuristic mechanisms. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158620
References

 

DC FieldValueLanguage
dc.contributor.authorHung, KSen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T09:00:30Z-
dc.date.available2012-08-08T09:00:30Z-
dc.date.issued2009en_US
dc.identifier.citation2009 9Th International Symposium On Communications And Information Technology, Iscit 2009, 2009, p. 75-80en_US
dc.identifier.urihttp://hdl.handle.net/10722/158620-
dc.description.abstractMany sensor network applications require the tracking and the surveillance of target objects. We are specifically interested in the coverage problem known as perimeter coverage that the perimeter of the whole target has to be monitored while a single sensor can only monitor a certain portion of the perimeter. In this case, several sensors are required to ensure the perimeter coverage of the target, and our main focus is to monitor the whole target object as long as possible. In this paper, we first discuss the sufficient conditions in which a linear or a polynomial time optimal solution exists. Since no known polynomial time solution exists for configurations that do not satisfy the conditions, we study the dynamic duration technique to enhance the performance of existing heuristic mechanisms. ©2009 IEEE.en_US
dc.languageengen_US
dc.relation.ispartof2009 9th International Symposium on Communications and Information Technology, ISCIT 2009en_US
dc.titleOn perimeter coverage scheduling in wireless sensor networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/ISCIT.2009.5341284en_US
dc.identifier.scopuseid_2-s2.0-74549210080en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-74549210080&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage75en_US
dc.identifier.epage80en_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