DOI QR코드

DOI QR Code

An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks

지연 감내 네트워크에서 사회관계기반 기회적 라우팅 기법

  • 김찬명 (한국기술교육대학교 컴퓨터공학과) ;
  • 강인석 (삼성전자 무선사업부) ;
  • 오영준 (한국기술교육대학교 컴퓨터공학과) ;
  • 한연희 (한국기술교육대학교 컴퓨터공학과)
  • Received : 2013.10.31
  • Accepted : 2013.12.31
  • Published : 2014.01.31

Abstract

Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

지연 감내 네트워크는 지속적인 연결이 보장되지 않고 저장(Store), 운반(Carry), 전달(Forward) 방식의 메시지 전달을 사용 하는 네트워크이다. 이러한 지연 감내 네트워크에서 메시지 전달은 중요한 연구 이슈이며, 최근 많은 라우팅 기법들이 제안되었다. 본 논문에서는 노드들의 사회관계와 확장 매개 중심도를 이용하여 효율적인 지연 감내 네트워크에서 라우팅 기법을 제안한다. 시뮬레이션 결과를 통해 Epidemic routing, Friendship routing에 비해 적은 메시지 전달 성공률차이를 유지하며, 메시지 전달 비용에는 효율적임을 보인다.

Keywords

References

  1. F. Warthman, "Delay-Tolerant Networks(DTNs): A tutorial," Warthman Associates, Mar., 2003.
  2. M. R. Schurgot, C. Comaniciu, and K. Jaffres-Runser. "Beyond traditional DTN routing: social networks for opportunistic communication." Communications Magazine, IEEE 50.7 pp.155-162. Jul., 2012.
  3. A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke University, 2000.
  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. P.Hui, J. Crowcroft, and E. Yoneki. "Bubble rap: social-based forwarding in delay tolerant networks." Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing. ACM, 2008.
  6. Bulut, Eyuphan, and Boleslaw K. Szymanski. "Friendship based routing in delay tolerant mobile social networks," Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE. IEEE, 2010.
  7. L. Tang and H. Liu, "Community Detection and Mining in Social Media," Synthesis Lectures on Data Mining and Knowledge Discovery, Vol.2, No.1, 2010.
  8. S. Wasserman and K. Faust. "Social Network Analysis: Methods and Applications," Cambridge University Press, 1994.
  9. J.-g. Shon, Y.-h. Kim, Y.-H. Han, "Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks," KIPS Transactions on Computer and Communication System, Vol. 02 No.05. pp.209-216, 2013. https://doi.org/10.3745/KTCCS.2013.2.5.209
  10. 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.
  11. 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, June, 2009.
  12. M. Everett, S. P. Borgatti, "Ego Network Betweenness," Social Networks, Vol.27, No.1, pp.31-38, Jan., 2005. https://doi.org/10.1016/j.socnet.2004.11.007
  13. F. Odella, "Using Ego-networks in Surveys: Methodological and Research Issues," In Proceedings of International Conference on Network Science, May, 2006.