{"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}
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.