Fountain-Coded File Spreading Over Mobile Networks

Spreading a large file consisting of many packets over a mobile network is challenging due to the short meeting duration for each transmission. Moreover, two typical causes of inefficient file spreading are duplicate packet reception at the destination nodes and excessive overhead exchanges. We propose to employ fountain codes at the source node to jointly addresses the three issues: 1) each coded packet can be small enough to fit into the meeting duration; 2) duplicate packet reception is significantly reduced since each coded packet is innovative; and 3) overhead is greatly saved by using file-level ACK instead of packet-level ACK. We conduct performance analysis in terms of the source-to-destination file delay and source-to-destination file spreading time in both non-relaying and relaying scenarios. While packet duplication can be eliminated in the former scenario, there is still a non-trivial duplication probability if relaying is allowed. Therefore, we propose a fountain-coded two-hop relaying (FTTR) protocol to further reduce the packet duplication ratio so that the spreading performance does not degrade with network size. The file spreading time and packet duplication ratio of FTTR are derived in closed form and verified through simulations.

[1]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[2]  Mohammad Hamed Firooz,et al.  Data Dissemination in Wireless Networks with Network Coding , 2012, IEEE Communications Letters.

[3]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[4]  Rachid El Azouzi,et al.  Interplay of contact times, fragmentation and coding in DTNs , 2013, 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt).

[5]  Christian Esposito,et al.  Distributed strategic learning for effective gossiping in wireless networks , 2016, 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[6]  Huaiyu Dai,et al.  Gossip-Based Information Spreading in Mobile Networks , 2012, IEEE Transactions on Wireless Communications.

[7]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[8]  Xin Li,et al.  Just FUN: a joint fountain coding and network coding approach to loss-tolerant information spreading , 2014, MobiHoc '14.

[9]  Jörg Widmer,et al.  Efficient broadcasting using network coding , 2008, IEEE/ACM Trans. Netw..

[10]  Lie-Liang Yang,et al.  Socially aware integrated centralized infrastructure and opportunistic networking: a powerful content dissemination catalyst , 2016, IEEE Communications Magazine.

[11]  Do Young Eun,et al.  Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks , 2009, TNET.

[12]  Devavrat Shah,et al.  Fast Distributed Algorithms for Computing Separable Functions , 2005, IEEE Transactions on Information Theory.

[13]  Bernhard Haeupler,et al.  Analyzing Network Coding (Gossip) Made Easy , 2010, J. ACM.

[14]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[15]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2011 .

[16]  Lie-Liang Yang,et al.  Distributed Multistage Cooperative-Social-Multicast-Aided Content Dissemination in Random Mobile Networks , 2015, IEEE Transactions on Vehicular Technology.

[17]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[18]  Dapeng Oliver Wu,et al.  From Rateless to Hopless , 2015, IEEE/ACM Transactions on Networking.

[19]  Huaiyu Dai,et al.  Mobile conductance in sparse networks and mobility-connectivity tradeoff , 2014, 2014 IEEE International Symposium on Information Theory.

[20]  Bernard Mans,et al.  Broadcast delay of epidemic routing in intermittently connected networks , 2009, 2009 IEEE International Symposium on Information Theory.

[21]  Edmund M. Yeh,et al.  On the latency for information dissemination in mobile wireless networks , 2008, MobiHoc '08.

[22]  Devavrat Shah,et al.  Gossip Algorithms , 2009, Found. Trends Netw..

[23]  Eitan Altman,et al.  Forward Correction and Fountain Codes in Delay-Tolerant Networks , 2008, IEEE/ACM Transactions on Networking.

[24]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[25]  Devavrat Shah,et al.  Product Multicommodity Flow in Wireless Networks , 2006, IEEE Transactions on Information Theory.