JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of KIISE
  • Volume 42, Issue 7,  2015, pp.929-938
  • Publisher : Korean Institute of Information Scientists and Engineers
  • DOI : 10.5626/JOK.2015.42.7.929
 Title & Authors
Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks
Kim, Seohyang; Oh, Hayoung; Kim, Chongkwon;
 
 Abstract
In opportunistic networks, each message is delivered to the destination by repeating, storing, carrying, and forwarding the message. Recently, with the vitalization of social networks, a large number of existing articles have shown performance improvement when delivering the message and considering its social relational networks. However, these works only deliver messages when they find nodes, assuming that every node cooperates with each other unconditionally. Moreover, they only consider the number of short-term contacts and local social relations, but have not considered each node's average relation with the destination node. In this paper, we propose novel message sending techniques for opportunistic networks using nodes' social network characteristics. In this scheme, each message is delivered to the destination node with fewer copies by delivering it mostly through nodes that have high intimacy with the destination node. We are showing that our proposed scheme presents a 20% performance increase compared to existing schemes.
 Keywords
opportunistic network;social network;message delivery technique;device to device;communication technique;sensor network;
 Language
Korean
 Cited by
 References
1.
A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-2000-06, Duke University, 2000.

2.
F. Li and J. Wu, "LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks," Proc. IEEE Conf. Sensor, Mesh and Ad Hoc Communications and Networks, pp. 574-582, Jun. 2009.

3.
Abderrahmen Mtibaa, Martin May, Christophe Diot and Mostafa Ammar, "PeopleRank: Social Opportunistic Forwarding," IEEE INFOCOM 2010, San Diego, CA, USA, 2010.

4.
A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," Service Assurance with Partial and Intermittent Resources, Springer Berlin Heidelberg, pp. 239-254. 2004.

5.
Bulut, Eyuphan, and Boleslaw K. Szymanski, "Friendship based routing in delay tolerant mobile social networks," Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE, MIAMI, FLORIDA, USA, 2010.

6.
Chan-Myung Kim, In-Seok Kang, Young-Jun Oh and Youn-Hee Han, "An Opportunistic Routing Scheme Based on Social Relations in Delay- Tolerant Networks," KIPS Tr. Comp. and Comm. Sys., Vol. 3, No. 1, pp. 15-22, Mar. 2014.

7.
S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Comput. Netw. ISDN Syst., 30(1-7):107-117, 1998. crossref(new window)

8.
Wei Gao and Guohong Cao, "User-Centric Data Dissemination in Disruption Tolerant Networks," IEEE INFOCOM 2011, Shanghai, China, 2011.

9.
Pavlos Sermpezis and Thrasyvoulos Spyropoulos, "Not all content is created equal: Effect of popularity and availability for content-centric opportunistic networking," ACM MobiHoc 2014, Philadelphia, PA, USA, 2014.

10.
Kanchana Thilakarathna, Aline Carneiro Viana and Aruna Seneviratne, "Mobile Social networking through friend-to-friend opportunistic Content dissemination," ACM MobiHoc 2013, Bangalore, India, 2013.

11.
Floriano De Rango and Filippo Monteverdi, "Social and dynamic graph-based scalable routing protocol in a DTN network," Performance Evaluation of Computer and Telecommunication Systems (SPECTS) 2012, Genoa, Italy, Jul. 2012.

12.
Ying Zhu, et. al., "A Survey of social-based routing in delay tolerant networks: Positive and negative social effects," IEEE Communications Surveys & Tutorials, Vol. 15, No. 1, pp. 387-401, Apr. 2012.

13.
U. B. Shevade, H. H. Song, L. Qiu, and Y. Zhang, "Incentive-aware routing in DTNs," Proc. 16th IEEE International Conference on Network Protocols (ICNP 2008), Orlando, FL, USA, Oct. 2008.

14.
J.-g. Shon, Y.-h. Kim and Y.-H. Han, "Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks," KIPS Transactions on Computer and Communication System, Vol. 2 No. 5. pp. 209-216, 2013. crossref(new window)

15.
Y.-h. Kim, C.-M. Kim, Y.-H. Han, Y.-S. Jeong and D.-S. Park, "Betweenness of Expanded Ego Networks in Sociality-Aware Delay Tolerant Networks," Ubiquitous Information Technologies and Applications (LNEE, Proc. of CUTE 2012), Springer, pp. 499-505, Dec. 2012.