資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://irlib.pccu.edu.tw/handle/987654321/20546
|
| 題名: | Fair inter-TAP routing and backhaul assignment for wireless mesh networks |
| 作者: | Lin, FYS (Lin, Frank Y. S.)
Wen, YF (Wen, Y. F.) |
| 貢獻者: | 資訊管理研究所 |
| 關鍵詞: | cluster
fairness
load-balancing
mesh networks
routing
optimization |
| 日期: | 2009 |
| 上傳時間: | 2011-11-30 15:13:21 (UTC+8) |
| 摘要: | Although limiting the number of backhauls, specifically chosen transit access points (TAPs) that forward traffic from other TAPs, reduces the overall costs of a wireless mesh network (WMN), an egress bottleneck is induced, which aggregates traffic and limits the bandwidth. To avoid such problems while working to minimize budgetary expenses, we balanced traffic flow on 'to-be-determined' backhauls and adjacent links, a mixed nonlinear- and integer-programming problem that minimizes the aggregated flow subject to budget, backhaul assignment, top-level load-balanced routing, and link capacity constraints. Two algorithms are proposed, weighted backhaul assignment (WBA) and greedy load-balanced routing (GLBR), that operate in conjunction with Lagrangean relaxation (LR), used for constructing LR-based heuristics and also as a means of quantification and evaluation of the proposed algorithms. Experiment results show that the proposed algorithms achieve near-optimization, outperforming related solutions. Copyright (C) 2008 John Wiley & Sons, Ltd. |
| 顯示於類別: | [資訊管理學系暨資訊管理研究所 ] 期刊論文
|
在CCUR中所有的資料項目都受到原著作權保護.
|
