scholar.google.com › citations
Dec 9, 2017 · It uses the community nature of nodes movement to select the relay node, and each node uses the overhearing information to advance the progress ...
The algorithm selects relay nodes for message based on the community attribute of nodes. At the same time, each node uses the overhearing information to advance ...
Mar 1, 2020 · This study proposes a heuristic‐based scheme for routing messages from the source to the destination using the Ant Algorithm.
May 23, 2024 · Simulation results show that it performs better than the traditional routing algorithms in terms of delivery probability, overhead ratio, ...
This study proposes a heuristic-based scheme for routing messages from the source to the destination using the Ant Algorithm. Problems related to frequent ...
We then introduce a new social-based routing algorithm, called Community Roamer, which identifies those active nodes moving between different clustered ...
The FNRA algorithm exhibits superior performance through detailed experimental simulations by enhancing message delivery rate, decreasing network overhead, and ...
Missing: Overhearing | Show results with:Overhearing
In this paper, we proposes an efficient routing algorithm, community-based routing (CR), where nodes determine which community it belongs to and choose a proper ...
Sep 7, 2021 · We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm.
Missing: Overhearing | Show results with:Overhearing
Mar 1, 2020 · This study proposes a heuristic-based scheme for routing messages from the source to the destination using the Ant Algorithm.
Missing: Overhearing | Show results with:Overhearing