SlideShare a Scribd company logo
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 5, Ver. II (Sep - Oct .2015), PP 58-64
www.iosrjournals.org
DOI: 10.9790/2834-10525864 www.iosrjournals.org 58 | Page
Performance Improvements of the Umts Systems for Messages
Transfer
TarigShawgiAbdelrahman
†
, Amin Babiker A. Mustafa
†
, and Ismail El-Azhary
††
†Dept. of Telecommunications, Faculty of Engineering, Al Neelain University, Khartoum, Sudan
††Dept. of Computer Engineering, Faculty of Engineering, Al Neelain University, Khartoum, Sudan
Abstract: This paper addresses the improvement of the Universal Mobile Telecommunication System (UMTS)
performance in the transmission of short messages over Random Access Channel and dedicated channel. In
addition to call origination and registration messages,Random Access Channel (RACH)can carry traffic
including short message service packets. Throughput for message data transmission is evaluated as a function
of the offered network load. Two mathematical models are implemented,dedicated channel model1 which is
used to analyze the dedicated channelthroughput, and the proposed model which is used to analyzeRACH and
dedicated channel throughput, in the first model Random Access Channel only carry requests for transmissions
over dedicated channel, in the second model Random Access Channel carry either messages or requests of
transmission, so increasing the number of the received messages.
I. Introduction
Universal Mobile Telecommunication System (UMTS) is one of the major third generation mobile
communication system developed by ETSI. UMTS mark the move into the third generation of mobile networks
and isexpected to address the growing demand of mobile and internet applications for increasing capacity and
higher data rates that were the shortcoming of 2G and 2.5G (GPRS) [1]. UMTS supports multimedia and
various other applications like http, ftp, email, voip, sms , by the side of voice. UMTS supports a wide range of
data rates from 64kbps to 2 Mbps in the indoor and outdoor environments [1].
UMTS provides channels for services of non-real time applications, also provides channels for services
of real time applications. UMTS standard provides various channels for different types of traffic services,
Dedicated Channel (DCH), Downlink Shared Channel (DSCH) and the Forward Access Channel (FACH)
transmits packets in the downlink direction. DCH, Uplink Shared Channel (USCH) and Random Access
Channel (RACH) transmit packets in the uplink direction.
Dedicated channel can be used in two modes: one is the dedicated channel mode and the other is the
multiplexing mode. Dedicated channel mode guarantees the allocation of dedicated channel for the entire
duration of a session or a call and used for transmission of real time applications, the other mode is the
multiplexing mode in which the channel can be allocated to different packet users and used for transmission of
non-real time applications [1].
Investigating the UMTS system performance over dedicated channel based on buffer length allocation
and dynamic allocation control procedures was proposed in [1].Details of random access procedure is proposed
in [3] and [4]. Throughput of slotted aloha p persistence RACH and a detailed specifications of Radio Resource
Control (RRC) protocol are well discussed in [2]. Calculation of the throughput of RACH channel Common
Packet Channel CPCH is the main focus of [5] in which the probability of successful transmission given at least
one preamble transmission attempt was calculated first. Throughput analysis for Carrier Sense Multiple Access
CSMS- type random access protocol for finite number of users has been presented in [6]. Pure and slotted aloha
throughput was introduced in [7].
The main goal of this paper is to increase number of the received messages during busy hours,
messages can be carried either over DCH or RACH. We attempt to investigate the impact of various parameters
on the throughput such as offered network load and percentage of the offered network load on RACH and DCH.
The paper is organized as follows: section two including throughput of the dedicated channel model1, in section
3 we discuss throughput of the proposed model, in section 4 throughputs of the dedicated channel model1 and
the proposed model were compared and discussed, including effects of the variable values of the offered
network loadand its distribution percentage on the throughput, finally we concluded in section-5.
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 59 | Page
II. Dedicated channel Throughput
Fig(1):Dedicated Channel Model1
The throughput of the dedicated channel is well discussed in [1]. The dedicated channel access
mechanism is mathematically analyzed to study the performance in terms of throughput and access delay. The
overall system is divided in two individual stages as shown in fig (1), the first stage being RACH slotted aloha
channel and the other stage where in dedicated channel is allocated. As per the protocol users contend on the
RACH channel and if its request is successfully granted, the packets are transmitted on dedicated channel. Since
the stages are connected in cascade the throughput of both the stages are individually determined and multiplied
to get the overall throughput.S1 and S2are throughput of first and second stage respectively. The first stage is
asimple slotted aloha system and the second stage can be approximated to an M/M/m/m system [1].
2.1 RACH Throughput
RACH channel is the first stage of the model in fig(1) above. Before sending a short message over
RACH each user transmits a short burst called a preamble during one access slot of 1.33 ms, the preamble is
detected and acknowledged by the base station, each preamble is encoded by one of 16 signatures, the base
station acknowledges signatures in the AI (Acquisition Indication) message sent a predefined time interval after
the reception of the preamble[2]. The AI message does not acknowledge preambles individually, only signatures
that were used. If the base station does not have a resource (demodulator) to serve the incoming message it
sends a NACK for a particular signature [2]. In case signature was not used in a particular slot, or the preamble
was not detected a NoACK feedback will be sent in the corresponding AI message for this signature. If a
preamblereceived a NoACK feedback the user equipment assumes that the power was too low and preample is
retransmitted at higher power level [2]. After the preample is acknowledged the message is sent at a
predetermined time interval after the preample [2]. If a NACK feedback is received the message goes through a
random backoffprocedure[2]. The normalized RACH throughput in fig(1) is calculated as a function of the
average number of preamples sent per access slot (1.33ms),(G). Time can be represented as a sequence of idle
and busy periods. Each busy period resulting in either success or collision is of the same length M= (Tm/1.33)
slots [2].Tm is the total length of the preample and preample to message gab. M includes the overhead associated
with sending the preample denoted by α [2]. In RACH specifications α can be 3 or 4 [2]. We
assumesthatallpreamples are received at the power level above threshold, and we assumes that those transmitted
during the busy period do not affect the ongoing successful packet reception [2]. Cycle is defined as an idle
period followed by a busy period then according to poisson assumption consecutive cycles are independent[7].
In that case the average throughput is defined as:
S =
E[u]
E I +E[B]
……………………..…. (1)
Where U defined as the length of a useful transmission during a cycle, can be M –α or 0 depending on
whether the cycle results in a success or collision, respectively [2].
E I =
e−G
1−e−G
………………………… (2)
E[B] = M (3)
S =
Psucc (M−∝)(1−e−G )
e−G +M(1−e−G )
……………………..(4)
Psucc of a single signature was introduced in [7]
PSucc = P 1 pream.send|atleast 1 sent =
Ge −G
1−e−G
……….(5)
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 60 | Page
Throughput in case of single signature
S1=
Ge−G (M−α)
e−G +(1−e−G )M
…………………….(6)
2.2 Dedicated Channel Throughput
For the second stage the call blocking probability of an M/M/m/m is derived in [1].
Pm
=
λ
µ
m
m !
λ
µ
k
k!
m
k=0
……………………(7)
Where m is the number of dedicated channels.The probability of request successfully reaching at the
base station is
PSucc = 1 − Pm… (8)
Throughput of the second stage is given by:
S2 = PSucc ∗
T
τ
…….(9)
Whereτ is the request transmission time, T is the time granted for each request,λ is the arrival rate of
the successfully received requests at the base station, and μ is the request service time = 1/T (10)
the throughput of the second stage is
S2 = 1 −
λ
µ
m
m !
λ
µ
k
k!
m
k=0
∗
T
τ
………………………(11)
The overall throughput of the model in fig (1) S =
Ge−G (M−α)
e−G +(1−e−G )M
* 1 −
λ
µ
m
m !
λ
µ
k
k!
m
k=0
∗
T
τ
(requests/time
slot)………… (12)
III. Proposed model
Fig(2): The Proposed Model
As shown in fig (2), the total throughput of the proposed model is composed of S1 and S2, Stot = S1 +
S2 (13). In the proposed model RACH channel carry requests for transferring messages either over itself or
over dedicated channel. Every request successfully received at the base station granted transmission for time T
over dedicated channel or RACH channel.
S1=
XG e−XG
(M1−α)
e−XG +M1(1−e−XG )
∗ 1 −
λ
µ
m
m !
λ
µ
k
k!
m
k=0
∗
T
τ
……… (13)
Here M1 = 4.5a ……………………………………(14)
a(time slot) = 1.33 ms………………………………(15)
S2=
(1−X)G e−(1−X)G
(M2−α)
e−(1−X)G +M2(1−e−(1−X)G )
……………….. (16)
M2 = 34.5*a…………………………………..(17)
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 61 | Page
Stotal =
XG e−XG
(M1−α)
e−XG +M1(1−e−XG )
∗ 1 −
λ
µ
m
m !
λ
µ
k
k!
m
k=0
∗
T
τ
+
(1−X)G e−(1−X)G
(M2−α)
e−(1−X)G +M2 1−e− 1−X G
(req/time slot)…….(18)
X is defined as the percentage of requests for transmission of SMSover the dedicated channel, 0≤X≤1. Where (1
- X) is defined as the percentage of requests for transmission of SMS over RACH channel.
IV. Results and Discussion
Fig (3):Throughput versus offered load of the dedicated model1.
Fig (3) shows the throughput versus the offered load (G) of the dedicated channel in
model1,throughput is rapidly increased from 0 which is minimum throughput value at (G=0) up to 0.557which
is the maximum throughput obtained at (G=1), then throughput declared with increasing the offered load G.
Fig (4): Throughput of the proposed model versus offered load (G) at different values of (X)
0
0.1
0.2
0.3
0.4
0.5
0.6
0 1 2 3 4 5 6 7 8 9 10
T
h
r
o
u
g
h
P
u
t
G
G Versus Thoughput
0
0.2
0.4
0.6
0.8
1
1.2
1.4
0 1 2 3 4 5 6 7 8 9 10
T
h
r
o
u
g
h
P
u
t
G
G Versus Thoughput
x=1
x=0.75
x=0.5
x=0.25
x=0
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 62 | Page
Fig (4) illustrates throughput of the proposed model versus offered load (G) at different values of (X), it
have seen that the throughput of the proposed model is higher than model1 for all X values, except at X=1 at
which throughputs of model1 and proposed model are equal and at X=0 at which the proposed mode throughput
is lower than model1 throughput.Also it is clear that for decreasing X values the rate of throughput degradation
decreases with increasing the offered load G,the optimum value of X for G≤6 is 0.75 and for G≥ 6is 0.25.
Fig (5), (6) and (7) illustrates the optimum (X) values to obtain maximum throughput, it is clear that the impact
of X on throughput is more significant near 0 or 1.
Fig(5): Throughput versus X at the offered load G = 1
Fig(5) shows throughput versus X for the offered load (G = 1). As shown the minimum throughput is
0.522 which is obtained at X=0. For 0≤X≤0.07 throughput is rapidly increased from 0.552 up to 1.011, for
0.07≤X≤0.77 throughput is gradually increasing approximately in linear manner from 1.011 up to 1.294 which
is the maximum throughput of G=1, throughput for 0.77≤X≤1 rapidly declared from 1.294 down to 0.557.
Fig(6): Throughput versus X at offered load G=4
Fig(6) shows throughput versus X at offered load( G=4). Throughput at 0≤X≤0.06 is rapidly increased
from 0.068 which is the minimum throughput up to 0.633. At 0.06≤X≤0.93 throughput is gradually
0
0.2
0.4
0.6
0.8
1
1.2
1.4
0
0.07
0.14
0.21
0.28
0.35
0.42
0.49
0.56
0.63
0.7
0.77
0.84
0.91
0.98
T
h
r
o
u
g
h
P
u
t
X
X Versus Thoughput
G=1
0
0.2
0.4
0.6
0.8
1
1.2
0
0.07
0.14
0.21
0.28
0.35
0.42
0.49
0.56
0.63
0.7
0.77
0.84
0.91
0.98
T
h
r
o
u
g
h
P
u
t
X
X Versus Thoughput
G=4
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 63 | Page
increasedfrom 0.633 up to 1.044 which is the maximum throughput. Throughput at 0.93≤X≤1 is rapidly
decreased from 1.044 down to 0.283.
Fig(7): Throughput versus X at offered load G=7
Fig(7) illustrates throughput versus X at offered load G=7,it is shown that the minimum throughput is
0.005 which is obtained at X=0, throughput is rapidly increased from 0.005 up to 0.576 at X=0.09, at
0.09≤X≤0.61 throughput is gradually decreased from 0.576 down to 0.424, at 0.61≤X≤0.97 throughput
increased from 0.424 up to 0.777 which is the maximum throughput, at 0.97≤X≤1 throughput is rapidly
decreased from 0.777 down to 0.04.
V. Conclusion
In this paper the throughput of messages transferred by UMTS is improved. Two mathematical
performance models are analyzed in terms of throughput. In dedicated channel model, RACH channel is solely
used for requests transmission. In the proposed model RACH is used for requests and messages transmission,
this led to increase number of the received messages.
For the proposed model, the impact of the offered load percentages (X) and (1-X) applied on the
dedicated channel and RACH channel respectively, on the total system throughputis investigated. It is clearly
shown that distributing the offered load with any percentage(0<X<1) results in increasing throughput compared
with transmitting the whole offered load either on dedicated or RACH channel. According to the offered load G
the optimum (X) value and maximum throughput could be obtained.
References
[1]. ManjuSarvagya and Ratnam V. Raja Kumar, “Performance analysis of the UMTS system for packet data transfer over dedicated
channels,”
[2]. Ivan N Vukovic and TylerBrown,“Performance analysis of the Random Access channel in WCDMA” IEEE2001.
[3]. GPP TS 25.331 “Radio Resource Control Protocol Specifications,” (Release 2004).
[4]. 3GPP TS 25.214 “Physical layer procedure,” (FDD) (Release 2004).
[5]. Ivan N Vukovic. “Throughput Comparison of Random Access Schemes in 3GPP
[6]. Hideagi Takagi, Leonard Kleinrock, “Throughput Analysis for Persistent CSMA Systems”, IEEE Transactions on communications,
July 1985.
[7]. L. Kleinrock and F. Tobagi, “Packet Switching in Radio Channels: part 1- Carrier Sense M ultiple Access Models and Their
Troughput-Delay Characteristics,” IEEE Trans. Commun, COM-23, NO. 12,PP. 1400-1416,Dec 1975.
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
0
0.07
0.14
0.21
0.28
0.35
0.42
0.49
0.56
0.63
0.7
0.77
0.84
0.91
0.98
T
h
r
o
u
g
h
P
u
t X
X Versus Thoughput
G=7
Performance Improvements of the Umts Systems for Messages Transfer
DOI: 10.9790/2834-10525864 www.iosrjournals.org 64 | Page
TarigShawgireceived his BSc in ElectronicEngineering from Military TechnicalCollege,
Egypt in 1993.He did his MSc in Computer&NetworkEngineeringfrom Faculty of
Engineering,AlgazeeraUniversity,Sudan in 2002.He is now doing his PhD research in the field of QoS with the
Department of Telecommunications, Al Neelain University. Currently he is a Lecturer with Electrical
Engineering Department, the Jordian Sudanese College.His research interest includes QoS in
telecommunications.
Amin Babiker A/Nabi Mustafa obtained his B.Sc. & M.Sc. from the university of Khartoum
in 1990 & 2001 respectively. He obtained his Ph.D. from Alneelain University in 2007. He was the head of
Computer Eng. Dept. from 2001 to 2004. Then he became the vice-dean. He has been the dean, Faculty of
Engineering Alneelain University since 2009. His research areas includeQoS in Communication Systems,
Traffic Engineering, Service Costing Disciplines & Networking. Associated Prof. Dr. Amin is a Consultant
Engineer. He is a member of the Sudan Engineering Council. He is also a member of the Executive Committee
of the Federation of Sudanese Engineers. Dr. Amin supervised or supervising more than 30 Ph.D. or M.Sc.
students.Since 2002 up to April 2015 when he became the Secretary of Academic Affairs in Alneelain
university.
Ismail El-Azharyreceived his BSc (Hons) degree from the University of Khartoum (Sudan)
in1979. In 1989 he obtained his PhD degree from the University of Bradford (UK). He joined Omdurman
Islamic University in 1992 as an assistant professor. Then, he moved to the Sudan University of Science and
Technology as an associate professor in 1994. He became the Dean of the Faculty of Engineering, Al Neelain
University from 2000 to 2005. His research interests include: QoS of networks, technical communication, digital
typography, e-learning, antennas and propagation, and embedded systems. Dr El-Azhary is a Chartered
Engineer and member of the IET. .

More Related Content

What's hot

A cross layer delay-aware multipath routing algorithm for mobile adhoc networks
A cross layer delay-aware multipath routing algorithm for mobile adhoc networksA cross layer delay-aware multipath routing algorithm for mobile adhoc networks
A cross layer delay-aware multipath routing algorithm for mobile adhoc networks
csandit
 
Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...
ijwmn
 
Channel quality
Channel qualityChannel quality
Channel quality
Saraswathi Venkataraman
 
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
ijwmn
 
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute OperationsQuantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
journalBEEI
 
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerDelay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
AM Publications
 
Comparative study on priority based qos
Comparative study on priority based qosComparative study on priority based qos
Comparative study on priority based qos
ijwmn
 
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
journal ijrtem
 
Survey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lteSurvey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lte
ijngnjournal
 
Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningMaximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Eswar Publications
 
17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)
IAESIJEECS
 
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
ijwmn
 
Jt3516941700
Jt3516941700Jt3516941700
Jt3516941700
IJERA Editor
 
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
ijwmn
 
Multi-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON'sMulti-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON's
Mithileysh Sathiyanarayanan
 
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
IRJET Journal
 
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An OverviewQos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
IJERA Editor
 

What's hot (17)

A cross layer delay-aware multipath routing algorithm for mobile adhoc networks
A cross layer delay-aware multipath routing algorithm for mobile adhoc networksA cross layer delay-aware multipath routing algorithm for mobile adhoc networks
A cross layer delay-aware multipath routing algorithm for mobile adhoc networks
 
Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...
 
Channel quality
Channel qualityChannel quality
Channel quality
 
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...
 
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute OperationsQuantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute Operations
 
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerDelay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross Layer
 
Comparative study on priority based qos
Comparative study on priority based qosComparative study on priority based qos
Comparative study on priority based qos
 
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
 
Survey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lteSurvey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lte
 
Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningMaximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning
 
17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)
 
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)
 
Jt3516941700
Jt3516941700Jt3516941700
Jt3516941700
 
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...
 
Multi-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON'sMulti-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON's
 
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
IRJET- QOS Aware Manet Routing Protocol for Multimedia Traffic in an Adaptive...
 
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An OverviewQos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
Qos Enabled Communication Support over Multicast Ad Hoc Networks: An Overview
 

Viewers also liked

G012424452
G012424452G012424452
G012424452
IOSR Journals
 
B012240612
B012240612B012240612
B012240612
IOSR Journals
 
C1103011926
C1103011926C1103011926
C1103011926
IOSR Journals
 
Bipolar Disorder Investigation Using Modified Logistic Ridge Estimator
Bipolar Disorder Investigation Using Modified Logistic Ridge EstimatorBipolar Disorder Investigation Using Modified Logistic Ridge Estimator
Bipolar Disorder Investigation Using Modified Logistic Ridge Estimator
IOSR Journals
 
J010435966
J010435966J010435966
J010435966
IOSR Journals
 
I010246467
I010246467I010246467
I010246467
IOSR Journals
 
N0102196100
N0102196100N0102196100
N0102196100
IOSR Journals
 
P01051125133
P01051125133P01051125133
P01051125133
IOSR Journals
 
B013150813
B013150813B013150813
B013150813
IOSR Journals
 
Influence of soil texture and bed preparation on growth performance in Plectr...
Influence of soil texture and bed preparation on growth performance in Plectr...Influence of soil texture and bed preparation on growth performance in Plectr...
Influence of soil texture and bed preparation on growth performance in Plectr...
IOSR Journals
 
E017153342
E017153342E017153342
E017153342
IOSR Journals
 
E012623035
E012623035E012623035
E012623035
IOSR Journals
 
C017661419
C017661419C017661419
C017661419
IOSR Journals
 
P01741109117
P01741109117P01741109117
P01741109117
IOSR Journals
 
F011114153
F011114153F011114153
F011114153
IOSR Journals
 
A1103030111
A1103030111A1103030111
A1103030111
IOSR Journals
 
Modeling Object Oriented Applications by Using Dynamic Information for the I...
Modeling Object Oriented Applications by Using Dynamic  Information for the I...Modeling Object Oriented Applications by Using Dynamic  Information for the I...
Modeling Object Oriented Applications by Using Dynamic Information for the I...
IOSR Journals
 
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
IOSR Journals
 
G010523539
G010523539G010523539
G010523539
IOSR Journals
 
I1803056267
I1803056267I1803056267
I1803056267
IOSR Journals
 

Viewers also liked (20)

G012424452
G012424452G012424452
G012424452
 
B012240612
B012240612B012240612
B012240612
 
C1103011926
C1103011926C1103011926
C1103011926
 
Bipolar Disorder Investigation Using Modified Logistic Ridge Estimator
Bipolar Disorder Investigation Using Modified Logistic Ridge EstimatorBipolar Disorder Investigation Using Modified Logistic Ridge Estimator
Bipolar Disorder Investigation Using Modified Logistic Ridge Estimator
 
J010435966
J010435966J010435966
J010435966
 
I010246467
I010246467I010246467
I010246467
 
N0102196100
N0102196100N0102196100
N0102196100
 
P01051125133
P01051125133P01051125133
P01051125133
 
B013150813
B013150813B013150813
B013150813
 
Influence of soil texture and bed preparation on growth performance in Plectr...
Influence of soil texture and bed preparation on growth performance in Plectr...Influence of soil texture and bed preparation on growth performance in Plectr...
Influence of soil texture and bed preparation on growth performance in Plectr...
 
E017153342
E017153342E017153342
E017153342
 
E012623035
E012623035E012623035
E012623035
 
C017661419
C017661419C017661419
C017661419
 
P01741109117
P01741109117P01741109117
P01741109117
 
F011114153
F011114153F011114153
F011114153
 
A1103030111
A1103030111A1103030111
A1103030111
 
Modeling Object Oriented Applications by Using Dynamic Information for the I...
Modeling Object Oriented Applications by Using Dynamic  Information for the I...Modeling Object Oriented Applications by Using Dynamic  Information for the I...
Modeling Object Oriented Applications by Using Dynamic Information for the I...
 
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...
 
G010523539
G010523539G010523539
G010523539
 
I1803056267
I1803056267I1803056267
I1803056267
 

Similar to J010525864

Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...
Performance Evaluation of Finite Queue Switching  Under Two-Dimensional M/G/1...Performance Evaluation of Finite Queue Switching  Under Two-Dimensional M/G/1...
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...
Syeful Islam
 
2G3GISHO
2G3GISHO2G3GISHO
2G3GISHO
Navid Solhjoo
 
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
Elizabeth Williams
 
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidanceFault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
graphhoc
 
System performance evaluation of fixed and adaptive resource allocation of 3 ...
System performance evaluation of fixed and adaptive resource allocation of 3 ...System performance evaluation of fixed and adaptive resource allocation of 3 ...
System performance evaluation of fixed and adaptive resource allocation of 3 ...
Alexander Decker
 
Study on Performance of Simulation Analysis on Multimedia Network
Study on Performance of Simulation Analysis on Multimedia NetworkStudy on Performance of Simulation Analysis on Multimedia Network
Study on Performance of Simulation Analysis on Multimedia Network
IRJET Journal
 
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular NetworkQoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
IJSRD
 
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
IJECEIAES
 
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
IJECEIAES
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
IJNSA Journal
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
IJNSA Journal
 
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
IJCSEA Journal
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
IJNSA Journal
 
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETsSimulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
IOSR Journals
 
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
ijmnct
 
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
 SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO... SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
ijmnct
 
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
ijmnct
 
TanReport
TanReportTanReport
seminar report on multiple access control protocol submitted by munesh
seminar report on multiple access control protocol submitted by munesh seminar report on multiple access control protocol submitted by munesh
seminar report on multiple access control protocol submitted by munesh
meenamunesh
 
D0431013019
D0431013019D0431013019
D0431013019
ijceronline
 

Similar to J010525864 (20)

Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...
Performance Evaluation of Finite Queue Switching  Under Two-Dimensional M/G/1...Performance Evaluation of Finite Queue Switching  Under Two-Dimensional M/G/1...
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...
 
2G3GISHO
2G3GISHO2G3GISHO
2G3GISHO
 
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
A Heuristic Algorithm For The Resource Assignment Problem In Satellite Teleco...
 
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidanceFault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
 
System performance evaluation of fixed and adaptive resource allocation of 3 ...
System performance evaluation of fixed and adaptive resource allocation of 3 ...System performance evaluation of fixed and adaptive resource allocation of 3 ...
System performance evaluation of fixed and adaptive resource allocation of 3 ...
 
Study on Performance of Simulation Analysis on Multimedia Network
Study on Performance of Simulation Analysis on Multimedia NetworkStudy on Performance of Simulation Analysis on Multimedia Network
Study on Performance of Simulation Analysis on Multimedia Network
 
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular NetworkQoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
QoS -Aware Spectrum Sharing for Multi-Channel Vehicular Network
 
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
An Accurate Performance Analysis of Hybrid Efficient and Reliable MAC Protoco...
 
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
 
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
Classical Discrete-Time Fourier TransformBased Channel Estimation for MIMO-OF...
 
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHMY-HAMILTONIAN LAYERS BROADCAST ALGORITHM
Y-HAMILTONIAN LAYERS BROADCAST ALGORITHM
 
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETsSimulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
 
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
Secondary User Undercover Cooperative Dynamic Access Protocol for Overlay Cog...
 
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
 SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO... SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...
 
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...
 
TanReport
TanReportTanReport
TanReport
 
seminar report on multiple access control protocol submitted by munesh
seminar report on multiple access control protocol submitted by munesh seminar report on multiple access control protocol submitted by munesh
seminar report on multiple access control protocol submitted by munesh
 
D0431013019
D0431013019D0431013019
D0431013019
 

More from IOSR Journals

A011140104
A011140104A011140104
A011140104
IOSR Journals
 
M0111397100
M0111397100M0111397100
M0111397100
IOSR Journals
 
L011138596
L011138596L011138596
L011138596
IOSR Journals
 
K011138084
K011138084K011138084
K011138084
IOSR Journals
 
J011137479
J011137479J011137479
J011137479
IOSR Journals
 
I011136673
I011136673I011136673
I011136673
IOSR Journals
 
G011134454
G011134454G011134454
G011134454
IOSR Journals
 
H011135565
H011135565H011135565
H011135565
IOSR Journals
 
F011134043
F011134043F011134043
F011134043
IOSR Journals
 
E011133639
E011133639E011133639
E011133639
IOSR Journals
 
D011132635
D011132635D011132635
D011132635
IOSR Journals
 
C011131925
C011131925C011131925
C011131925
IOSR Journals
 
B011130918
B011130918B011130918
B011130918
IOSR Journals
 
A011130108
A011130108A011130108
A011130108
IOSR Journals
 
I011125160
I011125160I011125160
I011125160
IOSR Journals
 
H011124050
H011124050H011124050
H011124050
IOSR Journals
 
G011123539
G011123539G011123539
G011123539
IOSR Journals
 
F011123134
F011123134F011123134
F011123134
IOSR Journals
 
E011122530
E011122530E011122530
E011122530
IOSR Journals
 
D011121524
D011121524D011121524
D011121524
IOSR Journals
 

More from IOSR Journals (20)

A011140104
A011140104A011140104
A011140104
 
M0111397100
M0111397100M0111397100
M0111397100
 
L011138596
L011138596L011138596
L011138596
 
K011138084
K011138084K011138084
K011138084
 
J011137479
J011137479J011137479
J011137479
 
I011136673
I011136673I011136673
I011136673
 
G011134454
G011134454G011134454
G011134454
 
H011135565
H011135565H011135565
H011135565
 
F011134043
F011134043F011134043
F011134043
 
E011133639
E011133639E011133639
E011133639
 
D011132635
D011132635D011132635
D011132635
 
C011131925
C011131925C011131925
C011131925
 
B011130918
B011130918B011130918
B011130918
 
A011130108
A011130108A011130108
A011130108
 
I011125160
I011125160I011125160
I011125160
 
H011124050
H011124050H011124050
H011124050
 
G011123539
G011123539G011123539
G011123539
 
F011123134
F011123134F011123134
F011123134
 
E011122530
E011122530E011122530
E011122530
 
D011121524
D011121524D011121524
D011121524
 

Recently uploaded

Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success StoryDriving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Safe Software
 
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift.pdfMonitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Tosin Akinosho
 
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 202420240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
Matthew Sinclair
 
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxOcean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
SitimaJohn
 
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfHow to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
Chart Kalyan
 
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceAI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
IndexBug
 
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfUnlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Malak Abu Hammad
 
WeTestAthens: Postman's AI & Automation Techniques
WeTestAthens: Postman's AI & Automation TechniquesWeTestAthens: Postman's AI & Automation Techniques
WeTestAthens: Postman's AI & Automation Techniques
Postman
 
GenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizationsGenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizations
kumardaparthi1024
 
How to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptxHow to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptx
danishmna97
 
20240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 202420240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 2024
Matthew Sinclair
 
Columbus Data & Analytics Wednesdays - June 2024
Columbus Data & Analytics Wednesdays - June 2024Columbus Data & Analytics Wednesdays - June 2024
Columbus Data & Analytics Wednesdays - June 2024
Jason Packer
 
Digital Marketing Trends in 2024 | Guide for Staying Ahead
Digital Marketing Trends in 2024 | Guide for Staying AheadDigital Marketing Trends in 2024 | Guide for Staying Ahead
Digital Marketing Trends in 2024 | Guide for Staying Ahead
Wask
 
Artificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopmentArtificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopment
Octavian Nadolu
 
Introduction of Cybersecurity with OSS at Code Europe 2024
Introduction of Cybersecurity with OSS  at Code Europe 2024Introduction of Cybersecurity with OSS  at Code Europe 2024
Introduction of Cybersecurity with OSS at Code Europe 2024
Hiroshi SHIBATA
 
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Speck&Tech
 
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
名前 です男
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
innovationoecd
 
Choosing The Best AWS Service For Your Website + API.pptx
Choosing The Best AWS Service For Your Website + API.pptxChoosing The Best AWS Service For Your Website + API.pptx
Choosing The Best AWS Service For Your Website + API.pptx
Brandon Minnick, MBA
 
Nordic Marketo Engage User Group_June 13_ 2024.pptx
Nordic Marketo Engage User Group_June 13_ 2024.pptxNordic Marketo Engage User Group_June 13_ 2024.pptx
Nordic Marketo Engage User Group_June 13_ 2024.pptx
MichaelKnudsen27
 

Recently uploaded (20)

Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success StoryDriving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
 
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift.pdfMonitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift.pdf
 
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 202420240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
 
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxOcean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
 
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfHow to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
 
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceAI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
 
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfUnlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
 
WeTestAthens: Postman's AI & Automation Techniques
WeTestAthens: Postman's AI & Automation TechniquesWeTestAthens: Postman's AI & Automation Techniques
WeTestAthens: Postman's AI & Automation Techniques
 
GenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizationsGenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizations
 
How to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptxHow to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptx
 
20240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 202420240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 2024
 
Columbus Data & Analytics Wednesdays - June 2024
Columbus Data & Analytics Wednesdays - June 2024Columbus Data & Analytics Wednesdays - June 2024
Columbus Data & Analytics Wednesdays - June 2024
 
Digital Marketing Trends in 2024 | Guide for Staying Ahead
Digital Marketing Trends in 2024 | Guide for Staying AheadDigital Marketing Trends in 2024 | Guide for Staying Ahead
Digital Marketing Trends in 2024 | Guide for Staying Ahead
 
Artificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopmentArtificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopment
 
Introduction of Cybersecurity with OSS at Code Europe 2024
Introduction of Cybersecurity with OSS  at Code Europe 2024Introduction of Cybersecurity with OSS  at Code Europe 2024
Introduction of Cybersecurity with OSS at Code Europe 2024
 
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
 
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
 
Choosing The Best AWS Service For Your Website + API.pptx
Choosing The Best AWS Service For Your Website + API.pptxChoosing The Best AWS Service For Your Website + API.pptx
Choosing The Best AWS Service For Your Website + API.pptx
 
Nordic Marketo Engage User Group_June 13_ 2024.pptx
Nordic Marketo Engage User Group_June 13_ 2024.pptxNordic Marketo Engage User Group_June 13_ 2024.pptx
Nordic Marketo Engage User Group_June 13_ 2024.pptx
 

J010525864

  • 1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 5, Ver. II (Sep - Oct .2015), PP 58-64 www.iosrjournals.org DOI: 10.9790/2834-10525864 www.iosrjournals.org 58 | Page Performance Improvements of the Umts Systems for Messages Transfer TarigShawgiAbdelrahman † , Amin Babiker A. Mustafa † , and Ismail El-Azhary †† †Dept. of Telecommunications, Faculty of Engineering, Al Neelain University, Khartoum, Sudan ††Dept. of Computer Engineering, Faculty of Engineering, Al Neelain University, Khartoum, Sudan Abstract: This paper addresses the improvement of the Universal Mobile Telecommunication System (UMTS) performance in the transmission of short messages over Random Access Channel and dedicated channel. In addition to call origination and registration messages,Random Access Channel (RACH)can carry traffic including short message service packets. Throughput for message data transmission is evaluated as a function of the offered network load. Two mathematical models are implemented,dedicated channel model1 which is used to analyze the dedicated channelthroughput, and the proposed model which is used to analyzeRACH and dedicated channel throughput, in the first model Random Access Channel only carry requests for transmissions over dedicated channel, in the second model Random Access Channel carry either messages or requests of transmission, so increasing the number of the received messages. I. Introduction Universal Mobile Telecommunication System (UMTS) is one of the major third generation mobile communication system developed by ETSI. UMTS mark the move into the third generation of mobile networks and isexpected to address the growing demand of mobile and internet applications for increasing capacity and higher data rates that were the shortcoming of 2G and 2.5G (GPRS) [1]. UMTS supports multimedia and various other applications like http, ftp, email, voip, sms , by the side of voice. UMTS supports a wide range of data rates from 64kbps to 2 Mbps in the indoor and outdoor environments [1]. UMTS provides channels for services of non-real time applications, also provides channels for services of real time applications. UMTS standard provides various channels for different types of traffic services, Dedicated Channel (DCH), Downlink Shared Channel (DSCH) and the Forward Access Channel (FACH) transmits packets in the downlink direction. DCH, Uplink Shared Channel (USCH) and Random Access Channel (RACH) transmit packets in the uplink direction. Dedicated channel can be used in two modes: one is the dedicated channel mode and the other is the multiplexing mode. Dedicated channel mode guarantees the allocation of dedicated channel for the entire duration of a session or a call and used for transmission of real time applications, the other mode is the multiplexing mode in which the channel can be allocated to different packet users and used for transmission of non-real time applications [1]. Investigating the UMTS system performance over dedicated channel based on buffer length allocation and dynamic allocation control procedures was proposed in [1].Details of random access procedure is proposed in [3] and [4]. Throughput of slotted aloha p persistence RACH and a detailed specifications of Radio Resource Control (RRC) protocol are well discussed in [2]. Calculation of the throughput of RACH channel Common Packet Channel CPCH is the main focus of [5] in which the probability of successful transmission given at least one preamble transmission attempt was calculated first. Throughput analysis for Carrier Sense Multiple Access CSMS- type random access protocol for finite number of users has been presented in [6]. Pure and slotted aloha throughput was introduced in [7]. The main goal of this paper is to increase number of the received messages during busy hours, messages can be carried either over DCH or RACH. We attempt to investigate the impact of various parameters on the throughput such as offered network load and percentage of the offered network load on RACH and DCH. The paper is organized as follows: section two including throughput of the dedicated channel model1, in section 3 we discuss throughput of the proposed model, in section 4 throughputs of the dedicated channel model1 and the proposed model were compared and discussed, including effects of the variable values of the offered network loadand its distribution percentage on the throughput, finally we concluded in section-5.
  • 2. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 59 | Page II. Dedicated channel Throughput Fig(1):Dedicated Channel Model1 The throughput of the dedicated channel is well discussed in [1]. The dedicated channel access mechanism is mathematically analyzed to study the performance in terms of throughput and access delay. The overall system is divided in two individual stages as shown in fig (1), the first stage being RACH slotted aloha channel and the other stage where in dedicated channel is allocated. As per the protocol users contend on the RACH channel and if its request is successfully granted, the packets are transmitted on dedicated channel. Since the stages are connected in cascade the throughput of both the stages are individually determined and multiplied to get the overall throughput.S1 and S2are throughput of first and second stage respectively. The first stage is asimple slotted aloha system and the second stage can be approximated to an M/M/m/m system [1]. 2.1 RACH Throughput RACH channel is the first stage of the model in fig(1) above. Before sending a short message over RACH each user transmits a short burst called a preamble during one access slot of 1.33 ms, the preamble is detected and acknowledged by the base station, each preamble is encoded by one of 16 signatures, the base station acknowledges signatures in the AI (Acquisition Indication) message sent a predefined time interval after the reception of the preamble[2]. The AI message does not acknowledge preambles individually, only signatures that were used. If the base station does not have a resource (demodulator) to serve the incoming message it sends a NACK for a particular signature [2]. In case signature was not used in a particular slot, or the preamble was not detected a NoACK feedback will be sent in the corresponding AI message for this signature. If a preamblereceived a NoACK feedback the user equipment assumes that the power was too low and preample is retransmitted at higher power level [2]. After the preample is acknowledged the message is sent at a predetermined time interval after the preample [2]. If a NACK feedback is received the message goes through a random backoffprocedure[2]. The normalized RACH throughput in fig(1) is calculated as a function of the average number of preamples sent per access slot (1.33ms),(G). Time can be represented as a sequence of idle and busy periods. Each busy period resulting in either success or collision is of the same length M= (Tm/1.33) slots [2].Tm is the total length of the preample and preample to message gab. M includes the overhead associated with sending the preample denoted by α [2]. In RACH specifications α can be 3 or 4 [2]. We assumesthatallpreamples are received at the power level above threshold, and we assumes that those transmitted during the busy period do not affect the ongoing successful packet reception [2]. Cycle is defined as an idle period followed by a busy period then according to poisson assumption consecutive cycles are independent[7]. In that case the average throughput is defined as: S = E[u] E I +E[B] ……………………..…. (1) Where U defined as the length of a useful transmission during a cycle, can be M –α or 0 depending on whether the cycle results in a success or collision, respectively [2]. E I = e−G 1−e−G ………………………… (2) E[B] = M (3) S = Psucc (M−∝)(1−e−G ) e−G +M(1−e−G ) ……………………..(4) Psucc of a single signature was introduced in [7] PSucc = P 1 pream.send|atleast 1 sent = Ge −G 1−e−G ……….(5)
  • 3. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 60 | Page Throughput in case of single signature S1= Ge−G (M−α) e−G +(1−e−G )M …………………….(6) 2.2 Dedicated Channel Throughput For the second stage the call blocking probability of an M/M/m/m is derived in [1]. Pm = λ µ m m ! λ µ k k! m k=0 ……………………(7) Where m is the number of dedicated channels.The probability of request successfully reaching at the base station is PSucc = 1 − Pm… (8) Throughput of the second stage is given by: S2 = PSucc ∗ T τ …….(9) Whereτ is the request transmission time, T is the time granted for each request,λ is the arrival rate of the successfully received requests at the base station, and μ is the request service time = 1/T (10) the throughput of the second stage is S2 = 1 − λ µ m m ! λ µ k k! m k=0 ∗ T τ ………………………(11) The overall throughput of the model in fig (1) S = Ge−G (M−α) e−G +(1−e−G )M * 1 − λ µ m m ! λ µ k k! m k=0 ∗ T τ (requests/time slot)………… (12) III. Proposed model Fig(2): The Proposed Model As shown in fig (2), the total throughput of the proposed model is composed of S1 and S2, Stot = S1 + S2 (13). In the proposed model RACH channel carry requests for transferring messages either over itself or over dedicated channel. Every request successfully received at the base station granted transmission for time T over dedicated channel or RACH channel. S1= XG e−XG (M1−α) e−XG +M1(1−e−XG ) ∗ 1 − λ µ m m ! λ µ k k! m k=0 ∗ T τ ……… (13) Here M1 = 4.5a ……………………………………(14) a(time slot) = 1.33 ms………………………………(15) S2= (1−X)G e−(1−X)G (M2−α) e−(1−X)G +M2(1−e−(1−X)G ) ……………….. (16) M2 = 34.5*a…………………………………..(17)
  • 4. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 61 | Page Stotal = XG e−XG (M1−α) e−XG +M1(1−e−XG ) ∗ 1 − λ µ m m ! λ µ k k! m k=0 ∗ T τ + (1−X)G e−(1−X)G (M2−α) e−(1−X)G +M2 1−e− 1−X G (req/time slot)…….(18) X is defined as the percentage of requests for transmission of SMSover the dedicated channel, 0≤X≤1. Where (1 - X) is defined as the percentage of requests for transmission of SMS over RACH channel. IV. Results and Discussion Fig (3):Throughput versus offered load of the dedicated model1. Fig (3) shows the throughput versus the offered load (G) of the dedicated channel in model1,throughput is rapidly increased from 0 which is minimum throughput value at (G=0) up to 0.557which is the maximum throughput obtained at (G=1), then throughput declared with increasing the offered load G. Fig (4): Throughput of the proposed model versus offered load (G) at different values of (X) 0 0.1 0.2 0.3 0.4 0.5 0.6 0 1 2 3 4 5 6 7 8 9 10 T h r o u g h P u t G G Versus Thoughput 0 0.2 0.4 0.6 0.8 1 1.2 1.4 0 1 2 3 4 5 6 7 8 9 10 T h r o u g h P u t G G Versus Thoughput x=1 x=0.75 x=0.5 x=0.25 x=0
  • 5. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 62 | Page Fig (4) illustrates throughput of the proposed model versus offered load (G) at different values of (X), it have seen that the throughput of the proposed model is higher than model1 for all X values, except at X=1 at which throughputs of model1 and proposed model are equal and at X=0 at which the proposed mode throughput is lower than model1 throughput.Also it is clear that for decreasing X values the rate of throughput degradation decreases with increasing the offered load G,the optimum value of X for G≤6 is 0.75 and for G≥ 6is 0.25. Fig (5), (6) and (7) illustrates the optimum (X) values to obtain maximum throughput, it is clear that the impact of X on throughput is more significant near 0 or 1. Fig(5): Throughput versus X at the offered load G = 1 Fig(5) shows throughput versus X for the offered load (G = 1). As shown the minimum throughput is 0.522 which is obtained at X=0. For 0≤X≤0.07 throughput is rapidly increased from 0.552 up to 1.011, for 0.07≤X≤0.77 throughput is gradually increasing approximately in linear manner from 1.011 up to 1.294 which is the maximum throughput of G=1, throughput for 0.77≤X≤1 rapidly declared from 1.294 down to 0.557. Fig(6): Throughput versus X at offered load G=4 Fig(6) shows throughput versus X at offered load( G=4). Throughput at 0≤X≤0.06 is rapidly increased from 0.068 which is the minimum throughput up to 0.633. At 0.06≤X≤0.93 throughput is gradually 0 0.2 0.4 0.6 0.8 1 1.2 1.4 0 0.07 0.14 0.21 0.28 0.35 0.42 0.49 0.56 0.63 0.7 0.77 0.84 0.91 0.98 T h r o u g h P u t X X Versus Thoughput G=1 0 0.2 0.4 0.6 0.8 1 1.2 0 0.07 0.14 0.21 0.28 0.35 0.42 0.49 0.56 0.63 0.7 0.77 0.84 0.91 0.98 T h r o u g h P u t X X Versus Thoughput G=4
  • 6. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 63 | Page increasedfrom 0.633 up to 1.044 which is the maximum throughput. Throughput at 0.93≤X≤1 is rapidly decreased from 1.044 down to 0.283. Fig(7): Throughput versus X at offered load G=7 Fig(7) illustrates throughput versus X at offered load G=7,it is shown that the minimum throughput is 0.005 which is obtained at X=0, throughput is rapidly increased from 0.005 up to 0.576 at X=0.09, at 0.09≤X≤0.61 throughput is gradually decreased from 0.576 down to 0.424, at 0.61≤X≤0.97 throughput increased from 0.424 up to 0.777 which is the maximum throughput, at 0.97≤X≤1 throughput is rapidly decreased from 0.777 down to 0.04. V. Conclusion In this paper the throughput of messages transferred by UMTS is improved. Two mathematical performance models are analyzed in terms of throughput. In dedicated channel model, RACH channel is solely used for requests transmission. In the proposed model RACH is used for requests and messages transmission, this led to increase number of the received messages. For the proposed model, the impact of the offered load percentages (X) and (1-X) applied on the dedicated channel and RACH channel respectively, on the total system throughputis investigated. It is clearly shown that distributing the offered load with any percentage(0<X<1) results in increasing throughput compared with transmitting the whole offered load either on dedicated or RACH channel. According to the offered load G the optimum (X) value and maximum throughput could be obtained. References [1]. ManjuSarvagya and Ratnam V. Raja Kumar, “Performance analysis of the UMTS system for packet data transfer over dedicated channels,” [2]. Ivan N Vukovic and TylerBrown,“Performance analysis of the Random Access channel in WCDMA” IEEE2001. [3]. GPP TS 25.331 “Radio Resource Control Protocol Specifications,” (Release 2004). [4]. 3GPP TS 25.214 “Physical layer procedure,” (FDD) (Release 2004). [5]. Ivan N Vukovic. “Throughput Comparison of Random Access Schemes in 3GPP [6]. Hideagi Takagi, Leonard Kleinrock, “Throughput Analysis for Persistent CSMA Systems”, IEEE Transactions on communications, July 1985. [7]. L. Kleinrock and F. Tobagi, “Packet Switching in Radio Channels: part 1- Carrier Sense M ultiple Access Models and Their Troughput-Delay Characteristics,” IEEE Trans. Commun, COM-23, NO. 12,PP. 1400-1416,Dec 1975. 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 0 0.07 0.14 0.21 0.28 0.35 0.42 0.49 0.56 0.63 0.7 0.77 0.84 0.91 0.98 T h r o u g h P u t X X Versus Thoughput G=7
  • 7. Performance Improvements of the Umts Systems for Messages Transfer DOI: 10.9790/2834-10525864 www.iosrjournals.org 64 | Page TarigShawgireceived his BSc in ElectronicEngineering from Military TechnicalCollege, Egypt in 1993.He did his MSc in Computer&NetworkEngineeringfrom Faculty of Engineering,AlgazeeraUniversity,Sudan in 2002.He is now doing his PhD research in the field of QoS with the Department of Telecommunications, Al Neelain University. Currently he is a Lecturer with Electrical Engineering Department, the Jordian Sudanese College.His research interest includes QoS in telecommunications. Amin Babiker A/Nabi Mustafa obtained his B.Sc. & M.Sc. from the university of Khartoum in 1990 & 2001 respectively. He obtained his Ph.D. from Alneelain University in 2007. He was the head of Computer Eng. Dept. from 2001 to 2004. Then he became the vice-dean. He has been the dean, Faculty of Engineering Alneelain University since 2009. His research areas includeQoS in Communication Systems, Traffic Engineering, Service Costing Disciplines & Networking. Associated Prof. Dr. Amin is a Consultant Engineer. He is a member of the Sudan Engineering Council. He is also a member of the Executive Committee of the Federation of Sudanese Engineers. Dr. Amin supervised or supervising more than 30 Ph.D. or M.Sc. students.Since 2002 up to April 2015 when he became the Secretary of Academic Affairs in Alneelain university. Ismail El-Azharyreceived his BSc (Hons) degree from the University of Khartoum (Sudan) in1979. In 1989 he obtained his PhD degree from the University of Bradford (UK). He joined Omdurman Islamic University in 1992 as an assistant professor. Then, he moved to the Sudan University of Science and Technology as an associate professor in 1994. He became the Dean of the Faculty of Engineering, Al Neelain University from 2000 to 2005. His research interests include: QoS of networks, technical communication, digital typography, e-learning, antennas and propagation, and embedded systems. Dr El-Azhary is a Chartered Engineer and member of the IET. .