Show simple item record

dc.contributor.authorZhang, Z.
dc.contributor.authorWu, Weili
dc.contributor.authorYuan, Jing
dc.contributor.authorDu, Dingzhu
dc.date.accessioned2019-07-26T16:59:09Z
dc.date.available2019-07-26T16:59:09Z
dc.date.created2018
dc.identifier.issn1063-6692
dc.identifier.urihttps://hdl.handle.net/10735.1/6727
dc.descriptionFull text access from Treasures at UT Dallas is restricted to current UTD affiliates (use the provided Link to Article). All others may find the web address for this item in the full item record as "dc.relation.uri" metadata.
dc.description.abstractBarrier Coverage plays a vital role in wireless sensor networks. Research on barrier coverage has mainly focused on the lifetime maximization and the critical conditions to achieve k-Barrier Coverage under various sensing models. When sensors are randomly deployed along the boundary of an area of interest, they may form several disjoint barrier covers. To maximize the lifetime of barrier coverage, those barrier covers need to be scheduled to avoid a security problem, call breach. In a heterogeneous wireless sensor network, given a set of barrier-covers each with a lifetime, we study the problem of finding a lifetime-maximizing subset with a breach-free sleep-wakeup scheduling. We first prove that it can be judged in polynomial time whether a given sleep-wakeup schedule is breach-free or not, but given a set of barrier-covers, it is NP-Complete to determine whether there exists a breach-free schedule. Then, we show that the problem of finding a lifetime-maximizing breach-free schedule is equivalent to the maximum node weighted path problem in a directed graph, and design a parameterized algorithm. Experimental results show that our algorithm significantly outperforms the heuristics proposed in the literature.
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.urihttp://dx.doi.org/10.1109/TNET.2018.2867156
dc.rights©2018 IEEE
dc.subjectWireless communication systems--Security measures
dc.subjectWireless communication systems
dc.subjectWireless sensor networks
dc.subjectDirected graphs
dc.subjectComputer networks--Security measures
dc.titleBreach-Free Sleep-Wakeup Scheduling for Barrier Coverage with Heterogeneous Wireless Sensors
dc.type.genrearticle
dc.description.departmentErik Jonsson School of Engineering and Computer Science
dc.identifier.bibliographicCitationZhang, Z., W. Wu, J. Yuan, and D. Du. 2018. "Breach-free sleep-wakeup scheduling for barrier coverage with heterogeneous wireless sensor." IEEE/ACM Transactions on Networking 26(5): 2404-2413, doi:10.1109/TNET.2018.2867156
dc.source.journalIEEE/ACM Transactions on Networking
dc.identifier.volume26
dc.identifier.issue5
dc.contributor.utdAuthorWu, Weili
dc.contributor.utdAuthorYuan, Jing
dc.contributor.utdAuthorDu, Dingzhu
dc.contributor.VIAF288884264 (Du, D)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record