The Community for Technology Leaders
RSS Icon
Issue No.01 - Jan. (2013 vol.12)
pp: 151-165
Wei Gao , The Pennsylvania State University, University Park
Guohong Cao , The Pennsylvania State University, University Park
Tom La Porta , The Pennsylvania State University, University Park
Jiawei Han , University of Illinois at Urbana-Champaign, Urbana
Unpredictable node mobility, low node density, and lack of global information make it challenging to achieve effective data forwarding in Delay-Tolerant Networks (DTNs). Most of the current data forwarding schemes choose the nodes with the best cumulative capability of contacting others as relays to carry and forward data, but these nodes may not be the best relay choices within a short time period due to the heterogeneity of transient node contact characteristics. In this paper, we propose a novel approach to improve the performance of data forwarding with a short time constraint in DTNs by exploiting the transient social contact patterns. These patterns represent the transient characteristics of contact distribution, network connectivity and social community structure in DTNs, and we provide analytical formulations on these patterns based on experimental studies of realistic DTN traces. We then propose appropriate forwarding metrics based on these patterns to improve the effectiveness of data forwarding. When applied to various data forwarding strategies, our proposed forwarding metrics achieve much better performance compared to existing schemes with similar forwarding cost.
Transient analysis, Measurement, Communities, Relays, Peer to peer computing, Mobile communication, Time factors, community, Forwarding, transient contact pattern, social network, delay-tolerant network, centrality
Wei Gao, Guohong Cao, Tom La Porta, Jiawei Han, "On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks", IEEE Transactions on Mobile Computing, vol.12, no. 1, pp. 151-165, Jan. 2013, doi:10.1109/TMC.2011.249
[1] M. Abramovitz and I. Stegun, Handbook of Mathematical Functions. Dover, 1972.
[2] A. Balasubramanian, B. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," Proc. SIGCOMM, 2007.
[3] J. Burgess, B. Gallagher, D. Jensen, and B. Levine, "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks," Proc. IEEE INFOCOM, 2006.
[4] H. Cai and D.Y. Eun, "Crossing over the Bounded Domain: From Exponential to Power-Law Inter-Meeting Time in MANET," Proc. ACM MobiCom, pp. 159-170, 2007.
[5] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of Human Mobility on Opportunistic Forwarding Algorithms," IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.
[6] A. Chaintreau, A. Mtibaa, L. Massoulie, and C. Diot, "The Diameter of Opportunistic Mobile Networks," Proc. ACM CoNEXT, 2007.
[7] S.Y. Chan, P. Hui, and K. Xu, "Community Detection of Time-Varying Mobile Social Networks," Complex Sciences, vol. 4, pp. 1154-1159, 2009.
[8] P. Costa, C. Mascolo, M. Musolesi, and G. Picco, "Socially Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks," IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 748-760, June 2008.
[9] E. Daly and M. Haahr, "Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs," Proc. ACM MobiHoc, 2007.
[10] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages," Proc. ACM MobiHoc, pp. 257-266, 2003.
[11] N. Eagle and A. Pentland, "Reality Mining: Sensing Complex Social Systems," Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255-268, 2006.
[12] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, "Delegation Forwarding," Proc. ACM MobiHoc, 2008.
[13] K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," Proc. SIGCOMM, pp. 27-34, 2003.
[14] L. Freeman, "A Set of Measures of Centrality Based on Betweenness," Sociometry, vol. 40, no. 1, pp. 35-41, 1977.
[15] W. Gao and G. Cao, "On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks," Proc. IEEE Int'l 18th Network Protocols Conf. (ICNP), 2010.
[16] W. Gao and G. Cao, "User-Centric Data Dissemination in Disruption Tolerant Networks," Proc. IEEE INFOCOM, 2011.
[17] W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in Delay Tolerant Networks: A Social Network Perspective," Proc. ACM MobiHoc, pp. 299-308, 2009.
[18] P. Hui, J. Crowcroft, and E. Yoneki, "Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks," Proc. ACM MobiHoc, 2008.
[19] P. Hui, E. Yoneki, S. Chan, and J. Crowcroft, "Distributed Community Detection in Delay Tolerant Networks," Proc. ACM Int'l Workshop Mobility in the Evolving Internet Architecture (MobiArch '07), 2007.
[20] T. Karagiannis, J.-Y. Boudec, and M. Vojnovic, "Power Law and Exponential Decay of Inter Contact Times Between Mobile Devices," Proc. ACM MobiCom, pp. 183-194, 2007.
[21] Q. Li, S. Zhu, and G. Cao, "Routing in Socially Selfish Delay Tolerant Networks," Proc. IEEE INFOCOM, 2010.
[22] A. Lindgren, A. Doria, and O. Schelen, "Probabilistic Routing in Intermittently Connected Networks," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.
[23] M. McNett and G. Voelker, "Access and Mobility of Wireless PDA Users," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 9, no. 2, pp. 40-55, 2005.
[24] S.C. Nelson, M. Bakht, R. Kravets, and A. Harris, "Encounter-Based Routing in Dtns," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 13, no. 1, pp. 56-59, 2009.
[25] M. Newman, "Analysis of Weighted Networks," Physical Rev. E, vol. 70, no. 5, p. 056131, 2004.
[26] M. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks," Physical Rev. E, vol. 69, no. 2, p. 026113, 2004.
[27] G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society," Nature, vol. 435, no. 7043, pp. 814-818, 2005.
[28] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray-and-Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility," Proc. Pervasive Computing and Comm. Workshops, 2007.
[29] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
[30] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
[31] Q. Yuan, I. Cardei, and J. Wu, "Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks," Proc. ACM MobiHoc, pp. 95-104, 2009.
[32] J. Zhao and G. Cao, "VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks," Proc. IEEE INFOCOM, 2006.
50 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool