QOS in cellular network based on MPT

CHAPTER 1
INTRODUCTION
In recent years, there has been a rapid increase in wireless network deployment and
mobile device market penetration. With vigorous research that promises higher data rates,
future wireless networks will likely become an integral part of the global communication
infrastructure. Ultimately, wireless users will demand the same reliable service as of
todays wire line telecommunications and data networks. However, there are some unique
problems in cellular networks that challenge their service reliability. In addition to
problems introduced by fading, user mobility places stringent requirements on network
resources. Whenever an active mobile terminal (MT) moves from one cell to another, the
call needs to be handed off to the new baseStation (BS), and network resources must be
reallocated. Resource demands could fluctuate abruptly due to the movement of high data
rate users. Quality of Service (QoS) degradation or even forced termination may occur
when there are insufficient resources to accommodate these handoffs.If the system has
prior knowledge of the exact trajectory of every MT, it could take appropriate steps to
reserve resources, so that QoS may be guaranteed during the MTs connection lifetime.
However, such an ideal scenario is very unlikely to occur in real life. Instead, much of the
work on resource reservation has adopted a predictive approach.
For example, Liu uses pattern matching techniques and a self adaptive extended
Kalman filter for next-cell prediction based on cell sequence observations, signal strength
measurements, and cell geometry assumptions. In Levine et al, propose the concept of a
shadow cluster - a set of BSs to which a MT is likely to attach in the near future. The
scheme estimates the probability of each MT being in any cell within the shadow cluster
for future time intervals, based on knowledge aboutindividual MT's dynamics and call
holding patterns.In the United States, the FCC recently mandates that cellular-service
providers must be able to pinpoint a wireless emergency call's originating location to
within 125 m. This spurs intensive research in mobile tracking techniques. One promising
approach is the integration of a global positioning system (GPS) receiver in each MT. It is
very reasonable to expect assisted GPS positioning methods to yield an accuracy of under
20 m during 67 percent of the time. During 2003-2009, a new batch of GPS satellites will
be launched to include two additional civilian carrier frequencies that could potentially
yield positioning accuracy within 1 m for civilian users, even without the use of ground-
based augmentation system. As more breakthroughs in positioning techniques take place,

Dept. of ECE,ATMECE , MYSORE Page 1

QOS in cellular network based on MPT
fuelled by the strong interest in location-based services from the industry, MTs are likely
equipped with reasonably accurate location tracking capability in the near future. The
time is thus ripe for active research into how such inherent tracking capability may be
harnessed to bring about a leap in wireless network services.

1.1 History of QOS

One exciting research area in which mobile positioning is extremely valuable is mobility
prediction. The use of real-time positioning information for mobility prediction could
potentially give rise to better accuracy and greater adaptability to time-varying conditions
than previous methods. The availability of a practical and accurate mobility prediction
technique could open the door to many applications such as resourcereservation, location
management, location-based services, and others that might have yet to be
identified.While there has been previous work that attempts to perform mobility
prediction based on mobilepositioning, none of the work has addressed the fact that the
cell boundary is normally fuzzy andirregularly shaped due to terrain characteristics and
the existence of obstacles that interfere with radio wavepropagation. Instead, either
hexagonal or circular cell boundaries have been assumed for simplicity.

Our research seeks to develop mobility prediction techniques that utilize real-time
mobile positioninginformation without the need for any cell geometry assumption. While
the positioning accuracy of currentcommercially available GPS-based MTs is still poor,
our work is built upon the assumption that future MTscould achieve much better accuracy
than today (say<10 m). we have developed a decentralizedprediction scheme, in which
individual MTs equipped with positioning capability shall perform mobilitypredictions
based on approximated cell boundary data that were downloaded from the serving BS.
Theapproximated cell boundary is represented as a series of points around the BS; these
points are computedbased on the previous handoff locations reported by other MTs. In
that scheme, road topology informationhas not been incorporated. Since MTs that are
carried in vehicles would encounter more frequent handoffs,they are the ones that would
benefit most from mobility predictions, and are therefore the main focus of ourwork.
Because vehicles travel on roads, the incorporation of road topology information into the
predictionalgorithm could potentially yield better accuracy.

In this article, we consider a centralized approach, inwhich each BS shall perform

mobility predictions for individual active MTs within its coverage area. Sincea BS has

Dept. of ECE,ATMECE , MYSORE Page 2

QOS in cellular network based on MPT
more computational and storageresources than a MT does, we can afford to incorporate
roadinformation into our prediction scheme for better accuracy.

1.3Organization of report
The rest of the report is organized as follows. As we have already seen Chapter 1
provided introduction, history, concept of QOS and QOSoverview. Details of this seminar
and the methodology is also shown in Chapter 2. Chapter 3 provides the working of QOS.
Chapter 4 provides the complete Application of this seminar and also the conclusion .

Dept. of ECE,ATMECE , MYSORE Page 3

QOS in cellular network based on MPT

CHAPTER 2
QUALITY OF SERVICE(QoS)
Quality of Service (QoS) in cellular networks is defined as the capability of the cellular
serviceproviders to provide a satisfactory service which includes voice quality, signal
strength, low call blocking and dropping probability, high data rates for multimedia and
data applications etc.
For network based services QoS depends on the following factors
Throughput The rate at which the packets go through the network. Maximum
rate is alwayspreferred.
Delay This is the time which a packet takes to travel from one end to the other.
Minimum delay is always preferred.
Packet Loss Rate The rate at which a packet is lost. This should also be as
minimum as
possible.
Packet Error Rate This is the errors which are present in a packet due to
corrupted bits. Thisshould be as minimum as possible
Reliability The availability of a connection. (Links going up/down). It is for these
reasons that providing QoS has been a great challenge in the past and it continues
to be a hot topic as there is still a lot of scope to provide better service standards.

2.1 Need of QoS

Imagine a situation where you are hardly able to hear what your friend is talking over the
phone or the phone gets cut when you are talking something important. These things are
highly undesirable and you do not want to get low quality service for paying high
monthly bills. Communication plays a major role in todays world and to support it QoS
has to be given maximum priority. It is important to differentiate the traffic based on
priority level. Some traffic classes should be given higher priority over other classes.
Example: voice should be given a higher priority compared to data traffic as voice is still
considered as the most important service. It should be noted that more preference has to
be given to customers who pay more to get better service, without affecting the remaining
customers who pay normal amount. To realize all these things effective QoS schemes are
needed. Issues and schemes related to providing better QoS is the main subject of this
report.

Dept. of ECE,ATMECE , MYSORE Page 4

QOS in cellular network based on MPT

2.2 Quality of Service Challenges

In wireless mobile networks QoS refers to the measurement of a system with good
transmission quality,service availability and minimum delay.
The major challenges when considering QoS in cellular networks arevarying rate
channel characteristics, bandwidth allocation, fault tolerance levels and handoff
supportamong heterogeneous wireless networks. It is fortunate that each layer which
includes physical, MAC,
IP, TCP and application have got their own mechanisms to provide QoS. It is important to
guaranteeQoS in each layer so that the network is more flexible and tolerant to QoS
issues. Someof the otherchallenges are efficient usage of the spectrum as its availability is
limited. Bandwidth allocation plays amajor role with respect to this aspect. It must be
made sure that bandwidth is allocated in an efficientmanner and also the remaining
bandwidth should not be wasted. Some schemes like Renegotiationscheme takes care of
this issue by allocating the remaining bandwidth to lower priorityclasses. Things get even
more complicated when data and voice service has to be supported. Voiceservices are
very delay sensitive and require real - time service. On the other hand data services are
lessdelay sensitive but are very sensitive to loss of data and also they expect error free
packets. So boththese factors have to be considered for providing QoS for voice and data
services.

2.3 Achievements in QoS till now

In 1G networks basic voice services with analog based protocols was provided. In2G
networks such as GSM and CDMA there was only one aspect of QoS and it isvoice.
Providing quality speech was the major concern. In 3G networks QoS has to be provided
forvoice as well as data. Still priority is given for voice services as they are considered as
the primaryservice. They are very delay sensitive and require real - time service. Data
services are comprised of text, internet and multimedia. In 4G network Qos was designed
primarily for data, IP-based protocols(LTE) were introduced whch are also less delay
sensitive and require real time service.

2.4 Attributes of QoS

Maximum bit rate (kbps) is defined as the maximum number of bits delivered
by theUniversal Mobile Telecommunication System (UMTS) and to the UMTS at
a Service Access Point (SAP) within a period of time, divided by the duration of
the period.
Dept. of ECE,ATMECE , MYSORE Page 5
QOS in cellular network based on MPT
The maximum bit rate is the upper limit a user or application can accept or
provide.
The purpose of this attribute is
(1) To limit the delivered bit rate to applications or external networks with such
limitation.
(2) To allow maximum waned user bit rate to be defined for applications able to
operate
with different rates.
Guaranteed bit rate (kbps) is defined as the guaranteed number of bits delivered
by UMTS at a SAP within a period of time (provided that there is data to deliver),
divided by the duration of the period. The purpose of this attribute is that it
describes the bit rate the UMTS bearer service shall guarantee to the user or
application.
Delivery order (y/n) indicates whether the UMTS bearer shall provide in -
sequence SDU delivery or not. The purpose of this attribute is to know whether
out- of - sequence SDU is allowed or not.
Maximum SDU size (octets): is defined as the maximum SDU size for which the
network shall satisfy the negotiated QoS. The purpose of this attribute is that it is
used for admission control and policing and optimizing transport.
SDU format information (bits) defines the list of possible exact sizes of SDUs.
SDU error ratio: indicates the fraction of SDUs lost or detected as error packets.
SDU error ratio is defined only for conforming traffic. The purpose of this
attribute is that it is used to configure the protocols, algorithms and error detection
scheme.
Residual bit error ratio: indicates the undetected bit error ratio in the delivered
SDUs. If no error detection is requested, Residual bit error ratio indicates the bit
error ratio in the delivered SDUs. The purpose is that it is used to configure radio
interface protocols, algorithms and error detection coding.
Traffic handing priority specifies the relative importance of handling of all
SDUs belonging to the UMTS bearer compared to the SDUs of other bearers.
Delivery of erroneous SDUs (y/n) indicates whether SDUs detected as erroneous
should be delivered or discarded. This is used to decide whether error detection is
required or not and also whether frames detected as errors should be thrown or
not.

Dept. of ECE,ATMECE , MYSORE Page 6

QOS in cellular network based on MPT

Transfer delay (ms) is defined as the maximum delay for 95th percentile of the
distribution of delay for all delivered SDUs during the lifetime of a bearer service,
where delay for an SDU is defined as the time from request to transfer and SDU at
one SAP to its delivery at the other SAP .

2.5Different QoS Schemes in Cellular Networks

There are many QoS schemes which have been deployed for cellular networks and each
scheme has its own advantages and disadvantages. In this section we are going to look
into some of the fundamental and effective QoS schemes which are used for providing
voice and data services. Fault Tolerant Dynamic Allocation scheme looks into methods of
reusing the channels effectively between two cells, which are separated by a minimum
distance so that they do not interfere with each other. The channels are allocated
dynamically as opposed to static allocation where the channels are allocated and reserved
beforehand. The next scheme is the Call Admission Control (CAC) which employs pre -
blocking of calls based on the available bandwidth for handling calls. This algorithm is
based on two schemes which were used earlier namely Pre request scheme and the guard
channel scheme. CAC algorithm utilizes both the schemes and gives better performance
in terms of successful call completion rates (SCCR) and provides guaranteed QoS for
profiled users. In the Mobility prediction techniques hand off losses are reduced and due
to which the blocking and the dropping probabilities are significantly reduced. In this
mobility prediction scheme road topology information is gathered and stored in a
database and the path or the trajectory of the mobile host is calculated. No assumption
aboutthe shape of the cell is assumed. The renegotiation scheme is a scheme in which the
bandwidthallocation is changed dynamically based on the availability. If a low priority
service has been admitted with a bandwidth less than what it had asked and after
sometime extra bandwidth is available due to completion of a high priority service then
the remaining bandwidth is given to the low priority service and thus increases the QoS of
the lower priority service.

Dept. of ECE,ATMECE , MYSORE Page 7

QOS in cellular network based on MPT

CHAPTER 3
QOS BASED ON MOBILITY PREDICTION
TECHNIQUE
Mobile prediction techniques are employed to find the path or the trajectory of a mobile
node and it is stored in a database from time to time. This technique helps in reserving
resources for MH before a hand off occurs so prioritizing resources takes place for a node
before its hand off and thus this decreases the call blocking rate at hand offs. However the
new call admission rate is reduced as more resources are reserved for hand off calls.
Forced termination can be reduced by increasing the number of new call blocking
probability. But this is not very efficient utilization of the radio resources. By using
mobile prediction techniques, we can know in advance when a handoff will take place
and so dynamic allocation of resources for the handoff can be done. This ensures that the
new call blocking probability is not increased so much to preserve resources for the hand
off calls. There are many mobile prediction techniques which have been employed in the
past which includes GPS positioning methods in which each MH is integrated with a GPS
receiver so that the path of the MH can be traced.

3.1 Road Topology based Mobile Prediction Techniques

This technique is based on the fact that MHs in vehicles will encounter the most frequent
hand offs andso studying their characteristics would prove to be more beneficial. Since
the vehicles travel on the road,the road topology is studied and is used in the prediction
algorithm. In this scheme the base station will do the mobile prediction based on the road
topology information it has. Since the base station has morestorage capability and
resources than the MH, it is used for better accuracy.

In this technique there are several base stations, which are updated with the MHs
latest position at regular interval of time. Each base station will maintain a database
which contains information about the road topology. As shown in figure 3.1 the road
which consists of bends are broken into many piecewise linear line segments and the
coordinates for these line segments are stored separately. The database has information
such as average time to transit a segment, neighboring segments at each junction and the
probability of the MH to do a hand off and go to a next neighboring segment. The
database is updated periodically and at every instant the information about the location of
the MH is obtained.

Dept. of ECE,ATMECE , MYSORE Page 8

QOS in cellular network based on MPT
Segments which have already had hand offs arereferred to as handoff probable segments.
Using this model, accurate prediction is done, which is useful in prioritizing resources for
the handoff of an MH.

Figure3.1: Utilizing road topology information for mobility prediction

In our proposed technique, we require the serving BS to receive updated information

about each active MTs position at regular time intervals. This will consume several bytes
per second of wireless bandwidth for each MT, which might be negligible for future

Dept. of ECE,ATMECE , MYSORE Page 9

QOS in cellular network based on MPT
wireless services. In order to incorporate road information into the mobility predictions,
each BS needs to maintain a database of the roads within its coverage area. We shall treat
the road between two neighboring junctions as a road segment, and identify each segment
using a junction pair (J1, J2), where a junction can be interpreted as the intersection of
roads, e.g. T-junction or cross-junction.
The approximate coordinates of each junction pair are to be stored in the database.
Since a road segment may contain bends, it can be broken down further into piecewise-
linear linesegments. The coordinates defining these line segments within each road
segment are also recorded.

All theabove coordinates could be easily extracted from existing digital maps
previously designed for GPS-basednavigational devices. Infrequent updates to these maps
are foreseen because new roads are not constructedvery often, while existing road layouts
are seldom modified.

The database also stores some important information about each road segment.
Since two-way roads wouldprobably have different characteristics for each direction, the
database shall store information correspondingto opposite directions separately.
Information stored in the database includes the average time taken totransit the segment,
the neighboring segments at each junction, and the corresponding probability that a
MTtraveling along the segment would select each of these neighboring segments as its
next segment. Thesetransition probabilities could be automatically computed from the
previous paths of other MTs. Thedatabase will be updated periodically every Tdatabase
since many of its elements are dependent on currenttraffic conditions.

In reality, the transition probabilities between road segments would probably vary
with time and trafficconditions. For stochastic processes whose statistics vary slowly with
time, it is often appropriate to treat theproblem as a succession of stationary problems.
We propose to model the transition between road segmentsas a second-order Markov
process, and we assume that it is stationary between database update instances soas to
simplify the computations. Based on this model, the conditional distribution of a MT
choosing aneighboring segment given all its past segments is assumed to be dependent
only on the current segmentand the immediate prior segment.
Using the road topology shown in Fig.3.1 as an illustration, consider twoMTs
(MT1 andMT2) that are currently traveling from junction B towards junction E. MT1
came fromsegment CB, while MT2 came from segment AB. Based on the assumed

Dept. of ECE,ATMECE , MYSORE Page 10

QOS in cellular network based on MPT
model, the conditional probabilityof MT1 going to segment EF will be computed
differently from that of MT2.

If previous handoffs have occurred along a road segment, the probability of a

handoff occurring in thatsegment is computed from previous data observed. The handoff
probability, the target handoff cell, as wellas the average time and position at which
handoffs occur after entering the segment, are recorded. We shallrefer to a segment that
has experienced previous handoffs as a handoff-probable segment (HPS).
Anassumption made here is that MTs traveling along the same road segment in the same
direction as previousMTs that have encountered handoffs are likely to encounter handoffs
themselves.

Using the model described above, we could determine via chain rule the
conditional probabilities ofreaching and handing off at each of the HPSs from segments
that are several hops away.

We could alsoestimate the average time required to reach them, using current
position and speed information, as well aspreviously collected statistics corresponding to
each segment along the paths. The target handoff cellcorresponding to each HPS is also
available from the database.We could in turn estimate the probabilitythat a MT would
hand off to each neighboring BS within any specified threshold time.

3.2 Handoff Prioritization via Dynamic Resource Reservation

Among the many possible applications for which an accurate mobility prediction
technique would be a valuable tool, this article focuses on applying mobility predictions
to dynamically adjust wireless resource reservations, so as to improve the efficiency of
handoff prioritization schemes. In the classic handoff prioritization problem, handoff
requests are prioritized over new call requests by reserving wireless resources at each BS
that could only be utilized by incoming handoffs. The prioritization of handoffs is
necessary so as to improve the users perception of QoS, because forced termination of an
ongoing call during handoff (due to insufficient resources at the new BS) is generally
more objectionable than the blocking of a new call request. Since any such resource
reservation would inevitably increase the blocking probability of new calls, and reduce
the overall system resource utilization, it is therefore extremely important that the
reservations are made as sparingly as possible while achieving the desired degree of
handoff prioritization. In this way, wireless service providers would be able to provision
high qualityservices without compromising their revenues unnecessarily.

Dept. of ECE,ATMECE , MYSORE Page 11

QOS in cellular network based on MPT
Early work in handoff prioritization proposed static reservation at each BS, in
which a fixed portion of the radio capacity is permanently reserved for handoffs.
However, this approach is unable to handle variable traffic load and mobility; it might
underutilize precious radio resources when handoffs are less frequent, and could
experience high forced terminations when mobility is high. On the other hand, the use of
real-time mobility predictions for resource reservations has the merit of being more robust
to changes in traffic conditions. This is potentially more efficient than static reservation
and non-predictive schemes. As mentioned earlier, several previous attempts to utilize
mobility predictions for resource reservations have the shortcoming of relying on
unrealistic cell geometry assumptions. Theapplicability and performance of these
techniques in actual networks are therefore unclear. Our previous work presented is the
first handoff prioritization scheme based on mobility predictions that considerIrregular
cell boundaries. However, the prediction model still has room for improvement it does
not utilizeroad topology information, but merely uses instantaneous speed and direction
for mobility predictions.

Since MTs that are carried in vehicles are the ones that would encounter the most
frequent handoffs, and theincorporation of road information improves the prediction
accuracy for such MTs, our new mobilityprediction technique described in this article
could potentially achieve more efficient resource reservations.

In our scheme, each BS shall have a reservation target (Rtarget) that is updated
periodically according to theprojected demands of anticipated handoffs from neighboring
cells. A new call is accepted if the remainingresource after its acceptance is at least
Rtarget. For a handoff request, the admission control rule is morelenient it is admitted so
long as there is sufficient remaining capacity to accommodate the handoff,regardless of
the value of Rtarget.
At each location update instant, say every 1 sec, all active MTs within the cell report their
positions to theBS. Given both currently and previously reported positions, the BS uses
an appropriate map-matching algorithm to determine the road segment that each MT is
transiting. The speed of the MT is alsoestimated.
Using the information stored in the database, the BS could estimate the probability
that a MTwould hand off to a neighboring cell within any threshold time Tthreshold.The
reservation target Rtarget at each BS is to be updated every TRSV.

During each update, the BS estimatesthe amount of resources it needs to reserve at

each neighboring cell on behalf of those active MTs currentlywithin its coverage.

Dept. of ECE,ATMECE , MYSORE Page 12

QOS in cellular network based on MPT
Resources are reserved only for those MTs that might hand off to these neighborswithin
Tthreshold. Suppose the probability that MT iwould hand off to neighboring cell Cjwithin
Tthreshold isestimated to be p, and the resource requirement of MTis Ri. The amount of
resources to be reserved in Cjon behalf of MT iis computed as the product of p and Ri.
The reservation requirements for all MTs thatcould hand off to a neighboring cell Cjare
aggregated before being conveyed to Cjs BS using a singlerequest message.

The threshold time could be interpreted as the time given to the target BS to set
aside the requestedamount of spare resources for the anticipated handoffs. During this
time, spare resources are accumulated asthey are released by active MTs that either end
their calls or hand off to other cells; new calls are blocked solong as Rtarget is
compromised. Thus, the value of Tthreshold could indirectly affect the forced
terminationprobability (PFT) experienced by handoff calls entering the cell. Since the
required value of Tthreshold for thesame target PFT could vary over time when there are
changes in dynamic factors such as system load, trafficconditions, user mobility, etc.,
Tthreshold should be dynamically adjusted to keep PFT at the desired targetvalue. We
utilize an adaptive algorithm used to control its value. The algorithm counts the number
offorced terminations among a number of observed handoffs. It increases Tthreshold by 1
sec if the measuredforced termination ratio exceeds a preset value, and decreases it by 1
sec otherwise. In the algorithm, thevalue of Tthreshold is limited to the range [0,
Tthres_max].

3.3Simulation Details and Results

Handoff prioritization schemes are commonly evaluated in terms of two QoS metrics,
namely new call blocking probability (PNC) and forced termination probability (PFT).

PFT may be reduced at the expense of increasing PNC. However, in the process of
meeting the same PFT requirement, a more efficient scheme will be able to accomplish
the task with a lower PNC than a less efficient scheme. The efficiency of the scheme
depends on whether the reservations are made at the right place and time.

Therefore, a predictive scheme should outperform a non-predictive scheme.

Similarly, the efficiency of a predictive scheme should improve with its prediction
accuracy.

To facilitate the evaluation of the proposed scheme, a novel simulation model was
designed. Previous work in the literature either assumes that MTs travel in straight lines
for long periods of time, or assumes that MTs follow random movements that do not

Dept. of ECE,ATMECE , MYSORE Page 13

QOS in cellular network based on MPT
resemble vehicular motion on roads. Our simulation model incorporates road layouts that
place constraints on MTs paths.

This establishes a more realistic platform to evaluate the performance of any

positioning-based prediction algorithm. The simulation network consists of 42 wireless
cells. In order to eliminate boundary effects that could make it very difficult to
comprehend the performance evaluation results, we have used a common approach found,
cells at the boundary wrap around as shown in Fig.3. 2. In this way, whenever a MT
travels out of the network boundary, it is re-injected into the network again via the
appropriate wrap-around cell as though a handoff has occurred from outside the
simulation network. This compensates for any traffic loss at the network boundary. We
randomly generate arbitrary road layouts based on some heuristic rules; real maps are not
used because we require the roads to wrap around at the network boundary. The road
layouts are designed to imitate those found in city areas. Fig. 3.3 shows an example of the
road topology thatwas randomly generated for simulation purpose.

Although the cell layout shown in Fig. 3.2 adopts the hexagonal cell model, the
simulation model does not assume that handoffs occur at the hexagonal boundary. In the
simulation network, the hexagonal model is merely used to determine the BS locations. In
contrast to previously mentioned work in which handoffs are assumed to occur at either
circular or hexagonal cell boundaries, the simulation model used here does not have well-
defined cell boundaries. Instead, we randomly generate M = 100 points around each BS
that influence the positions at which handoffs occur. We shall call them as handoff
influence points (HIPs).

Suppose R is the cell radius (assumed to be 1000 m in the simulations), which is typically
defined as the distance from the BS to the vertex of the hexagonal cell model. When a
MT comes within 0.075R from one or more of these HIPs, we assume that a handoff will
occur during its transit through this region. The time at which the handoff shall occur is
assumed to follow a uniform distribution within the time spent in the region. The target
BS is assumed to be the nearest neighboring BS at the time when the handoff occurs,
although this may not be the case in real life. The HIPs are created around the BS at
regular angles = 360/M apart.

The distance between each point and the BS is first generated using truncated
Gaussian distribution, with a mean of 1.15R and a standard deviation of 0.2R. All the
distances are truncated to the range [0.95R, 1.35R]. Next, we perform smoothing by

Dept. of ECE,ATMECE , MYSORE Page 14

QOS in cellular network based on MPT
averaging the distance of each point with those of its immediate neighboring points, so as
to eliminate any gap in the handoff region.

We do not claim that the above model resembles the actual handoff position
distribution in a real cellular network. However, we feel that it is sufficient for the
purpose of creating an irregular handoff region with some uncertainty, so as to evaluate
the performance of different handoff prioritization schemes. To our knowledge, no work
has modeled the 2-D distribution of handoff positions in real cellular networks. Therefore,
we are unable to make use of any previously known model in our simulations.To make
the problem more interesting, we introduced traffic lights in our simulation model. Two
sets of traffic lights are assumed. When one set is GREEN, the other set is RED. At a T-
junction, we randomly assign one set to the two roads that make the largest angle. The
other remaining road will be assigned the opposite set. At a cross-junction, the roads are
assigned alternate traffic light sets. Each GREEN and RED signal shall last for 60 sec.
We also assign a speed limit to each road segment chosen from the set 40 km/h, 50 km/h,
and 60 km/h with equal probability. Each MT will be randomly assigned a speed as it
enters a new road segment, using truncated Gaussian distribution. The mean speed will be
the speed limit of that particular road segment. The standard deviation is assumed to be 5
km/h, and the speed is truncated to a limit of three standard deviations from its mean.

In this article, the unit of bandwidth is called bandwidth unit (BU), which is
assumed to be the required bandwidth to support a voice connection. Each cell is assumed
to have a fixed link capacity C of 100 BUs. For simplicity, we assume that the bandwidth
requirement of each MT is symmetric, meaning that they have the same requirement in
both uplink and downlink. However, it is straightforward to modify the scheme to handle
asymmetric requirements. Call requests are generated according toPoisson distribution
with rate (connections/sec/cell) in each cell.

The initial position of a new call and itsdestination can be on any road with equal
probability. The path chosen by the MT is assumed to follow theshortest path possible.
For each call request, we assume that it is either of type voice (requires 1 BU), orof
type video (requires 4 BUs) with probabilities Rvo and 1Rvo respectively, where Rvo
is also called thevoice ratio. In the simulations, Rvo is set to 0.5.

The lifetime for each connection isexponentially distributed with mean 180 sec.
We adopt the same definition of offered load per cell,which is the product of connection
generation rate , average connections BU requirement [Rvo+ 4(1Rvo)],and average
connection lifetime (180sec). We normalize the above by dividing it with the link
Dept. of ECE,ATMECE , MYSORE Page 15
QOS in cellular network based on MPT
capacity C,so as to obtain the normalized offered load per cell, L. In our simulations, we
set L to be 1.0.

Figure 3.2: A simulation network with wrap around at network boundary

Figure 3.3: A sample road layout randomly generated using heuristic rules for simulation
purpose

3.4 Additional simulatedschemes for comparison purpose

Reactive scheme: This scheme is purely reactive with no prediction. It serves as a
lower bound for the efficiency of the schemes considered. It measures the forced
termination ratio among a number of handoffs recently observed, and increases

Dept. of ECE,ATMECE , MYSORE Page 16

QOS in cellular network based on MPT
the reservation in the cell when the PFT target is not achieved, or decreases it
otherwise.
Chois AC1 scheme: This is one of the three schemes. In their simulations based
on 1-D cell layout, their AC3 scheme performed best among the three schemes,
namely AC1, AC2 and AC3. However, in our simulations based on 2-D cell
layout, we discover that AC1 has the best performance, whereas AC2 and AC3
are over-conservative and has much worse efficiency than the Reactive scheme.
Therefore, we only present the results for AC1 in this article. This scheme works
by estimating the probability that a MT would hand off into a neighboring cell
within an estimation time window test, based upon its previous cell, and its extant
sojourn time (i.e., the time it has already spent in the current cell). It requires the
use of a knowledge base containing the time spent by previous MTs in the cell, the
previous cells that they came from, and their corresponding target handoff cells.
Test is dynamically adjusted based on the measured forced termination ratio
among a number of handoffs recently observed, and it indirectly controls the
amount of resource reservations.
Linear extrapolation (LE) scheme: This is a modified version of the scheme.
The MTs are also assumed to possess positioning capability. However, no road
information is used in the mobility predictions. Instead, the MT is simply
predicted to continue moving straight in the direction obtained using linear
regression over its last few positions. Its speed is estimated to be the average
speed over its last few positions. The handoff region is approximated using a
number of points known as handoff approximationpoints (BAPs). Each BAP is
assigned a most likely target handoff cell computed from previous handoff
requests. During each prediction instant (every 1 sec), the BS uses a fast search
algorithm to determine the BAP that is closest to each MTs trajectory, and
estimate the time taken for the MT to reach this point. If the time is found to be
shorter than a threshold time Tthreshold, the MTs resource requirement will be
reserved atthe target handoff cell. Tthreshold is dynamically adjusted using a
mechanism similar to the one used for adjusting Test in Chois AC1 scheme.
Benchmark scheme: This scheme serves as a benchmark indicating the best
achievable results if we were to have perfect knowledge regarding when and
where handoff requests will occur. It is impossible to achieve this in real-life.
Reservations are computed for each active MT at regular time intervals (1 sec). If
a MTs handoff time is within Tthreshold, the MTs resource requirement will be
Dept. of ECE,ATMECE , MYSORE Page 17
QOS in cellular network based on MPT
reserved at the target handoff cell. Tthreshold is dynamically adjusted using a
mechanism similar to the one used for adjusting Test, so as to meet any specified
PFT target.

In the following, we present the results obtained from the simulations. Note that all results
presented herein are the averages over 42 cells in the simulation network. In our
simulation with no handoff prioritization, both PNC and PFT are 7.6%. This is
unacceptably high for PFT, thus explaining the need for handoff prioritization. Fig.3. 4
shows the plots of PNC versus PFT for the five schemes considered. For each scheme, we
varied the target PFT so as to illustrate its tradeoff with PNC. For any fixed L (set to 1.0
in the simulations), the relative positions of such tradeoff curves could demonstrate the
relative efficiencies among the different schemes. A curve that is closer to the origin
represents a more efficient scheme. It means that the scheme is able to achieve the same
PFT target while trading off a smaller increase in PNC.

Among the five schemes, the Reactive scheme has the worst efficiency since it does not
make use of any prediction. Chois AC1 scheme has better efficiency than the Reactive
scheme because it possesses some intelligence in where and when the resources should be
reserved. However, it has lower efficiency than the next three schemes. This is probably
because it may be insufficient to predict the mobility of a MT based on its previous cell
information and its extant sojourn time. Moreover, calls that are newly generated in the
cell do not have previous cell information. This hinders the schemes prediction accuracy,
thus lowering its efficiency.

The LE scheme has slightly better efficiency over Chois AC1 scheme. The RTB
scheme described in this article demonstrates even greater improvement. These results
show that mobility prediction

Dept. of ECE,ATMECE , MYSORE Page 18

QOS in cellular network based on MPT

Figure 3.4 Plot of PNC v/s PFT demonstrating the efficiency of different schemes
Schemes based on mobile positioning information are more accurate, thus leading to
more efficient reservations. The most efficient scheme among the five schemes
considered is the Benchmark scheme. As mentioned earlier, this is an idealized scheme
that possesses complete knowledge of when and where the next handoff of each MT will
occur.

It merely serves as a bound to the best efficiency that could be achieved by other
schemes. For a target PFT of 1%, the Reactive scheme has a PNC of 17.9%, while the
lower bound set by the Benchmark scheme is 15.8%.

The RTB scheme is able to achieve a PNC of 16.5%. As we have seen, the plots
agree with intuition that handoff prioritization efficiency improves as the amount of
knowledge incorporated into the schemes increases. With the additional knowledge of
real-time mobilepositioning information, the LE scheme is able to outperform Chois
AC1 scheme, even though it is based on a simple linear extrapolation approach. For the
RTB scheme, the use of both real- time mobile positioning information and road
topology knowledge further reduces the uncertainty in predicting the MTs future
movements. As a result, its performance is even closer to the limit set by the Benchmark
scheme.

Dept. of ECE,ATMECE , MYSORE Page 19

QOS in cellular network based on MPT

CHAPTER 4
APPLICATIONS
Different applications and services place different demands on the network, and together
these are driving the need for a comprehensive approach to QoS.
Voice over Internet Protocol (VoIP) over mobile

VoIP is a technology for supporting voice communications over packet networks, such as
the Internet. With modern encoding techniques, voice traffic requires relatively low
bandwidth, but to deliver acceptable quality, the packets must be transmitted with
minimum latency and jitter, or variation in latency.

Video Streaming

The dramatic growth in mobile network traffic is being caused primarily by bandwidth-
hungry video traffic. Real-time, user-generated and on-demand video streaming
applications, such as YouTube etc, are therefore a significant factor in QoS in mobile
networks.

Content Download

A significant amount of mobile bandwidth is consumed by users downloading and

uploading movies, pictures, music, documents, etc. Unlike with real-time video, however,
these transfers are buffered and can, therefore, be handled at a more leisurely pace. The
batch nature of such transfers enables the use of best-effort bandwidth scheduling, where
packets can be dropped to accommodate higher priority traffic.

Mobile Traffic Surges

QoS is used to effectively managing peak-demand scenarios when a large number of

users access the same application or service.
Monetizing Mobile Networks

The ever-present need to make money applies fully to the user quality of experience for
many of todays mobile applications and services. In fact, monetization is a major driving
force behind the need for enhanced QoS in mobile networks. Mobile operators face
enormous pressure to maximize the return on investment (ROI) while keeping up with the
rapid changes in application characteristics, and the growing diversity in subscriber needs
and preferences.

Dept. of ECE,ATMECE , MYSORE Page 20

QOS in cellular network based on MPT

CONCLUSION
In this article, it describes a mobility prediction technique in which each BS performs
predictions forall active MTs under its service. The technique is built upon the
assumption that future MTs would beequipped with reasonably accurate positioning
capability. Unlike previous attempts to perform mobilitypredictions based on mobile
positioning, which have either assumed hexagonal or circular cell geometries,our scheme
does not require any cell geometry assumption. It also incorporates road
topologyinformation into the prediction technique, which could potentially yield better
prediction accuracy for MTsthat are carried in vehicles.
Among the many possible applications for which mobility predictions could prove
useful, this articleoutlines its use for dynamic resource reservation so as to prioritize
handoff calls over new calls. Withmobility prediction, the reservations at each BS could
be dynamically adjusted according to the resourcedemands of MTs that are anticipated to
hand off into the cell from its neighboring cells. By comparing theplots featuring the
tradeoffs between new call blocking probability and forced termination
probabilityobtained from several schemes, we demonstrate that reservation efficiency
improves as the amount ofknowledge incorporated into the scheme increases, and the
RTB scheme has the potential to achieveperformance that is closest to the limit set by the
idealized Benchmark scheme. The use of the RTB schemecould therefore provide
subscribers with the desired degree of call-level QoS throughout their call duration,while
achieving higher resource utilization than other handoff prioritization schemes.With the
emergence of telemetric systems in vehicles, motorists may receive dynamic route
guidance basedon real-time traffic information. If this routing information were to be
made available to the wirelessnetwork, it could help to further diminish the uncertainty in
mobility predictions, and realize even moreefficient resource reservation schemes.

Dept. of ECE,ATMECE , MYSORE Page 21