| 研究生: |
謝承峰 Xie, Cheng-Feng |
|---|---|
| 論文名稱: |
在無線網路上減緩空間競爭效應之分散式排程演算法 A Novel Distributed QoS Scheduling to Reduce Spatial Contention in Wireless Ad hoc Networks |
| 指導教授: |
李忠憲
Li, Jung-Shian |
| 學位類別: |
碩士 Master |
| 系所名稱: |
電機資訊學院 - 電機工程學系 Department of Electrical Engineering |
| 論文出版年: | 2004 |
| 畢業學年度: | 92 |
| 語文別: | 英文 |
| 論文頁數: | 69 |
| 中文關鍵詞: | 自我偶合問題 、空間競爭性 |
| 外文關鍵詞: | spatial contention, self-coupling problem |
| 相關次數: | 點閱:112 下載:2 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
近幾年來,隨著無線網路上及時性應用程式的增加,提供服務品質給即時性的資料流漸漸的引起大家的注意。然而,IEEE 802.11無線網路環境下最普遍的通訊協定-分散式協調函式(DCF)卻沒有提供服務品質的機制。另一方面,無線網路所展現的一些獨特的特性,像是完全分散式的環境、空間競爭性、以及多點轉送的交通型態,更讓提供服務品質的任務增加了許多挑戰性。
在論文中,我們考慮了上述的一些無線網路的特性,提出一種分散式的封包排程演算法。首先,我們利用資料封包來背負一些控制訊息,並啟動雜亂監聽模式來將一個無線節點中最前線封包的的傳送截止時間傳播給空間中其他的無線節點,進而發展出一套藉由比較各節點傳送截止時間的緩急程度來調整節點後退時間,繼而決定封包傳送優先權的機制。另一方面,我們注意到一個在無線網路上相當獨特,稱為自我偶合的問題,並特別設計了此一問題的解決方案,冀以消除在同一個資料流中,各個節點盲目競爭的現象。我們相信,藉由我們所提出的機制來考慮各節點的傳送優先權及協調無線節點接的空間競爭行為,我們可以達到更加的端對端傳輸延遲及更高的封包傳送率來滿足服務品質的要求。
In the recent years, more and more attention has been attracted to providing quality of service (QoS) for real-time traffic in wireless ad hoc networks as the increase of real-time applications. However, the Distributed Coordination Function (DCF), the popular communication protocol in IEEE 802.11 standard, fails to provide QoS guarantee for real-time applications. On the other hand, some characteristics in wireless network, such as fully distributed nature, spatial contention, and multi-hop environment, make QoS-supporting considerably a challenging job.
In this thesis, we propose a novel distributed traffic scheduling scheme by considering some special characteristics of wireless ad hoc networks mentioned above. In our scheme, we take advantage of a piggyback in data packets and the promiscuous mode in wireless networks to spread the timing information of head-of-line (HOL) packets among several nodes who share a common channel in a standpoint of spatial contention. A backoff time adjustment policy is developed to coordinate the transmission orders of these contending nodes in accordance with the urgency of their packets. Besides, we address a special phenomenon in wireless ad hoc network called self-coupling problem and design an effective solution to eliminate the blind contentions within a flow. By well-coordination of spatial contention with consideration of priority of each packet, both average end-to-end delay and the packet delivery ratio can be significantly improved so that the QoS condition can be satisfied as far as possible
[1] J. L. Sobrinho and A. S. Krishnakumar, “Quality-of-Service in ad hoc carrier sense multiple access networks”, IEEE Journal on Selected Area in Communications, vol 17, NO.8: 1353-1368, August 1999.
[2] The Institute of Electrical and Electronics Engineers, Inc. IEEE Std 802.11 – Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, 1999 edition.
[3] Haiyun Luo, SongWu Lu, and Vaduvur Bharghavan, “A new model for packet scheduling in multihop wireless networks”, in proceedings of the 6th annual international conference on Mobile computing and networking, pp 76-86, 2000
[4] D.B. Johnson and D.A Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks” in Mobile Computing, pp 153-181, 1996
[5] C. E. Perkins and E. M. Royer, “ Ad-hoc On-Demand Distance Vector Routing”, Second IEEE WorkShop on Mobile Computing Systems and Applications, pp90-100, February 1999.
[6] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM: Computer Communication Review, vol.21, no.4 pp.234-244, October 1994.
[7] V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, “Distributed Priority Scheduling and Medium Access in Ad Hoc Networks” ACM Wireless Networks vol.8, pp 455–466, 2002
[8] Hossam Fattah, and Cyril Leung “An Overview of Scheduling Algorithms in Wireless Multimedia Networks” IEEE Wireless Communications , pp 76-83, October 2002.
[9] Lichun Bao, and J. J. Garcia-Luna-Aceves, “A new Approach to Channel Access Scheduling for Ad Hoc Networks”, ACM International Conference on Mobile Computing and Networking, p220-221, 2001.
[10] http://pcl.cs.ucla.edu/projects/glomosim/
[11] Xiang Zeng, Rajive Bagrodia, Mario Gerla ,"GloMoSim: a Library for Parallel Simulation of Large-scale Wireless Networks", Proceedings of the 12th Workshop on Parallel and Distributed Simulations -- PADS '98, May 26-29, 1998 in Banff, Alberta, Canada
[12] Shigang Chen and Klara Nahrstedt, “Distributed Quality-of-Service Routing in Ad Hoc Networks” IEEE Journal on selected areas in communications, vol. 17, no. 8, augest 1999
[13] Gahng-Seop Ahn , Andrew T. Campbell, Andras Veres, and Li-Hsiang Sun, “Supporting Service Differentiation for Real-Time and Best-Effort Traffic in
Stateless Wireless Ad Hoc Networks (SWAN)”, IEEE transaction on mobile computing, pp 192-207, vol. 1, no. 3, July 2002