Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Calabuig, D. ; Inst. of Telecommun. & Multimedia Applic., Polytech. Univ. of Valencia, Valencia ; Monserrat, J.F. ; Gomez-Barquero, D. ; Cardona, N.

This paper proposes a dynamic resource-allocation (DRA) algorithm for packet data services in wireless communication systems based on Hopfleld 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.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:57 ,  Issue: 6 )

Date of Publication:

Nov. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.