標題: Throughput-coverage tradeoff in a scalable wireless mesh network
作者: Huang, Jane-Hwa
Wang, Li-Chun
Chang, Chung-Ju
電信工程研究所
Institute of Communications Engineering
關鍵字: wireless mesh network (WMN);scalability issue;throughput-coverage tradeoff;multi-channel and multi-radio operations;frequency planning
公開日期: 1-三月-2008
摘要: The wireless mesh network (WMN) is an economical and low-power solution to support ubiquitous broadband services. However, mesh networks face scalability and throughput bottleneck issues as the coverage and the number of users increase. Specifically, if the coverage is extended by multiple hops, the repeatedly relayed traffic will exhaust the radio resource and degrade user throughput. Meanwhile, as the traffic increases because of more users, the throughput bottleneck will occur at the users close to the gateway. The contention collisions among these busy users near the gateway will further reduce user throughput. In this paper, a newly proposed scalable multi-channel ring-based WMN is employed. Under the ring-based cell structure, multi-channel frequency planning is used to reduce the number of contending users at each hop and overcome the throughput bottleneck issue, thereby making the system more scalable to accommodate more users and facilitate coverage extension. This paper mainly focuses on investigating the overall tradeoffs between user throughput and cell coverage in the ring-based WMN. An analytical throughput model is developed for the ring-based WMN using the carrier sense multiple access (CSMA) medium access control (MAC) protocol. In the analysis, we also develop a bulk-arrival semi-Markov queueing model to describe user behavior in a non-saturation condition. On top of the developed analytical model, a mixed-integer nonlinear optimization problem is formulated, aiming to maximize cell coverage and capacity. Applying this optimization approach, we can obtain the optimal number of rings and the associated ring widths of the ring-based WMN. (c) 2007 Elsevier Inc. All fights reserved.
URI: http://dx.doi.org/10.1016/j.jpdc.2007.10.003
http://hdl.handle.net/11536/30020
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2007.10.003
期刊: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume: 68
Issue: 3
起始頁: 278
結束頁: 290
顯示於類別:會議論文


文件中的檔案:

  1. 000253690200002.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。