English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57073/90741 (63%)
造访人次 : 12487124      在线人数 : 228
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/112453

    题名: A location-aware power saving mechanism based on quorum systems for multi-hop mobile ad hoc networks
    作者: Chang, Chao-Tsun;Chang, Chih-Yung;Kuo, Chin-Hwa;Hsiao, Chih-Yao
    关键词: Quorum;Power saving;IEEE 802.11;Scheduling;Location-aware
    日期: 2016-12-15
    上传时间: 2017-12-20 02:10:12 (UTC+8)
    摘要: IEEE 802.11 specifies a Power Saving Mode (PSM) in order to save the consumption of energy or power for mobile stations in wireless ad hoc networks. Following the standard of PSM, a number of studies [1–5] further discussed the wake-up/sleep scheduling of beacon intervals based on Quorum systems so that any communication pair of stations has common awake intervals for data exchange. However, most of them did not take into consideration the fact that non-neighbor stations did not require common wake up intervals since they were unable to communicate with each other. Hence, the energy conservation and the transmission delay could not be significantly improved. This paper utilizes the location information and proposes a location-aware power saving mechanism. In the proposed scheme, the network area is partitioned into regular hexagon cells and every station determines the basic quorum intervals based on its cell location information such that only neighboring cells have common beacon intervals for data exchange. In addition, a collision avoidance strategy is proposed to improve the network throughput. Experiment results reveal that the proposed scheme outperforms existing approaches in terms of energy conservation and transmission delay.
    關聯: Ad Hoc Networks 53,pp 94-109
    显示于类别:[資訊工程學系暨研究所] 期刊論文





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