淡江大學機構典藏:Item 987654321/106222
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3885701      在线人数 : 425
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML174检视/开启
    Mobile Sensor Relocation Problem_ Finding the Optimal (Nearest) Redundant Sensor with Low Message Overhead.pdf5846KbAdobe PDF2检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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