Guillaume Gaillard, D. Barthel, Fabrice Théoleyre, F. Valois
{"title":"确定性无线多跳网络中的高可靠性调度","authors":"Guillaume Gaillard, D. Barthel, Fabrice Théoleyre, F. Valois","doi":"10.1109/PIMRC.2016.7794839","DOIUrl":null,"url":null,"abstract":"The industrial Internet of Things (IoT) relies on multi-hop radio paths. Synchronized nodes follow a Frequency-Time Division Multiple Access (FTDMA) schedule, but even using channel-hopping to mitigate interference, the radio links suffer packet losses. Resource allocation algorithms must consider the requirements of the applications in terms of delivery and allocate extra resource to compensate for anticipated losses. We propose a hop-by-hop allocation mechanism that extends the Traffic-Aware Scheduling Algorithm (TASA) by enabling retransmissions. We give each flow on the network the possibility to satisfy its applicative end-to-end delivery constraint. We keep the amount of resource allocated for retransmissions low, and balance the allocations on the relay nodes. By means of simulations, we show the gain in terms of reliability, and the cost in terms of number of allocations.","PeriodicalId":137845,"journal":{"name":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"High-reliability scheduling in deterministic wireless multi-hop networks\",\"authors\":\"Guillaume Gaillard, D. Barthel, Fabrice Théoleyre, F. Valois\",\"doi\":\"10.1109/PIMRC.2016.7794839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The industrial Internet of Things (IoT) relies on multi-hop radio paths. Synchronized nodes follow a Frequency-Time Division Multiple Access (FTDMA) schedule, but even using channel-hopping to mitigate interference, the radio links suffer packet losses. Resource allocation algorithms must consider the requirements of the applications in terms of delivery and allocate extra resource to compensate for anticipated losses. We propose a hop-by-hop allocation mechanism that extends the Traffic-Aware Scheduling Algorithm (TASA) by enabling retransmissions. We give each flow on the network the possibility to satisfy its applicative end-to-end delivery constraint. We keep the amount of resource allocated for retransmissions low, and balance the allocations on the relay nodes. By means of simulations, we show the gain in terms of reliability, and the cost in terms of number of allocations.\",\"PeriodicalId\":137845,\"journal\":{\"name\":\"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2016.7794839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2016.7794839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
High-reliability scheduling in deterministic wireless multi-hop networks
The industrial Internet of Things (IoT) relies on multi-hop radio paths. Synchronized nodes follow a Frequency-Time Division Multiple Access (FTDMA) schedule, but even using channel-hopping to mitigate interference, the radio links suffer packet losses. Resource allocation algorithms must consider the requirements of the applications in terms of delivery and allocate extra resource to compensate for anticipated losses. We propose a hop-by-hop allocation mechanism that extends the Traffic-Aware Scheduling Algorithm (TASA) by enabling retransmissions. We give each flow on the network the possibility to satisfy its applicative end-to-end delivery constraint. We keep the amount of resource allocated for retransmissions low, and balance the allocations on the relay nodes. By means of simulations, we show the gain in terms of reliability, and the cost in terms of number of allocations.