Mesh. QoS Routing Algorithm and Performance Evaluation Based on Dynamic Programming Method in Wireless Mesh Networks

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "Mesh. QoS Routing Algorithm and Performance Evaluation Based on Dynamic Programming Method in Wireless Mesh Networks"

Ζένα Αγγελοπούλου
5 χρόνια πριν
Προβολές:

1 29 12 Vol.29No Journal of Electronics & Information Technology Dec Mesh QoS ( ) ( ) Mesh QoS MAC CPRMQS DSR Mesh QoS TP393 A (2007) QoS Routing Algorithm and Performance Evaluation Based on Dynamic Programming Method in Wireless Mesh Networks Song Wen Fang Xu-ming (Provincial Mobile Communication Laboratory, Southwest Jiaotong University, Chengdu , China) (National Mobile Communications Research Laboratory, Southeast University, Nanjing , China) Abstract: Focusing on throughput and transmission reliability of multimedia delay-sensitive traffic, the dynamic programming and cross-layer design methods are introduced to design QoS routing algorithm in wireless mesh networks. Moreover, a novel Convex Programming Routing Metric QoS (CPRMQS) routing algorithm is proposed as well as an integrated metric (CPRM) QoS model from MAC layer information based on the assumed network model, and then the steps and example using dynamic programming method are presented to solve routing optimization problem. Finally the feasibility of the proposed algorithm is verified with protocol simulation, and the performance evaluations of proposed protocol extended based on DSR are given, including throughput and delay etc. Key words: WMN; QoS routing; Dynamic programming; Cross-layer design 1 Mesh (WMN) Ad hoc Mesh / QoS QoS () [1, 2] WMN ( ) QoS 3 [3] (N200608) (2005B02) NPC [4] [5] O(n k) O(n 2 ) [6] n k WMN 2 QoS 2.1 WMN WMN V E G (V, E) 1 V WMN E E i i

2 WMN i+1 i, i+1v E i i+1 j W S, T, B i j i+1 U U 1, = 0, P j = 1N1N D(P j )= N 1 i ( T U ) T 0 T 0 1N T TX (P j )= Max Min( B j i U ) T s (P j ) = Max Min( S U ) j i [6 8] (MOP) [9,10]QoS [9] QoS 2.2 QoS N k = 1, 2,, N x 1 X1 p = { u, u N 1, N 1, } k1<k N V1, N( x1, P1, N) = opt ϕ V1, k 1( x1, p1, k 1), p1, k 1 P1, k 1( x1 ) opt VkN, ( xk, pkn, ) pkn, PkN, ( xk) V k,k (x k, p k,n (x k ))kn() ϕ Vopt () p 1,N p1, N ( x1 ) k1<k<n p kn, x 1 p 1, k 1 x k kn n X E f(x) x 1, x 2 X [0,1] λ f[ λ x2 + (1 λ) x1] λ fx ( 2) + (1 λ) fx ( 1)] QoS [11] T TX [12 14] T s CPRM(Convex Programming Routing Metric) CPRM CPRM CPRM = λ T + (1 λ) T (1) TX (1)T s T s T TX λ 0 λ QoS P P1P2PE λ T TX (P)T s (P) CPRM maxf maxf=[t TX (P), T s (P)], T TX (P) bandwidth(p)t s (P)successful(P)(1) (1)P1P2.B max =Max(bandwidth(P1)) S max =Max(successful(P2)) P1=P2 s

3 12 Mesh QoS 3003 (2) (2)Max[λ B(bandwidth(P))+(1 λ) S (successful(p))] s.t.pe (E )P λ [0,1] (3) S = { P S } k k S k (4)Max[λ B(bandwidth (P)) + (1 λ) S(successful(P))] s.t.ps k P(6) (5) (7) (6)QoS( ) λ(3)p (7)λ(3) S k (a)s k (6) (b)s k PS k (7) S k S k (c)s k PS k (5) (6) S D 8 4 ( 2.2 ) S D 2.3 (1) S D B max 4(j=1)B min 2(j=2 4)( ) U 11 1U 21 =1U 31 =1 U 41 =1 U 0 T max 3(j=1)T min =1(j=4)( ) U 11 1 U 21 =1U 31 =1U 41 =1 U 0 j=1 ( 1 ) 2 WMN CPRMQS λ U U 11 =U 21 =U 34 =U 41 =1 CPRM QoS QoS QoS DSR QoS CPRMQS(Convex Programming Routing Metric QoS) CPRM ( 3) QoS QoS QoS QoS [3] QoS DSR QoS QoS CPRMQS CPRM T s T TX MAC [15] IEEE MAC 1 T TX MAC ( NAV ) [16, 17] 3 MAC NAV NAV MAC NAV T s T s T TX

4 DSR CPRMQS 2.2 CPRM (2) CPRM CPRM CPRM CPRM 1, N x1 P1, N = ϕ 1, k 1 x1 p1, k 1 p1, k 1 P1, k 1( x1 ) CPRM (, ) opt [CPRM (, ), opt CPRM ( x, p )] pkn, PkN, ( xk) kn, k kn, (2) 4 [20] WMN m CPRMQS DSR CPRMQS 25 CPRMQS 100 CPRMQS DSR DSR CPRMQS DSR λ 3 ( 5 ) λ 0.5 CPRMQS λ λ 0.5 λ 5 CPRMQS CPRMQS QoS DSR [18] NS-2 [19] byte 250m 200s 49 CBR(Constant Bit Rate) CMUPriQueue 1Mbit/s λ QoS 6s QoS 50 (kbps) (s) 4 3 DSR CPRMQS CPRMQS CPRMQS ( λ =0.3) ( λ =0.5) ( λ =0.7)

5 12 Mesh QoS 3005 Mi Zhi-chao, Zheng Shao-ren, Wang Ze-yan, and Ni Ming-fang. An interactive QoS routing algorithm for Ad hoc networks. Wuhan University Journal (Natural Science Edition), 2002, 1: [10],,. ad hoc QoS., 2005, 2: Zhao Ning, Gu Hong-bin, and Mi Zhi-chao. A QoS routing 6 DSR CPRMQS CPRMQS NPC DSR WMN [1] Chen Shi-gang and Nahrstedt K. Distributed quality of service routing in Ad hoc network. IEEE Journal on Selected Areas in Communications, 1999, 17(8): [2] Lin Chunhung Richard and Liu Jain-Shing. QoS routing in Ad hoc wireless network. IEEE Journal on Selected Areas in Communications, 1999, 17(8): [3] Steuer R E. Multiple Criteria Optimization: Theory, Computation and Application, New York: John Wiley & Sons, 1986: [4] Walsh G R. Methods of Optimization, New York: Wiley, 1975, [5] Cormen T H, Leiserson C E, Rivest R L, and Stein C. Introduction to Algorithms, 2nd Ed. the MIT Press, 2002: [6] Divide-and-Conquer Algorithms. ac.uk/ ~ped/teachadmin/algor/ d_and_c. html [7] Aubin J P, Vinter R B, and Ioffe A D. Convex Analysis and Optimization. Research notes in mathematics, 57. Boston: Pitman Advanced Publishing Program, 1982: [8] Chen S and Nahrstedt K. On Finding Multi-Constrained Paths. ICC 98, Atlanta, GA (USA), 1998: [9],,,.Ad hoc QoS. (), 2002, 1: algorithm based on multi-object programming used in Ad hoc network. IT Age, 2005, 2: [11] Korkmaz T and Krunz M. Multi-constrained optimal path selection. INFOCOM'01, Alaska (USA), 2000, 2: [12] Awerbuch B, Holmer D and Rubens H. High throughput route selection in multi-rate Ad Hoc wireless networks. Lecture Notes in Computer Science, 2003, 2928: [13] Chang H, Jamin S, and Willinger W. Internet connectivity at the AS-level: An optimization-driven modeling approach. Proc. of ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research, Karlsruhe (Germany), [14] Santivanez C and Ramanathan R. Hazy Sighted Link State (HSLS) routing: A scalable link state algorithm. BBN Technical Memo, 2003, 1301: 144. [15] Iannone L and Fdida S. Increasing the throughput capacity of mesh networks by cross-layer routing. INFOCOM 2005 Student Workshop, Miami (USA), 2005: 1. [16] Chen Lei and Heinzelman Wendi. QoS-aware routing based on bandwidth estimation for mobile Ad hoc networks. IEEE Journal on Selected Areas in Communications, 2005, 23(3): [17] Song Wen and Fang Xuming. Routing with congestion control using cross-layer design in wireless mesh networks. ICWMMN2006, Hangzhou (China), 2006: [18] Johnson D B, Maltz D A, and Hu Y C. The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF draft-ietf-manet-dsr-10.txt, [19] Network Simulator Notes and Documentation. UCB/LBNL, [20]. Ad hoc., 2005, 16(5): Guo Jia-feng, et al.. A leisure degree adaptive routing protocol for mobile Ad hoc network. Journal of Software, 2005, 16(5): Ad hoc Mesh B3G/4G Ad hocmesh.

Σχετικά έγγραφα

19 18 Vol. 19 No Journal of System Simulation Sep., 2007 WMN

19 18 Vol. 19 No Journal of System Simulation Sep., 2007 WMN DOI:10.16182/j.cnki.joss.2007.18.021 19 18 Vol. 19 No. 18 2007 9 Journal of System Simulation Sep., 2007 Mesh 1 1,2 1., 610031; 2., 210096 Mesh WMN DSR MAC DSR, DSR Mesh TP393 A 1004-731X (2007) 18-4320-06