Publication

Fundamental limits and optimal operation in large wireless networks

Related publications (285)

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.

Base Stations in Mobile Ad-Hoc Networks

Thomas Lochmatter

Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. ...

2004

Design of Energy Efficient Wireless Networks Using Dynamic Data Type Refinement Methodology

David Atienza Alonso

This paper presents a new perspective to the design of wireless networks using the proposed dynamic data type refinement methodology. In the forthcoming years, new portable devices will execute wireless network applications with extensive computational dem ...

Springer2004

Automatic Management of 802.11 Access Points

Sacha Varone, Frédéric Jean-Michel Aviolat, Daniel Rossier

The automatic configuration of Access Points (APs) is a new subject, since the Wi-Fi technology, which underlies hotspots by a wireless local area network, appears on the world market in 2001. The first market relevance has been in 2002. APs channel assign ...

2004

Self-Policing Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty ...

CRC Press2004

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

Emre Telatar, Olivier Lévêque

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 ...

2004

Denial of Service Resilience in Ad Hoc Networks

Jean-Pierre Hubaux, Imad Aad

Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc networks have sufficiently redundant paths and counter-DoS mechanisms to make Do ...

2004

Distributed source-channel coding for wireless sensor networks

Michael Christoph Gastpar

In this paper, we investigate properties of good coding strategies for a class of wireless sensor networks that could be termed "monitoring" networks: Their task is to monitor an underlying physical reality at the highest possible fidelity. Since the sense ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004

The Driving Philosophers

Rachid Guerraoui, Bastian Pochon

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...

2004

The Driving Philosophers

Bastian Pochon

2004

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price charged by the cellular network operators is too high. In this paper, we explain that ther ...

2004