Abstract
The mobile opportunistic networks (MONs) aim to realize the data delivery in challenged network environment that is characterized by intermittent connectivity and dynamic network topology. To address the routing problems in MONs, a connectivity probability based spray and wait routing algorithm (CPSWR) is presented. First of all, in view of the data sending and receiving status of nodes in MONs, a three-dimensional connectivity matrix for network nodes is constructed. Then, CPSWR calculates the connectivity probability between nodes for the next time slot based on connectivity matrix. Finally, the spray process is guided by the connectivity probability. In CPSWR, the packet replication only takes place between nodes with high connectivity probability to improve the effectiveness of data forwarding. The simulation results demonstrate that compared with traditional spray and wait routing algorithm (SWR), CPSWR can reduce inefficient data forwarding and improve packet delivery performance.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call