Professional Documents
Culture Documents
Email: zhaodf123@263.net
Abstract
The RR (Round Robin) scheme adopted in PCF (Point Coordination Function) of WLAN seems difficult to guarantee QoS and
satisfy the low delay of the sensitive traffic, yet it can hardly differentiate from priority service for the specific polling station. Thus
we develop an improved polling model with priority service, multi-level-polling mechanism and mixed service discipline to
enhance the RR scheme. With the help of Embedded Markov Chain and Probability Generating Function Method, we set up the
mathematical model for the proposed polling system, and make preparations for the closed form expressions of the system
parameters.
Keywords: WLAN; PCF; Polling System; Modeling and Analyzing
WLAN PCF *
1 2 2
1. 650051
2. 650091
WLAN PCF (Point Coordination Function) RR (Round Robin)
WLAN PCF
Markov
WLANPCF
N
N [13]
20 50 70
80
[4-9]
Ad Hoc EPON (Ethernet Passive Optical Network)
[10-16]
[4][6][7][17,18] Markov
[1,3,19,20]
: (No.69862001,F0424104,60362001,61072079)
- 27 http://www.sjie.org/
OFDM
WLAN
[20,21] WLAN PCF (Point Coordination Function ) RR (Round Robin)
[12,22]
WLAN PCF Markov
(Common Station)N
(K=1)
AP (Access Point)
AP
K K=1
WLAN PCF
PCF RR
(K=1)
1 Markov
1 WLAN PCF
2.1
1 h
AP tn i
N+1 i x1 , x2 ,, xi ,, xN , xh AP i
K(K=1) i (n)
j ( j 1,2,, N , h
j i) j ( i ) AP t *
n
h h
1 (n* ), 2 (n* ),, N (n* ), h (n* )
P[ j n* y j ; j 1, 2,
, N , h] N+1
ih y1 , y2 ,..., y N , yh AP h h (n* ) j
j ( h ) i+1 t n1
j ( j 1,2,, N , h
t n1 tn t n*
Markov Markov
[3,10,19,22]
2.2
(1) i
A(z) A(1) 2 A(1) 2 h
2
2
Ah (z ) h Ah (1) h Ah(1) h h
(2) i
B(z) B(1) 2 B(1) 2 h
2
2
Bh (z ) h Bh (1) h Bh(1) h h
(3) 1 h
R(z) R(1) 2 R(1) 2
(4) h
Fh (z )
(5) FCFS(First Come First
Service)
2.3
tn N+1
N
i 1
i 1
Markov i i i h 1 i i i ; h h h ; i 1, 2,
, N
limP[ j n x j ; j 1, 2, , N , h] i x x ,
1,
x,
x ,x
(1)
x x ,, x ,, x , x
G (z , z , , z , z ) x x , , x , , x , x z x z x z x z x z x
1,
x1 x 2
xi
xN xh
1,
t n* ih y1 , y2 ,..., y N , yh
- 29 http://www.sjie.org/
i 1,2, N
(2)
yi 0
y , y ,..., y
yN 0 yh 0
ih
, yh z1 y1 z2 y2 ...zi yi ...z N yn zh yh
i 1,2, N
(3)
j 1, 2,
, N, h
j 1, 2,
,N
ji
h (n 1) h (ui )
j ( n 1) j ( n ) j (ui ) j (vh )
h ( n ) t n* h h (n) tn h
j ( n ) t n* j ( j 1,2,, N )
j (n) tn j( j 1,2,, N
j i) i (n )
t n* i h (n 1) t n1 h
j (n 1) t n1 j( j 1,2,, N
j i)
t n*
N
j ( n* ) h ( n* )
Gih ( z1 , z2 , , z N , zh ) lim E z j zh
j 1
n
j i
N n* n*
lim E z j j zh h i n k P i n k
n
k 0
j 1
N ( n* )
*
*
( n* )
lim E z j j zhh ( n ) i n 0 P i n 0 lim E z j j zhh ( n ) i n k P i n k
n
n
k 1
j 1
j 1
n j ui h n h ui i ui
lim E z j j
zh
zi
i n 0 P i n 0
j 1
n
j i
n j i h n h i i n i i 1
lim E z j j
zh
zi
i n k P i n k
j 1
n
k 1
j i
N u
n
lim E z j j i E z j j zhh n zi0 i n 0 P i n 0
j 1
jj 1i
N
N
n
lim E z j j i zh h i zi1 E z j j zhh n zii n i n k P i n k
n
j 1
k 1 jj 1i
Ri Ah zh Aj z j Gi z1 , , zi , , z N , zh
j 1
zi 0
1
Bi Ah zh Aj z j Gi z1 , , zi , , z N , zh Gi z1 , , zi , , z N , zh
zi
j 1
zi 0
N
N
j 1
j 1
z i
t n1
N
( n1) h ( n1)
Gi1 ( z1 , z2 ,, z N , zh ) lim E z j j
zh
j 1
n
j i
- 30 http://www.sjie.org/
(4)
( n* ) j ( i ) j ( h ) h ( i )
lim E z j j
zh
j 1
n
j i
( n* ) j ( h )
( )
lim E z j j
E z j j i zhh ( i )
j 1
n
j 1
j i
N
N
N
N
( n )
(v )
Ri A j ( z j ) Fi Ai ( zi ) lim E z j j
z j j h
j 1
n j 1
i 1
j 1
j i
N
N
N
h
( n )
Ri A j ( z j )Ah ( z h ) lim E z j j
A j ( z j )
n
j 1
j 1
j 1
h ( n )
N
N j ( n ) N
Ri A j ( z j )Ah ( z h ) lim
E z j
Bh A j ( z j )Fh A j ( z j )
n
j 1
j 1
j 1
j 1
N
N
Gih z1 , z 2 , z N , Bh A j z j Fh
A j z j
j 1
j 1
N
N
Gih z1 , z 2 , z N , Bh A j z j Fh
A j z j
j 1
(5)
i 1,2, N
Fh(1)
Fh zh
h h
h
1 h h 1 h
(6)
2
2
Fh( z ) Ah( z )( Bh ( z )) 2 1 Fh ( z ) Ah ( z ) Bh( z )1 Fh( z ) Ah ( z ) Bh ( z )2 Fh( z ) Fh( z )
2
2
Fh(1) Ah(1) h2 1 Fh (1) h Bh(1)1 Fh(1) h h 2 Fh(1) Fh(1)
Ah(1) h2
Bh(1)h
2 h2
2
(1 h ) 2 1 h
(1 h )
1
1 h
1
Ah(1) h2 Bh(1)h 2 h2 (1 h )
(1 h ) 3
(7)
(4)(5)
[22] 1100bit
11Mbps 10s 70s 10s
2 (=7, =1)
- 31 http://www.sjie.org/
2
3
3 (=7, =1)
WLAN PCF
Markov
REFERENCES
[1] Hideaki Takagi. Mean message waiting times in symmetric multiqueue systems with cyclic service[J]. Performance Evaluation,
1985, 5(4): 271-277
[2] H. Levy, M. Sidi. Polling systems: applications, modeling and optimization[J]. IEEE Transactions on Communications, 1990,
38(10): 1750-1759
[3] H. Takagi. Application of polling models to computer networks[J]. Computer Networks, 1991,22(3): 193-211
[4] Alan G. Konheim, Bernd Meister. Service in a loop system[J]. Journal of the Association for Computing Machinery. 1972, 19(1):
92-108
[5] Rubin I, De Moraes L F. Message delay analysis for polling and token multiple-access schemes for local communication
networks[J]. IEEE Journal on Selected Areas in Communications, 1983, 1(3): 935-947
[6] M.J. Ferguson and Y. J. Aminetzah. Exact Results for Nonsymmetric Token Ring Systems[J]. IEEE Transactions on Communications,
1985, 31(5): 223-231
[7] Konheim A. G. Descendent set: an efficient approach for analysis of polling systems[J]. IEEE Transactions on Communications,
1994, 42(8): 1245-1253
[8] Hwang L C. An exact analysis of an asymmetric polling system with mixed service discipline and general service order[J].
Computer Communications, 1997, 20(10): 1293-1299
[9] Romano Fantacci, Luca Zoppi. Performance evaluation of polling systems for Wireless Local Communication Networks[J]. IEEE
Transactions on Vehicular Technology, 2000, 49(6): 2148-2157
[10] , , , . [J]. , 2004, 27(9): 1213-1220
- 32 http://www.sjie.org/
[11] Jane Y. Y., Peter H. J. Chong. A Survey of clustering schemes for mobile Ad Hoc networks[J]. IEEE Communications Surveys &
Tutorials, 2005, 7 (1): 32- 48
[12] Tao Li, Logothetis D. Analysis of a polling system for telephony traffic with application to wireless LANs. IEEE Transactions on
Wireless Communications, 2006, 5(6): 1284-1293
[13] Chunsheng Cao, Rupo Yin, Weidong Zhang. Mean waiting time approximation for a real time polling system[J]. High Technology
Letters, 2007, 13(2): 136-139
[14] Ben-Jye Chang,Yan-Ling Chen. Adaptive hierarchical polling and Markov decision process based CAC for increasing network
reward and reducing average delay in IEEE 802.16 WiMAX networks[J]. Computer Communications, 2008, 31(10): 2280-2292
[15] Eldad P. IEEE 802.11n development: History, process and technology[J]. IEEE Communication Magazine, 2008, 46(7): 48-55
[16] Lim, W., Yang, Y., Milosavljevic M.. Multicast polling for 10G-EPON[J]. Electronics Letters, 2012, 48(9): 513-514
[17] Onno Boxma, Josine Bruin, Brian Fralix. Sojourn times in polling systems with various service disciplines[J]. Performance
Evaluation, 2009, 66(5): 621-639
[18] M. A. A. Boon, I. J. B. F. Adan, O. J. Boxma. A polling model with multiple priority levels[J]. Performance Evaluation 2010,
67(1): 468-484
[19] , , , . MAC [J]. , 2010, 38(7): 1-1456
[20] Yiqing Zhou, Tung-Sang Ng, Jiangzhou Wang. OFCDM: a promising broadband wireless access technique[J]. IEEE Communications
Magazine, 2008, 46(3): 38-49
[21] Yiqing Zhou, Jiangzhou Wang, Sawahashi, M.. Downlink transmission of broadband OFCDM Systems-part I: hybrid detection[J].
IEEE Transactions on Communications, 2005, 53(4): 718-729
[22] Qianlin Liu, Dongfeng Zhao, Dongming Zhou. An analytic model for enhancing IEEE 802.11 coordination function media access
control protocol[J]. European Transactions on Telecommunications, 2011, 22(6): 332-338
1966-
1957-
1989 7 1995 3
1983 7 1986 7
2011 1
Email: zhaodf123@263.net
Email: liuqianlin@sina.com
3
1986-
2008 7
2011 7
Email: yfzhao@163.com
- 33 http://www.sjie.org/