http://scholars.ntou.edu.tw/handle/123456789/20282
Title: | Mobile Sensor Relocation Problem: Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead | Authors: | Chien-Fu Cheng Chih-Wei Huang Lung-Hao Li |
Keywords: | Mobile wireless sensor networks;Mobile sensor;Sensor failure;Sensor relocation problem;Optimal (nearest) redundant sensor;Low message overhead | Issue Date: | 1-Nov-2015 | Publisher: | ELSEVIER | Journal Volume: | 91 | Start page/Pages: | 407-424 | Source: | Computer Networks | Abstract: | 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. |
URI: | http://scholars.ntou.edu.tw/handle/123456789/20282 | ISSN: | 1389-1286 | DOI: | 10.1016/j.comnet.2015.08.022 |
Appears in Collections: | 資訊工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.