Concept

Radio network

Related publications (8)

Profit Optimization for Wireless Video Broadcasting Systems Based on Polymatroidal Analysis

This study addresses the problem of profit maximization between wireless service providers (WSPs) and content providers (CPs) in wireless broadcasting systems, while simultaneously providing high quality of experience for end-users (EUs). We first study th ...

2015

Algebraic algorithms for network information flow

Javad Ebrahimi Boroojeni

Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...

EPFL2013

Optimal Channel Choice for Collaborative Ad-Hoc Dissemination

Jean-Yves Le Boudec, Milan Vojnovic

Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the ...

2010

Efficient Broadcasting Using Network Coding

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

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 netwo ...

2008

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

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- ...

2008

Precoding for broadcasting with linear network codes

Ali H. Sayed

A technique based on linear precoding is introduced for broadcasting on linear networks. The precoding allows the different message components of a broadcast message to be separated and decoded at the desired sink nodes, thus providing a systematic design ...

2006

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

Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks

André Schiper, David Cavin, Yoav Sasson

Although far from optimal, flooding is an in- dispensable message dissemination technique for network- wide broadcast within mobile ad hoc networks (MANETs). As such, the plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, c ...

2002

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.

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