Professional Documents
Culture Documents
Abstract
A multi-service multi-access protocol based on gated-polling control (MSGPMA) for ad hoc network was presented. Packets with
different service arrive at user terminal with different arrival rate, and could be transmitted with different transmission time. The
average queue length and approximated mean waiting time of MSGPMA protocol were obtained. The results show that the
simulation is in concordance with the theoretical analysis.
Keywords: Ad Hoc Network; Multi-Service; MAC; Polling; Waiting Time
ad hocMAC
*
650091
MAC(MSGP)
MSGP
MAC
Ad hoc
ad hoc
QoS
PCF WTRP ad hoc
MSGPMA
ad hoc MAC
1.1
Ad hoc
[1]
[2][3]ID[4]ad hoc
1.2
N
k (/)Poisson
k k (), k 1,..., N ID
1.3
[5]
(1)
Valuei t a1e
Vi t
a2 e
Ni t
a3 Ei t a4 1 Di t
(1)
Value Value Vi t i
Ni t i Ei t i Di t i
a1 a 2 a3 a 4 0 ak 1 k 1, , 4 k 1 ak 1 t
4
ad hoc MAC
[6]MSGPMAN
i ( i ) i ( N 1 )1 i 1
i j n 1 , j i i 1 t n 1 i
N-1 j 1, j i j n 1
N
2
i
i+1
i-1
i
i
(a) MSGPMA
1 MSGPMA
- 157 Copyright 2012 Ivy Publisher
(b) MSGPMA
2.1
(1) i
Ai zi , i A' 1 Ai" (1)
i
(2) i
Bi zi , i B' 1 Bi" (1)
i
(3) i
Ri zi , i R ' 1 Ri" (1)
i
(4)
(5) (FCFS)
(6)
2.2
k n , k 1, 2,..., N tn k N 1 ( )
Gi z1 ,
N
N
, zN Ri Aj z j Gi B1 Aj z j ,
j 1
j 1
N
, zN Ri Aj z j Gi z1 , z2 ,
j 1
Gi z1 ,
, Bi 1 Aj z j , zi , Bi 1 Aj z j ,
j 1
j 1
, Bi Aj z j ,
j 1
, BN Aj z j
j 1
, zN
(2)
(3)
3.1
t n i k gi (k )
gi (k )
lim
z1 , z2 ,..., zN 1
Gi ( z1 , z2 , , zN )
k 1, , N
zk
(2)(3) gi (i ) g i (m)
N
gi i
i k
k 1
N
1 k
, g i m
k 1
m k
k 1
N
1 k
k 1
j 1
j i
k 1
m j k
gi m
1 k
k 1
m m
; g i i
i i k
k 1
N
1 k
i i ; m 1,
i 1, i 1,
,N
k 1
3.2
2 Gl ( z1 , , z N )
, l i, i; j 1, 2, , N ; k 1, 2, , N (2)(3)
1
z j zk
gl ( j, k ) lim
z1 ,..., z N
(4)
gi i, j i j Ri" 1 i i j i j i 2i j i i i j Bi" 1 gi i i i gi j i i gi i, j
i j i2 gi i, i
(5)
gi j , k j k Ri" 1 i j k j k i 2 j k i i Bi" 1 j k gi i i j gi k
i k gi j k i gi i, j j i gi i, k gi j , k j k i2 gi i, i
(6)
(7)
(8)
2i m gi i, m i2 m n gi m, n gi i, i
m 1
m i
m 1 n 1
m i n i
gi i, j i j Ri" 1 i j ri ri j gi i i j m 2i j ri m i j Bm" 1 gi m
m 1
mi
(9)
j m gi i, m i j m n gi m, n
m 1
mi
m 1 n 1
m i n i
(10)
m 1 n 1
mi n i
gi j, k j k Ri" 1 j k ri j k m 2 j k ri m j k Bm" 1 gi m j k m n gi m, n
m 1
mi
(11)
m 1 n 1
m i n i
i j k (4)(11)
g i i, i
N
2
R" 1 r 2r B" 1 g m
i
i
i m
m
m
i
i
1 i 1 i2 2 2 i2 2 i 2
m 1
2 1 2 2 i i ri gi i 2 i i2 1 2 j gi j i2 1 i 2 2 i 2 2 3
N
(12)
j 1
j i
R" 1 i i 2 i i Bi" 1 gi i
i
m
m 1
mi
gi i , i [7][8]
E Wi
(1 i ) gi (i, i) Ai(1)
2i gi (i)
2i 2
(13)
MACMatlab7.0
33Poisson
1235400bit
54Mbit/s10us
12
1
1
(packet/slot)
(slot)
(slot)
g1(1) (packet)
g2(2) (packet)
g2(3) (packet)
0.1
0.2
0.3
0.7500
0.7487
1.5000
1.5080
2.2500
2.2561
0.1
0.1
0.1
0.7500
0.7503
0.7500
0.7482
0.7500
0.7490
0.05
0.05
0.05
0.6000
0.6048
0.6000
0.6026
0.6000
0.5999
0.05
0.01
0.005
10
20
0.2727
0.2703
0.0545
0.0542
0.0273
0.0263
0.05
0.01
0.005
10
20
0.2143
0.2151
0.0429
0.0423
0.0214
0.0214
2
1
(packet/slot)
(slot)
(slot)
W1 (slot)
W2 (slot)
W3 (slot)
0.1
0.2
0.3
4.2608
4.2823
4.6268
4.6106
5.0541
5.0404
0.1
0.1
0.1
4.9273
4.9826
5.4712
5.5186
5.9688
6.0596
0.05
0.05
0.05
13.6964
13.6766
13.5848
13.5856
13.5848
13.5846
0.05
0.01
0.005
10
20
6.6497
6.6596
6.2336
6.1247
6.2336
6.2335
0.05
0.01
0.005
10
20
3.8735
3.8759
4.0867
4.1344
4.0867
4.0753
123
(1)
(2)
(3)
(4) 0.30.75
0.01 /
0.05
ad hocMAC (MSGPMA)
MSGPMA
REFERENCES
[1] P. Gupta, P. R. Kumar. The capacity of wireless networks, IEEE Transaction on Information Theory, 2000, 46: 388-404
[2] J. A. Torkestani, M. R. Meybodi. Clustering the wireless Ad Hoc networks: A distributed learning automata approach. Journal of
Parallel Distributed Computing, 2010, 70: 394-405
[3] . Ad Hoc . , 2010, 22(5): 1226-1231
- 160 Copyright 2012 Ivy Publisher
1982-
1957-
2007
1983 7 1986 7
Email: gz_627@sina.com
Email: zhaodf123@263.net