Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System

Shan-Hung Wu, Ming-Syan Chen, Chung-Min Chen
{"title":"Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System","authors":"Shan-Hung Wu, Ming-Syan Chen, Chung-Min Chen","doi":"10.1109/ICDCS.2008.88","DOIUrl":null,"url":null,"abstract":"Quorum-based power saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of mobile stations. These protocols assign to each station a cycle pattern that specifies when the station should wake up (to transmit/receive data) and sleep (to save battery power). In all existing QPS protocols, the cycle length is either identical for all stations or is restricted to certain numbers (e.g. squares or primes). These restrictions on cycle length severely limit the practical use of QPS protocols as each individual station may want to select a cycle length that is best suited for its own need (in terms of remaining battery power, tolerable packet delay, and drop ratio). In this paper we propose the notion of hyper quorum system (HQS)-a generalization of QPS that allows for arbitrary cycle lengths. We describe algorithms to generate two different classes of HQS given any set of arbitrary cycle lengths as input. We then present analytical and simulation results that show the benefits of HQS-based power saving protocols over the existing QPS protocols.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 28th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2008.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

Quorum-based power saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of mobile stations. These protocols assign to each station a cycle pattern that specifies when the station should wake up (to transmit/receive data) and sleep (to save battery power). In all existing QPS protocols, the cycle length is either identical for all stations or is restricted to certain numbers (e.g. squares or primes). These restrictions on cycle length severely limit the practical use of QPS protocols as each individual station may want to select a cycle length that is best suited for its own need (in terms of remaining battery power, tolerable packet delay, and drop ratio). In this paper we propose the notion of hyper quorum system (HQS)-a generalization of QPS that allows for arbitrary cycle lengths. We describe algorithms to generate two different classes of HQS given any set of arbitrary cycle lengths as input. We then present analytical and simulation results that show the benefits of HQS-based power saving protocols over the existing QPS protocols.
使用超仲裁系统的Ad Hoc网络的完全自适应节能协议
针对自组织网络(如IEEE 802.11自组织模式)提出了基于群体的节能协议,以提高能源效率并延长移动站的运行时间。这些协议为每个工作站分配一个周期模式,指定工作站何时应该唤醒(发送/接收数据)和休眠(节省电池电量)。在所有现有的QPS协议中,周期长度对于所有站点都是相同的,或者被限制为特定的数字(例如平方数或素数)。这些对周期长度的限制严重限制了QPS协议的实际使用,因为每个站点可能希望选择最适合其自身需求的周期长度(就剩余电池电量、可容忍的数据包延迟和丢包率而言)。在本文中,我们提出了超仲裁系统(HQS)的概念,这是QPS的一个推广,允许任意周期长度。我们描述了在给定任意周期长度作为输入的情况下生成两类不同HQS的算法。然后,我们给出了分析和仿真结果,显示了基于hqs的节能协议相对于现有QPS协议的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信