Polynomial Time and Provably Efficient Network Coding Scheme for Lossy Wireless Networks

Author(s):  
Abdallah Khreishah ◽  
Issa M. Khalil ◽  
Jie Wu
2009 ◽  
Vol 15 (8) ◽  
pp. 1152-1164 ◽  
Author(s):  
Xiaoyan Zhu ◽  
Hao Yue ◽  
Yuguang Fang ◽  
Yumin Wang

2014 ◽  
Vol 529 ◽  
pp. 721-725
Author(s):  
Feng Jun Shang ◽  
Zhe Geng

In order to improve the performance of multi-hop wireless network, network coding mixes multiple signals in a single channel. A coding scheme proposed previously which is called BEND is a very compelling network coding applications. While it is another way of such programs, but there is still great potential to be developed. This article, based on BEND, expands the width of the potential paths by asking more potential nodes to join so that it increases network throughput and reduces the transmission delay at the same time. It is not a right way neither in theory nor in practical application that increasing the width of the paths unlimitedly by progressive approach. So the best paths width, as well as the network parameters which affecting the paths width is discussed in the final part of this article.


Sign in / Sign up

Export Citation Format

Share Document