Distributed delay minimization in stochastic routing for wireless sensor networks

U. Wijetunge, S. Perreau, A. Pollok
{"title":"Distributed delay minimization in stochastic routing for wireless sensor networks","authors":"U. Wijetunge, S. Perreau, A. Pollok","doi":"10.1109/AusCTW.2012.6164915","DOIUrl":null,"url":null,"abstract":"Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.","PeriodicalId":320391,"journal":{"name":"2012 Australian Communications Theory Workshop (AusCTW)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2012.6164915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.
无线传感器网络随机路由中的分布式时延最小化
提高分组传输延迟是无线传感器网络中随机路由的主要挑战之一:从源节点到目标节点使用随机路径导致平均路由较长,这在延迟敏感应用中是不可取的。本文提出了一种新颖的分布式分散随机路由算法,以最小化网络的平均数据包传输延迟。我们还利用离散时间马尔可夫链模型给出了圆形网络平均数据包传输延迟的解析表达式,并讨论了相对于随机行走方法的性能改进。仿真结果表明,与现有的路由方法相比,我们提出的路由方法显著提高了平均数据包传输延迟,并提供了接近最优的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信