An efficient routing scheme based on social relations in delay-tolerant networks

Chan Myung Kim, In Seok Kang, Youn Hee Han, Young Sik Jeong

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

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.

Original languageEnglish
Title of host publicationUbiquitous Information Technologies and Applications, CUTE 2013
PublisherSpringer Verlag
Pages533-540
Number of pages8
ISBN (Print)9783642416705
DOIs
StatePublished - 2014
Event8th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2013 - Danang, Viet Nam
Duration: 18 Dec 201320 Dec 2013

Publication series

NameLecture Notes in Electrical Engineering
Volume280 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference8th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2013
Country/TerritoryViet Nam
CityDanang
Period18/12/1320/12/13

Keywords

  • Delay-Tolerant Networks
  • Expanded Ego Network
  • Routing
  • Social Networks

Fingerprint

Dive into the research topics of 'An efficient routing scheme based on social relations in delay-tolerant networks'. Together they form a unique fingerprint.

Cite this