Mobile Sensor Relocation Problem: Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead
學年 104
學期 1
出版（發表）日期 2015-11-14
作品名稱 Mobile Sensor Relocation Problem: Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead
作品名稱（其他語言）
著者 Cheng, Chien-Fu; Huang, Chih-Wei; Li, Lung-Hao
單位
出版者
著錄名稱、卷期、頁數 Computer Networks 91, p.407-424
摘要 In the sensor relocation (SR) problem, advertisement packets are used to inform the locations of redundant sensors and request packets are used to inform the locations of requesting places. When redundant sensors move to requesting places, their location information will change. So, the message with redundant sensors information is not reusable. This is also why locating redundant sensors with low message overhead is of high importance. In this paper, we revisit the matching problem of SR in mobile wireless sensor networks. In order to reduce the amount of message exchange, we employ the concept of quorum to send advertisement packets (in columns) and request packets (in rows). With the proposed stopping criteria, the proposed algorithm can further reduce the amount of these two types of packets to send. In performance evaluation, we consider three scenarios of different shapes, including a square plane, a rectangular plane and a circle plane. The simulation results show that the proposed algorithm can effectively and significantly reduce the number of advertisement and request packets to find the optimal (nearest) redundant sensor for each requesting place.
關鍵字 Mobile wireless sensor networks;Mobile sensor;Sensor failure;Sensor relocation problem;Optimal (nearest) redundant sensor;Low message overhead
語言 en_US
ISSN 1872-7069
期刊性質 國外
收錄於 SCI EI
產學合作
通訊作者 Cheng, Chien-Fu
審稿制度 是
國別 TWN
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106222 )