Fuad A. Ghaleb, M. Kamat, M. Salleh, M. F. Rohani, S. Razak, M. A. Shah
{"title":"基于加权链路排序方案的无线Mesh网络信道分配算法公平性","authors":"Fuad A. Ghaleb, M. Kamat, M. Salleh, M. F. Rohani, S. Razak, M. A. Shah","doi":"10.1145/3234698.3234726","DOIUrl":null,"url":null,"abstract":"Wireless Mesh Networks (WMNs) are promising means to provide inexpensive deployment, flexible and fast broadband access. Recent WMNs use multiple-radio and multiple channels to provide high performance. However, interference between channels is considered the key challenge for WMN performance. In WMN, the data flows are directed from/to the gateways. Thus, the quality of the critical links close to the gateways should be properly considered during channel assignments. Otherwise, network fragmentation and bottleneck problem may occur which affect the performance of the network due to congestions, and unfair channel distribution. Unfortunately, the existing channel assignments focusing only on the links close to the gateways and neglecting other critical links. This paper proposes a fair channel assignment algorithm based on weighted link ranking scheme in order to minimize the interference and thus improve the capacity of the network. The links are fairly ranked based on multiple criteria obtained from traffic and network topology such as distance from the gateways, interference index, and, traffic load. The results from numerical simulation demonstrate that the proposed channel assignment algorithm has reduced the interference, improving the network capacity, and achieves the fairness of channel distribution.","PeriodicalId":144334,"journal":{"name":"Proceedings of the Fourth International Conference on Engineering & MIS 2018","volume":"366 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Fairness of Channel Assignment Algorithm Based on Weighted Links Ranking Scheme for Wireless Mesh Network\",\"authors\":\"Fuad A. Ghaleb, M. Kamat, M. Salleh, M. F. Rohani, S. Razak, M. A. Shah\",\"doi\":\"10.1145/3234698.3234726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Mesh Networks (WMNs) are promising means to provide inexpensive deployment, flexible and fast broadband access. Recent WMNs use multiple-radio and multiple channels to provide high performance. However, interference between channels is considered the key challenge for WMN performance. In WMN, the data flows are directed from/to the gateways. Thus, the quality of the critical links close to the gateways should be properly considered during channel assignments. Otherwise, network fragmentation and bottleneck problem may occur which affect the performance of the network due to congestions, and unfair channel distribution. Unfortunately, the existing channel assignments focusing only on the links close to the gateways and neglecting other critical links. This paper proposes a fair channel assignment algorithm based on weighted link ranking scheme in order to minimize the interference and thus improve the capacity of the network. The links are fairly ranked based on multiple criteria obtained from traffic and network topology such as distance from the gateways, interference index, and, traffic load. The results from numerical simulation demonstrate that the proposed channel assignment algorithm has reduced the interference, improving the network capacity, and achieves the fairness of channel distribution.\",\"PeriodicalId\":144334,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Engineering & MIS 2018\",\"volume\":\"366 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Engineering & MIS 2018\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3234698.3234726\",\"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 Fourth International Conference on Engineering & MIS 2018","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3234698.3234726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fairness of Channel Assignment Algorithm Based on Weighted Links Ranking Scheme for Wireless Mesh Network
Wireless Mesh Networks (WMNs) are promising means to provide inexpensive deployment, flexible and fast broadband access. Recent WMNs use multiple-radio and multiple channels to provide high performance. However, interference between channels is considered the key challenge for WMN performance. In WMN, the data flows are directed from/to the gateways. Thus, the quality of the critical links close to the gateways should be properly considered during channel assignments. Otherwise, network fragmentation and bottleneck problem may occur which affect the performance of the network due to congestions, and unfair channel distribution. Unfortunately, the existing channel assignments focusing only on the links close to the gateways and neglecting other critical links. This paper proposes a fair channel assignment algorithm based on weighted link ranking scheme in order to minimize the interference and thus improve the capacity of the network. The links are fairly ranked based on multiple criteria obtained from traffic and network topology such as distance from the gateways, interference index, and, traffic load. The results from numerical simulation demonstrate that the proposed channel assignment algorithm has reduced the interference, improving the network capacity, and achieves the fairness of channel distribution.