Publications associées à Asymptotic properties of wireless multi-hop networks

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.

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Ainur Zhaikhan

Connectivity is an important key performance indicator and a focal point of research in large-scale wireless networks. Due to path-loss attenuation of electromagnetic waves, direct wireless connectivity is limited to proximate devices. Nevertheless, connec ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Efficient Key Exchange for Wireless Multi-hop Networks

Christina Fragouli, László Czap, Iris Safaka

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protoc ...

2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Martin Vetterli, Benjamin Bejar Haro

Over the past years there has been an increasing interest in developing distributed computation methods over wireless networks. A new communication paradigm has emerged where distributed algorithms such as consensus have played a key role in the developmen ...

IEEE2014

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

Robust Localization from Incomplete Local Information

Amin Karbasi

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a

d

-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment m ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Dario Floreano, Bixio Rimoldi, Jean-Christophe Zufferey, Alberto Jimenez Pacheco, Yannick Gasser

This paper describes the implementation and characterisation of a mobile ad-hoc network (MANET) of ultra-light intelligent flying robots. The flying nature of the network makes it suitable to collect or disseminate content in urban areas or challenging ter ...

2012

Robust Localization from Incomplete Local Information

Amin Karbasi

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a

d

-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment m ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Asymptotic properties of wireless multi-hop networks

Graph Chatbot

Chattez avec Graph Search

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Cellular Fronthauling for Data Capacity Increase in Underserved Spaces

Throughput Analysis of Large Networks

Efficient Key Exchange for Wireless Multi-hop Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Creating Secrets out of Erasures

Exchanging Pairwise Secrets Efficiently

Robust Localization from Incomplete Local Information

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Exchanging Pairwise Secrets Efficiently

Creating Secrets out of Erasures

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Throughput Analysis of Large Networks

Cellular Fronthauling for Data Capacity Increase in Underserved Spaces

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Efficient Key Exchange for Wireless Multi-hop Networks

Robust Localization from Incomplete Local Information