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

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/100208

    题名: Low Latency Scheduling for Convergecast in ZigBee Tree-Based Wireless Sensor Networks
    作者: 潘孟鉉;Liu, Ping-Lin
    贡献者: 淡江大學資訊工程學系
    关键词: Convergecast;Graph theory;Scheduling;Tree construction;Wireless sensor network;ZigBee
    日期: 2014-11-01
    上传时间: 2015-02-05 16:46:06 (UTC+8)
    出版者: Elsevier
    摘要: Convergecast is a fundamental operation in many wireless sensor network (WSN) applications. When gathering data, power saving and convergecast latency are two main concerns. This work adopts the ZigBee tree networks to address these two concerns. In a ZigBee tree network, to support energy efficient operations, each node is assigned to an active portion (or say slot). A node wakes up at its slot and its parent׳s slot to collect data from its children and to report data to its parent, respectively. Then, it can go to sleep to save energy. To support low latency convergecast, in this work, we propose a centralized and a distributed slot assignment schemes for ZigBee tree networks. We observe that when assigning slots, the latency can be further reduced by reconnecting some tree links. More specifically, by the designed rules, a node is allowed to locally modify some of its neighbors׳ parents, and then the node can be assigned to a better slot that can have the benefit of reducing the node׳s report latency. Simulation and implementation results show that the proposed schemes can effectively reduce the convergecast latency in ZigBee tree-based WSNs.
    關聯: Journal of Network and Computer Applications 46, pp.252–263
    DOI: 10.1016/j.jnca.2014.07.007
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数



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