一般而言，在單頻道無線網狀網路中存在兩種方法可以來最大化網路傳輸容量，分別是在每個傳輸時間隔間裡提高無干擾的傳輸數量，以及增加可行傳輸的傳輸率。然而因為無線通訊干擾的問題，在這兩個方法之間會遇到一些取捨的局面，因此我們要去研究在空間分時多工存取之下的單頻道無線網狀網路中，針對網路傳輸容量所面臨到的空間重用和傳輸功率控制取捨問題。
在這篇論文中，我們提出了一項空間淨空重用的策略來控制淨空區域(無干擾)，以及根據這個策略來決定可同時存取的群組集合，接著我們會針對每一個傳輸單位進行傳輸功率的配置，以最大化整體的網路傳輸容量。根據實驗部分顯示，在我們實驗不同程度之下的空間淨空重用策略所得到不同的網路傳輸容量大小，進而可以了解面臨到的空間重用和傳輸功率控制取捨問題。

In general, there are two approaches to maximize network throughput capacity in a single-channel wireless mesh network: increasing the number of non-interfering transmissions at each time slot by exploiting spatial reuse, and increasing transmission rate of active transmitters. However, a tradeoff of the two ways encounters the wireless communication inference problem. Therefore, we want to investigate the tradeoff between spatial reuse and transmission power control on network throughput capacity in spatial TDMA-based wireless mesh network with single channel. In this paper, we propose a Clean-Air Spatial Reuse Policy to control clean air (interference free) zone and determine the set of concurrent access groups based on the policy. Then, we perform transmission power assignment to each transmitter to maximize the network throughput capacity. Experiment results of the network throughput capacity performance under different levels of the Clean-Air Spatial Reuse policy are presented.

誌謝 I
論文摘要 II
THESIS ABSTRACT III
Table of Contents IV
List of Figures VI
Chapter 1 Introduction 1
Chapter 2 System Models 8
2.1. Interference Model 8
2.2. Network Model 11
2.3. Channel Capacity Model 15
Chapter 3 Planning Model 17
3.1. Clean-Air Spatial Reuse Policy 17
3.2. Feasible Power Region for Two Nearest Pairs 19
3.3. Formation of Concurrent Access Group 20
Chapter 4 Transmission Power Control 23
4.1. Power Control Programming Problem 23
4.2. Matrix From Solution 24
4.3. Generalized Reduced Gradient Algorithm 26
Chapter 5 Performance Evaluation 27
5.1. Network Setting 27
5.2. Hexagonal Topology Evaluation 28
5.2.1. Number of CAGs under different Clean-Air Spatial Reuse Policy 29
5.2.2. Average Transmission pairs per CAG under Different Clean Air Policy 29
5.2.3. The Tradeoff of Clean-Air Spatial Reuse Policy and Transmission Power Allocation 31
5.2.4. Network Throughput Capacity under Different Clean-Air Control Policy 33
5.2.5. Relationship of Network Throughput Capacity and Frame Size 35
5.3. Arbitrary Topology Evaluation 36
5.3.1. Number of CAGs under different Clean-Air Spatial Reuse Policy 37
5.3.2. Average Transmission pairs per CAG under Different Clean Air Policy 38
5.3.3. The Tradeoff of Clean-Air Spatial Reuse Policy and Transmission Power Allocation 40
5.3.4. Network Throughput Capacity under Different Clean-Air Control Policy 42
5.3.5. Relationship of Network Throughput Capacity and Frame Size 44
5.3.6. Evaluation of the tradeoff of spatial reuse and transmission rate 45
Chapter 6 Conclusion 49
Reference 50

[1] Gurashish Brar, Douglas M. Blough, and Paolo Santi, “Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks,” MobiCom’06, September 2006.
[2] Andrea Goldsmith, Wireless Communications, Cambridge University Press, 2005.
[3] Randolph Nelson and Leonard Kleinrock, “Spatial TDMA: A Collision Free Multihop Channel Access Protocol,” IEEE Transactions on Communications, vol. 33, no. 9, September 1985.
[4] Shin-Ming Cheng, Di-Wei Huang, Phone Lin and Shun-Ren Yang, “A Study on Distributed/Centralized Scheduling for Wireless Mesh Network,” IWCMC’06, June 2006.
[5] H-Y. Wei, S. Ganguly, R. Izmailov, and Z. J. Haas, “Interference-Aware IEEE 802.16 WiMax Mesh Networks,” IEEE Vehicular Technology Conference, May 2005.
[6] Abdul Kabbani, Theodoros Salonidis, and Edward W. Knightly, “Distributed Low-Complexity Maximum-Throughput Scheduler for Wireless Backhaul Networks,” IEEE Infocom’07, May 2007.
[7] Jianfeng Chen, Caixia Chi, and Qian Guo, “An Odd-Even Alternation Mechanism for Centralized Scheduling in WiMAX Mesh Network,” GLOBECOM’06, November 2006.
[8] Harish Viswanathan and Sayandev Mukherjee, “Throughput-Range Tradeoff of Wireless Mesh Backhaul Networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, March 2006.
[9] IEEE Std 802.16-2004, “IEEE Standard for Local and Metropolitan Area Networks--Part 16: Air Interface for Fixed Broadband Wireless Access Systems,” 2004.
[10] Min Cao, Wenchao Ma, Qian Zhang, Xiaodong Wang, and Wenwu Zhu, “Modeling and Performance Analysis of the Distributed Scheduler in IEEE 802.16 Mesh Mode,” MobiHoc’05, May 2005.
[11] Tae-Suk Kim, Hyuk Lim, and Jennifer C. Hou, “Improving Spatial Reuse through Tuning Transmit Power, Carrier Sense Threshold, and Data Rate in Multihop Wireless Network,” MobiCom’06, September 2006.
[12] Hongqiang Zhai and Yuguang Fang, “Physical Carrier Sensing and Spatial Reuse in Multirate and Multihop Wireless Ad Hoc Networks,” IEEE Infocom’06, April 2006.
[13] http://www.wimaxforum.org/
[14] Joshua Robinson, and Edward W. Knightly, “A Performance Study of Deployment Factor in Wireless Mesh Networks,” IEEE Infocom’07, May 2007.
[15] Suk Yu Hui, Kai Hau Yeung, and Kin Yueng Wong, “Optimal Placement of Mesh Points in Wireless Mesh Networks,” IFIP Networking 2008
[16] John Bicket, Sanjit Biswas, Daniel Aguayo, and Robert Morris, “Architecture and evaluation of the MIT Roofnet mesh network,” ACM MobiCom’05, August 2005.
[17] Theodore S. Rapport, “Wireless Communications Principles and Practice,” Prentice Hall, 1998.
[18] Gurashish Brar, Douglas M. Blough and Paolo Santi, “Computationally Efficient Sched-uling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks,” ACM MobiCom’06, 2006.
[19] Anindya Basu, Brian Boshes, Sayandev Mukherjee and Sharad Ramanathan, “Network Deformation: Traffic-Aware Algorithms for Dynamically Reducing End-to-end Delay in Multi-hop Wireless Networks,” MobiCom’04, 2004.
[20] Piyush Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
[21] Benyuan Liu, Zhen Liu and Don Towsley, “On the Capacity of Hybrid Wireless Net-works,” IEEE Infocom’03, 2003.
[22] C. Berge, “Graphs and Hyper Graphs,” North-Holland, Amsterdam, 1973.
[23] S. Ramanathan. “A unified Framework and Algorithm for Channel Assignment in Wireless Networks,” Wireless Networks, vol. 5, pp. 81-94, 1999.
[24] T. Herman, S. Pemmaraju, and I. Pirwani, “Oriented edge colorings and link scheduling in sensor networks,” Proc. International Conference on Communication System Software and Middleware (Comsware 2006), pp. 1-6.
[25] Arash Behzad, and Izhak Rubin, “Multiple Access Protocol for Power-Controlled Wireless Access Nets,” IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 3, NO. 4, OCTOBER-DECEMBER 2004
[25] Arash Behzad, and Izhak Rubin; “Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks”, IEEE Transactions on Vehicular Technology, Vol. 56, No. 1, pp. 194-205, Jan. 2007