On the Broadcast Capacity of Wireless Networks With Cooperative Relays
Related publications (182)
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.
In this paper we will propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of dumbly forwarding packets. In our scheme we assume that the ...
The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them ...
The Swiss National Competence Center for Research in mobile Information and Communication Systems (NCCR-MICS or MICS) is one of several research initiatives sponsored by the Swiss National Science Foundation to promote long term research projects in areas ...
The low-power communication in wireless sensor networks can be impacted by severe channel impairments. In this paper, to address this problem and achieve high network goodput, we propose that the medium access control protocol takes into consideration the ...
Packet detection and timing acquisition for IR-UWB networks such as 802.15.4a relies on the presence of an acquisition sequence (or preamble) at the beginning of each packet. A simple network design choice is to use a common acquisition sequence for the wh ...
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 ...
We present DRIFT --- a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding --- a way of using unrel ...
The gradual transformation of a mushy zone during alloy solidification, from a continuous liquid film network to a fully coherent solid, has been simulated using a granular model. Based on a Voronoi tessellation of a random set of nucleation centers, solid ...
Packet detection and timing acquisition for IR-UWB networks such as 802.15.4a relies on the presence of an acquisition sequence (or preamble) at the beginning of each packet. A simple network design choice is to use a common acquisition sequence for the wh ...
We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not ...