Optimal Channel Choice for Collaborative Ad-Hoc Dissemination
Related publications (40)
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.
This work studies how to build wireless network protocols that achieve better reliability, lower delay and higher throughput than existing alternatives by using network coding and by exploiting the broadcast nature of the wireless channel. In the first par ...
In a previous project, a 7.2g helicopter made of carbon was designed and realized at the LAI. The goal of this project is to design and realize a tiny receiver and a remote capable of driving the helicopter from a distance of 2 to 4 meters. Challenges are ...
In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes --bandwidth- and power-limited-- have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling l ...
Emerging pervasive wireless networks, pocket switched networks, Internet of things, vehicular networks and even sensor networks present very challenging communication circumstances. They might involve up to several hundreds of wireless devices with mobilit ...
Wireless adhoc networks consist of users that want to communicate with each other over a shared wireless medium. The users have transmitting and receiving capabilities but there is no additional infrastructure for assisting communication. This is in contra ...
The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...
We solve for the equilibrium dynamics of Information sharing in a large population Each agent is endowed with signals regarding the likely outcome of a random variable of common concern Individuals choose the effort with which they search for others from w ...
A huge increase in the amount of data consumed by smartphone users is becoming a serious problem for mobile operators. In three years, mobile data traffic in the AT&T's network rose 5000%. The US operators invest 50 billion dollars in their data networks e ...
We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...
We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...