A general call admission policy for next generation wireless networks

Authors:
Hamid Beigy;M. R. Meybodi
Affiliations:
Computer Engineering Department, Sharif University of Technology, Tehran, Iran and Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Science, Tehran, Iran;Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Science, Tehran, Iran and Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran
Venue:
Computer Communications
Year:
2005

Citing 5
Cited 4

On optimal call admission control in cellular networks

Wireless Networks
Call Admission Control for Multimedia Cellular Networks Using Neuro-dynamic Programming

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
On handoff performance for an integrated voice/data cellular system

Wireless Networks
A new fractional channel policy

Journal of High Speed Networks
Solution of queuing problems by a recursive technique

IBM Journal of Research and Development

An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic framework and performance evaluation for prioritized call admission control in next generation networks

Computer Communications
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Wireless Personal Communications: An International Journal
Performance analysis of finite population fractional guard channel policies in mobile cellular networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, we consider the call admission problem in cellular networks that support several classes of calls. In the first part of this paper, we first introduce a multi-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels that minimizes the blocking probability of calls with lowest level of QoS subject to constraints on blocking probabilities of other calls. In the second part of the paper, we give an algorithm for finding the minimum number of channels subject to constraints on blocking probabilities of calls. Finally, we propose a prioritized channel assignment algorithm for multi-cells cellular networks to minimize the blocking probability of calls with lowest level of QoS subject to constraints on the blocking probabilities of other calls.