Optimal relay node selection in two-hop routing for intermittently connected MANETs

Tomotaka Kimura, Chinthaka Premachandra

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Recently, many researchers have been attracted to intermittently connected mobile ad-hoc networks (MANETs), which are a type of DTN (delay/disruption/disconnect tolerant network). To achieve end-to-end communication between a source node and a destination node in the networks, storecarry-forward routing has been considered as a promising solution. In this paper, we propose an algorithm for optimal relay node selection in two-hop store-carry-forward routing schemes, where only the source node can generate relay nodes (nodes with a copy of the message). When the routing scheme restricts the maximum number of relay nodes, its performance is highly dependent on the selection of relay nodes so that the algorithm is important. The routing scheme according to our method of relay node selection can minimize the mean delivery delay. In this paper, we first straightforwardly formulate a system dynamics model from generating an original message to its destination, and then show that it is difficult to derive the optimal relay node selection for the system dynamics model. To construct the algorithm, we consider an system model equivalent to the original system model, and show that the relay node selection can be obtained easily for the equivalent system model. Through numerical experiments, we evaluate the performance of the routing scheme according to our method of relay node selection.

Original languageEnglish
Pages (from-to)23-38
Number of pages16
JournalJournal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
Volume7
Issue number1
Publication statusPublished - 2016 Mar 1
Externally publishedYes

Fingerprint

Mobile ad hoc networks
Dynamic models
Communication
Experiments

Keywords

  • Delay/disruption tolerant networking
  • Dynamic programming
  • Relay node selection
  • Store-carry-forward routing
  • Two-hop routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

@article{84058a2d2b5b4a94b267be9bda58e605,
title = "Optimal relay node selection in two-hop routing for intermittently connected MANETs",
abstract = "Recently, many researchers have been attracted to intermittently connected mobile ad-hoc networks (MANETs), which are a type of DTN (delay/disruption/disconnect tolerant network). To achieve end-to-end communication between a source node and a destination node in the networks, storecarry-forward routing has been considered as a promising solution. In this paper, we propose an algorithm for optimal relay node selection in two-hop store-carry-forward routing schemes, where only the source node can generate relay nodes (nodes with a copy of the message). When the routing scheme restricts the maximum number of relay nodes, its performance is highly dependent on the selection of relay nodes so that the algorithm is important. The routing scheme according to our method of relay node selection can minimize the mean delivery delay. In this paper, we first straightforwardly formulate a system dynamics model from generating an original message to its destination, and then show that it is difficult to derive the optimal relay node selection for the system dynamics model. To construct the algorithm, we consider an system model equivalent to the original system model, and show that the relay node selection can be obtained easily for the equivalent system model. Through numerical experiments, we evaluate the performance of the routing scheme according to our method of relay node selection.",
keywords = "Delay/disruption tolerant networking, Dynamic programming, Relay node selection, Store-carry-forward routing, Two-hop routing",
author = "Tomotaka Kimura and Chinthaka Premachandra",
year = "2016",
month = "3",
day = "1",
language = "English",
volume = "7",
pages = "23--38",
journal = "Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications",
issn = "2093-5374",
publisher = "Innovative Information Science & Technology Research Group (ISYOU)",
number = "1",

}

TY - JOUR

T1 - Optimal relay node selection in two-hop routing for intermittently connected MANETs

AU - Kimura, Tomotaka

AU - Premachandra, Chinthaka

PY - 2016/3/1

Y1 - 2016/3/1

N2 - Recently, many researchers have been attracted to intermittently connected mobile ad-hoc networks (MANETs), which are a type of DTN (delay/disruption/disconnect tolerant network). To achieve end-to-end communication between a source node and a destination node in the networks, storecarry-forward routing has been considered as a promising solution. In this paper, we propose an algorithm for optimal relay node selection in two-hop store-carry-forward routing schemes, where only the source node can generate relay nodes (nodes with a copy of the message). When the routing scheme restricts the maximum number of relay nodes, its performance is highly dependent on the selection of relay nodes so that the algorithm is important. The routing scheme according to our method of relay node selection can minimize the mean delivery delay. In this paper, we first straightforwardly formulate a system dynamics model from generating an original message to its destination, and then show that it is difficult to derive the optimal relay node selection for the system dynamics model. To construct the algorithm, we consider an system model equivalent to the original system model, and show that the relay node selection can be obtained easily for the equivalent system model. Through numerical experiments, we evaluate the performance of the routing scheme according to our method of relay node selection.

AB - Recently, many researchers have been attracted to intermittently connected mobile ad-hoc networks (MANETs), which are a type of DTN (delay/disruption/disconnect tolerant network). To achieve end-to-end communication between a source node and a destination node in the networks, storecarry-forward routing has been considered as a promising solution. In this paper, we propose an algorithm for optimal relay node selection in two-hop store-carry-forward routing schemes, where only the source node can generate relay nodes (nodes with a copy of the message). When the routing scheme restricts the maximum number of relay nodes, its performance is highly dependent on the selection of relay nodes so that the algorithm is important. The routing scheme according to our method of relay node selection can minimize the mean delivery delay. In this paper, we first straightforwardly formulate a system dynamics model from generating an original message to its destination, and then show that it is difficult to derive the optimal relay node selection for the system dynamics model. To construct the algorithm, we consider an system model equivalent to the original system model, and show that the relay node selection can be obtained easily for the equivalent system model. Through numerical experiments, we evaluate the performance of the routing scheme according to our method of relay node selection.

KW - Delay/disruption tolerant networking

KW - Dynamic programming

KW - Relay node selection

KW - Store-carry-forward routing

KW - Two-hop routing

UR - http://www.scopus.com/inward/record.url?scp=84962385745&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962385745&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84962385745

VL - 7

SP - 23

EP - 38

JO - Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications

JF - Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications

SN - 2093-5374

IS - 1

ER -