English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 52047/87178 (60%)
造訪人次 : 8682987      線上人數 : 126
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106222

    題名: Mobile Sensor Relocation Problem: Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead
    作者: Cheng, Chien-Fu;Huang, Chih-Wei;Li, Lung-Hao
    關鍵詞: Mobile wireless sensor networks;Mobile sensor;Sensor failure;Sensor relocation problem;Optimal (nearest) redundant sensor;Low message overhead
    日期: 2015-11
    上傳時間: 2016-04-22 13:42:15 (UTC+8)
    摘要: 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.
    關聯: Computer Networks 91, pp.407-424
    DOI: 10.1016/j.comnet.2015.08.022
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    Mobile Sensor Relocation Problem_ Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead.pdf5846KbAdobe PDF1檢視/開啟



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