Premium
Network coding based on hyper‐edge decomposition for wireless network with link failures
Author(s) -
Wang Jing,
Chi Kaikai,
Yang Yang,
Wang Xinmei
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2781
Subject(s) - computer science , wireless network , linear network coding , computer network , enhanced data rates for gsm evolution , wireless , coding (social sciences) , wireless wan , separable space , graph , theoretical computer science , wi fi array , telecommunications , mathematics , statistics , network packet , mathematical analysis
Summary This paper is concerned with the construction of network coding for wireless network with link failures. Based on hyper‐edge decomposition, for the wireless network, we first construct the hyper‐edge graph, where each node represents one hyper‐edge (consisting of multiple adjacent edges transmitting the same information) of the wireless network. Then we present a heuristic coloration method for the hyper‐edge graph, and a network coding vector allocation scheme based on maximum distance separable code is proposed to effectively overcome some link failures. Copyright © 2014 John Wiley & Sons, Ltd.