多跳无线网络延迟感知TDMA调度

Shanti Chilukuri, A. Sahoo
{"title":"多跳无线网络延迟感知TDMA调度","authors":"Shanti Chilukuri, A. Sahoo","doi":"10.1145/2684464.2684493","DOIUrl":null,"url":null,"abstract":"Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in terms of delay, throughput etc. In this study, we focus on end-to-end delay and bandwidth utilization as the QoS parameters. We present a TDMA scheduling scheme that minimizes the end-to-end delay of data, while reusing time slots where possible. This is done by ordering the transmissions along a path such that the scheduling delay at intermediate nodes is minimized. The scheme results in end-to-end delay spanning multiple frames. However, because the TDMA frame length is minimized, the end-to-end delay is minimized while increasing the throughput. The proposed scheme uses a heuristic which has a complexity of O(n2), making it suitable for networks with a large number of nodes. We also present a simple distributed version of our heuristic. Simulation results show that our scheme performs better than previous work in literature in terms of end-to-end delay and slot reuse.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks\",\"authors\":\"Shanti Chilukuri, A. Sahoo\",\"doi\":\"10.1145/2684464.2684493\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in terms of delay, throughput etc. In this study, we focus on end-to-end delay and bandwidth utilization as the QoS parameters. We present a TDMA scheduling scheme that minimizes the end-to-end delay of data, while reusing time slots where possible. This is done by ordering the transmissions along a path such that the scheduling delay at intermediate nodes is minimized. The scheme results in end-to-end delay spanning multiple frames. However, because the TDMA frame length is minimized, the end-to-end delay is minimized while increasing the throughput. The proposed scheme uses a heuristic which has a complexity of O(n2), making it suitable for networks with a large number of nodes. We also present a simple distributed version of our heuristic. Simulation results show that our scheme performs better than previous work in literature in terms of end-to-end delay and slot reuse.\",\"PeriodicalId\":298587,\"journal\":{\"name\":\"Proceedings of the 16th International Conference on Distributed Computing and Networking\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 16th International Conference on Distributed Computing and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2684464.2684493\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684464.2684493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

基于时分多址(TDMA)的介质访问控制(MAC)协议可以提供有保证的服务质量(QoS)。由于节点遵循固定的时间表来传输数据,因此该时间表在确定延迟、吞吐量等方面的QoS方面起着主要作用。在本研究中,我们将端到端延迟和带宽利用率作为QoS参数。我们提出了一种TDMA调度方案,该方案最小化了数据的端到端延迟,同时在可能的情况下重用时隙。这是通过沿着一条路径排序传输来实现的,这样中间节点的调度延迟就最小化了。该方案产生跨多帧的端到端延迟。然而,由于TDMA帧长度被最小化,端到端延迟被最小化,同时增加了吞吐量。该方案采用了复杂度为O(n2)的启发式算法,适用于节点数量较多的网络。我们还提供了一个简单的分布式启发式版本。仿真结果表明,该方案在端到端时延和时隙复用方面优于已有文献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks
Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in terms of delay, throughput etc. In this study, we focus on end-to-end delay and bandwidth utilization as the QoS parameters. We present a TDMA scheduling scheme that minimizes the end-to-end delay of data, while reusing time slots where possible. This is done by ordering the transmissions along a path such that the scheduling delay at intermediate nodes is minimized. The scheme results in end-to-end delay spanning multiple frames. However, because the TDMA frame length is minimized, the end-to-end delay is minimized while increasing the throughput. The proposed scheme uses a heuristic which has a complexity of O(n2), making it suitable for networks with a large number of nodes. We also present a simple distributed version of our heuristic. Simulation results show that our scheme performs better than previous work in literature in terms of end-to-end delay and slot reuse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信