{"title":"无线网状网络中带宽保证最短路径路由","authors":"Yuanyuan Zeng, Bo Xi, Ziming Zeng, Hao Wang","doi":"10.1109/CHINACOM.2006.344839","DOIUrl":null,"url":null,"abstract":"The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks\",\"authors\":\"Yuanyuan Zeng, Bo Xi, Ziming Zeng, Hao Wang\",\"doi\":\"10.1109/CHINACOM.2006.344839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.\",\"PeriodicalId\":408368,\"journal\":{\"name\":\"2006 First International Conference on Communications and Networking in China\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 First International Conference on Communications and Networking in China\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CHINACOM.2006.344839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 First International Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CHINACOM.2006.344839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks
The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
