802．11無線局域網(wǎng)中AP放置與信道配置的聯(lián)合算法
Joint AP Placement and Channel Assignment Algorithm for 802.11 Wireless LANs
-
摘要: 在多小區(qū)無線局域網(wǎng)規(guī)劃中,接入訪問點(diǎn)(AP)放置與信道配置是兩個(gè)重要的任務(wù)。在給定用戶業(yè)務(wù)需求的條件下,謀求最大系統(tǒng)吞吐率和資源分配的公平性是網(wǎng)絡(luò)規(guī)劃的目標(biāo),其中公平性由吞吐率均衡因子表征。在傳統(tǒng)的規(guī)劃策略中,AP放置與信道配置被分割為兩個(gè)先后的步驟;而該文提出的目標(biāo)函數(shù)則將這兩個(gè)問題聯(lián)合解決以得到更好的系統(tǒng)性能。當(dāng)采用全局遍歷時(shí),對(duì)目標(biāo)函數(shù)尋求全局最優(yōu)解計(jì)算量龐大;因此該文又提出了一種有效的局部最優(yōu)解搜索算法補(bǔ)丁算法,此算法計(jì)算量小,同時(shí)能較好地逼近全局最優(yōu)解。Abstract: To deploy a multi-cell 802.11 wireless LAN system, Access Point(AP) placement and channel assignment are two primaiy design issues. For a given set of traffic demands, maximizing not only the overall system throughput, but also the fairness in resource sharing among users are aimed at, which is measured by a throughput balance index. Unlike conventional approaches that decouple AP placement and channel assignment into two phases, jointly solving the two problems for better performance is proposed. Due to the high computational complexity involved in the exhaustive searching, an efficient local searching algorithm, called patching algorithm, is designed. The simulation results show that for a typical indoor environment, patching algorithm can provide a close-to-optimal performance with much lower time complexity than the exhaustive searching.
-
計(jì)量
- 文章訪問數(shù): 2648
- HTML全文瀏覽量: 114
- PDF下載量: 782
- 被引次數(shù): 0
下載:
