An efficient routing scheme based on social relations in delay-tolerant networks
- Authors
- Kim, C.-M.; Kang, I.-S.; Han, Y.-H.; Jeong, Y.-S.
- Issue Date
- 2014
- Publisher
- Springer Verlag
- Keywords
- Delay-Tolerant Networks; Expanded Ego Network; Routing; Social Networks
- Citation
- Lecture Notes in Electrical Engineering, v.280 LNEE, pp 533 - 540
- Pages
- 8
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Electrical Engineering
- Volume
- 280 LNEE
- Start Page
- 533
- End Page
- 540
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/17619
- DOI
- 10.1007/978-3-642-41671-2_68
- ISSN
- 1876-1100
1876-1119
- Abstract
- In delay-tolerant network (DTN), the message forwarding and routing are important research issues, since the network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. In this paper, we propose an efficient DTN routing scheme by using a node's social relation where each node chooses a proper relay node based on its contact history. In order to enhance the routing efficiency, the expanded egonetwork betweenness centrality is used when a relay node is selected. We have demonstrated that our algorithm performs efficiently compared to the existing epidemic and friendship routing schemes. © Springer-Verlag Berlin Heidelberg 2014.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Advanced Convergence Engineering > Department of Computer Science and Artificial Intelligence > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.