Design Framework to Optimize Power Consumption and Latency Delay for Sensor Nodes Using Min(N, T) Policy M/G/1 Queuing Models

Fuu-Cheng Jiang, Chao-Tung Yang, Kuo-Hsiung Wang, Der-Chen Huang
{"title":"Design Framework to Optimize Power Consumption and Latency Delay for Sensor Nodes Using Min(N, T) Policy M/G/1 Queuing Models","authors":"Fuu-Cheng Jiang, Chao-Tung Yang, Kuo-Hsiung Wang, Der-Chen Huang","doi":"10.1109/FUTURETECH.2010.5482757","DOIUrl":null,"url":null,"abstract":"To prolong the lifetime of sensor nodes, most research works have focused on how to tune the duty cycling schemes among nodes to save the communication cost using multifarious wake-up strategies. To this aim, we propose a novel design strategy for mitigating average power consumption of sensor node using the Min(N, T) policy M/G/1 queuing theory. There is a heavy overhead for packet collisions and channel contention resulting from restarting the process of medium contention. The basic point of our approach is that Min(N, T) dyadic policy would mitigate the total average times of medium contention by having both a counter (N) and a timer (T) for the control of triggering on a radio server to transmit queued packets, and then power consumption of communication can be alleviated. We show how the improvement level on power consumption can be achieved through analytical and simulated results. To meet the mission requirements in sensor networks, the proposed add-on power saving technique can also provide a design framework for the sensor network manager to optimize relevant system parameters including power consumption and latency delay.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"19 41","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Conference on Future Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUTURETECH.2010.5482757","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

To prolong the lifetime of sensor nodes, most research works have focused on how to tune the duty cycling schemes among nodes to save the communication cost using multifarious wake-up strategies. To this aim, we propose a novel design strategy for mitigating average power consumption of sensor node using the Min(N, T) policy M/G/1 queuing theory. There is a heavy overhead for packet collisions and channel contention resulting from restarting the process of medium contention. The basic point of our approach is that Min(N, T) dyadic policy would mitigate the total average times of medium contention by having both a counter (N) and a timer (T) for the control of triggering on a radio server to transmit queued packets, and then power consumption of communication can be alleviated. We show how the improvement level on power consumption can be achieved through analytical and simulated results. To meet the mission requirements in sensor networks, the proposed add-on power saving technique can also provide a design framework for the sensor network manager to optimize relevant system parameters including power consumption and latency delay.
基于Min(N, T)策略M/G/1排队模型的传感器节点功耗和时延优化设计框架
为了延长传感器节点的生命周期,大多数研究工作都集中在如何使用多种唤醒策略来调整节点间的占空比方案以节省通信成本。为此,我们提出了一种利用Min(N, T)策略M/G/1排队理论降低传感器节点平均功耗的新设计策略。由于重新启动介质争用进程,数据包冲突和通道争用的开销很大。我们的方法的基本观点是,Min(N, T)二元策略通过在无线电服务器上使用计数器(N)和定时器(T)来控制触发以传输排队数据包,从而减轻介质争用的总平均时间,从而减轻通信的功耗。我们将通过分析和模拟结果展示如何实现功耗的改进水平。为了满足传感器网络中的任务要求,所提出的附加节能技术还可以为传感器网络管理器优化功耗和时延等相关系统参数提供一个设计框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信