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

A communication architecture for large heterogeneous wireless 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)
Niesen, U. ; Bell Labs., Alcatel-Lucent, Murray Hill, NJ, USA ; Gupta, P. ; Tse, D.

Capacity scaling in wireless networks under homogeneous node placement and traffic demands has been widely studied over the last decade. In general networks, however, both the node placement and traffic demands can be highly non-uniform. In this paper, we present a communication architecture that operates a wireless network under such heterogeneous settings. The proposed scheme includes the existing communication schemes for large wireless networks-multi-hopping, cooperative communication, cooperative multi-hopping-as special cases. We illustrate through a few specific wireless network scenarios that the proposed scheme can perform significantly better, even scaling-wise, than any of these previous schemes.

Published in:

Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on

Date of Conference:

Sept. 29 2010-Oct. 1 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.