在可攜式裝置所組成的移動式隨意網路中，由於缺乏中央調控者所以在運作上比較缺乏效率。再加上可攜式裝置通常是使用電池作為動力來源，所以資源可有效利用成為一個很重要的課題。另外在隨意網路中傳輸延遲較大，所以對real time traffic很不利，這也是另一個挑戰。
本文提出HEBM的佇列管理方法來解決上述情況，藉由已經過的hop數、發送節點的電力多寡及預測剩餘hop數來決定封包傳送的優先權，來減少封包遺失所造成的重傳發生，藉此減少傳送接收的次數來減少電力的消耗，也能減少延遲。而且我們針對real time traffic提供較高的傳送優先權，以期減少點對點延遲來改善隨意網路對real time traffic不利的情形。

第一章 導論 1
1.1簡介 1
1.2 移動式無線隨意網路的QoS 4
1.3 研究動機 6
1.4 論文架構 7
第二章 相關研究 8
佇列管理(Queue Management) 8
2.1 尾端拋棄(Tail drop) 9
2.2 早期隨機偵測(Random early detection) 10
2.3 BLUE 13
2.4 Hop-Aware Buffering Scheme (HAB) 14
2.5 802.11e EDCA(Enhanced Distributed Channel Access) 18
第三章 提出的方法 20
3.1 環境假設 20
3.2 Hop-aware and Energy-based Buffer Management 21
3.2.1 Classifier 22
3.2.2 Partitioned Buffer 22
3.2.3 Queue Size Manager 22
3.2.4 Priority Manager 24
3.2.5 Scheduler 27
3.3 公式推導 28
3.3.1穩定態平衡等式 28
3.3.2遺失率 30
3.3.3點對點延遲 31
3.3.4 增加分類 32
第四章 模擬及討論 33
4.1模擬環境 33
4.2模擬結果與討論 35
4.2.1 最佳參數設定 35
4.2.2 整體效能比較 37
4.2.3整體電力的節省 39
4.2.4 Real time與Non-real time Traffic效能比較 42
4.2.5 LH與SH封包效能比較 44
4.2.6 理論與模擬封包效能比較 45
第五章 結論 46
References 47

[1]L. Hanzo II and R. Tafazolli, "A survey of QoS routing solutions for mobile ad hoc networks", IEEE Communications Surveys and Tutorials, vol. 9 , No2, EEE Communications Magazine, 2007.
[2]W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue Management Algorithms. U. Michigan CSE-TR-387-99, April 1999.
[3]Kalil, M.A, Al-Mahdi, H., Mitschele-Thiel, A. “Performance Evaluation of Hop-Aware Buffer Management Scheme in Multihop Ad Hoc Networks”. Wireless and Mobile Communications, 2008. ICWMC ''08. The Fourth International Conference on. July 27 2008.
[4]Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S.: ‘Recommendations on queue management and congestion avoidance in the Internet’. IETF RFC 2309 April 1998.
[5]Sally Floyd, Ramakrishna Gummadi, and Scott Shenker, “Adaptive RED: An Algorithm for Increasing the Robustness of RED''s Active Queue Management,” Technical Report, ICSI, August 1, 2001.
[6]Wu-Chang Feng, Dilip D. Kandlur, Debanjan Saha, Kang G. Shin. “Stochastic Fair Blue: an algorithm for enforcing fairness”. In Proc. INFOCOM''2001, 2001.
[7]M. Brahma, K. W. Kim, M. El Hachimi, A. Abouaissa, P. Lorenz,” A Buffer and Energy Based Scheduling in Mobile Ad hoc Networks over Link Layer”Advanced International Conference on Telecommunications, AICT 2006, 19-25 February 2006.
[8]N. Bisnik and A. Abouzeid, “Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks,” Proceedings of International conference on Wireless Communications and Mobile Computing (IWCMC’06), pp. 773-778,2006.
[9]Floyd, S., & Jacobson, V., “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Transactions on Networking, Vol. 1, No 4, pp.397-413, 1993.
[10]L. Kleinrock, Queueing Systems, vol. I, John Wiley, 1976.
[11]P. Gupta and P.R. Kumar, "The capacity of wireless networks", IEEE Transactions on Information Theory, 46(2): 388-404, March 2000.
[12]A. El Gamal, J.Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks", Proceedings of IEEE Infocom 2004.