A realistic framework for delay-tolerant network routing in open terrains with continuous churn

Veeramani Mahendran, Anirudh Sivaraman, C. Siva Ram Murthy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.

Original languageEnglish (US)
Title of host publicationDistributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings
Pages407-417
Number of pages11
Volume6522 LNCS
DOIs
StatePublished - 2011
Event12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India
Duration: Jan 2 2011Jan 5 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6522 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Distributed Computing and Networking, ICDCN 2011
CountryIndia
CityBangalore
Period1/2/111/5/11

Fingerprint

Delay tolerant networks
Delay Tolerant Networks
Network routing
Routing protocols
Routing
Routing Protocol
Closed
Vertex of a graph
Network protocols
Framework
Hits
Queue
Continue
Costs
Classify
Equivalence
Scenarios

Keywords

  • Delay-tolerant network
  • mobility model
  • open terrain
  • routing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mahendran, V., Sivaraman, A., & Murthy, C. S. R. (2011). A realistic framework for delay-tolerant network routing in open terrains with continuous churn. In Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings (Vol. 6522 LNCS, pp. 407-417). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6522 LNCS). https://doi.org/10.1007/978-3-642-17679-1_36

A realistic framework for delay-tolerant network routing in open terrains with continuous churn. / Mahendran, Veeramani; Sivaraman, Anirudh; Murthy, C. Siva Ram.

Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings. Vol. 6522 LNCS 2011. p. 407-417 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6522 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mahendran, V, Sivaraman, A & Murthy, CSR 2011, A realistic framework for delay-tolerant network routing in open terrains with continuous churn. in Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings. vol. 6522 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6522 LNCS, pp. 407-417, 12th International Conference on Distributed Computing and Networking, ICDCN 2011, Bangalore, India, 1/2/11. https://doi.org/10.1007/978-3-642-17679-1_36
Mahendran V, Sivaraman A, Murthy CSR. A realistic framework for delay-tolerant network routing in open terrains with continuous churn. In Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings. Vol. 6522 LNCS. 2011. p. 407-417. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-17679-1_36
Mahendran, Veeramani ; Sivaraman, Anirudh ; Murthy, C. Siva Ram. / A realistic framework for delay-tolerant network routing in open terrains with continuous churn. Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings. Vol. 6522 LNCS 2011. pp. 407-417 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2e2f2350e07d4b0eb114aaa862b8c92e,
title = "A realistic framework for delay-tolerant network routing in open terrains with continuous churn",
abstract = "The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.",
keywords = "Delay-tolerant network, mobility model, open terrain, routing",
author = "Veeramani Mahendran and Anirudh Sivaraman and Murthy, {C. Siva Ram}",
year = "2011",
doi = "10.1007/978-3-642-17679-1_36",
language = "English (US)",
isbn = "364217678X",
volume = "6522 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "407--417",
booktitle = "Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings",

}

TY - GEN

T1 - A realistic framework for delay-tolerant network routing in open terrains with continuous churn

AU - Mahendran, Veeramani

AU - Sivaraman, Anirudh

AU - Murthy, C. Siva Ram

PY - 2011

Y1 - 2011

N2 - The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.

AB - The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.

KW - Delay-tolerant network

KW - mobility model

KW - open terrain

KW - routing

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

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

U2 - 10.1007/978-3-642-17679-1_36

DO - 10.1007/978-3-642-17679-1_36

M3 - Conference contribution

SN - 364217678X

SN - 9783642176784

VL - 6522 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 407

EP - 417

BT - Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings

ER -