Journal of KIISE (정보과학회 논문지)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks

기회주의적 네트워크에서 노드의 그룹 친밀성 정보를 이용한 메시지 전달 기법

  • Received : 2014.11.27
  • Accepted : 2015.05.06
  • Published : 2015.07.15
⟨ Previous Next ⟩

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.

기회주의적 네트워크에서는 각 메시지들이 저장, 운반 및 전달을 반복하면서 목적지까지 전송된다. 최근 소셜 네트워크가 활성화되면서 기존의 많은 연구들은 메시지 전송 시 사회관계망을 고려하여, 기회적 메시지 전송에서의 성능 향상을 보여주었다. 하지만 기존 연구들은 사회관계망을 구성하고 있는 모든 노드들은 서로 무조건 협력한다는 강한 가정 아래 전송 범위 안에 메시지를 수신할 수 있는 노드가 발견되면 무조건 메시지를 전달했다. 또한, 단기적인 접촉 횟수 및 지역적 사회관계만 고려하고 최종 목적지와의 평균적인 관계는 고려하지 못했다. 본 논문에서는 기회주의적 네트워크에서 메시지 전달 시 노드의 그룹 친밀성 정보를 이용하여, 목적지 노드와 친밀도가 높은 노드를 통해 메시지를 전달함으로써 적은 메시지 복사수로 목적지 노드에 메시지를 전달하는 기법을 제안한다. 성능평가를 통해 제안 기법이 기존 기법에 비해 오버헤드 측면에서 최대 20%까지 성능향상이 있음을 보였다.

Keywords

Acknowledgement

Supported 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. https://doi.org/10.3745/KTCCS.2014.3.1.15
  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. https://doi.org/10.1016/S0169-7552(98)00110-X
  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. https://doi.org/10.3745/KTCCS.2013.2.5.209
  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.