.png){kind=icon}
.png){kind=icon}
Return
Distributed topology design for network coding deployed networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2019.07.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Network coding
Game theory
Topology design
Distributed solution
Multi-source multicast flows
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W