File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Arbitrary obstacles constrained full coverage in wireless sensor networks

TitleArbitrary obstacles constrained full coverage in wireless sensor networks
Authors
KeywordsComputational Geometry
Coverage
Obstacles
Wireless Sensor Networks
Issue Date2010
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2010, v. 6221 LNCS, p. 1-10 How to Cite?
AbstractCoverage is critical for wireless sensor networks to monitor a region of interest and to provide a good quality of service. In many application scenarios, full coverage is required, which means every point inside the region (excluding the obstacles) must be covered by at least one sensor. The problem of using the minimum number of sensors to achieve full coverage for an arbitrary region with obstacles is NP-hard. Most existing coverage methods, such as contour-based ones, simply place sensors along the boundaries to cover the holes that are near the obstacles and the region boundary. These methods are inefficient especially when the obstacles or the region are irregular. In this paper, based on computational geometry, we design a full coverage method, which accurately finds the uncovered holes and places sensors efficiently for both the regular and irregular obstacles and regions. Specifically, we show that the more irregular the obstacles and the region are, the more sensors our method can save. © 2010 Springer-Verlag Berlin Heidelberg.
Persistent Identifierhttp://hdl.handle.net/10722/151979
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorTan, Hen_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorHao, Xen_US
dc.contributor.authorHua, QSen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:31:50Z-
dc.date.available2012-06-26T06:31:50Z-
dc.date.issued2010en_US
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2010, v. 6221 LNCS, p. 1-10en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/151979-
dc.description.abstractCoverage is critical for wireless sensor networks to monitor a region of interest and to provide a good quality of service. In many application scenarios, full coverage is required, which means every point inside the region (excluding the obstacles) must be covered by at least one sensor. The problem of using the minimum number of sensors to achieve full coverage for an arbitrary region with obstacles is NP-hard. Most existing coverage methods, such as contour-based ones, simply place sensors along the boundaries to cover the holes that are near the obstacles and the region boundary. These methods are inefficient especially when the obstacles or the region are irregular. In this paper, based on computational geometry, we design a full coverage method, which accurately finds the uncovered holes and places sensors efficiently for both the regular and irregular obstacles and regions. Specifically, we show that the more irregular the obstacles and the region are, the more sensors our method can save. © 2010 Springer-Verlag Berlin Heidelberg.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.subjectComputational Geometryen_US
dc.subjectCoverageen_US
dc.subjectObstaclesen_US
dc.subjectWireless Sensor Networksen_US
dc.titleArbitrary obstacles constrained full coverage in wireless sensor networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/978-3-642-14654-1_1en_US
dc.identifier.scopuseid_2-s2.0-77958482236en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77958482236&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume6221 LNCSen_US
dc.identifier.spage1en_US
dc.identifier.epage10en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridTan, H=22936378500en_US
dc.identifier.scopusauthoridWang, Y=35222735000en_US
dc.identifier.scopusauthoridHao, X=36618827900en_US
dc.identifier.scopusauthoridHua, QS=15060090400en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats