Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

Preprint English OPEN
Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia;
  • Related identifiers: doi: 10.1109/MCOM.2012.6231292
  • Subject: Computer Science - Social and Information Networks | Computer Science - Networking and Internet Architecture
    acm: ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks ar... View more
  • References (17)
    17 references, page 1 of 2

    [1] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” in Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, ser. SIGCOMM '03. New York, NY, USA: ACM, 2003, pp. 27-34.

    [2] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” SIGCOMM Comput. Commun. Rev., vol. 34, pp. 145-158, Aug. 2004.

    [3] M. Wang and K. Nahrstedt, “Social Structure Based Routing of Intermittently Connected Network Using Contact Information,” in Proc. IEEE MILCOM, San Diego, California, USA, Nov. 2008, pp. 1-7.

    [4] C. Boldrini, M. Conti, and A. Passarella, “Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution,” Pervasive and Mobile Computing, vol. 4, no. 5, pp. 633-657, 2008.

    [5] P. Hui, J. Crowcroft, and E. Yoneki, “BUBBLE Rap: Social-Based Forwarding in Delay Tolerant Networks,” IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, Nov. 2011.

    [6] E. Daly and M. Haahr, “Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs,” IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 606-621, May 2009.

    [7] G. Ding and B. Bhargava, “Peer-to-peer File-sharing over Mobile Ad Hoc Networks,” in Proc. IEEE PerComW'04, Orlando, Florida, USA, Mar. 2004, pp. 104-108.

    [8] A. Vahdat and D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” Duke University, Tech. Rep. CS-2000-06, 2000.

    [9] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case,” IEEE/ACM Trans. Netw., vol. 16, pp. 77-90, Feb. 2008.

    [10] A. Lindgren, A. Doria, and O. Scheln, “Probabilistic Routing in Intermittently Connected Networks,” in Service Assurance with Partial and Intermittent Resources, ser. Lecture Notes in Computer Science, P. Dini, P. Lorenz, and J. N. d. Souza, Eds. Springer Berlin / Heidelberg, 2004, vol. 3126, pp. 239-254.

  • Metrics
Share - Bookmark