2008
DOI: 10.1109/vetecs.2008.540
|View full text |Cite
|
Sign up to set email alerts
|

Cost-Aware Handover Decision Algorithm for Cooperative Cellular Relaying Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…Therefore, the cost optimization must be considered during a handover process. A scheme based on cost aware handover decision is proposed which uses two cost functions, that is, triggering and priority decision [24]. Both functions are optimized for the best values of signal transmission quality, handover signaling cost, handover latency, and estimate interference.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, the cost optimization must be considered during a handover process. A scheme based on cost aware handover decision is proposed which uses two cost functions, that is, triggering and priority decision [24]. Both functions are optimized for the best values of signal transmission quality, handover signaling cost, handover latency, and estimate interference.…”
Section: Related Workmentioning
confidence: 99%
“…If an AP/BS reaches a close state, then it blocks any incoming connections. The probability of blocking a new connection can be represented as follows [24,35]:…”
Section: Mobile Information Systemsmentioning
confidence: 99%
“…Therefore, the cost optimization must be considered during a handover process. A scheme based on cost aware handover decision is proposed which uses two cost functions, i.e., triggering and priority decision [22]. Both functions are optimized for the best values of signal transmission quality, handover signaling cost, the handover latency, and estimate interference.…”
Section: Related Workmentioning
confidence: 99%
“…A MU can enter the queue until there is free space in a handover queue or its estimated remaining time is less than estimated remaining time of aleast priority request in the queue [11]. While, In the heavy traffic networks, many MSs may send out HO requests to the same target at the same time leading to the performance degradation [14].…”
Section: Analysis Of the Handover Prioritiesmentioning
confidence: 99%