GSMS: A Barrier Coverage Algorithm for Joint Surveillance Quality and Network Lifetime in WSNs

doi:10.1109/ACCESS.2019.2949579

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/118867

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/118867

题名:	GSMS: A Barrier Coverage Algorithm for Joint Surveillance Quality and Network Lifetime in WSNs
作者:	Xu, Pei;Wu, Jianguo;Shang, Cuijuan;Chang, Chih-Yung
日期:	2019-10-25
上传时间:	2020-07-07 12:10:19 (UTC+8)
摘要:	Barrier coverage problem is one of the most crucial issues in wireless sensor networks (WSNs) which have been applied to a wild range of applications. A lot of algorithms have been proposed to cope with this problem. However, the majority researches apply the Boolean Sensing Model (BSM) and the sensing frequency of the sensor is not considered, which are difficult to reflect the physical features of the sensing component. This paper proposed a barrier coverage algorithm, called Guaranteeing Surveillance Quality with Minimal Number of Active Sensors, or GSMS in short, aiming to guarantee the surveillance quality for a given monitoring region while activating the minimal number of active sensors. By applying the Probability Sensing Model (PSM) and considering sensing frequency, the proposed GSMS algorithm calculates the sensing probability of every location in the monitoring region and identifies the bottleneck location of surveillance quality. Then the GSMS algorithm prior schedules the sensor with the maximal contribution to the bottleneck location in terms of surveillance quality. The experimental study reveals that the proposed GSMS algorithm outperforms the existing algorithm in terms of the number of active sensors, lifetime of the WSNs, efficiency as well as the cooperative sensing probability.
關聯:	IEEE ACCESS 7, p.159608-159621
DOI:	10.1109/ACCESS.2019.2949579
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	154	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....