AD-AC Opportunistic Routing Algorithm Based on Context Information of Nodes in Opportunistic Networks

Opportunistic networks are mobile self-organizing networks that use the encounter opportunities brought by node movement to achieve communication. However, existing opportunistic routing algorithms rarely consider node context information and cache management at the same time, which leads to network congestion and high energy consumption problems in opportunistic networks. To solve the above problems, this paper defines the node historical activity degree and encounter duration based on the context information of nodes, and designs the AD-AC (historical Activity degree and encounter Duration of nodes-Acknowledgment deletion mechanism) opportunistic routing algorithm based on the context information of nodes by incorporating ACK (Acknowledgment) deletion mechanism. The simulation results indicate that AD-AC can substantially improve the message delivery rate while reducing the network overhead as well as the average hop count of messages.