CaltechAUTHORS
  A Caltech Library Service

An achievability result for random networks

Gowaikar, Radhika and Hochwald, Bertrand and Hassibi, Babak (2005) An achievability result for random networks. In: International Symposium on Information Theory, 2005. ISIT 2005. Proceedings. IEEE , Piscataway, NJ, pp. 946-950. ISBN 0-7803-9151-9. https://resolver.caltech.edu/CaltechAUTHORS:20150210-070353237

[img] PDF - Published Version
See Usage Policy.

258Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150210-070353237

Abstract

We analyze a network of nodes in which pairs communicate over a shared wireless medium. We are interested in the maximum total aggregate traffic flow that is possible through the network. Our model differs substantially from the many existing approaches in that the channel connections in our network are entirely random: we assume that, rather than being governed by geometry and a decay law, the strength of the connections between nodes is drawn independently from a common distribution. Such a model is appropriate for environments where the first order effect that governs the signal strength at a receiving node is a random event (such as the existence of an obstacle), rather than the distance from the transmitter. We show that the aggregate traffic flow is a strong function of the channel distribution. In particular, we show that for certain distributions, the aggregate traffic flow scales at least as n/((log n)^v) for some fixed v > 0, which is significantly larger than the O(√n) results obtained for many geometric models.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ISIT.2005.1523477DOIArticle
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1523477PublisherArticle
Additional Information:© 2005 IEEE. This work is supported in part by the National Science Foundation under grant nos. CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking.
Funders:
Funding AgencyGrant Number
NSFCCR-0133818
NSFCCR-0326554
David and Lucille Packard FoundationUNSPECIFIED
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20150210-070353237
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20150210-070353237
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:54619
Collection:CaltechAUTHORS
Deposited By: Shirley Slattery
Deposited On:10 Feb 2015 23:35
Last Modified:03 Oct 2019 07:59

Repository Staff Only: item control page