English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49521/84657 (58%)
Visitors : 7599746      Online Users : 68
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106222


    Title: Mobile Sensor Relocation Problem: Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead
    Authors: Cheng, Chien-Fu;Huang, Chih-Wei;Li, Lung-Hao
    Keywords: Mobile wireless sensor networks;Mobile sensor;Sensor failure;Sensor relocation problem;Optimal (nearest) redundant sensor;Low message overhead
    Date: 201511
    Issue Date: 2016-04-22 13:42:15 (UTC+8)
    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.
    Relation: Computer Networks 91, pp.407-424
    DOI: 10.1016/j.comnet.2015.08.022
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML73View/Open
    Mobile Sensor Relocation Problem_ Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead.pdf5846KbAdobe PDF1View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback