Subscriber-assisted handoff support in multimedia PCS
ACM SIGMOBILE Mobile Computing and Communications Review
"Call-level" and "Burst-level" priorities for an effective management of multimedia services in UMTS
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
On optimal call admission control in cellular networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A reversible hierarchical scheme for microcellular systems with overlaying macrocells
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Measurement-based band allocation in multiband CDMA
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
SIGACT news online algorithms column 14
ACM SIGACT News
Solving channel borrowing problem with coevolutionary genetic algorithms
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Deterministic on-line call control in cellular networks
Theoretical Computer Science
Frequency allocation problems for linear cellular networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
The wide deployment of multimedia services in third generation wireless networks will require handoff designs that can simultaneously reduce the blocking probability of handoff requests and decrease the handoff delay. Reducing the handoff blocking probability is needed to prevent frequent call dropping of real-time VBR/VCR connections and decreasing the delay associated with handoff is needed to prevent QoS degradation for multimedia traffic. In this paper, we present a channel assignment/reassignment scheme for highway cellular networks that achieves both requirements. The scheme can be used to deliver real-time data to a large segment of global highways, namely, highways in which the radio channels used in a given cell cannot be simultaneously used in the two neighboring cells to its left and to its right. The scheme possesses the desirable features of real-time algorithms: the execution time per handoff request has a constant time complexity, the number of transmitted messages per request is small, and the space overhead is also O(1). The scheme uses a non-compact initial assignment of nominal channels to neighboring cells and utilizes a set of pointers in each base station to implement an efficient channel assignment and reassignment strategy. The resulting approach greatly simplifies the selection process and avoids the expensive computation and message exchanges typically needed by dynamic channel allocation schemes. The low communication overhead of the scheme can be further reduced via control thresholds. Performance simulation results show that the scheme achieves low blocking probability and is therefore suitable for handling handoffs of real-time connections in highway cellular networks.