Cargando…
Minimal Increase Network Coding for Dynamic Networks
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed....
Autores principales: | Zhang, Guoyin, Fan, Xu, Wu, Yanxia |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4750993/ https://www.ncbi.nlm.nih.gov/pubmed/26867211 http://dx.doi.org/10.1371/journal.pone.0148725 |
Ejemplares similares
-
Structural inference embedded adversarial networks for scene parsing
por: Wang, ZeYu, et al.
Publicado: (2018) -
Design an Effective Blood Distribution Network with Minimal Impacts on the Environment and Blood Supply Assurance
por: Zheng, Xiaojin, et al.
Publicado: (2022) -
Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources
por: Hu, Xiao-Bing, et al.
Publicado: (2014) -
A Dynamic Community Detection Method for Complex Networks Based on Deep Self-Coding Network
por: Zhang, Yusha, et al.
Publicado: (2022) -
Predictive Coding of Dynamical Variables in Balanced Spiking Networks
por: Boerlin, Martin, et al.
Publicado: (2013)