{"title":"多信道WMNs的分布式资源和路由分配算法","authors":"Y. Wen, T. Anderson","doi":"10.1109/ICWMC.2008.65","DOIUrl":null,"url":null,"abstract":"Guarantees on quality-of-service (QoS) are essential for multimedia applications such as wireless TV and VoIP (voice over IP) to be successfully utilized over a WMN (Wireless Mesh Networks). As a consequence of providing Internet access to many clients over such a network, throughput is affected by the number of hops that a client is from its backhaul and how traffic load distributing. These spatial bias and load- balancing problems are formulated as a mixed-integer nonlinear programming problem that take into consideration the multi-hop delay, both in terms of least-hop and load-balanced routing, and in terms of link capacity constraints in mesh structures. In this paper, we proposed distributed resource allocation scheme and load-balanced routing algorithms combining with Lagrangean Relaxation approach that minimize the maximum multi-hop delay at the MAC layer and network layer, algorithms that achieve load-balanced on each backhaul and each branch of the backhaul with orthogonal channels. Our experiment results demonstrate that the algorithms achieve near-minimum multi- hop delay and outperform other resource allocation schemes and routing algorithms.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Resource and Routing Assignment Algorithms for Multi-channel WMNs\",\"authors\":\"Y. Wen, T. Anderson\",\"doi\":\"10.1109/ICWMC.2008.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Guarantees on quality-of-service (QoS) are essential for multimedia applications such as wireless TV and VoIP (voice over IP) to be successfully utilized over a WMN (Wireless Mesh Networks). As a consequence of providing Internet access to many clients over such a network, throughput is affected by the number of hops that a client is from its backhaul and how traffic load distributing. These spatial bias and load- balancing problems are formulated as a mixed-integer nonlinear programming problem that take into consideration the multi-hop delay, both in terms of least-hop and load-balanced routing, and in terms of link capacity constraints in mesh structures. In this paper, we proposed distributed resource allocation scheme and load-balanced routing algorithms combining with Lagrangean Relaxation approach that minimize the maximum multi-hop delay at the MAC layer and network layer, algorithms that achieve load-balanced on each backhaul and each branch of the backhaul with orthogonal channels. Our experiment results demonstrate that the algorithms achieve near-minimum multi- hop delay and outperform other resource allocation schemes and routing algorithms.\",\"PeriodicalId\":308667,\"journal\":{\"name\":\"2008 The Fourth International Conference on Wireless and Mobile Communications\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 The Fourth International Conference on Wireless and Mobile Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWMC.2008.65\",\"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 The Fourth International Conference on Wireless and Mobile Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWMC.2008.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Resource and Routing Assignment Algorithms for Multi-channel WMNs
Guarantees on quality-of-service (QoS) are essential for multimedia applications such as wireless TV and VoIP (voice over IP) to be successfully utilized over a WMN (Wireless Mesh Networks). As a consequence of providing Internet access to many clients over such a network, throughput is affected by the number of hops that a client is from its backhaul and how traffic load distributing. These spatial bias and load- balancing problems are formulated as a mixed-integer nonlinear programming problem that take into consideration the multi-hop delay, both in terms of least-hop and load-balanced routing, and in terms of link capacity constraints in mesh structures. In this paper, we proposed distributed resource allocation scheme and load-balanced routing algorithms combining with Lagrangean Relaxation approach that minimize the maximum multi-hop delay at the MAC layer and network layer, algorithms that achieve load-balanced on each backhaul and each branch of the backhaul with orthogonal channels. Our experiment results demonstrate that the algorithms achieve near-minimum multi- hop delay and outperform other resource allocation schemes and routing algorithms.