정보과학회 컴퓨팅의 실제 논문지 (KIISE Transactions on Computing Practices)

  • 제24권3호
  • /
  • Pages.145-150
  • /
  • 2018
  • /
  • 2383-6318(pISSN)
  • /
  • 2383-6326(eISSN)
한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지
DOI QR코드

DOI QR Code

기회적 네트워크에서의 유사도 기반의 포워딩 기법의 성능 분석

Performance Analysis of Forwarding Schemes Based on Similarities for Opportunistic Networks

  • 김선겸 (한국과학기술정보연구원 정보서비스실) ;
  • 이태석 (한국과학기술정보연구원 정보서비스실) ;
  • 김완종 (한국과학기술정보연구원 정보서비스실)
  • 투고 : 2017.09.01
  • 심사 : 2018.01.09
  • 발행 : 2018.03.15
⟨ 이전 논문 다음 논문 ⟩

초록

기회적 네트워크(Opportunistic networks)의 포워딩은 간헐적인 연결로 인하여 출발지와 목적지 간에 안정된 경로가 존재하지 않아 기존 포워딩 기법들은 성능이 저하되는 문제를 가지고 있다. 최근 소셜 네트워크 관계망을 이용한 연구가 활발히 진행되고 있으며, 유사도(Similarity)는 소셜 네트워크 분석을 위한 매우 중요한 분석 방법 중 하나이다. 본 논문은 대표적인 유사도를 이용한 포워딩 기법들을 제안하고 기회적 네트워크에서 유사도에 기반한 포워딩 기법을 적용시에 얼마나 성능 향상이 있는지 알아본다. 그 결과로, 이 기법들은 목적지와 유사도가 높은 노드를 중개 노드로 선정하여 포워딩하기 때문에 낮은 트래픽 및 홉 수를 가지게 되며, 준수한 전송 딜레이를 유지한다.

Forwarding in opportunistic networks shows low performance because there may be no connecting paths between the source and the destination nodes due to the intermittent connectivity. Currently, social network analysis has been researched. Specifically, similarity is one of methods of social networks analysis. In this paper, we propose forwarding schemes based on representative similarities, and evaluate how much the forwarding performance increases. As a result, since the forwarding schemes are based on similarities, these schemes only forward messages to nodes with higher similarity as relay nodes, toward the destination node. These schemes have low network traffic and hop count while having stable transmission delay.

키워드

과제정보

연구 과제 주관 기관 : 한국과학기술정보연구원(KISTI)

참고문헌

  1. S. Kim, "Multimedia Contents Dissemination using Mobile Communication and Opportunistic Networks," Journal of Digital Contents Society, Vol. 14, No. 3, pp. 357-365, Sep. 2013. https://doi.org/10.9728/dcs.2013.14.3.357
  2. M. Conti, and M. Kumar, "Opportunities in opportunistic computing," IEEE Computer, Vol. 43, No. 1, pp. 42-50, Sep. 2010.
  3. D. Liben-Nowell, and J. Kleinberg, "The linkprediction problem for social networks," Journal of the Association for Information Science and Technology, Vol. 58, No. 7, pp. 1019-1031, Mar. 2007.
  4. A. Vahdat, and D. Becker, "Epidemic routing for partially connected ad hoc networks," Technical Report CS-2000-06, 2000.
  5. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," Proc. of the 2005 ACM SIGCOMM workshop on Delaytolerant networking, pp. 252-259, 2005.
  6. S. Kim, J. Choi, and S. Yang, "Hotspot: Location-based Forwarding Scheme in an Opportunistic Network," Ad hoc & Sensor Wireless Networks, Vol. 26, No. 1-4, pp. 151-150, May. 2005.
  7. E. M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," Proc. of the 8th ACM international symposium on Mobile ad hoc networking and computing, pp. 32-40, 2010.
  8. 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, Dec. 2011. https://doi.org/10.1109/TMC.2010.246
  9. A. Mei, G. Morabitto, P Santi, and J. Stefa, "Social-aware stateless forwarding in pocket switched networks," Proc. of IEEE INFOCOM, pp. 251-255, 2011.
  10. P. Hui and J. Crowcroft, "How small labels create big improvements," Proc. of IEEE ICMAN, pp. 244-251, 2007.
  11. 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, Oct. 2008. https://doi.org/10.1016/j.pmcj.2008.04.003
  12. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," Proc. of SAPIR, pp. 239-254, 2004.
  13. A. Mtibaa, M. May, C. Diot, and M. Ammar, "People Rank: social opportunistic forwarding," Proc. of IEEE INFOCOM Mini-Conference, pp. 1-5, 2010.
  14. C. Boldrini, and A. Passarella, "HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships," Computer Communications, Vol. 33, No. 9, pp. 1056-1074, Jun. 2010. https://doi.org/10.1016/j.comcom.2010.01.013
  15. Network simulator-2. http://www.isi.edu/nsnam/ns/