Near Optimal Broadcast with Network Coding in Large Homogeneous Wireless Networks

Cédric Adjih (1) , Song Yean Cho (1, 2) , Philippe Jacquet (1)

1 HIPERCOM - High performance communication
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

We propose an efficient broadcast algorithm for wireless sensor networks, based on network coding: we introduce a simple rate selection and analyze its performance (through computation of \emph{min-cut}). By broadcast, we mean sending data from one source to all the other nodes in the network, and our metric for efficiency is the number of transmissions necessary to transmit one packet from the source to every destination. We address this problem, in some special cases of wireless ``homogeneous'' sensor networks contained of the plane: wireless lattice networks, and dense unit disk networks. Our results are based on the simple principle of Increased Rate for Exceptional Nodes, Identical Rate for Other Nodes (IREN/IRON), for setting rates on the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum broadcast rate of the source: our central result is a proof of the value of the min-cut for such networks.

Domaines: Réseaux et télécommunications [cs.NI]

Cédric Adjih, Song Yean Cho, Philippe Jacquet. Near Optimal Broadcast with Network Coding in Large Homogeneous Wireless Networks. 2007. ⟨inria-00144354⟩