Optimising sink-connected barrier coverage in wireless sensor networks

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/107116

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/107116

Title:	Optimising sink-connected barrier coverage in wireless sensor networks
Authors:	江振瑞;Lai, Yung-Liang;Jiang, Jehn-Ruey
Contributors:	資訊電機學院資訊工程學系
Date:	2015-01-01
Issue Date:	2026-04-23 13:56:59 (UTC+8)
Publisher:	Inderscience Publishers (IEL)
Abstract:	摘要： 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
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	14	View/Open

社群 sharing

Loading...