Publication

Connectivity vs Capacity in Dense Ad Hoc Networks

Related publications (38)

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.

On the Throughput of Ad Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2005

Time-dependent strength of colloidal gels

Suliana Manley

Colloidal silica gels are shown to stiffen with time, as demonstrated by both dynamic light scattering and bulk rheological measurements. Their elastic moduli increase as a power law with time, independent of particle volume fraction; however, static light ...

2005

A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

André Schiper, David Cavin, Yoav Sasson

We give a lower bound of

\Omega(n)

rounds for broadcasting in a mobile ad hoc network, where

n

is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...

2004

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

Christina Fragouli

2004

Self Organized Terminode Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...

2002

The Terminodes Project: Towards Mobile Ad-Hoc WANs

Jean-Yves Le Boudec, Jean-Pierre Hubaux

The Terminode project follows a system approach to investigate wide area, large, totally wireless networks that we call mobile ad-hoc wide area networks. A network of terminodes is an autonomous, self-operated, wireless multimedia network, independent of a ...

1999

A Path Selection Method in ATM using Pre-Computation

Jean-Yves Le Boudec, Olivier Crochat

An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...

1996

Algebraic gossip on Arbitrary Networks

Shrinivas Kudekar, Dinkar Vasudevan

Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Shah et al where a bound to the ...

A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

André Schiper, David Cavin, Yoav Sasson

We give a lower bound of

\Omega(n)

rounds for broadcasting in a mobile ad hoc network, where

n

is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...

2004