Rawan Derbas, Lina Bariah, S. Muhaidat, P. Sofotasios, H. Saleh, E. Damiani
{"title":"基于电池充电时间的功率受限物联网路由","authors":"Rawan Derbas, Lina Bariah, S. Muhaidat, P. Sofotasios, H. Saleh, E. Damiani","doi":"10.1109/CommNet52204.2021.9641956","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new routing algorithm for the Internet-of-Things (IoT) networks. Our proposed routing algorithm considers multi-channel fading conditions and the battery recharging time (BRT) to enhance the overall network throughput. Our proposed scheme consists of three stages: path discovery, channel assignment and path selection. First, the channel assignment is formulated as an optimization problem, which is then formulated as a binary linear programming (BLP) problem. Consequently, the formulated problem can be solved in polynomial-time (PT) using linear programming (LP) techniques. To show the effectiveness of the proposed algorithm, we compared its performance with That of the minimum hop (MH) algorithm. The presented simulation results show the performance superiority of the proposed algorithm, compared to the MH algorithm.","PeriodicalId":354985,"journal":{"name":"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"574 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Battery Recharging Time-Based Routing for Power Constrained IoT Networks\",\"authors\":\"Rawan Derbas, Lina Bariah, S. Muhaidat, P. Sofotasios, H. Saleh, E. Damiani\",\"doi\":\"10.1109/CommNet52204.2021.9641956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new routing algorithm for the Internet-of-Things (IoT) networks. Our proposed routing algorithm considers multi-channel fading conditions and the battery recharging time (BRT) to enhance the overall network throughput. Our proposed scheme consists of three stages: path discovery, channel assignment and path selection. First, the channel assignment is formulated as an optimization problem, which is then formulated as a binary linear programming (BLP) problem. Consequently, the formulated problem can be solved in polynomial-time (PT) using linear programming (LP) techniques. To show the effectiveness of the proposed algorithm, we compared its performance with That of the minimum hop (MH) algorithm. The presented simulation results show the performance superiority of the proposed algorithm, compared to the MH algorithm.\",\"PeriodicalId\":354985,\"journal\":{\"name\":\"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)\",\"volume\":\"574 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CommNet52204.2021.9641956\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CommNet52204.2021.9641956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Battery Recharging Time-Based Routing for Power Constrained IoT Networks
In this paper, we propose a new routing algorithm for the Internet-of-Things (IoT) networks. Our proposed routing algorithm considers multi-channel fading conditions and the battery recharging time (BRT) to enhance the overall network throughput. Our proposed scheme consists of three stages: path discovery, channel assignment and path selection. First, the channel assignment is formulated as an optimization problem, which is then formulated as a binary linear programming (BLP) problem. Consequently, the formulated problem can be solved in polynomial-time (PT) using linear programming (LP) techniques. To show the effectiveness of the proposed algorithm, we compared its performance with That of the minimum hop (MH) algorithm. The presented simulation results show the performance superiority of the proposed algorithm, compared to the MH algorithm.