DocumentCode :
392181
Title :
A modified contention resolution algorithm for W-CDMA
Author :
Shankar, Sai N.
Author_Institution :
Philips Res. Labs., Briarcliff Manor, NY, USA
Volume :
1
fYear :
2002
fDate :
17-21 Nov. 2002
Firstpage :
742
Abstract :
The emergence of wireless and personal communications has brought random access protocols for packet radio networks back to the research fore fronts. Most of the protocols are based on ALOHA protocol. Unfortunately this protocol is inherently unstable and requires sophisticated schemes to stabilize it. Another class of random access schemes, called limited sensing or stack algorithms, has been proposed that is stable and allows for the dynamic incorporation of new stations into the network. Indeed, after the second generation networks supporting voice service only, the third generation systems, UMTS (Universal Mobile Telecommunication System), should offer more services with quality. We analyze the possibility to apply the tree random access protocol for the W-CDMA (wideband-code division multiple access) part in the UTRA (UMTS Terrestrial Radio Access) radio interface proposition. The analytical model uses a modified version of the tree protocol which can be represented by a simple Geom/G/1 queue. We analyze this simple Geom/G/1 queue to predict the performance of the new random access protocol. It Is found that random access procedure is very stable and has higher channel capacity and lower access delay than the conventional slotted ALOHA access. It was also inferred that the protocol is insensitive to the way in which the tree runs, either breath first search or depth first search, thus giving the implementation flexibility. Also, simulation results are presented and show the predominance of this protocol compared with the conventional tree access mechanisms.
Keywords :
3G mobile communication; access protocols; broadband networks; channel capacity; code division multiple access; delays; multiuser channels; packet radio networks; personal communication networks; queueing theory; search problems; ALOHA protocol; Geom/G/1 queue; UMTS; UTRA Terrestrial Radio Access; UTRA radio interface; Universal Mobile Telecommunication System; W-CDMA; access delay; breath first search; channel capacity; channel capacity analysis; depth first search; limited sensing algorithms; modified contention resolution algorithm; packet radio networks; personal communications; random access protocol; random access protocols; second generation networks; simulation results; slotted ALOHA access; stack algorithms; third generation systems; tree protocol; tree random access protocol; voice service; waiting time analysis; wideband code division multiple access; wireless communications; 3G mobile communication; Access protocols; Analytical models; Channel capacity; Multiaccess communication; Packet radio networks; Performance analysis; Queueing analysis; Wireless communication; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
Print_ISBN :
0-7803-7632-3
Type :
conf
DOI :
10.1109/GLOCOM.2002.1188177
Filename :
1188177
Link To Document :
بازگشت