The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2012 vol.23)
pp: 2254-2265
Eyuphan Bulut , Rensselaer Polytechnic Institute, Troy
Boleslaw K. Szymanski , Rensselaer Polytechnic Institute, Troy
ABSTRACT
Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs), making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols. In this paper, we introduce a new metric that detects the quality of friendships between nodes accurately. Utilizing this metric, we define the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly. We also present Friendship-Based Routing in which periodically differentiated friendship relations are used in forwarding of messages. Extensive simulations on both real and synthetic traces show that the introduced algorithm is more efficient than the existing algorithms.
INDEX TERMS
Routing, Social network services, Algorithm design and analysis, Tolerant networks, Delay, efficiency, Delay tolerant networks, mobile social networks, routing
CITATION
Eyuphan Bulut, Boleslaw K. Szymanski, "Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 12, pp. 2254-2265, Dec. 2012, doi:10.1109/TPDS.2012.83
REFERENCES
[1] P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, and D. Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet," Proc. ACM 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
[2] J. Ott and D. Kutscher, "A Disconnection-Tolerant Transport for Drive-Thru Internet Environments," Proc. IEEE INFOCOM, 2005.
[3] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
[4] K. Harras, K. Almeroth, and E. Belding-Royer, "Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding Schemes in Sparse Mobile Networks," Proc. Fourth IFIP-TC6 Int'l Conf. Networking Technologies, Services, and Protocols; Performance of Computer and Comm. Networks; Mobile and Wireless Comm. Systems, May 2005.
[5] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 77-90, Feb. 2008.
[6] E. Bulut, Z. Wang, and B. Szymanski, "Cost Effective Multi-Period Spraying for Routing in Delay Tolerant Networks," IEEE/ACM Trans. Networking, vol. 18, no. 5, pp. 1530-1543, Oct. 2010.
[7] 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.
[8] E.P.C. Jones, L. Li, and P.A.S. Ward, "Practical Routing in Delay Tolerant Networks," Proc. ACM SIGCOMM Workshop Delay Tolerant Networking (WDTN), 2005.
[9] T. Spyropoulos, K. Psounis, and C.S. 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.
[10] J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine, "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks," Proc. IEEE INFOCOM, Apr. 2006.
[11] Y. Wang, S. Jain, M. Martonosi, and K. Fall, "Erasure-Coding Based Routing for Opportunistic Networks," Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking, 2005.
[12] S. Jain, M. Demmer, R. Patra, and K. Fall, "Using Redundancy to Cope with Failures in a Delay Tolerant Network," Proc. ACM SIGCOMM, 2005.
[13] E. Bulut, Z. Wang, and B. Szymanski, "Cost Efficient Erasure Coding Based Routing in Delay Tolerant Networks," Proc. IEEE Int'l Conf. Comm. (ICC), 2010.
[14] Y. Liao, K. Tan, Z. Zhang, and L. Gao, "Estimation Based Erasure Coding Routing in Delay Tolerant Networks," Proc. Int'l Conf. Wireless Comm. and Mobile Computing, July 2006.
[15] L. Chen, C. Yu, T. Sun, Y. Chen, and H. Chu, "A Hybrid Routing Approach for Opportunistic Networks," Proc. ACM SIGCOMM, pp. 213-220, Sept. 2006.
[16] E. Daly and M. Haahr, "Social Network Analysis for Routing in Disconnected Delay-Tolerant Manets," Proc. ACM MobiHoc, 2007.
[17] P. Hui, J. Crowcroft, and E. Yoneki, "BUBBLE Rap: Social Based Forwarding in Delay Tolerant Networks," Proc. ACM MobiHoc, 2008.
[18] E. Bulut, Z. Wang, and B.K. Szymanski, "Impact of Social Networks in Delay Tolerant Routing," Proc. IEEE GLOBECOM, 2009.
[19] F. Li and J. Wu, "LocalCom: A Community-Based Epidemic Forwarding Scheme in Disruption-Tolerant Networks," Proc. IEEE Comm. Soc. Sixth Ann. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON), pp. 574-582, 2009.
[20] T. Zhou, R.R. Choudhury, and K. Chakrabarty, "Diverse Routing: Exploiting Social Behavior for Routing in Delay-Tolerant Networks," Proc. Conf. Computational Science and Eng., 2009.
[21] Q. Li, S. Zhu, and G. Cao, "Routing in Selfish Delay Tolerant Networks," Proc. IEEE INFOCOM, 2010.
[22] P. Hui and E. Yoneki, "Distributed Community Detection in Delay Tolerant Networks," Proc. Second ACM/IEEE Int'l Workshop Mobility in the Evolving Internet Architecture (MobiArch), p. 18, 2007.
[23] M.E.J. Newman, "The Structure and Function of Complex Networks," SIAM Rev., vol. 45, pp. 167-256, Mar. 2003.
[24] T. Hossmann, T. Spyropoulos, and F. Legendre, "Putting Contacts into Context: Mobility Modeling Beyond Inter-Contact Times," Proc. ACM MobiHoc, 2011.
[25] P. Hui and J. Crowcroft, "Predictability of Human Mobility and Its Impact on Forwarding," Proc. Third Int'l Conf. Comm. and Networking in China, 2008.
[26] J.M. Pujol, A.L. Toledo, and P. Rodriguez, "Fair Routing in Delay Tolerant Networks," Proc. IEEE INFOCOM, 2009.
[27] J. Link, N. Viol, A. Goliath, and K. Wehrle, "SimBetAge: Utilizing Temporal Changes in Social Networks for Pocket Switched Networks," Proc. ACM Workshop User-Provided Networking, 2009.
[28] T. Hossmann, T. Spyropoulos, and F. Legendre, "Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing," Proc. IEEE INFOCOM, 2010.
[29] N. Eagle, A. Pentland, and D. Lazer, "Inferring Social Network Structure Using Mobile Phone Data," Proc. Nat'l Academy of Sciences of USA, vol. 106, no. 36, pp. 15274-15278, 2009.
[30] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages," Proc. ACM MobiHoc, 2003.
[31] C. Chen and Z. Chen, "Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding," IEEE Trans. Mobile Computing, vol. 8, no. 10, pp. 1397-1411, Oct. 2009.
[32] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, "Performance Analysis of Mobility-Assisted Routing," Proc. MobiHoc, 2006.
[33] M. Musolesi and C. Mascolo, "A Community Based Mobility Model for Ad Hoc Network Research," Proc. Second Int'l Workshop Multi-Hop Ad Hoc Networks: From Theory To Reality (ACM REALMAN), 2006.
[34] S. Srinivasa and S. Krishnamurthy, "CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time," Proc. IEEE Comm. Soc. Sixth Ann. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON), 2009.
[35] P.U. Tournoux, J. Leguay, F. Benbadis, V. Conan, M. Amorim, and J. Whitbeck, "The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing," Proc. IEEE INFOCOM, 2009.
[36] C. Liu and J. Wu, "Routing in a Cyclic Mobispace," Proc. ACM MobiHoc, 2008.
[37] C. Liu and J. Wu, "An Optimal Probabilistically Forwarding Protocol in Delay Tolerant Networks," Proc. MobiHoc, 2009.
[38] CRAWDAD Data Set, http:/crawdad.cs.dartmouth.edu, 2012.
[39] A European Union Funded Project in Situated and Autonomic Comm., www.haggleproject.org, 2012.
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool