Time-Sensitive Utility-Based Routing in Duty-Cycle Wireless Sensor Networks with Unreliable Links

Mingjun Xiao, Jie Wu, Liusheng Huang
{"title":"Time-Sensitive Utility-Based Routing in Duty-Cycle Wireless Sensor Networks with Unreliable Links","authors":"Mingjun Xiao, Jie Wu, Liusheng Huang","doi":"10.1109/SRDS.2012.75","DOIUrl":null,"url":null,"abstract":"Utility-based routing is a special routing approach, which takes the reliability and transmission costs into account at the same time. However, the existing utility-based routing algorithms have not yet considered the delivery delay. Thus, they cannot work well in duty-cycle wireless sensor networks (WSNs) since delay is an important factor in such WSNs. In this paper, we propose a novel utility model time-sensitive utility model. Unlike previous work, the utility of a message delivery in our model is not only affected by the reliability and transmission costs but also by the delivery delay. Under the time-sensitive utility model, we derive an iterative formula to compute the time-varying utility of each message delivery. Based on the formula, we propose an optimal time-sensitive utility-based routing algorithm. The theoretical analysis and simulation results show that our proposed algorithm can maximize the average utility of message deliveries, which makes a good tradeoff among reliability, delay, and cost.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 31st Symposium on Reliable Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2012.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Utility-based routing is a special routing approach, which takes the reliability and transmission costs into account at the same time. However, the existing utility-based routing algorithms have not yet considered the delivery delay. Thus, they cannot work well in duty-cycle wireless sensor networks (WSNs) since delay is an important factor in such WSNs. In this paper, we propose a novel utility model time-sensitive utility model. Unlike previous work, the utility of a message delivery in our model is not only affected by the reliability and transmission costs but also by the delivery delay. Under the time-sensitive utility model, we derive an iterative formula to compute the time-varying utility of each message delivery. Based on the formula, we propose an optimal time-sensitive utility-based routing algorithm. The theoretical analysis and simulation results show that our proposed algorithm can maximize the average utility of message deliveries, which makes a good tradeoff among reliability, delay, and cost.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
链路不可靠的占空比无线传感器网络中基于时间敏感效用的路由
基于效用的路由是一种特殊的路由方法,它同时考虑了可靠性和传输成本。然而,现有的基于效用的路由算法尚未考虑传输延迟。因此,它们不能很好地工作在占空比无线传感器网络(WSNs)中,因为延迟是这类WSNs的一个重要因素。本文提出了一种新型时敏型实用新型。与以前的工作不同,在我们的模型中,消息传递的效用不仅受到可靠性和传输成本的影响,还受到传递延迟的影响。在时间敏感实用新型下,我们推导出一个迭代公式来计算每个消息传递的时变效用。在此基础上,提出了一种基于时间敏感效用的最优路由算法。理论分析和仿真结果表明,该算法能够最大限度地提高消息传递的平均效用,在可靠性、延迟和成本之间取得了很好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Identifying Root Causes of Faults in Service-Based Applications Query Plan Execution in a Heterogeneous Stream Management System for Situational Awareness Towards Reliable Communication in Intelligent Transportation Systems RADAR: Adaptive Rate Allocation in Distributed Stream Processing Systems under Bursty Workloads Availability Modeling and Analysis for Data Backup and Restore Operations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1