A dynamic game-theoretic trust-tree routing framework improves packet delivery ratios by approximately 13 to 16 percent in simulated Internet of Things networks containing non-cooperative nodes, according to experimental findings published in the International Journal of Networked and Distributed Computing. In addition to enhanced delivery rates, the proposed framework decreased the average end-to-end communication delay by nearly 18 percent and reduced routing overhead by approximately 15 percent.
Efficient packet routing represents an escalating operational challenge across Internet of Things architectures, particularly when non-cooperative nodes take part in packet forwarding processes. The authors observe that the presence of non-cooperative network participants undermines overall packet delivery reliability, induces substantial communication delays, and results in the inefficient consumption of finite network resources during transmission tasks.
Earlier trust-aware and game-theoretic routing strategies have sought to address non-cooperative behavior, but existing models generally depend on static trust evaluation procedures or rigid, predetermined hierarchical structures. As a consequence of these static designs, conventional routing models demonstrate an inherent limitation in their ability to adapt to fluid, continuously changing network conditions across dynamic Internet of Things environments.
To resolve these structural limitations, the authors developed a routing framework that mathematically formulates trust relationships through a dynamic hierarchy. The framework constructs and continuously updates a hierarchical trust tree by employing a two-player bargaining game mechanism. Network routing decisions are executed using a trust-aware utility function that concurrently evaluates four core parameters: packet forwarding reliability, residual energy, communication cost, and individual node trustworthiness.
A central distinction of the proposed architecture lies in how it manages network organization compared to conventional hierarchical trust models. Rather than enforcing an inflexible structure, the framework dynamically reorganizes the trust tree hierarchy based on observed node behavior. This responsive structural adaptation enables adaptive parent selection among forwarding devices, thereby promoting more reliable packet forwarding across dynamic network paths.
The authors conducted experimental evaluations of the mathematically formulated routing framework using The ONE simulator across multiple diverse network scenarios. The simulation results revealed that synthesizing dynamic trust-tree construction with game-theoretic decision-making provides an efficient, scalable, and reliable routing solution for Internet of Things settings affected by non-cooperative nodes, outperforming representative trust-based baselines across delivery ratio, delay, and routing overhead metrics.
Subject of Research: Trust-aware routing protocols for Internet of Things networks
Article Title: A Dynamic Game-Theoretic Trust Tree Framework for Trust-Aware Routing Against Non-Cooperative Nodes in the Internet of Things
Article References: Novinara, M., Derakhshanfard, N., Pour Haji Kazem, A. A., Dadashkhani, N., Khoshvaght, P., & Al-Daher, A. H. (2026). A Dynamic Game-Theoretic Trust Tree Framework for Trust-Aware Routing Against Non-Cooperative Nodes in the Internet of Things. International Journal of Networked and Distributed Computing. https://doi.org/10.1007/s44227-026-00125-z
Image Credits: AI Generated
DOI: 10.1007/s44227-026-00125-z
Keywords: Internet of Things, trust-aware routing, dynamic trust tree, non-cooperative nodes, two-player bargaining game, packet delivery ratio, end-to-end delay, routing overhead, packet forwarding reliability, residual energy, communication cost, node trustworthiness, The ONE simulator, adaptive parent selection, hierarchical trust models, network simulation
News Source: Denise Maddox. (November 18, 2026). Dynamic Game-Theoretic Trust Trees Boost Packet Delivery in IoT Simulations. Scienmag.



