Cooperative file sharing mechanism with Network Coding in wireless Mesh networks  

作　　者：KIMBA DIT ADAMOU Boubacar ZOU Shi-hong ABDOU Saley MA Yi-hui CHENG Shi-duan 

机构地区：[1]School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China [2]MAC Engineering Inc., Canada T2S OCT

出　　处：《The Journal of China Universities of Posts and Telecommunications》2009年第1期1-8,共8页中国邮电高校学报（英文版）

基　　金：supported by the National Basic Research Program of China (2003CB314806);the Hi-Tech Research and Development Program of China (2007AA12Z321);the National Natural Science Foundation of China (60603060, 60502037 and 90604019).

摘　　要：This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors＇ approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic random linear Network Coding. Within this mechanism, every node transmits random linear combination of its packets according to cooperative priority, which is computed in a distributed manner according to the node-possible contribution to its neighbor nodes. With this mechanism, the more a node contributes to others, the more the node has chances to recover the entire file first. The performance metrics of interest here are： the delay until all the packets in a file have been delivered to all nodes, and an ideal packet size, by the use of which the authors can get the minimum transmission delay. Through extensive simulation the authors compare their mechanism with the current transmission process in a wireless Mesh network without random linear Network Coding. The authors found that using their mechanism, the nodes can cooperatively share the entire file with less transmission time and delay than the current transmission process without random linear network.This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors＇ approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic random linear Network Coding. Within this mechanism, every node transmits random linear combination of its packets according to cooperative priority, which is computed in a distributed manner according to the node-possible contribution to its neighbor nodes. With this mechanism, the more a node contributes to others, the more the node has chances to recover the entire file first. The performance metrics of interest here are： the delay until all the packets in a file have been delivered to all nodes, and an ideal packet size, by the use of which the authors can get the minimum transmission delay. Through extensive simulation the authors compare their mechanism with the current transmission process in a wireless Mesh network without random linear Network Coding. The authors found that using their mechanism, the nodes can cooperatively share the entire file with less transmission time and delay than the current transmission process without random linear network.

关 键 词：wireless Mesh network Network Coding file sharing 

分 类 号：TN929.5[电子电信—通信与信息系统]