Abstract | ||
---|---|---|
Delay Tolerant Networks (DTNs) suffer from frequent disruptions and partitioning. Because of dynamic environment and lack of knowledge about the whole network topology, routing is quiet challenging in DTNs. Prediction based algorithms in DTNs are able to predict nodes future contacts in the case where each node has a movement model. In this paper we are going to propose a risk taking routing algorithm, which differs from previous algorithms in predicting the future contacts and waiting for those nodes instead of forwarding to the currently in contact good forwarders. Considering the forwarding strategy as an online problem, we evaluate the algorithm using a risk reward competitive analysis. Simulation results show that our algorithm performs much better than PROPHET which is a base to our algorithm. The results also show that the optimum risk value is 2 which results in best performance. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/AINA.2013.128 | Advanced Information Networking and Applications |
Keywords | Field | DocType |
delay tolerant networks,telecommunication network routing,vehicular ad hoc networks,PROPHET,delay tolerant networks,forwarding strategy,movement model,network topology,risk reward competitive analysis,risk taking routing algorithm,risk value,Competitive Analysis,Delay Tolerant Networks,Online Routing,Risk Reward Analysis | Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Computer science,Static routing,Computer network,Destination-Sequenced Distance Vector routing,Routing table,Geographic routing,Routing protocol,Distributed computing | Conference |
ISSN | ISBN | Citations |
1550-445X E-ISBN : 978-0-7695-4953-8 | 978-0-7695-4953-8 | 0 |
PageRank | References | Authors |
0.34 | 16 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Maziar Mirzazad Barijough | 1 | 71 | 4.11 |
Nasser Yazdani | 2 | 425 | 57.92 |
Djamshid Tavangarian | 3 | 223 | 67.53 |
Robil Daher | 4 | 30 | 6.54 |