Natsuko Kawabata

川端 奈津子

Kwansei Gakuin University Repository

Studies on Epidemic Routing inDelay/Disruption-Tolerant Networkingyear 2018URL http://hdl.handle.net/10236/000280522018年度修士論文要旨Abstract of 2018 Master’s ThesisStudies on Epidemic Routingin Delay/Disruption-Tolerant Networking関西学院大学大学院理工学研究科情報科学専攻大崎研究室川端奈津子Natsuko KawabataDepartment of InformaticsGraduate School of Science and TechnologyKwansei Gakuin UniversityIn the last decade, DTN (Delay/Disruption-Tolerant Networking) has been attract-ing significant amount of attention as a solution for realizing emergency and/orlow-cost communication infrastructure. In order to design an efficient informationdiffusion strategy in communication networks like DTN, we tackled to solve fourresearch issues.First, to realize high-speed and efficient DTN routing, it is crucial to deliver a mes-sage to the destination node immediately, and to delete copies of the delivered mes-sage from the network quickly. Building theMarkovmodel of epidemic routingwithbroadcasting ACKs, we derive the average message delivery delay of epidemic rout-ing with multiple messages, each of which competes for the network bandwidth.Second, we propose a novel mechanism called restrained epidemic routing, whichimproves the performance of conventional epidemic broadcasting with broadcast-ing ACKs. However, for restrained epidemic routing to work efficiently, the tim-ing for suppressing the message forwarding probability must be appropriately de-termined. We therefore investigate the characteristics of restrained epidemic rout-ing under given system parameters (the number of nodes, the contact rate betweennodes, and the message generation rate from nodes) by describing the dynamics ofrestrained epidemic routing as a continuous time system.Third, we analyze the characteristics of restrained epidemic routing when the con-tact relation between nodes is given by a general contact model such as complexnetworks. Specifically, we describe the dynamics of restrained epidemic routing ona complex network with a given degree distribution as differential equations usingthe degree-based mean field approximation.Forth, we focus on value of location information of the destination node. By de-scribing the average behavior of a message generated at an arbitrary point on thefield moving toward the destination node, we derive the average message deliverydelay with the single-copy position-based DTN routing using location information.

Studies on Epidemic Routing in Delay/Disruption-Tolerant Networking

https://kwansei.repo.nii.ac.jp/?action=repository_action_common_download&item_id=28106&item_no=1&attribute_id=20&file_no=1

Studies on Epidemic Routing in Delay/Disruption-Tolerant Networking

Abstract

Similar works

Full text

Available Versions

Kwansei Gakuin University Repository