A Community-Based Message Transmission Algorithm for Opportunistic Networks

Abstract

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.