本篇論文旨在探討ad hoc 無線網路中，頻寬資源分配的問題。由於位置相依競爭(location-dependent contention) 是無線網路環境的一個重要特徵，我們提出一個最大稠密度的叢集形成演算法，來提升無線網路空間的頻道重複使用，並且在叢集式的無線網路構下，對於網路中所有的資料流設計出一套避免衝突(conflict-free)的公平排程機制。由於所有叢集內及叢集間的資料傳輸都必須經由叢集的排程者來協調。而每個叢集的排程者卻都是獨立工作，因此叢集與叢集之間的傳輸就可能彼此發生衝突。未解決這個問題，我們將資料流依照其兩端點的位置來分類，藉此，排程者在對資料流做排程的時候，不需要搜集整個網路的資訊即可有效地避免傳輸可能產生的衝突。模擬結果顯示我們提出的機制能維持公平性並且有效增加網路的總產量。

This work studies the allocation of bandwidth resources in wireless ad hoc networks. The highest-density clustering algorithm is presented to promote reuse of the spatial channel and a new slot allocation algorithm is proposed to achieve conflict-free scheduling for transmissions. Since the location-dependent contention is an important characteristic of ad hoc networks, in this paper we consider this feature of ad hoc networks to present a new cluster formation algorithm, by increasing the number of simultaneous links to enhance spatial channel reuse. Furthermore, because each cluster has its own scheduler and schedulers operate independently of each other, the transmissions may conflict among the clusters. In this paper, we classify the flows by the locations of their endpoints to prevent this problem. Finally, the proposed mechanism is implemented by simulation and the results reveal that the conflicts can be efficiently avoided without global information and the network throughput is improved without violating fairness.

章節目錄
中文摘要..................................................I
英文摘要.................................................II
章節目錄.................................................Ⅲ
圖目錄....................................................V
表格目錄.................................................Ⅵ字母縮寫對照表...........................................Ⅶ
第一章 導論...............................................1
1.1 簡介................................................1
第二章 相關概念與相關研究.................................8
2.1 相關概念............................................8
2.1.1隱藏節點與暴露節點的問題.........................8
2.1.2 無線存取技術簡介...............................11
2.2 相關研究...........................................12
2.2.1 增加系統總產量之探討...........................12
2.2.2 排成策略之探討.................................15
2.3 研究動機及想法.....................................16
第三章 最大稠密度叢集形成演算法與免衝突排程機制..........19
3.1 環境假設...........................................19
3.2 探討完成圖的叢集結構...............................20
3.3 最大籌密度的叢集形成演算法.........................22
3.3.1 符號定義.......................................22
3.3.2 HDC叢集形成演算法..............................23
3.4 排程機制...........................................26
3.4.1 資料流資訊表...................................26
3.4.2 時槽配置演算法.................................27
3.5服務註冊和繞送路徑..................................29
3.6範例................................................31
第四章 模擬結果及分析....................................34
4.1 鏈結產量的評估.....................................35
4.2 公平性指標的評估...................................38
第五章 結論..............................................46
參考文獻.................................................47

參考文獻
[1] Bensaon, B.; Tsang, D.H.K. and Chan, T. (2001) ‘Credit-based fair queuening (CBFQ): A simple service-scheduling algorithm for packet-switched networks’, IEEE/ACM Trans. Networking, Oct., pp.591 604.
[2] Chao,H. L. and Liao, W. (2002) ‘Credit-based fair scheduling in wireless ad hoc networks’, Proceedings of 56th IEEE Vehicular Technology Conference, September, pp.1442 1446.
[3] Chao,H. L. and Liao, W. (2002) ‘Fair scheduling with QoS support in ad hoc networks’, Proceedings of IEEE Conference on Local Computer Networks, November, pp.502 507.
[4] Chao,H. L. and Liao, W. (2003) ‘Credit-Based Slot Allocation for Multimedia Mobile Ad Hoc Networks’, IEEE J. Select. Areas Communication, Vol. 21, No. 10, December, pp.1642 1651.
[5] Chao,H. L. and Liao, W. (2004) ‘Fair scheduling with QoS support in wireless ad hoc networks’, Wireless Communications, IEEE Transactions, Volume 3, Issue 6, November pp.2119 2128.
[6] Gerla, M. and Tsai, J. T.-C. (1995) ‘Multicluster, mobile, multimedia radio network’, ACM J. Wireless Networks, Volume 1, No. 3, pp.23 29.

[7]
Gilhousen, K.S. and Jacobs, I. M. et al. (1991) ‘On the capacity of a cellular CDMA system’, IEEE Transaction Vehicular Technology, pp.303 312.
[8] Goldsmith, A.J. and Wicker, S.B. (2002) ‘Design challenges for energy-constrained ad hoc wireless networks’, IEEE Wireless Communications, Vol. 9, Issue 4, August, pp.8 27.
[9] Goyal, P., Vin, H. M. and Cheng, H. (1997) ‘Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks’, IEEE/ACM Trans. Networking, Vol. 5, October, pp.690 704.
[10] Hossain, E. and Bhargava, V. K. (2001) ‘A centralized TDMA-based scheme for fair bandwidth allocation in wireless IP networks’, IEEE J. Select. Areas Communication, Vol. 19, November, pp.2201 2214.
[11] Jain, R. K., Chiu, D. W. and Hawe, W. R. (1984) ‘A quantitative measure of fairness and discrimination for resource allocation in shared computer system’, DEC Technology Report, December.
[12] Jung, P., Baier, P.W. and Steil, A. (1993) ‘Advantages of CDMA and spread spectrum techniques over FDMA and TDMA in cellular mobile radio applications’, IEEE Trans. Vehicular Technology, Vol. 42, pp.357 364

[13]
Luo, H. and Lu, S. (2000) ‘A topology-independent fair queueing model in ad hoc wireless networks’, Proceedings of IEEE Int. Conf. Network Protocols, November, pp.325 335.
[14] Luo, H. and Lu, S. (2001) ‘A self-coordinating approach to distributed fair queueing in ad hoc wireless networks’, Proceedings of IEEE INFOCOM, April, pp.1370 1379.
[15] Perkins, C. E. and Royer, E. M.(1999) ‘Ad-hoc on demand distance vector routing’, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, Louisiana, USA, Feb. 1999, pp. 90 100.
[16] Shreedhar, M. and Varghese, G. (1996) ‘Efficient fair queueing using deficit round-robin’, IEEE/ACM Trans. Networking, vol. 4, June, pp.375 385.
[17] Somani, A.K. and Zhou, Jianwei (2003) ‘Achieving fairness in distributed scheduling in wireless ad-hoc networks’, Proceedings of IEEE Int. Conference Performance, Computing, and Communications, April, pp.95 102.
[18] Vaidya, N. H. and Bahl, P. (1999) ‘Fair scheduling in broadcast environments’, Microsoft Research Technology Report MSR-TR-99-61, August.
[19] Wu, Xinran; Yuen, Clement and Gao, Yan (2001) ‘Fair scheduling with bottleneck consideration in wireless ad-hoc networks’, Computer Communications and Networks Proceedings of Tenth International Conference on 15-17, Oct, pp.568 572.