Publication

Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks

Emre Telatar, Olivier Lévêque
2004
Conference paper

Abstract

We derive an information theoretic upper bound on the maximum achievable rate per communication pair in a large extended ad-hoc wireless network. We show that under a reasonably weak assumption on the attenuation due to environment, this rate tends to zero as the number of users gets large.

Official source

https://infoscience.epfl.ch/record/98386?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks

Graph Chatbot

Chat with Graph Search

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Wireless Multi-hop Networks Beyond Capacity

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Wireless Multi-hop Networks Beyond Capacity

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing