Sharing spray and wait routing algorithm in opportunistic networks |
| |
Authors: | Nahideh Derakhshanfard Masoud Sabaei Amir Masoud Rahmani |
| |
Affiliation: | 1.Department of Computer Engineering, Science and Research Branch,Islamic Azad University,Tehran,Iran;2.Computer Engineering and Information Technology Department,Amirkabir University of Technology,Tehran,Iran |
| |
Abstract: | Due to the instability and intermittent connectivity of links among the nodes and the lack of connectivity in opportunistic network, it is not feasible to use common routing for delivering messages. The only practical method for routing and delivering messages is to use the store-carry-forward routing method. As a case in point, spray and wait is considered to be one of the most appropriate routing methods. The efficiency of this method depends directly on the proper selection of the next hop and the number of copies when it encounters a node. In this paper, a method was proposed that constantly selects the next node and considers the number of copies a node can deliver. In the proposed method, the selection of the next node and the number of message copies to be transmitted by the next hop are based on message carrying time and the probability of message delivery. The network model, based on Markov chain, is extended for analysis. Simulation and analysis results showed that significant enhancement is obtained with the proposed method when measuring metrics such as delay, delivery ratio and copy do comparisons with similar methods. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|