Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/239
DC FieldValueLanguage
dc.contributor.authorZhao, Yingchaoen_US
dc.contributor.otherZhang, X.-
dc.contributor.otherFan, H.-
dc.contributor.otherLee, V. C. S.-
dc.contributor.otherLi, M.-
dc.contributor.otherLiu, C.-
dc.date.accessioned2021-03-17T01:43:23Z-
dc.date.available2021-03-17T01:43:23Z-
dc.date.issued2018-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/239-
dc.description.abstractBarrier coverage, as one of the most important applications of wireless sensor network (WSNs), is to provide coverage for the boundary of a target region. We study the barrier coverage problem by using a set of n sensors with adjustable coverage radii deployed along a line interval or circle. Our goal is to determine a range assignment R=(r1,r2,…,rn) of sensors such that the line interval or circle is fully covered and its total cost C(R)=∑ni=1riα is minimized. For the line interval case, we formulate the barrier coverage problem of line-based offsets deployment, and present two approximation algorithms to solve it. One is an approximation algorithm of ratio 4 / 3 runs in O(n2) time, while the other is a fully polynomial time approximation scheme (FPTAS) of computational complexity O(n2ϵ). For the circle case, we optimally solve it when α=1 and present a 2(π2)α-approximation algorithm when α>1. Besides, we propose an integer linear programming (ILP) to minimize the total cost of the barrier coverage problem such that each point of the line interval is covered by at least k sensors.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofJournal of Combinatorial Optimizationen_US
dc.titleMinimizing the total cost of barrier coverage in a linear domainen_US
dc.typejournal articleen_US
dc.identifier.doi10.1007/s10878-018-0306-6-
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.issn1573-2886en_US
dc.description.volume36en_US
dc.description.issue2en_US
dc.description.startpage434en_US
dc.description.endpage457en_US
dc.cihe.affiliatedYes-
item.languageiso639-1en-
item.openairetypejournal article-
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptSchool of Computing and Information Sciences-
crisitem.author.orcid0000-0001-8362-6735-
Appears in Collections:CIS Publication
Files in This Item:
File Description SizeFormat
Check Library Catalogue115 BHTMLView/Open
SFX Query Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.