Opportunistic scheduling for network coded data in wireless multicast networks

Nadieh Moghadam, M. Mohebbi, Hongxiang Li
{"title":"Opportunistic scheduling for network coded data in wireless multicast networks","authors":"Nadieh Moghadam, M. Mohebbi, Hongxiang Li","doi":"10.1109/ICCNC.2017.7876270","DOIUrl":null,"url":null,"abstract":"In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness of our proposed algorithm.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness of our proposed algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线组播网络中网络编码数据的机会调度
本文分析了擦除信道上单跳无线组播网络的队列稳定性。首先,介绍了一个由多个子队列组成的排队模型。在队列稳定性约束下,采用Lyapunov优化模型,定义决策变量,推导出一种基于网络编码的分组调度算法,该算法的复杂度显著降低,队列大小明显缩短。进一步,对算法进行了改进,以满足时间关键数据的要求。最后,仿真结果验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A game-theoretic analysis of energy-depleting jamming attacks Overlapping user grouping in IoT oriented massive MIMO systems Towards zero packet loss with LISP Mobile Node Social factors for data sparsity problem of trust models in MANETs An approach to online network monitoring using clustered patterns
×
引用
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