By Topic

Dynamic resource allocation in wireless ad hoc networks based on QS-CDMA

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
$33 $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

2 Author(s)
A. Feistel ; Heinrich-Hertz-Chair for Mobile Commun., Berlin Tech. Univ., Germany ; S. Stanczak

We consider a wireless ad-hoc network for data applications using an orthogonal quasi-synchronous CDMA air interface with a linear receiver structure. The throughput performance of such networks is highly affected by a limited number of signature sequences and by individual power constraints on each node. This paper deals with strategies for allocating powers and sequences to nodes. These strategies exploit the relative delay tolerance of data applications and the random packet arrivals to improve the throughput performance. We provide an upper bound of the optimal centralized strategy, and then propose a centralized heuristic algorithm and two distributed approximations of this strategy based on clustering

Published in:

2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications  (Volume:3 )

Date of Conference:

11-14 Sept. 2005