|Title:||The Carrier-Based Sensor Deployment in Linear IWSNs With Return/Non-Return Branches||Authors:||Cheng, Chien-Fu
|Keywords:||WIRELESS;ALGORITHM;INDUSTRY||Issue Date:||15-Mar-2022||Publisher:||IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC||Journal Volume:||22||Journal Issue:||6||Start page/Pages:||6175-6186||Source:||IEEE SENS J||Abstract:||
The Industrial Wireless Sensor Networks (IWSN) is an important part of Industry 4.0. Most IWSNs constructed for surveillance applications has a linear topology. However, existing carrier-based sensor deployment work only deals with linear topology in which a backbone and some non-return branches are exist. None of existing works deals with the problem with return branches. In this paper, we study the carrier-based sensor deployment problem with linear topology in which a backbone and some return/non-return branches are existed. The objective of this paper is to plan a shorter deployment path for the mobile robot based on its carrying capacity to solve the carrier-based sensor deployment problem. With a shorter deployment path, the mobile robot can accomplish the sensors deployment task within a shorter time and therefore reduce the delay time. In performance evaluation, we evaluate the proposed algorithm in terms of the length of the deployment path required with varied carrying capacity, varied sensing radius, varied total lengths of branches and varied number of branches. Through the extensive simulations, we demonstrate that the proposed algorithm can reduce the length of the deployment path required for the mobile robot to solve the carrier-based sensor deployment problem with linear topology in which a backbone and some return/non-return branches are existed.
|Appears in Collections:||資訊工程學系|
09 INDUSTRY, INNOVATION & INFRASTRUCTURE
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.