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


KIPS Transactions on Computer and Communication Systems, Vol. 3, No. 1, pp. 15-22, Jan. 2014
10.3745/KTCCS.2014.3.1.15,   PDF Download:

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 efㄴficiency 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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. I. Choi, I. S. Park and Y. Z. Cho, "An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks," KIPS Transactions on Computer and Communication Systems, vol. 3, no. 1, pp. 15-22, 2014. DOI: 10.3745/KTCCS.2014.3.1.15.

[ACM Style]
Jae In Choi, In Soo Park, and You Ze Cho. 2014. An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks. KIPS Transactions on Computer and Communication Systems, 3, 1, (2014), 15-22. DOI: 10.3745/KTCCS.2014.3.1.15.