Heuristics for Network Coding in Wireless Networks

Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from one source to all nodes, in a multi-hop wireless network. The broadcast we focus on is based on network coding, a promising avenue for reducing cost; previous work of ours showed that the performance of network coding with simple heuristics is asymptotically optimal: each transmission is beneficial to nearly every receiver. This is for homogenous and large networks of the plan. But for small, sparse or for inhomogeneous networks, some additional heuristics are required. This report proposes such additional new heuristics (for selecting rates) for broadcasting with network coding. Our heuristics are intended to use only simple local topology information. We detail the logic of the heuristics, and with experimental results, we illustrate the behavior of the heuristics, and demonstrate their excellent performance

Capacité de Diffusion avec Codage Réseau dans les Grilles Toriques

International audienceDans ce travail, nous étudions les performances du codage réseau pour les réseaux sans fil multi-sauts dans le cas de la diffusion : une source transmet des informations (paquets) à tous les nœuds du réseau. La communication sans fil est modélisée comme un hyper-graphe, i.e. la même transmission d'un nœud atteint simultanément plusieurs de ses voisins. Nous analysons le cas particulier où les nœuds sont organisés dans une grille torique. Nous prouvons un résultat sur la capacité de diffusion du codage réseau sans-fil sur cette topologie, en utilisant des propriétés de la théorie des groupes. Une implication est que le codage réseau est ici "quasi optimal" en termes d'efficacité énergétique, dans le sens où une transmission apporte de nouvelles informations à "quasiment" chaque récepteur

Energy Efficient Multicast Algorithm for an Ad Hoc Network

In this paper, we propose an energy efficient multicast algorithm for an Ad hoc network. The network is configured by identifying the virtual node and its neighboring nodes to form a Directed Acyclic graph. The non interference links are identified by creating realization Indicator Function. The Scheduling unequal timeshares are computed for non interference links using realization indicator functions. The Network Coding is applied based on the incoming traffic and the different number of source nodes for packet delivery

Heuristics for Network Coding in Wireless Networks

Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from one source to all nodes, in a multi-hop wireless network. The broadcast we focus on is based on network coding, a promising avenue for reducing cost; previous work of ours showed that the performance of network coding with simple heuristics is asymptotically optimal: each transmission is beneficial to nearly every receiver. This is for homogenous and large networks of the plan. But for small, sparse or for inhomogeneous networks, some additional heuristics are required. This report proposes such additional new heuristics (for selecting rates) for broadcasting with network coding. Our heuristics are intended to use only simple local topology information. We detail the logic of the heuristics, and with experimental results, we illustrate the behavior of the heuristics, and demonstrate their excellent performance