Near Optimal Broadcast with Network Coding in Large Sensor Networks

Cédric Adjih 1 Song Yean Cho 1 Philippe Jacquet 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum achievable broadcast rate of the source: our central result is a proof of the value of the min-cut for such networks, viewed as hypergraphs. Our metric for efficiency is the number of transmissions necessary to transmit one packet from the source to every destination: we show that IREN/IRON achieves near optimality for large networks; that is, asymptotically, nearly every transmission brings new information from the source to the receiver. As a consequence, network coding asymptotically outperforms any scheme that does not use network coding.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00166617
Contributor : Cédric Adjih <>
Submitted on : Tuesday, August 7, 2007 - 4:52:48 PM
Last modification on : Thursday, February 7, 2019 - 3:09:20 PM
Long-term archiving on : Friday, April 9, 2010 - 12:28:23 AM

Identifiers

  • HAL Id : inria-00166617, version 1
  • ARXIV : 0708.0975

Collections

Citation

Cédric Adjih, Song Yean Cho, Philippe Jacquet. Near Optimal Broadcast with Network Coding in Large Sensor Networks. First International Workshop on Information Theory for Sensor Netwoks (WITS 2007), Jun 2007, Santa Fe, United States. ⟨inria-00166617⟩

Share

Metrics

Record views

255

Files downloads

191