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

Resource allocation in fading wireless ad-hoc networks with temporally correlated loss

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)
Zheng, L. ; Dept. of Electr. Electron. Eng. & Comput. Sci.,, California Univ., Irvine, CA, USA ; Yousefi'zadeh, H. ; Jafarkhani, Hamid

Addressing the tradeoff between the QoS and consumed power is a critical issue for wireless ad-hoc networks. The loss observed in such networks is often temporally correlated. This paper examines an optimal scheme to maximize the aggregate data rate of wireless ad-hoc networks under the power and loss constraints. In order to properly model temporally correlated loss observed in a fading wireless channel, we propose the use of finite-state Markov chains. Details of fading statistics of SIR, an important indicator of transmission quality, are presented. We also analyze the impacts of enforcing power, block-loss probabilities, and data rates constraints.

Published in:

Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE  (Volume:3 )

Date of Conference:

21-25 March 2004

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.