2007
DOI: 10.1007/s11277-007-9414-9
|View full text |Cite
|
Sign up to set email alerts
|

Multi-class Bandwidth Reservation Scheme Based on Mobility Prediction for Handoff in Multimedia Wireless/Mobile Cellular Networks

Abstract: Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to Mobile Terminal (MT) with guaranteed Quality of Service (QoS). The challenge is to maintain the playing continuity of multimedia streams during handoff. In this paper, a bandwidth reservation scheme based on mobility prediction is proposed, to enable high accurate prediction of next crossing cell (target cell) which a MT is going to, in order to avoid too early or over reservation resulting in a waste of r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…Through next-cell prediction, the target cell can be determined, and an adaptive reservation can be derived. It reserves the required bandwidth only in those cells where the users are expected to visit in the near future [99], [100]. Also, BSs compute the amount of bandwidth need to be reserved based on cell estimation to reduce unnecessary bandwidth reservation [29].…”
Section: ) Resource Allocationmentioning
confidence: 99%
“…Through next-cell prediction, the target cell can be determined, and an adaptive reservation can be derived. It reserves the required bandwidth only in those cells where the users are expected to visit in the near future [99], [100]. Also, BSs compute the amount of bandwidth need to be reserved based on cell estimation to reduce unnecessary bandwidth reservation [29].…”
Section: ) Resource Allocationmentioning
confidence: 99%
“…All the traffic are queued and served by the single server with rate (l QS ) based on the priority level of each class. Generally, C B packets are given the highest priority, then C N and C R are served [18][19][20]. A problem of priority scheduling (of different traffic classes) of single band is that one type of packet may be served continuously while others may suffer starvation.…”
Section: Scheduling In Single Band Systemsmentioning
confidence: 99%
“…(3) Dropping probability of HCs from sectors to the SG Summing up the stationary probabilities of Markovian states where s D .C sgb / 0 , we have the dropping probability of HCs from sectors to the SG (i.e., DP sesg /, as shown in Equation (14).…”
Section: Blocking and Dropping Probabilitiesmentioning
confidence: 99%