Publication

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

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

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

Graph Chat

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

Chat with Graph Search

Non-cooperative Multi-radio Channel Allocation in Wireless Networks (Extended Version)

When Power Adaptation is Useless or Harmful