Publication

A Measurement-Based Algorithm to Maximize the Utility of Wireless Networks

Related publications (73)

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.

A Method and a system for energy consumption saving in wireless access networks

Dejan Kostic, Marco Canini

The method of the invention, comprising at the user side: a) checking if the load of a first gateway to which a user terminal device is wirelessly connected, falls below a given low load threshold; b) if said first gateway load has fallen below said given ...

2013

Bidder optimal assignments for general utilities

Monika Henzinger, Ingmar Weber

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u(i,j)(p(j)) expressing his utility of being matched to item j at price p(j). For this setting we prove that a bidder optimal outcome al ...

Elsevier Science Bv2013

Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. This decoupling assumption results from mean field convergence and is gen ...

Institute of Electrical and Electronics Engineers2012

Enhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks

Patrick Thiran, Julien Pierre Sacha Herzen, Ruben Merz, Adel Aziz

The goal of jointly providing efficiency and fairness in wireless networks can be seen as the problem of maximizing a given utility function. In contrast with wired networks, the capacity of wireless networks is typically time-varying and not known explici ...

2011

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Distributed Delay-Power Control Algorithms for Bandwidth Sharing in Wireless Networks

Nicolas Gabriel Gast

In this paper, we formulate a delay-power control (DPC) scheme for wireless networking, which efficiently balances delay against transmitter power on each wireless link. The DPC scheme is scalable, as each link autonomously updates its power based on the i ...

2011

Secure Neighbor Discovery and Ranging in Wireless Networks

Marcin Poturalski

This thesis addresses the security of two fundamental elements of wireless networking: neighbor discovery and ranging. Neighbor discovery consists in discovering devices available for direct communication or in physical proximity. Ranging, or distance boun ...

EPFL2011

Line and Lattice Networks Under Deterministic Interference Models

Michael Christoph Gastpar, Jasper Goseling

Capacity bounds are compared for four different deterministic models of wireless networks, representing four different ways of handling broadcast and superposition in the physical layer. In particular, the transport capacity under a multiple unicast traffi ...

2011

An Adaptive Field Estimation Algorithm for Sensor Networks in Dynamic Environments

Alcherio Martinoli, William Christopher Evans, Amanda Stella Markowska Prorok

The efficiency of distributed sensor networks depends on an optimal trade-off between the usage of resources and data quality. This workshop paper addresses the problem of optimizing this trade-off in self-configured distributed sensor networks. In our cas ...

2011

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

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