A Delay-Centric Dynamic Resource Allocation Algorithm for Wireless Communication Systems Based on HNN

doi:10.1109/TVT.2008.919619

Return

A Delay-Centric Dynamic Resource Allocation Algorithm for Wireless Communication Systems Based on HNN

2008-11-01

PRE

DOI：10.1109/TVT.2008.919619

Original

Original request for help

Save

Abstract

En 中文

This paper proposes a dynamic resource-allocation (DRA) algorithm for packet data services in wireless communication systems based on Hopfield neural networks (HNNs). The resource-allocation algorithm assumes a delay-centric approach in that it maximizes resource utilization of the overall system while minimizing the packet delay. The real-time (RT) working capability of HNN hardware implementation means that a very powerful scheduling DRA algorithm can be obtained. A generic formulation of the algorithm is presented to establish the optimal bit rate allocation. In addition, some illustrative examples of this formulation are given, considering specific wireless communication systems, such as General Packet Radio Service (GPRS) or Universal Mobile Telecommunications System (UMTS). To be more precise, the performance of the proposed DRA algorithm is evaluated in a realistic UMTS scenario, considering both RT and nonreal-time (NRT) services. To obtain the best resource distribution and fulfill the different quality-of-service (QoS) levels required by RT and NRT services, the new HNN-based delay-centric DRA algorithm is performed twice. Initially, only the RT services are considered, and following this, all the NRT services are taken into account. The results reveal that the proposed DRA algorithm outperforms other reference algorithms in terms of not only average packet delay but the allocated total bit rate as well.

Keywords:

Dynamic resource allocation (DRA)

Hopfield neural networks (HNNs)

wireless networks

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.