Intermittently connected mobile network (ICMN) is a delay-tolerant ad hoc network that is made up of mobile nodes. Here most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. Extreme mobility may render a complete path discovery highly inefficient. In these networks, there is usually no supporting infrastructure for routing. Due to frequent network disruption and intermittent connections in ICMN, it is difficult to establish reliable end-to-end paths between mobile peers. Conventional routing schemes fail, as they try to establish complete end-to-end paths, before any data is sent. In a social network, nodes show group behaviors so that some nodes meet each other more frequently than others. Bubble Rap routing protocol is used to forward the message to the destination based on the two metrics such as Community and Centrality nodes. Global ranking and local ranking systems are calculated to forward the message thus providing higher delivery rates and shorter delivery delays in the ICMN.

1. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein (2002), "Energy-efficient computing for wildlife tracking: Design tradeoffs andearly experiences with ZebraNet," in Proc. ASPLOS-X, pp. 96–107.
2. Balasubramanian, B. N. Levine, and A. Venkataramani (2007), "DTN routing as a resource allocation problem," in Proc. ACM SIGCOMM, Japan, pp. 373–384.
3. Becker. D and Vahdat. A (2000), 'Epidemic routing for partially connected ad hoc networks', Duke Univ. , Durham, NC, Tech. Rep
4. Daly. E and Haahr. M (2007), 'Social Network Analysis for Routing in Disconnected Delay-Tolerant Manets', Proc. ACM MobiHoc
5. Doria. A, Lindgren. A, and Schelen. O (2004), 'Probabilistic routing in intermittently connected networks', in Proc. SAPIR, vol. 3126, LNCS,pp. 239–254
6. Hui. P and Crowcroft . J (2011), 'BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks', vol. 10, no. 11 ,IEEE November
7. Newman M. E. J (2004), 'Detecting Community Structure in Networks', The European Physical J. B, vol. 38, pp. 321-330.
8. Okasha. S (2005), 'Altruism, Group Selection and Correlated Interaction', vol. 56, no. 4, pp. 703-725, Dec
9. Psounis. K, Raghavendra. C and Spyropoulos. T (2008), 'Efficient routing in intermittently connected mobile networks: The single-copy case',IEEE Trans. Networking, vol. 16, no. 1, Feb
10. Psounis. K, Raghavendra. C and Spyropoulos. T (2005), 'Spray and wait: An efficient routing scheme forintermittently connected mobile networks', in Proc. ACM WDTN, Aug, pp. 252–259
11. Thrasyvoulos Spyropoulos (2008), 'Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case', IEEE/ACM Transactions on Networking, Vol. 16, No. 1.
12. www. scalable-networks. com.

Social Network Forwarding Intermittently Connected Network