Browse > Article
http://dx.doi.org/10.1109/JCN.2015.000027

Delay Tolerant Information Dissemination via Coded Cooperative Data Exchange  

Tajbakhsh, Shahriar Etemadi (University of New South Wales)
Sadeghi, Parastoo (Australian National University)
Publication Information
Journal of Communications and Networks / v.17, no.2, 2015 , pp. 133-144 More about this Journal
Abstract
In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.
Keywords
Cooperative data exchange; delay tolerant networks; network coding;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Hui et al., "Pocket switched networks," Tech. Rep., 2005.
2 T. Ho et al., "On randomized network coding," in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, 2003.
3 S. E. Tajbakhsh and P. Sadeghi, "How to shuffle and scatter pieces of a puzzle over a metropolitan area," in Proc. IEEE WCNC, 2012.
4 S. E. Tajbakhsh and P. Sadeghi, "Energy efficient coded cooperative data exchange for mobile users," in Proc. IEEE PIMRC, Toronto, Canada, 2011.
5 K. Lee et al., "Slaw: A mobility model for human walks," in Proc. IEEE INFOCOM 2009, Rio de Janiero, Brazil, Apr. 2009.
6 F. Chierichetti, S. Lattanzi, and A. Panconesi, "Almost tight bounds for rumour spreading with conductance," in Proc. The 42nd ACM symposium on Theory of computing, 2010, pp. 399-408.
7 Z. J. Haas, J. Y. Halpern, and L. Li, "Gossip-based ad hoc routing," IEEE/ACM Trans. Netw., vol. 14, no. 3, pp. 479-491, 2006.   DOI
8 R. Karp et al., "Randomized rumor spreading," in Proc. IEEE 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 565-574.
9 D. Kempe and J. Kleinberg, "Protocols and impossibility results for gossip-based communication mechanisms," in Proc. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 471-480.
10 S. Deb, M. Medard, and C. Choute, "On random network coding based information dissemination," in Proc. IEEE ISIT, 2005, pp. 278-282.
11 B. Haeupler and D. Karger, "Faster information dissemination in dynamic networks via network coding," in Proc. The 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, 2011, pp. 381-390.
12 M. Borokhovich, C. Avin, and Z. Lotker, "Tight bounds for algebraic gossip on graphs," in Proc. IEEE ISIT, 2010, pp. 1758-1762.
13 D. Mosk-Aoyama and D. Shah, "Information dissemination via network coding," in Proc. IEEE ISIT, 2006, pp. 1748-1752.
14 B. Haeupler, "Analyzing network coding gossip made easy," in Proc. The 43rd annual ACMsymposium on Theory of computing, 2011, pp. 293-302.
15 X. Liu et al., "Network coding based cooperative peer-to-peer repair in wireless ad-hoc networks," in Proc. IEEE ICC, Beijing, China, May 2008.
16 C. Fragouli, J. Widmer, and J.-Y. Le Boudec, "On the benefits of network coding for wireless applications," in Proc. 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006, pp. 1-6.
17 C. Fragouli, J.Widmer, and J. Y. L. Boudec, "Efficient broadcasting using network coding," IEEE/ACM Trans. Netw., vol. 16, no. 2, pp. 450-463, 2008.   DOI
18 S. E. Tajbakhsh, P. Sadeghi, and R. Shams, "A generalized model for cost and fairness analysis in coded cooperative data exchange," in Proc. Netcod, Beijing, China, July 2011.
19 L. Militano et al., "Data seeding in nomadic cooperative groups," in Proc. ISCC, Greece, 2011.
20 Z. D. L. Al-Kanj and W. Saad, "A game theoretic approach for content distribution over wireless networks with mobile-to-mobile cooperation," in Proc. PIMRC, Toronto, Canada, 2011.
21 C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE Infocom, 2005.
22 P. Wang et al., "Understanding the spreading patterns of mobile phone viruses," Science, vol. 324, no. 5930, pp. 1071-1076, 2009.   DOI
23 J. Su et al., "Haggle: Seamless networking for mobile applications," in Proc. Ubiquitous Computing, Inssbruck, Austria, Sept. 2007.
24 N. Sarafijanovic-Djukic, M. Pidrkowski, and M. Grossglauser, "Island hopping: Efficient mobility-assisted forwarding in partitioned networks," in Proc. SECON, 2006, vol. 1, pp. 226-235.
25 G. Karlsson, V. Lenders, and M. May, "Delay tolerant broadcasting," IEEE Trans. Broadcast., vol. 53, pp. 369-381, 2007.   DOI
26 Y. Li et al., "Energy-efficient optimal opportunistic forwarding for delay-tolerant networks," IEEE Trans. Veh. Technol., vol. 59, pp. 4500-4512, 2010.   DOI
27 P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay-tolerant networks," IEEE Trans. Mobile Comput., vol. 10, pp. 1576-1589, 2011.   DOI
28 V. Erramilli et al., "Diversity of forwarding paths in pocket switched networks," in Proc. ACM SIGCOMM, 2007.
29 D. Brockmann, L. Hufnagel, and T. Geisel, "The scaling laws of human travel," Nature, vol. 439, no. 7075, pp. 462-465, 2006.   DOI
30 M. C. Gonzalez, C. A. Hidalgo, and A.-L. Barabasi, "Understanding individual human mobility patterns," Nature, vol. 453, no. 7196, pp. 779-782, 2008.   DOI
31 M. Kim, D. Kotz, and S. Kim, "Extracting a mobility model from real user traces." in Proc. IEEE INFOCOM, vol. 6, 2006, pp. 1-13.
32 I. Rhee et al., "On the levy-walk nature of human mobility," IEEE/ACM Trans. Netw., vol. 19, no. 3, pp. 630-643, 2011.   DOI
33 H. Bo et al., "Mobile data offloading through opportunistic communications and social participation," IEEE Trans.Mobile Comput., vol. 11, no. 5, pp. 821-834, 2012.   DOI
34 J. Whitbeck et al., "Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays," in Proc. IEEE WoWMoM, 2011, pp. 1-10.
35 Y. Li et al., "Multiple mobile data offloading through delay tolerant networks," in Proc. ACM workshop on Challenged networks, 2011, pp. 43-48.
36 K. Lee et al., "Slaw: A mobility model for human walks." [Online]. Available: http://research.csc.ncsu.edu/netsrv-/?q=content/human-mobility-models-download-tlw-slaw
37 N.-S. Chen et al., "Multiple contents offloading through opportunistic communications," in Proc. ConTEL, 2013, pp. 65-70.
38 Y. Fernandess and D. Malkhi, "On collaborative content distribution using multi-message gossip," J. Parallel and Distrib. Comput., vol. 67, no. 12, pp. 1232-1239, 2007.   DOI
39 P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. The annual Allerton conference on communication control and computing, vol. 41, no. 1, 2003, pp. 40-49.
40 R. K. Jain, D. W. Chiu, and W. R. Hawe, "A quantitative measure of fairness and discrimination for resource allocation in shared computer system," DEC-TR-301, Tech. Rep., 1984.
41 D. G. Saari, Basic Geometry of Voting, Berlin, Germany: Springer, 1995.
42 M. Cha et al., "I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system," in Proc. The 7th ACM SIGCOMM conference on Internet measurement, 2007.
43 L. Militano et al., "A genetic algorithm for source election in cooperative clusters implementing network coding," in Proc. IEEE ICC, 2010, pp. 1-6.
44 M. X. Goemans et al., "Market sharing games applied to content distribution in ad hoc networks," IEEE J. Sel. Areas Commun., vol. 24, no. 5, pp. 1020-1033, 2006.   DOI
45 K. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. SIGCOMM, 2003.
46 A. Clementi, R. Silvestri, and L. Trevisan, "Information spreading in dynamic graphs," in Proc. the 2012 ACM symposium on Principles of distributed computing, 2012, pp. 37-46.