The major objective of any communication system is to have the messages dispatched to their corresponding terminal. The network topology of DTNs/OMNs is not only highly dynamic, but also exhibits high degree of network partitioning. The maneuverability of the node in delay tolerant network considerably harms the productivity of data forwarding. The proposed approach selects the path according to the feasible number of hops needed to reach the corresponding node. The architecture anonymizes each and every node of the network by giving them fake ids. When a node wants to send its confidential data to the other node then the sender node and receiver node only knows each other’s real id. Here the data is send in the encrypted form which can be decrypted using a key.

Disruption tolerant network, multicast, privacy, security, unicast

[1] Kang Chen, Member and Haiying Shen, “Face Change: Attaining Neighbor Node Anonymity in Mobile Opportunistic Social Networks With Fine-Grained Control” in IEEE/ACM Transactions on Networking(TON), vol. 25 issue 2, April 2017
[2] K. Chen and H. Shen, “Fine-grained encountering information collection under neighbor anonymity in mobile opportunistic social networks,” in Proc. IEEE ICNP, Nov. 2015, pp. 179–188.
[3] W. Gao and Q. Li, “Wakeup scheduling for energy-efficient communication in opportunistic mobile networks,” in Proc. IEEE INFOCOM, Apr. 2013, pp. 2058–2066.
[4] A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN routing as a resource allocation problem,” in Proc. SIGCOMM, 2007, pp. 373–384.
[5] K. Chen, H. Shen, and H. Zhang, “Leveraging social networks for p2p content-based file sharing in disconnected MANETs,” in IEEE Trans. Mobile Comput., vol. 13, no. 2, pp. 235–249, Feb. 2014.
[6] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of human mobility on opportunistic forwarding algorithms” IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 606–620, Jun. 2007.
[7] M. C. Chuah, “Social network aided multicast delivery scheme for human contact-based networks,” in Proc.1st Simplex, vol.1, issue 3, Feb. 2009.
[8] V. Conan, J. Leguay, and T. Friedma n, “Characterizing pairwise inter-contact patterns in delay tolerant networks,” in Proc. 1st Int. Conf. Autonomic Comput. Commun. Syst., Article no. 19, Oct. 2007.
[9] P. Costa, C. Mascolo, M. Musolesi, and G. Picco, “Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks” in IEEE J. Sel. Areas Commun., vol. 26, no. 5, pp. 748–760, Jun.2008.
[10] Junggab Son, Donghyun Kim, Rahman Tashakkori, Alade O, Tokuta, Heekuck Oh, “A New Mobile Online Social Network Based Location Sharing with Enhanced Privacy Protection” in IEEE Computer Communication and Networks (ICCCN), 25th International Conference, Aug. 2016.
[11] N. Eagle and A. Pentland, “Reality mining: Sensing complex social systems,” in Pers. Ubiquitous Comput., vol. 10, no. 4, pp. 255–268, 2006.
[12] E. Daly and M. Haahr, “Social network analysis for routing in disconnected delay-tolerant MANETs,” in Proc. ACM MobiHoc, 2007, pp.32–40.
[13] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Delegation for-warding,” in Proc. ACM MobiHoc, 2008, pp. 251–260.
[14] K. Fall, “Delay tolerant network architecture for challenged internets,” in Proc. ACM SIGCOMM, 2003, pp. 27–34.
[15] L. Freeman, “A set of measures of centrality based on betweenness, Sociometry”, in IEEE vol. 40, no. 1, pp. 35–41, 1977.
[16] W. Gao and G. Cao, “Fine-grained mobility characterization: Steady and transient state behaviors,” in Proc. ACM MobiHoc, 2010, pp.61–70.
[17] W. Gao and G. Cao, “On exploiting transient contact patterns for data forwarding in delay tolerant networks,” in Proc. IEEE ICNP, 2010, pp.193–202.
[18] W. Gao and G. Cao, “User-centric data dissemination in disruption tolerant networks,” in Proc. IEEE INFOCOM, 2011, pp. 3119–3127.
[19] W. Hsu and A. Helmy, “On nodal encounter patterns in wireless LAN races” in IEEE Trans. Mobile Comput., vol. 9, no. 11, pp. 1563–1577, Nov. 2010.
[20] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in delay tolerant networks: A social network perspective,” in Proc. ACM MobiHoc, 2009, pp. 299–308.
[21] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble rap: Social-based for-warding in delay tolerant networks,” in Proc. ACM MobiHoc, 2008, pp. 241–250.