On-Supporting Energy Balanced k-Barrier Coverage in Wireless Sensor Networks

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/115582

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/115582

Title:	On-Supporting Energy Balanced k-Barrier Coverage in Wireless Sensor Networks
Authors:	Weng, Chien-I;CHANG, Chih-Yung;Hsiao, Chih-Yao;Chang, Chao-Tsun;CHEN, Haibao
Keywords:	Distributed;Barrier Coverage;Wireless Sensor Networks
Date:	2018-01-15
Issue Date:	2018-11-15 12:10:47 (UTC+8)
Abstract:	The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes decentralized algorithms to cope with the k-barrier coverage problem. For a given value k, the proposed algorithms find out the maximum disjoint sets of sensors such that each set of sensors meets the requirement of k-barrier coverage for users. Three mechanisms, called Basic, Backtracking, and Branch, are proposed for constructing as more as possible the disjoint sets of sensors that satisfy the requirement of k-barrier coverage. Performance study reveals that the proposed algorithms achieve near-optimal performance.
Relation:	IEEE ACCESS 6, p. 13261–13274
DOI:	10.1145/1582379.1582440
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	198	View/Open
On-supporting energy balanced k-barrier coverage in wireless sensor networks.pdf		1172Kb	Adobe PDF	2	View/Open