A Reliable Network Coverage Using Different Spanning Trees in Hexagonal Networks

Interconnection networks have an impact on the performance of wireless communication and distributed systems, enabling seamless integration of devices in applications such as IoT and 5G. They have been used to optimize energy efficiency, reduce transmissions, and address fault tolerance in wireless sensor networks based on network design.The use of Independent Spanning Trees (ISTs) and Edge-Disjoint Node-Independent Spanning Trees (EDNISTs) significantly improves the reliability of computer networks in the domain of parallel and distributed computing. ISTs are widely applied in broadcasting, multicasting, fault-tolerant routing, and secure message distribution.In this paper, we extend our results in [1] and provide the average of all maximum communication steps to reach all nodes from the root node in all EDNISTs in Eisenstein- Jacobi (EJ) networks. In addition, the performance comparison between EDNIST and IST is studied. Our comparison shows that EDNISTs overcome the ISTs in EJ networks in terms of the average maximum number of steps to reach all nodes from the root node.