LAN An Analysis on Influence of Control Messages of Ad Hoc Routing Protocols upon Link Trougput in 802.11 Wireless LAN Ryoji ONO, Tatsuji MUNAKA, and Takasi WATANABE DSR MAC IEEE 802.11 DCF DCF LAN DCF DCF DSR 0.003 [1/m 2 ] DSR DCF DSR IEEE 802.11 DCF 1. Information Tecnology R & D Center, Mitsubisi Electric Corporation, 5 1 1 Ofuna, Kamakura, Kanagawa, 247 8501 Japan Faculty of Informatics, Sizuoka University, 3 5 1 Jooku, Hamamatsu, Sizuoka, 432 8011 Japan [4] IEEE 802.11 LAN [1] [5], [6], [8] 802.11 MAC DCF Distributed Coordination Function PCF Point Coordination Function 2 PCF DCF DCF CSMA/CA Carrier Sense Multiple Access wit Collision Avoidance A Vol. Jxx A No. xx pp. 1 10 xxxx xx 1
xxxx/xx Vol. Jxx A No. xx DCF DCF [9], [10] [5] DSR [2] [5], [6] DCF DCF DCF [5] [7] DCF [9] [11] DCF IEEE 802.11 DCF DCF [5] DSR DCF DCF 2. IEEE 802.11 DCF DSR 3. 2. DSR 4. 5. 6. 2. 2. 1 IEEE 802.11 DCF IEEE 802.11 [1] MAC 2 DCF PCF DCF DCF CSMA/CA RTS/CTS request-to-send/clear-to-send 2 RTS/CTS DIFS DCF inter-frame space RTS/CTS SIFS sort inter-frame space ACK RTS/CTS DIFS RTS RTS SIFS CTS RTS SIFS RTS/CTS [9] 2. 2 IEEE 802.11 DCF IEEE 802.11 DCF Cen [10] g M T p 2
LAN normalized trougput S 0.4 0.3 0.2 0.1 single op multi op 0 0 0.0005 0.001 0.0015 0.002 0.0025 0.003 packet arrival rate g [pkt/slot] 1 DCF M = 10, T p = 32 Fig. 1 Trougput of DCF (M = 10, T p = 32) M 1 Cen [10] M = 10 T p = 32 [bytes] 1 g S M 1 2. 3 DSR DSR [2] DSR RREQ RREQ RREQ 1 [11] RREQ RREP RREQ RREQ RREQ RREP Caced RREP RERR RERR RREQ Broc [5] DSR 4 [6], [7] DSR 3. Cen [10] DSR Li [14] µ DSR p d [8] DSR g r p d µ v p d N ρ g r v ρ g a g Cen 3
xxxx/xx Vol. Jxx A No. xx [10] g DCF S v ρ DSR g r S 3. 1 [12], [13] 2 Li [14] 2 [15] µ r ū µ = 2ū πr (1) v 2 u θ v u = v 2 2v cos θ = 2v sin θ 2 (2) ū u θ ū = π 0 {2v sin(θ/2) 2π sin θ} dθ π 0 2π sin θ dθ = 4 3 v (3) µ = 8v 3πr 3. 2 (4) p d DSR 2 [15] 1 n l p d µ p d = n l µ (5) 2 p d N/2 N p d = N 2 p d = N 2 n lµ = 4N n lv 3πr 3. 3 (6) g r DSR RREQ RREP RERR g r DCF RREQ RREP RERR 3 p req p rep p err G r [8] G r = p req Nδ req + p rep n rep + p err n (7) N n n rep RREP δ req Caced RREP RREQ n r RERR 1 n r p err p d n r RREQ RERR p req p err RREQ 1 RREP δ rep p rep δ rep p req 2 DSR 3 4
LAN G r = (Nδ req + δ rep n rep + n ) n r p d (8) G r g r αg r = Ng r (9) [10] ρ A N = ρa g r g r = α N G r = α N (Nδ req + δ rep n rep + n ) n r p d 4α(ρAδreq + δrep nrep + n ) n l n rv = (10) 3πr Caced RREP δ req 1 δ rep 1 ρa = N n > n rep ρaδ req + n ) g r (δ rep n rep g r 4αA n l n r ρv (11) 3πr g r ρ v 3. 4 2. 2 g g g a g r g = g a + g r (12) g a g Cen [10] DCF S 4. 3. DSR DCF LAN 10 g r v ρ 2 S 4. 1 [8], [10], [11] 1 A 25 [m] T p Cen [10] T p [6] RREP RTS/CTS RTS/CTS [10] RTS/CTS DSR RREQ RTS/CTS Cen [10] RTS/CTS 4. 2 Caced RREP Caced RREP 1 Table 1 Parameters r 25 m A (100 100) m 2 n 3 n l 3 n r 2 1 Mbps α 20 µsec γ 2 µsec T p (26 + 4 n ) bytes PHY 24 bytes MAC 28 bytes RTS 44 bytes CTS 38 bytes ACK 38 bytes SIFS 10 µsec DIFS 50 µsec CW min 31 CW max 1023 m 5 5
xxxx/xx Vol. Jxx A No. xx trougput against offered load S/G 1 0.1 0.01 g a = 0.0002 g a = 0.0005 g a = 0.0010 g a = 0.0020 trougput against offered load S/G 1 0.1 0.01 g a = 0.0002 g a = 0.0005 g a = 0.0010 g a = 0.0020 0.1 1 10 node speed v [m/sec] 0.001 0.01 node density ρ [1/m 2 ] 2 Fig. 2 Trougput against node speed 3 Fig. 3 Trougput against node density (1) 4. 2. 1 Caced RREP Caced RREP δ req 1 δ rep 1 11 a ) v 2 S S G S/G G 9 g M = ρπr 2 α G = M α g = ρπr2 α g (13) 2 ρ 5.0 10 3 [1/m 2 ] 4 g a 0.0002 0.002 5 2 g a > = 0.001 v S/G 1 g > 0.001 4 8 m 1 5 200 2000 [pkt/sec] 140 1400 [kbps] g a < = 0.0005 v < = 1 S/G 1 v > 1 S/G v > 4 g a g r b ) ρ S/G 3 v = 1 [m/sec] g a 0.0002 0.002 ρ g a g a ρ S/G 3 4 4 3 4 g a = 0.001 6
LAN trougput against application trougput 1 0.9 0.8 0.7 0.6 g a = 0.0002 g a = 0.0005 g a = 0.0010 g a = 0.0020 0.001 0.01 node density ρ [1/m 2 ] 4 Fig. 4 Trougput against node density (2) ρ 4 ρ = 0.003 ρ = 0.005 c ) ρ 0.002 0.02 v S/G 5 g a 0.0002 2 3 4 5 g a g r ρ < = 0.003 v < = 10 v = 10 36km ρ v ρ > = 0.010 v < = 1 v = 1 3.6km ρ v ρ = 0.003 0.010 v trougput against offered load S/G 1 0.1 0.01 0.1 1 10 node speed v [m/sec] ρ = 0.002 ρ = 0.003 ρ = 0.004 ρ = 0.006 ρ = 0.010 ρ = 0.014 ρ = 0.020 5 Fig. 5 Trougput against node speed and density ρ > = 0.010 v ρ = 0.003 0.010 v 4. 2. 2 Caced RREP Caced RREP δ req 1 δ rep 1 10 δ req δ rep n rep 2 DSR Caced RREP [17] ρ 0.002 0.02 v S/G 6 ρ < = 0.003 v < = 10 ρ > = 0.010 v < = 1 2 2 Table 2 Parameters (2) δ req 0.267 δ rep 10.4 n rep 2.10 7
xxxx/xx Vol. Jxx A No. xx trougput against offered load S/G 1 0.1 0.01 0.1 1 10 node speed v [m/sec] ρ = 0.002 ρ = 0.003 ρ = 0.004 ρ = 0.006 ρ = 0.010 ρ = 0.014 ρ = 0.020 6 Fig. 6 Trougput against node speed and density ρ = 0.003 0.010v Caced RREP ρ > = 0.010 v ρ = 0.003 0.010 v 4. 3 A r ρ > = 0.010 [1/m 2 ] ρ = 0.003 0.010 [1/m 2 ] v = 1 10 [m/sec] DSR DCF MAC DSR ρ < = 0.003 6 6 10 m 1 100 100 m 2 30 5. a ) [5], [6] b ) RTS/CTS [6] RTS/CTS c ) DSR AODV [3] DSR [5], [6] d ) e ) DSR 6. IEEE 802.11 DCF DSR [14] [8] DSR DCF [10] 0.003 [1/m 2 ] 8
LAN DSR DCF DSR [1] IEEE standard for wireless LAN medium access control (MAC) and pysical layer (PHY) specification, ISO/IEC 8802-11:1999, Aug. 1999. [2] D. Jonson, D. Maltz, and Y. Hu, Te dynamic source routing protocol for mobile ad oc networks, draft-ietf-manet-dsr-10.txt, Jul. 2004. [3] C. Perkins, E. Belding-Royer, and S. Das, Ad oc on-demand distance vector (AODV) routing, RFC 3561, Jul. 2003. [4] IEEE standard for wireless LAN medium access control (MAC) and pysical layer (PHY) specification: ESS mes, ttp://grouper.ieee.org/groups/802/11 /Reports/tgs update.tm. [5] J. Broc, D. Maltz, D. Jonson, Y. Hu, and J. Jetceva, A performance comparison of multi-hop wireless ad oc network routing protocols, Proc. ACM/IEEE MobiCom 98, pp.85 97, Dallas, USA, Oct. 1998. [6] C. Perkins, E. Royer, S. Das, and M. Marina, Performance comparison of two on-demand routing protocols for ad oc networks, IEEE Personal Communications, vol.8, no.1, pp.16 28, Feb. 2001. [7] T. Kullberg, Performance of te ad-oc on-demand distance vector routing protocol, Helsinki University of Tecnology Seminar on Internetworking, HUT T- 110.551, Espoo, Finland, Apr. 2004. [8] vol.45 no.12 pp.2566 2578 Dec. 2004. [9] S. Kurana, A. Kaol, S. Gupta, and A. Jayasumana, Performance evaluation of distributed co-ordination function for IEEE 802.11 wireless LAN protocol in presence of mobile and idden terminals, Proc. IEEE MASCOTS 99, pp.40 47, College Park, USA, Oct. 1999. [10] Y. Cen, Q. Zeng, and D. Agrawal, Performance of MAC protocol in ad oc networks, Proc. CNDS 03, pp.55 61, Orlando, USA, Jan. 2003. [11] J. Yin, Q. Zeng, and D. Agrawal, Performance evaluation of 802.11 distributed coordination function in ideal and error-prone cannel, Proc. CNDS 04, pp.55 61, San Diego, USA, Jan. 2004. [12] J. Tsumoci, K. Masayama, H. Ueara, and M. Yokoyama, Impact of mobility metric on routing protocols for mobile ad oc networks, Proc. IEEE PACRIM 03, pp.322 325, Victoria, Canada, Aug. 2003. [13] X. Perz-Costa, C. Bettstetter, and H. Hartenstein, Toward a mobility metric for comparable and reproducible results in ad oc networks researc, ACM Mobile Computing and Communications Review, vol.7, no.4, pp.58 60, Oct. 2003. [14] X. Li, and Q-A. Zeng, Modeling and analysis of multi-op wireless and mobile ad oc networks using te IEEE 802.11 DCF protocols, Proc. ICWN 04, pp.539 545, Las Vegas, USA, Jun. 2004. [15] Q-A. Zeng, and D. Agrawal, Modeling and efficient andling of andoffs in integrated wireless mobile networks, IEEE Trans. Veicular Tecnology, vol.51, no.6, pp.1469 1478, Nov. 2002. [16] LAN MBL vol.2005 no.28 pp.117 124 Mar. 2005. [17] D. Maltz, J. Broc, J. Jetceva and D. Jonson, Te Effects of On-Demand Beavior in Routing Protocols for Multi-Hop Wireless Ad Hoc Networks, IEEE J. Selected Areas on Communications, vol.17, no.8, pp.1439 1453, Aug. 1999. 1. req rep n rep δ req δ rep n rep [17] [17] VII VIII Caced RREP RREQ RREP Caced RREP RREQ OgReq N F wreq N RREP OgRep N F wrep N Caced RREP OgReq C F wreq C OgRep C F wrep C 1 RREQ RREQ RREQ Caced RREP RtReq N RtReq C RtReq N RtReq C = OgReqN +F wreq N OgReq N = OgReqC +F wreq C OgReq C (A 1) (A 2) δ req Caced RREP Caced RREP RREQ 9
xxxx/xx Vol. Jxx A No. xx δ req = RtReqC RtReq N = (OgReqC +F wreq C ) OgReq N (OgReq N +F wreq N ) OgReq C (A 3) [17] VII VIII δ req = (776 + 8812) 871 0.267 (A 4) (871 + 39471) 776 δ rep RREQ RREP 1982 1984 1987 1990 1994 2005 802.11 IEEE δ rep = OgRepC OgReq C (A 5) [17] VIII δ req = 8077/776 10.4 (A 6) Caced RREP RREP n rep n rep = OgRepC +wrep C OgRep C (A 7) [17] VIII n rep = (8077 + 8894)/8077 2.10 (A 8) xx xx xx 1993 1995 1996 1986 OS/ IEEE 10
Abstract In on-demand ad oc routing protocols suc as DSR, control messages tend to increase as te mobility and te number of nodes increase. On te oter and, it is reported tat te trougput of IEEE 802.11 DCF, wic is often used as te MAC layer in ad oc networks, is remarkably deteriorated wen idden nodes exist. We investigate ow muc control messages of routing protocol exert on te trougput wen idden nodes exist, in order to clarify quantitatively conditions were te ad oc networks using DCF are practical. In tis paper, we analyze te influence on trougput by te control messages of DSR numerically. As a result, we found tat te DSR control messages does not affect trougput if te node density is very low. Key words DSR, control messages, IEEE 802.11 DCF, trougput, idden terminals