Efficient structured policies for admission control in heterogeneous wireless networks

Authors:
Amin Farbod;Ben Liang
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
Venue:
Mobile Networks and Applications
Year:
2007

Citing 12
Cited 1

The bisection method in higher dimensions

Mathematical Programming: Series A and B
On optimal call admission control in cellular networks

Wireless Networks
Channel Occupancy Times and Handoff Rate for Mobile Computing and PCS Networks

IEEE Transactions on Computers
Vertical handoffs in wireless overlay networks

Mobile Networks and Applications - Special issue: mobile networking in the Internet
Improving call admission policies in wireless networks

Wireless Networks
A decision-theoretic approach to resource allocation in wireless multimedia networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks

IEEE/ACM Transactions on Networking (TON)
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Call Admission Control for Multimedia Services in Mobile Cellular Networks: A Markov Decision Approach

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Signal threshold adaptation for vertical handoff in heterogeneous wireless networks

Mobile Networks and Applications
On the complexity of solving Markov decision problems

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Distributed call admission control in mobile/wireless networks

IEEE Journal on Selected Areas in Communications

A hybrid (N/M)CHO soft/hard vertical handover technique for heterogeneous wireless networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the near future, demand for heterogeneous wireless networking (HWN) is expected to increase. QoS provisioning in these networks is a challenging issue considering the diversity in wireless networking technologies and the existence of mobile users with different communication requirements. In HWNs with their increased complexity, "the curse of dimensionality" problem makes it impractical to directly apply the decision theoretic optimal control methods that are previously used in homogeneous wireless networks to achieve desired QoS levels. In this paper, optimal call admission control policies for HWNs are considered. A decision theoretic framework for the problem is derived by a dynamic programming formulation. We prove that for a two-tier wireless network architecture, the optimal policy has a two-dimensional threshold structure. Further, this structural result is used to design two computationally efficient algorithms, Structured Value Iteration and StructuredUpdate Value Iteration. These algorithms can be used to determine the optimal policy in terms of thresholds. Although the first one is closer in its operation to the conventional Value Iteration algorithm, the second one has a significantly lower complexity. Extensive numerical observations suggest that, for all practical parameter sets, the algorithms always converge to the overall optimal policy. Further, the numerical results show that the proposed algorithms are efficient in terms of time-complexity and in achieving the optimal performance.