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

Time slot allocation for TDMA/CDMA TH-UWB ad-hoc networks

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

3 Author(s)
Mary, P. ; IETR, INSA Rennes, Rennes, France ; Fijalkow, I. ; Poulliat, C.

In this paper, we deal with the time slot allocation in time-hopping ultra-wide band (TH-UWB) ad-hoc networks in order to maximize the total sum rate. This problem is known to be a discrete NP-hard optimization problem and hence cannot be solved with a computationally efficient algorithm. Moreover, the sum rate maximization often leads to starvation of links experiencing bad channel conditions. Our main contribution is to propose an algorithm which approaches the maximum sum rate while keeping the starvation rate under a threshold. We first propose a time slot allocation scheme based on an accept/reject criterion. The performance of the algorithm depends on the acceptance threshold. In a second approach, we add the starvation rate in constraints leading to a new algorithm maximizing the sum rate and keeping the starvation rate under control. Extensive simulation results show that the proposed algorithm achieves reasonable sum rate performances under restrictive starvation threshold.

Published in:

Signal Processing Advances in Wireless Communications (SPAWC), 2010 IEEE Eleventh International Workshop on

Date of Conference:

20-23 June 2010

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.