Multi-Channel Delay Sensitive Scheduling for Convergecast Network

Daoud Burghal, K. Kim, Jianlin Guo, P. Orlik, T. Hori, T. Sumi, Yukimasa Nagai
{"title":"Multi-Channel Delay Sensitive Scheduling for Convergecast Network","authors":"Daoud Burghal, K. Kim, Jianlin Guo, P. Orlik, T. Hori, T. Sumi, Yukimasa Nagai","doi":"10.1109/WCNC45663.2020.9120790","DOIUrl":null,"url":null,"abstract":"Motivated by an increasing interest in wireless networking in mission-critical applications, and a recent amendment of the time slotted channel hopping to IEEE 802.15.4, the multichannel delay sensitive scheduling is investigated in the many-to-one network, which is also known as the convergecast network. In such a network, each node has data to be transmitted to a gateway through multi-hop communications. As a realistic setting, packet release time at each node is not assumed to be uniform. Under this assumption, the goal of this work is to design a scheduling scheme that minimizes the schedule length and maximum end-to-end delay, in which the former is essential for repetitive data acquisition, whereas the later improves the freshness of the acquired data. To achieve the scheduling goal, the problem is formulated as a multi-objective integer programming. To obtain a feasible solution and gain an insight into the problem, a lower bound on the schedule length is derived. Based on that, a new scheduling scheme is designed to minimize the two objectives simultaneously. Link level simulations verify the performance improvement of the proposed scheme over the existing schemes.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC45663.2020.9120790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Motivated by an increasing interest in wireless networking in mission-critical applications, and a recent amendment of the time slotted channel hopping to IEEE 802.15.4, the multichannel delay sensitive scheduling is investigated in the many-to-one network, which is also known as the convergecast network. In such a network, each node has data to be transmitted to a gateway through multi-hop communications. As a realistic setting, packet release time at each node is not assumed to be uniform. Under this assumption, the goal of this work is to design a scheduling scheme that minimizes the schedule length and maximum end-to-end delay, in which the former is essential for repetitive data acquisition, whereas the later improves the freshness of the acquired data. To achieve the scheduling goal, the problem is formulated as a multi-objective integer programming. To obtain a feasible solution and gain an insight into the problem, a lower bound on the schedule length is derived. Based on that, a new scheduling scheme is designed to minimize the two objectives simultaneously. Link level simulations verify the performance improvement of the proposed scheme over the existing schemes.
汇聚网络的多通道时延敏感调度
基于对无线网络在关键任务应用中的日益增长的兴趣,以及IEEE 802.15.4对时隙信道跳变的最新修订,本文研究了多对一网络(也称为汇聚网络)中的多通道延迟敏感调度。在这样的网络中,每个节点都有要通过多跳通信传输到网关的数据。作为一个现实的设置,每个节点上的数据包释放时间不假设是一致的。在此假设下,本文的目标是设计一种最小化调度长度和最大端到端延迟的调度方案,其中前者对于重复数据采集至关重要,而后者则提高了采集数据的新鲜度。为实现调度目标,将该问题表述为多目标整数规划问题。为了得到一个可行的解并深入了解问题,导出了调度长度的下界。在此基础上,设计了一种新的调度方案,使两个目标同时最小化。链路级仿真验证了所提方案相对于现有方案的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信