Cost Efficient Predictive Routing in Disruption Tolerant Networks

Bibliographic Details
Main Author:	Deshpande, Satyajeet
Language:	English
Published:	The Ohio State University / OhioLINK 2011
Subjects:	Computer Science disruption tolerant networks predictive routing cost efficient
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=osu1293727616

id	ndltd-OhioLink-oai-etd.ohiolink.edu-osu1293727616
record_format	oai_dc
spelling	ndltd-OhioLink-oai-etd.ohiolink.edu-osu12937276162021-08-03T06:01:16Z Cost Efficient Predictive Routing in Disruption Tolerant Networks Deshpande, Satyajeet Computer Science disruption tolerant networks predictive routing cost efficient <p>Disruption Tolerant Networks contain intermittent connectivity and high end-to-end delays. Packets are transfered whenever a contact becomes available for anode. Examples of such networks vary from satellite networks to human networks tovehicular networks. Some of these these networks have a high constraint on energyand storage because of remoteness or inability to charge the nodes. Also some of theseDTN networks exhibit semi-deterministic mobility characteristic showing periodicitywith some variance. Extant research work in DTN have focused mainly on messagereliability and message delay. Efficiency of routing algorithms in terms of cost andenergy have not been explored enough. As DTN deployments become a reality energyefficiency of such networks become critical.</p><p>In this thesis we propose ‘Cost Efficient Predictive Routing’ in Disruption TolerantNetworks, which takes into account two important factors for messages of mobilenodes, i) their deadline and ii) cost which is defined as the number of transmissionsrequired to transfer the packet to the destination. Our routing protocol calculates lowcost paths and decides on which path to forward the message such that it not onlyoptimizes cost but also delivers the message within the deadline. It uses a predictionalgorithm that takes the inter contact times of nodes as input and gives the durationof next meeting times for a node.</p><p>We compare our protocol with some past replication routing protocols and someforwarding protocols who use average metrics. We show that our protocol outperformsthe replication protocols almost three times in terms of cost and outperforms theforwarding protocols almost two times. We also show that it achieves equivalentthroughput and delay compared to replication protocols who have the best delayand throughput and it has better throughput and delay compared to the forwardingprotocols. We also show how our protocol can be refined to suit to different delayrequirements of a network.</p> 2011-01-10 English text The Ohio State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=osu1293727616 http://rave.ohiolink.edu/etdc/view?acc_num=osu1293727616 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection	NDLTD
language	English
sources	NDLTD
topic	Computer Science disruption tolerant networks predictive routing cost efficient
spellingShingle	Computer Science disruption tolerant networks predictive routing cost efficient Deshpande, Satyajeet Cost Efficient Predictive Routing in Disruption Tolerant Networks
author	Deshpande, Satyajeet
author_facet	Deshpande, Satyajeet
author_sort	Deshpande, Satyajeet
title	Cost Efficient Predictive Routing in Disruption Tolerant Networks
title_short	Cost Efficient Predictive Routing in Disruption Tolerant Networks
title_full	Cost Efficient Predictive Routing in Disruption Tolerant Networks
title_fullStr	Cost Efficient Predictive Routing in Disruption Tolerant Networks
title_full_unstemmed	Cost Efficient Predictive Routing in Disruption Tolerant Networks
title_sort	cost efficient predictive routing in disruption tolerant networks
publisher	The Ohio State University / OhioLINK
publishDate	2011
url	http://rave.ohiolink.edu/etdc/view?acc_num=osu1293727616
work_keys_str_mv	AT deshpandesatyajeet costefficientpredictiveroutingindisruptiontolerantnetworks
_version_	1719429540272406528

Cost Efficient Predictive Routing in Disruption Tolerant Networks

Similar Items