Congestion Control Routing Algorithm Based on Overlapping Nested Communities in Opportunistic Networks

In the era of highly interconnected information, Opportunistic Networks (ONs) attract attention for their flexibility and dynamics. To overcome the limitations of traditional community models in handling nodes’ multiple affiliations and inter-community interactions, this paper proposes an overlap-nested-community-based congestion-aware routing algorithm (ONCCCRouter). It utilizes the overlap-nested community structure to better capture potential node relationships and incorporates a cellular automata model for node-level congestion awareness and adaptive traffic control. By optimizing message forwarding, ONCCCRouter enhances data delivery, reduces redundancy, and mitigates congestion. Experiments show it outperforms traditional methods in delivery rate, delay, and stability, offering a novel solution for efficient ON routing.