成功大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	蘇怡文 Su, Yi-Wen
論文名稱：	隨意網路服務品質保證路由協定之研究 Study of QoS-Routing Protocols in Multi-hop Ad Hoc Networks
指導教授：	蘇賜麟 Su, Szu-Lin
學位類別：	博士 Doctor
系所名稱：	電機資訊學院 - 電機工程學系 Department of Electrical Engineering
論文出版年：	2011
畢業學年度：	99
語文別：	英文
論文頁數：	59
中文關鍵詞：	隨意網路、MAC 、流量控制、品質服務保證路由協定、多重路徑
外文關鍵詞：	Ad hoc network, MAC, Admission control, Multihop, QoS routing, node-disjoint, multi-path
相關次數：	點閱：95 下載：1
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

在論文中，討論如何設計出一個有效的隨意網路協定去避免因即時資訊傳送時而造成網路擁塞是現今的一個重要課題。因為當網路系統所附載的資料量過多的時候，即時資訊很容易因網路壅塞而無法順利傳送成功，或因傳送的延遲時間超過限制而被拋棄。因此，最近有不少相關的論文討論如何有效的控制系統的流量，以達到資料傳輸時可以維持較低延遲的品質服務保證。在本論文中研究出一種新穎和有效的服務品質保證機制的路由協定”隨意網路服務品質保證路由協定(SPAC)”來降低傳統為了擁有網路傳送資料實所需的服務品質保證機制的複雜性且能達到更高的傳輸性能。SPAC根據無線路由的標準(AODV)加上最少的改良; 經由這些改良發展出更適合無線傳送系统所使用的路由協定，且經由模擬結果發現，系統流量被更有效的控制，在各項數據中SPAC路由協定提供在高負载之下擁有更高的傳送資料流量和較低延遲。
另外在現行具有服務保證的路由協定中，大多只能提供單一路徑，所以當節點因移動而使其鏈結產生問題時，需要重新尋找封包傳送路徑為此可能會造成大量的網路冗餘與資料延遲，系統效能因而大幅減低。
所以我們以SPAC為基礎架構，另外設計一種多路徑的傳送協定”隨意網路多重路徑與服務品質保證之路由設計”，來提供具服務品質保證的路由協定。此協定使用和SAPC一樣依據頻寬估測的結果來達成允入控制以保證即時傳輸的品質，並且在尋找路徑的同時建立節點分離的多重路徑，以防當原傳送路徑失效時使用，有代替路徑降低路徑維護的時間及提高網路效能。此外，當無法使用單一路徑來滿足頻寬需求時，可運用多重路徑來滿足頻寬傳送需求，進而增加網路的效能。

In this dissertation, a novel and effective single phase admission control (SPAC) scheme for QoS-routing protocols has been proposed to fulfill the real-time traffic requirements in ad hoc networks. The SPAC scheme is based on the ad hoc on-demand distance vector (AODV) protocol with slight modifications of control packets; network congestions are avoided by a simple and precise admission control that blocks most of the overloading flow requests in the route-discovery process. System simulations show that the performance of SPAC is comparable to that of the contention-aware admission control protocol (CACP)-Multihop in all respects; yet the SPAC scheme is simpler in structure. As compared to the QoS-aware routing protocol employing either the ‘‘listen’’ or the ‘‘hello’’ scheme, the SPAC protocol offers higher throughput and remarkably shorter end-to-end delays under heavy loads.
In the existing QoS routing protocols, most only provide a single route. Hence, when a link fail problem occurs in a route, a node needs to find a new route for the packet transmission; it may cause significant network redundancy and delay.
Hence, the SPAC architecture is used in this study to design a Node-disjoint Multi-path QoS Routing protocol to provide a guaranteed quality of QoS routing. In this protocol it uses the bandwidth estimation just the same as SAPC. Based on the estimation results the Node-disjoint Multi-path QoS Routing protocol is able to achieve admission control to ensure the quality of real-time transmission, to find the path while building of the multi-path route, and to provide the transmission path when the original route failure. In addition, if there is no single path to meet the bandwidth requirement, it will try to use multiple routes to meet the bandwidth requirement.

Contents
Chinese Abstract	i
English Abstract	ii
Contents	iii
List of Tables	iv
List of Figures	v
Chapter 1 Introduction	1
Chapter 2 Introduction of 802.11	3      
2.1 IEEE 802.11 MAC Layer Overview	3
2.2 Distributed Coordination Function (DCF)	4
Chapter 3 QoS Routing protocols description	7
3.1 Ad Hoc On-Demand Distance Vector (AODV)	7
3.2 Dynamic Source Routing (DSR)	8
3.3 QoS-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc 
 Networks	9
3.3.1 Bandwidth Estimation	9
3.3.2 Incorporating QoS in Route Discovery	12
3.3.3 Route Maintenance	14
  3.4 Contention-Aware Admission Control Protocol	15
3.4.1 Prediction of Available Bandwidth	15
3.4.1.1 Calculation of Local Available Bandwidth	16
3.4.1.2 Prediction of c-Neighborhood Available Bandwidth	17
3.4.1.3 Bandwidth Consumption	17
3.4.2 CACP Basic Protocol Desig	19
3.4.2.1 Route Discovery	20
3.4.2.2 Distributed Admission Control Algorithm	21
3.4.2.2.1 Partial Admission Contro	22
3.4.2.2.2 Full Admission Control	22
3.4.2.2.3 Building the c-Neighbor Set	23
Chapter 4 Single Phase Admission Control Protocol	24
4.1 Bandwidth (BW) Estimation	24
4.1.1 Estimation of Local BW (RBW) 	24
4.1.2 Acquisition of Neighbor’s RBWs 	25
4.2 Route-discovery process with admission control algorithms	25
4.2.1 Route Discovery Process 	26
4.2.2 Bandwidth Check Process 	27
4.3 Route maintenance	30
    4.4 System Simulations	31
4.4.1 CBR Flow 	34
4.4.2 Video Flow 	36
4.4.3 Voice Flow 	38
Chapter 5 A Novel Design of Node-disjoint Multi-path QoS Routing in Multi-hop Ad Hoc Networks 	40
5.1 Introduction 	40
5.2 Node-disjoint Multipath QoS routing	40
5.3 Control Packets 	41
5.3.1 RREQ format 	41
3.3.2 RREP format 	42
3.3.3 RRER format 	42
  5.4 Route Discovery at the RREQ procedure 	43
5.4.1 The calculation of Nct 	43
5.4.2 Intermediate node receives RREQ	43
5.4.3 Destination node receives RREQ 	44
5.5 Route Discovery at the RREP procedure  	47
5.5.1 Intermediate node receives RREP  	47
5.5.2 node receives RREP-NAK 	49
5.5.3 Source node receives RREP  	50
5.6 Route Maintenance  	52
5.7 Simulation Result  	53
Chapter 6 Conclusion 	57
Reference 	58

 
 
List of Tables
Table 4-1: Parameters of PHY/MAC layer	32
Table 4-2:Transmission times for the control signals	34
Table 5-1: Simulation Parameters 	54

 
List of Figures
Figure 2.1: Some IFS relationships.	3
Figure 2-2: DCF Method.	4
Figure 2-3: Transmission of MPDUs.	6
Figure 3-1: Hello structure.	11
Figure 3-2: Neighbor cache structure.	12
Figure 3-3: Host’s working procedure .	13
Figure 3-4: Bandwidth consumption of mutihop flow.	18
Figure 4-1: Modification of routing table: (a) original format; (b) new format...........	26
Figure 4-2: Modification of RREQ packet: (a) original format; (b) new format.........	26
Figure 4-3: Node B’s communication range and interference range............................	27
Figure 4-4: Bandwidth-check process.....................................................................	29
Figure 4-5: Determination of Nct and Nct* for the route discovery......	30
Figure 4-6: Modification of RRER packet: (a) original format; (b) new format..	30
Figure 4-7: RERR route maintenance process..	31
Figure 4-8: System performance comparison for CBR flows: (a) throughput; (b) number of blocking flows; (c) dropping rate; (d) end-to-end delay.	35
Figure 4-9: Frame-size statistics of the MPEG–4 file of Jurassic Park I.	36
Figure 4-10: System performance comparisons for video flows: (a) throughput; (b) number of blocking flows; (c) dropping rate; (d) end-to-end delay	37
Figure 4-11: System performance comparisons for video flows: (a) throughput; (b) number of blocking flows; (c) dropping rate; (d) end-to-end delay	39
Figure 5-1: RREQ packet format.	41
Figure 5-2: RREP packet format.	42
Figure 5-3: RERR format.	42
Figure 5-4: Intermediate node receives RREQ packet’s temp table.	43
Figure 5-5: Procedure of intermediate node receives RREQ.	44
Figure 5-6: Procedure of destination node receives RREQ.	45
Figure 5-7: Procedure of temp entry selection.	46
Figure 5-8: Routing table for the route information.	47
Figure 5-9: Procedure of intermediate node receives RREP.	48
Figure 5-10: Procedure of node receives RREP-NAK.	50
Figure 5-11: Procedure of source node receives RREP.	51
Figure 5-12: Procedure of main route table selection.	52
Figure 5-13: Procedure of route Maintenance.	53
Figure 5-14: end-to-end delay.	55
Figure 5-15: throughput.	55
Figure 5-16: Dropping rate.	55
Figure 5-17: Number of blocking flows.	56
Figure 5-18: Overhead.	56

                                    

[1] C.E. Perkins, E.M. Belding-Royer, I.D. Chakeres, Ad hoc on demand distance vector (AODV) routing, IETF Internet draft, October 2003.
[2] C. Perkins, E. Royer, Ad hoc on-demand distance vector routing, in: Proceedings of 2nd IEEE Workshop mobile Computing Systems and Applications, 1999, pp. 90–100.
[3] D.B. Johnson, D.A. Maltz, Y.-C. Hu, The dynamic source routing protocol for mobile ad hoc networks (DSR), Internet draft, draft-ietfmanet- dsr-09.txt, April 2003.
[4] S.R. Das, C.E. Perkins, E.E. Royer, Performance comparison of two ondemand routing protocols for ad hoc networks, in: Proceedings of INFOCOM, 2000, pp. 3–12.
[5] Lei Chen, W.B. Heinzelman, QoS-aware routing based on bandwidth estimation for ad hoc networks, IEEE Journal on Selected Areas in Communications 23 (March) (2005) 561–572.
[6] Yaling Yang, R. Kravets, Contention-aware admission control for ad hoc networks, IEEE Transactions on Mobile Computing 4 (4) (2005) 363–377.
[7] Q. Xue, A. Ganz, Ad Hoc QoS On-Demand Routing (AQOR) in Mobile Ad Hoc Networks, Journal of Parallel and Distributed Computing 63 (2) (2003) 154–165.
[8] R. Renesse, V. Friderikos, H. Aghvami, Cross-layer cooperation for accurate admission control decisions in mobile ad hoc networks, IET Communications 1 (4) (2007) 577–586.
[9] D. Dharmaraju, A. Roy-Chowdhury, P. Hovareshti, J. Baras, INORA-A unified signaling and routing mechanism for QoS support in mobile ad hoc networks, in: Proceedings of International Conference on Parallel Processing Workshops, 2002, pp. 86–93.
[10] Szu-Lin Su, Yi-Wen Su, Jing-Yen Jung, A novel QoS admission control for ad hoc networks, in: Wireless Communications and Networking Conference, 2007. WCNC, March 2007, pp. 4193–4197.
[11] Khoder Shamy, Saman Barghi, Chadi Assi, Efficient rate adaptation with QoS support in wireless networks, Ad Hoc Networks 8 (1) (2010) 119–133.
[12] F. Fitzek, M. Reisslein, MPEG-4 and H.263 video traces for network performance evaluation, IEEE Network 15 (6) (2001) 40–54.
[13] F. Fitzek, M. Reisslein, MPEG-4 and H.263 Video Traces for Network Performance Evaluation (extend version). Technical Report TKN-00- 06, Technical University Berlin, Dep. Of Electrical Eng., Germany, October 2000. <http://www.tkn.tu-berlin.de/research/trace/ trace.html> and <http://www.eas.asu.edu/trace>.
[14] K. Sridhar, M. Chan, Interference-based call admission control for wireless ad hoc networks, in: Proceedings of 3rd International Conference on Mobile and Ubiquitous Systems: Networking & Services, San Jose, CA, USA, July 2006, pp. 1–10
[15] Szu-Lin Su; Yi-Wen Su “Single Phase Admission Control for QoS-Routing Protocol in Ad Hoc Networks” Ad Hoc Networks (Accept) 2011 Article Number: 609
[16] T. Bheemarjuna Reddy et al., “Quality of Service Provisioning in Ad Hoc Wireless Networks: A Survey of Issues and Solutions,” Ad Hoc Networks, Volume 4, Issue 1, Jan. 2006, pp. 83–124
[17] S.-J. Lee, E.M. Belding-Royer, and C.E. Perkins, “Scalability Study of the Ad Hoc On-Demand Distance Vector Routing Protocol,” Int’l J. Network Management, Volume 13, no. 2, pp. 97-114, 2003.
[18] IEEE, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.” IEEE Standard 802.11, June, 1999.
[19] P. Mohapatra, J. Li, and C. Gui, “QoS in Mobile Ad Hoc Networks,” IEEE Wireless Commun., Special Issue on QoS in Next-Generation Wireless Multimedia Communications Systems, Volume 10, no. 3, June 2003, pp. 44–52.
[20] H. Zhu et al., “A Survey of Quality of Service in IEEE 802.11 Networks,” IEEE Wireless Commun., Volume 11, no. 4, Aug. 2004, pp. 6–14.
[21] Al-Karaki, J.N.; Chang, J.M, “A simple distributed access control scheme for supporting QoS in IEEE 802.11 wireless LANs” Wireless Communications and Networking Conference, 2004. WCNC, March 2004 Page(s):213 - 218
[22] O. Dousse, P. Thiran, and M. Hasler, “Connectivity in Ad-Hoc and Hybrid Networks,” Proc. INFOCOM, pp. 1079-1088, June 2002.

校內：2013-08-22公開
校外：2013-08-22公開

簡易檢索 / 詳目顯示

相關論文