46 5 20 0 JOURNAL OF SOUTHWEST JIAOTONG UNIVERSITY Vol 46 No 5 Oct 20 0258-27242005-0779-08 DOI0 3969 /j issn 0258-2724 20 05 0 6003 QoS MAC QoS 4% 29% TN929 5 A Price-Based Congestion Control Algorithm or Wireless Multi-hop Networks HE RongFANG Xuming Sichuan Provincial Key Lab o Inormation Coding & TransmissionSouthwest Jiaotong UniversityChengdu 6003 China AbstractIn order to alleviate network congestion eectively and ind a proper balance point between QoS guarantee and airness among dierent types o traica price-based hop-by-hop congestion control scheme was proposed In this scheme the constraints in MAC medium access controltime and binary intererence model are consideredand the transmission ailure ratioas one o the criteria o network congestion control is introduced into a congestion price unction To each node along a low path the transmission rate o each low is adjusted dynamically in light o the received congestion price The optimization goal is to obtain proportional airness or the utility sum o each low Additionally in order to guarantee the QoS requirement and airness o each low the intra-node low scheduling scheme is taken into accountand the priority o each low within a node is adjusted dynamically based on the waiting time unction The simulation results show that the proposed scheme can alleviate congestion eectively Compared with the scheme without congestion controlthe proposed scheme can increase the system total throughput by 4% and the airness by 29% Furthermore perormances such as average delayaverage packet loss ratio and average throughput are improved signiicantly Key wordscongestion controlwireless networkpricetime constraintintererence 20-0-4 60772085 974 - E-mailrhe@ swjtu edu cn 962 - E-mailxmang@ swjtu edu cn
780 46 4 Ad hoc QoS 5-6 - TCP 5-6 7 IP TCP MAC 8-2 MAC 9 IEEE 802 MAC TCP MAC 0 MAC Mesh MAC TCP Ad hoc 2 MAC MAC 2 MAC QoS 3 MAC -
5 78 s l i j sl o j s 7 9 j s c l l ε MAC T MAC p i_ T p i_ T= N i_ T/N i_s T N i_ T T i MAC ε N i_s T T i p i_ T x s /c li j sx s /c lo j s j s s 2 QoS ~ 7 QoS i W i t= W i 0 e αt i_wait 2 W i 0 W i 0 0 i α 0 < α W i 0 α t i_wait i Fig Network topology x 2 x + x 2 t i_last_send c c 2 x + x 2 + x 3 + x 4 + x 5 x 3 + x 4 t c i_wait 3 c 4 t i_wait = t now - t i_last_send 3 t now 0 ~ 7 W i t MAC ε x 4 + x 3 + x 4 ε c 5 c 5 c 4 x + x 2 MAC + x + x 2 + x 3 + x 4 + x 5 + x 3 + x 4 + x 5 ε c 3 2 c 3 c 4 c 7 x + x 2 + x 3 + x 4 + x 5 x s ( ε x 2 ε x 5 ε + ε0 < ε < c 3 c c 6 s Sj c li j s c lo ) j s 4 Sj j x s MAC MAC MAC x 4 x 5 x 5 c 5 c 6 c 7 x 4 x 2 c + x + x 2 c 2 ε x 5 c 6 + x 5 c 7 ε
782 46 H 0 NL NL H 2 i j = i j { 5 0 A R NL NR A lr = /c ll r 6 { 0 G 0 2 NV NL G vl = { l v 7 0 3 5~ 7NL NVNR MAC 8 2 GAx ε 8 additive binary 3 7 HAx ξ 9 x = x r NR x r 0ε = ε j 0 j Vξ = ξ k 0 k L SNR SNR HH A G 0 0 0 0 0 0 0 H = 0 mesh 0 0 0 0 0 /c 0 0 0 0 /c 2 /c 2 0 0 0 /c 3 /c 3 /c 3 /c 3 /c 3 A = 0 0 /c 4 /c 4 0 0 0 0 /c 5 0 0 0 0 0 /c 6 2 MAC 0 0 0 0 /c7 0 0 0 0 0 0 L V R 0 0 0 0 0 0 0 0 0 0 0 0 0 0 G = 0 0 0 0 0 0 7 0 0 0 0 0 0 i j 0 0 0 0 0 H i j 0 0 0 0 0
5 783 2 P 5 2 P Kelly Lx λ μ= ω s lg x s - λ T GAx - εμ T HAx - ξ 5-6 s R MAC λ μ 0 s U s x s = ω s lg x s ω s dl = ω s - dx s x s ( + j As c li j s c lo ) λ j - j s Pmax ω s lg x s s ( m L Is m c ) μ m 2 s t GAx ε 0 HAx ξ As s x s 0 Is m s m 2 0 P ω s 2 x s = ω s ( + λ j + c ) μ m ) 3 ( j As c li j s c lo ) j s ( m L Is m t s i 4 x s i t dx s i t = x dt s i t = k ( ω s - x s i t ( + λ s j t+ c ) μ s m t ) ) ( j As c li j s c lo ) j s ( m L Is m 4 λ s j tμ s m t λ s j t ω s s j 2 2 x s i t /c li j s+ /c lo j s j s MAC x s i t /c li j s+ /c lo j sλ s j t s j μ s m s m QoS x s i t ( Is m c ) μ s m t s m 2-4 7-9 x s i t ( m L Is m c ) μ s m t t j s λ s j t s λ s j t= αλ s j t - + - αp s j x s i t /c li j s+ /c lo j s α 0 5
784 46 α MAC 5 67 QoS - α 2 QoS 4 QoS λ s j t t = 0 0p s j j s 3 x s i t ( + c li j s c lo ) p s j j s 4 2 j s MAC p s j y = exp ( y - + exp p s_t - p th ) 6 s ) ( x i i n μ s m t μ s m 8FI FI + ( x s t - φ Is m c ) μ s m t = 7 5 3 2 x s t Is m c CBR EXP Pareto 28 B MAC 802 DCF x s t ( Is m c ) s AODV Mb /s RTS m c + = max c 0 CTS ACK Mb /s φ 2 5 5 Mb /s 4 MAC 00 s α p th s 2 3 T update = TU 0 sα 0 4p th 0 5 s 0 7 T update ACK 3 s j s MAC s QoS NS2 34 3 p s_ t t j - 3 p th MAC s airness index FI p th QoS FI 5FI 8 2 α s p th F = ( x i ) n n x 2 i 8 n i = T update i = T update 2 ~ 7 3
5 785 Fig 2 2 Average packet loss ratio o each low 3 Fig 3 Average throughput o each low 4 0-3 Fig 4 Throughput o low 0-3 vs time 5 Fig 5 Average delay o each low 6 Fig 6 System total throughput 7 Fig 7 Fairness comparison 4-3 05-3 0-3 00% 7 3 4-3 6-3 3 3 3 29% 2 ~ 4 4 6 6-3 4% 5 5 4-3 3 0-3 3-3 5 3 2
786 46 3 5KELLY F PMAULLOO ATAN D Rate control in communication networksshadow pricesproportional airness and stability J Journal o the Operational Research Society998493 237-252 6KELLY F P Charging and rate control or elastic traic J European Transactions on telecommunication 9978 33-37 4 Congestion control in multi-hop wireless networks J IEEE Transactions on Vehicular Technology2007 562 863-873 MAC 8LOW S HLAPSLEY D E Optimization low control-i basic algorithm and convergence J IEEE /ACM Transactions on Networking99976 86-874 9LEE H JLIM J T Congestion control or streaming service in IEEE 802 multihop networks J IET Communications20042 45-422 0FENG GangLONG FeiZHANG Yide Hop-by-hop congestion control or wireless mesh networks with multi-channel MACC Proc O IEEE Global Telecommunications Conerence Honolulu IEEE 2009-5 Ad hoc J 200 2 7 667-678 XU WeiqiangWANG YamingYU Chenghaiet al ACK Cross-layer optimal congestion control scheme in mobile Ad hoc networks J Journal o Sotware 802 s Mesh J 200 455 725-73 FANG XumingSUN ShujieHE Rong 802 s based ast transition scheme or wireless mesh network J Journal o Southwest Jiaotong University 200 455 725-73 2YUNG YiSANJAY S Hop-by-hop congestion control over a wireless multi-hop network J IEEE /ACM Transactions on Networking20075 33-44 3TAN LianshengZHANG XiaomeiANDREW L L H et al Price-based max-min air rate allocation in wireless multi-hop networks J IEEE Communications Letters20060 3-33 4AKYOL UANDREWS MCUPTA Pet al Joint scheduling and congestion control in mobile Ad-hoc networksc Proc o the 27th IEEE Conerence on Computer Communications INFOCOM '08 Phoenix IEEE200869-627 7TAN KunJIANG FengZHANG Qianet al 20027 667-678 2WU KundaLIAO Wanjun Flow allocation in multihop wireless networks a cross-layer approach J IEEE Transactions on Wireless Communications 20087 269-276 3HUANG ShuDUTTA R Design o wireless mesh networks under the additive intererence modelc Proc o IEEE 5th International Conerence on Computer Communications and Networks ICCCN'06 ArlingtonIEEE2006253-260 4CHEN JimingHE ShiboSUN Youxianet al Optimal low control or utility-lietime tradeo in wireless sensor networks J Computer Networks Elsevier2009538 303-304 5CHEN YongqianROH K MYOO S J Service index-based airness scheduling in wireless ad hoc networks J Computer Communications200629 5 2934-2944