Particle swarm optimization in intelligent routing of delay-tolerant network routing

Azadeh Omidvar,Karim Mohammadi

doi:10.1186/1687-1499-2014-147

Abstract

Delay-tolerant networks (DTNs) are wireless partitioned networks. Because of intermittency, mobile ad hoc network (MANET) routing protocols are not efficient in DTNs. Wildlife tracking, vehicular networks, interplanetary networks, etc. are different applications of DTN. Regarding DTN applications, different parameters should be considered while designing DTN routing protocols. Message delivery ratio, message delivery delay, overhead, message drop, etc. are some important factors that are usually considered in routing algorithms. This paper proposes a method which tries to reduce overhead and message drop while increasing message delivery ratio. Choosing the appropriate number of message copies to distribute in the network is important. Few numbers of copies can lead to message drop. So, the message cannot be delivered to the destination. On the other hand, increasing the number of copies causes overhead increase in the network. The proposed algorithm uses particle swarm optimization (PSO) in intelligent choosing of number of message copies. Regarding message delivery ratio and network overhead, PSO greatly helps in finding the suitable number of copies. In order to evaluate our method, which is called PSODTN, we compared it with epidemic routing (ER) and probabilistic routing protocol using history of encounters and transitivity (PROPHET). PSODTN helps to reduce overhead, on average, 95.6% compared to ER and PROPHET. While reducing overhead, PSODTN message delivery ratio is on average 98%.

Highlights

Delay-tolerant networks (DTNs) [1] are wireless ad hoc networks with intermittent connections, limited power and radio range, long variable delays, etc
As shown in the picture, overhead ratio in PSODTN has decreased by 95.71% compared to that in epidemic routing (ER) and 95.7% less than that in PROPHET
The delay is tolerable, and reducing overhead while maintaining message delivery ratio in a good state is our main concern. Considering both scenarios, overhead has reduced by an average of 95.6% compared to ER and PROPHET while we have a message delivery of 98%

Summary

Introduction

Delay-tolerant networks (DTNs) [1] are wireless ad hoc networks with intermittent connections, limited power and radio range, long variable delays, etc. Forwarding-based approaches use a single copy of the message to forward SocialCast considers destination interests in addition to moving patterns and social connections Flooding algorithms, such as epidemic routing [22], are the most reliable methods in delivering messages. Each node, which has the message, gives a copy of the message to every node it encounters These methods waste network resources such as energy, bandwidth, etc. The proposed method tries to reduce network overhead while keeping message delivery ratio in a good range. Since in DTN, increasing the number of message copies delivered to the destination is important, increasing message delivery ratio as much as possible is essential for us.

Random waypoint

ÀT þ

Findings

Conclusions