{"title":"无线网状网络的负载均衡路由:一种自适应分区方法","authors":"Hyoung-Gyu Choi, Seung-Jae Han","doi":"10.1109/CCNC08.2007.7","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Load Balancing Routing for Wireless Mesh Networks: An Adaptive Partitioning Approach\",\"authors\":\"Hyoung-Gyu Choi, Seung-Jae Han\",\"doi\":\"10.1109/CCNC08.2007.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.\",\"PeriodicalId\":183858,\"journal\":{\"name\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC08.2007.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC08.2007.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Load Balancing Routing for Wireless Mesh Networks: An Adaptive Partitioning Approach
In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.