Abstract:

Based on the analysis of the common routing algorithms in mobile ad hoc networks (MANETs), e. g., single-copy and flooding, a routing algorithm, which uses single copy and the similarities of the trace, is proposed. To address the problems of single-copy and flooding routing, such as the high transmission delay in single-copy routing, the large amount of the network overhead and packet loss in the flooding, we K-copies routing algorithm based on the similarities of nodes trace records. Finally, the algorithms are evaluated in terms of several performance parameters, i. e., the packet delivery ratio, the average transmission delay and forwarding hops. The results of the simulations show that our algorithms have the better performance than other existing routing algorithms in MANETs.

Key words: mobile ad hoc networks, single-copy routing, multiple-copies routing, trace-driven