Concept

Point d'accès sans fil

Publications associées (277)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...

2002

Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks

Martin Vetterli, Matthias Grossglauser

Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coord ...

2002

Connectivity in ad-hoc and hybrid networks

Martin Hasler

We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where f ...

2002

Connectivity in ad-hoc and hybrid networks

Patrick Thiran, Martin Hasler, Olivier Dousse

2002

Self-Organized Public-Key Management for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In contrast with conventional networks, mobile ad hoc networks do not provide on-line access to trusted authorities or to centralized servers. For this reason, key management is particularly difficult to implement in such networks. The solutions published ...

2002

Flow control for multiple access queues

Razvan Cristescu

We study the problem of finding a characterization for the channel that results when a queue is operated under multiple access conditions. In such systems, the mechanism by which different sources gain access to the channel plays a fundamental role in defi ...

2001

Mobile Ad-Hoc Networks

Ad-hoc networks are a key in the evolution of wireless networks. Ad-hoc networks are typically composed of equal nodes, which communicate over wireless links without any central control. Ad-hoc wireless networks inherit the traditional problems of wireless ...

2001

Development and Evaluation of a Dynamic Bluetooth Network Formation Procedure

Mark Felegyhazi

There is an important trend toward personal mobile communications. People use more and more handheld devices to keep in touch with friends or business partners. One possible way to connect these devices is provided by wireless radio technologies. The emerg ...

2001

GPS-free Positioning in Mobile Ad-Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

In this paper we consider the problem of node positioning in ad-hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on Global Positioning System (GPS). The algorithm uses the distances between the nodes to b ...

2001

Adaptive Multipath resolving for wireless location systems

Ali H. Sayed

We develop an adaptive technique for resolving overlapping multipath components. The technique relies on replacing the least-squares operation needed for resolving overlapping components by a gradient-based adaptive filter with projections. The projections ...

2001