Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 408676, 7 pages
Research Article

A Socially Aware Routing Based on Local Contact Information in Delay-Tolerant Networks

1Advanced Technology Research Center, Korea University of Technology and Education, Cheonan 330-708, Republic of Korea
2Department of Multimedia Engineering, Dong-Eui University, Busan 614-714, Republic of Korea
3Department of Multimedia Engineering, Dongguk University, Seoul 100-715, Republic of Korea

Received 30 January 2014; Accepted 13 March 2014; Published 1 July 2014

Academic Editors: H.-C. Chao, Y. Pan, and J. H. Park

Copyright © 2014 Chan-Myung Kim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In delay-tolerant networks, network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. These features make DTN routing one of important research issues, and the application of social network metrics has led to the design of recent DTN routing schemes. In this paper, we propose an efficient routing scheme by using a node’s local contact history and social network metrics. Each node first chooses a proper relay node based on the closeness to the destination node. A locally computed betweenness centrality is additionally utilized to enhance the routing efficiency. Through intensive simulation, we finally demonstrate that our algorithm performs efficiently compared to the existing epidemic or friendship routing scheme.