Distributed topology design for network coding deployed networks

Minhae Kwon, Hyunggon Park

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish
Pages (from-to)380-392
Number of pages13
JournalSignal Processing
StatePublished - Dec 2019

Bibliographical note

Publisher Copyright:
© 2019 Elsevier B.V.


  • Distributed solution
  • Game theory
  • Multi-source multicast flows
  • Network coding
  • Topology design


Dive into the research topics of 'Distributed topology design for network coding deployed networks'. Together they form a unique fingerprint.

Cite this