Optimising sink-connected barrier coverage in wireless sensor networks

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/107116

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/107116

題名:	Optimising sink-connected barrier coverage in wireless sensor networks
作者:	江振瑞;Lai, Yung-Liang;Jiang, Jehn-Ruey
貢獻者:	資訊電機學院資訊工程學系
日期:	2015-01-01
上傳時間:	2026-04-23 13:56:59 (UTC+8)
出版者:	Inderscience Publishers (IEL)
摘要:	摘要： This paper proposes an algorithm, named the optimal node selection algorithm (ONSA), to solve the sink-connected barrier coverage optimisation problem, which is concerned with how to select randomly deployed sensor nodes of a wireless sensor network (WSN) to reach two optimisation goals: 1) to maximise the degree of barrier coverage with the minimum number of detecting nodes; 2) to make the detecting nodes sink-connected with the minimum number of forwarding nodes. The detecting nodes are those for detecting intruders crossing a belt-shaped area of interest. On detecting intruders, they send intruding event notifications to one of the sink nodes with the help of the forwarding nodes to relay the notifications. We prove the optimality of ONSA, analyse its time complexity, perform simulations for it, and compare the simulation results with those of a related algorithm to show ONSA's advantages. 其他題名： ijahuc 出版者： Inderscience Publishers (IEL) 出版日期： 2015 出處： International journal of ad hoc and ubiquitous computing, 2015, Vol.20 (1), p.39-48 版權： Copyright © 2015 Inderscience Enterprises Ltd. 識別號： ISSN: 1743-8225 識別號： EISSN: 1743-8233 識別號： DOI: 10.1504/IJAHUC.2015.071661
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	13	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....