A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections a...

Full description

Bibliographic Details
Main Authors: Lei You, Jianbo Li, Changjiang Wei, Chenqu Dai, Jixing Xu, Lejuan Hu
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/603547
id doaj-7cf9d28898b3423cb75daaf210352b90
record_format Article
spelling doaj-7cf9d28898b3423cb75daaf210352b902020-11-25T01:13:21ZengHindawi LimitedThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/603547603547A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant NetworksLei You0Jianbo Li1Changjiang Wei2Chenqu Dai3Jixing Xu4Lejuan Hu5Information Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaInformation Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaInformation Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaInformation Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaInformation Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaInformation Engineering College, Qingdao University, Qingdao, Shandong 266071, ChinaRouting in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.http://dx.doi.org/10.1155/2014/603547
collection DOAJ
language English
format Article
sources DOAJ
author Lei You
Jianbo Li
Changjiang Wei
Chenqu Dai
Jixing Xu
Lejuan Hu
spellingShingle Lei You
Jianbo Li
Changjiang Wei
Chenqu Dai
Jixing Xu
Lejuan Hu
A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
The Scientific World Journal
author_facet Lei You
Jianbo Li
Changjiang Wei
Chenqu Dai
Jixing Xu
Lejuan Hu
author_sort Lei You
title A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
title_short A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
title_full A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
title_fullStr A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
title_full_unstemmed A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks
title_sort hop count based heuristic routing protocol for mobile delay tolerant networks
publisher Hindawi Limited
series The Scientific World Journal
issn 2356-6140
1537-744X
publishDate 2014-01-01
description Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.
url http://dx.doi.org/10.1155/2014/603547
work_keys_str_mv AT leiyou ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT jianboli ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT changjiangwei ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT chenqudai ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT jixingxu ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT lejuanhu ahopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT leiyou hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT jianboli hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT changjiangwei hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT chenqudai hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT jixingxu hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
AT lejuanhu hopcountbasedheuristicroutingprotocolformobiledelaytolerantnetworks
_version_ 1725162929976770560

Similar Items