Distributed Topology Design for Network Coding Deployed Large-scale Sensor Networks

TL;DR

This paper introduces a game-theoretic, low-complexity distributed algorithm for topology formation in large-scale sensor networks with network coding, ensuring stable configurations for multi-source multicast flows.

Contribution

It presents a novel decomposition of the topology formation game into simpler two-player link formation games, enabling practical deployment in large-scale networks.

Findings

Low computational complexity suitable for large networks

Guaranteed to find at least one stable topology

Effective in multi-source multicast scenarios

Abstract

In this paper, we propose a solution to the distributed topology formation problem for large-scale sensor networks with multi-source multicast flows. The proposed solution is based on game-theoretic approaches in conjunction with network coding. The proposed algorithm requires significantly low computational complexity, while it is known as NP-hard to find an optimal topology for network coding deployed multi-source multicast flows. In particular, we formulate the problem of distributed network topology formation as a network formation game by considering the nodes in the network as players that can take actions for making outgoing links. The proposed solution decomposes the original game that consists of multiple players and multicast flows into independent link formation games played by only two players with a unicast flow. We also show that the proposed algorithm is guaranteed to determine at least one stable topology. Our simulation results confirm that the computational complexity of the proposed solution is low enough for practical deployment in large-scale networks.