Improving routing performance in social internet of things with FNRA: The free node-based approach

Abstract

In the distributed environment of the Social Internet of Things (SIoT), where nodes rely primarily on the “store-carry-forward” mechanism for message delivery, it has been determined that forming community structures is advantageous for message propagation. Nevertheless, due to the dynamic nature of nodal social relationships and inaccurate community division, routing algorithm performance is inferior. This paper proposes a novel SIoT routing algorithm, the Free Node-based Routing Algorithm (FNRA) to resolve these issues. The FNRA algorithm presents a comprehensive framework for message forwarding, differentiating between in-community and out-of-community scenarios. The algorithm compares the forwarding capabilities of relay and source nodes within the community. A graph-theoretic approach is used to classify source, relay, and destination nodes into four distinct structures outside the community. Considering node-node, node-community, community-node, and community-community interactions, the algorithm addresses situations where the source, destination, and relay nodes do not belong to the same community. FNRA dynamically selects appropriate forwarding strategies to expedite message delivery to the destination node by leveraging the community structure and the presence of free nodes. The FNRA algorithm exhibits superior performance through detailed experimental simulations by enhancing message delivery rate, decreasing network overhead, and reducing average latency compared to existing routing algorithms. This demonstrates the algorithm's effectiveness in optimizing overall network performance.

Keywords

• Social Internet of things
• Opportunity routing
• Community
• Free node
• Routing algorithm
• Communication network