TY - GEN
T1 - A realistic framework for delay-tolerant network routing in open terrains with continuous churn
AU - Mahendran, Veeramani
AU - Anirudh, Sivaraman K.
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
AN - SCOPUS:78751660824
SN - 364217678X
SN - 9783642176784
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
T2 - 12th International Conference on Distributed Computing and Networking, ICDCN 2011
Y2 - 2 January 2011 through 5 January 2011
ER -