Network coding based on hyper‐edge decomposition for wireless network with link failures |
| |
| Authors: | Jing Wang Kaikai Chi Yang Yang Xinmei Wang |
| |
| Affiliation: | 1. School of Information Engineering, Chang'an University, Xi'an 710064, China;2. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China;3. State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China |
| |
| Abstract: | 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. |
| |
| Keywords: | network coding wireless network link failure hyper‐edge decomposition heuristic coloration |
|
|
