4.7 Article

An adaptive multiple spray-and-wait routing algorithm based on social circles in delay tolerant networks

Journal

COMPUTER NETWORKS
Volume 189, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.comnet.2021.107901

Keywords

Adaptive routing algorithm; Delay tolerant networks; Spray-and-wait; Social circles

Funding

  1. National Natural Science Foundation of China [U20A20177, 61772377, 91746206, 61972296, 61672257, 61702210]
  2. Fundamental Research Funds for the Central Universities [2042020kf0217]
  3. Wuhan Advanced Application Project [2019010701011419]
  4. Science and Technology planning project of ShenZhen [JCYJ20170818112550194]

Ask authors/readers for more resources

This paper investigates leveraging the social attributes of nodes in DTN to improve routing algorithms. It introduces a novel method for constructing social circles, and proposes a spray strategy and adaptive multiple spray-and-wait routing algorithm to enhance performance. Extensive simulations confirm the effectiveness of these proposed routing algorithms in DTN.
In delay tolerant networks (DTN), the social attributes of nodes show long-term stability, which can be leveraged for more effective routing. In this paper, we first present a novel way of constructing social circles based on the node clustering phenomena in DTN. Then, considering that the forwarding capability of nodes is significantly different, we propose a spray strategy based on social circles (named SC-SS) to improve the spray and-wait routing algorithm. SC-SS selects the next hop based on the social circle of nodes in the spray phase. Instead of fixing the initial number of copies, we design an adaptive multiple spray-and-wait routing algorithm based on social circles (named SC-AMSW) to further improve the performance of SC-SS. SC-AMSW selectively sprays messages multiple times in the wait phase and determines an appropriate number of redundant message copies based on delivery predictability. We conduct extensive simulations to confirm the effectiveness of our proposed routing algorithms in DTN.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available