Design and Analysis of Fibonacci based TGO compared with real-time mesh using graph invariant technique

Abstract

Background: Investigation of graph analytics is one among the foremost established and amazing strategies utilized in taking care of present-day designing issues. during this paper, we applied this procedure to networks. The Connectivity of gadgets is one among the intense issues distinguished in wireless systems. to deal with this issue a completely unique Fibonacci based TGO was proposed for a superior network. Methods: The proposed model takes a shot at the formation of trimet graph dependent on the Fibonacci arrangement implies a bunch is shaped with 3, 5, 8, 13, 21… hubs. Every one of these hubs is again associated recursively by trimet diagram to frame Fibonacci based TGO.practial mesh was invariant with random regular graph. Presently both these meshes are compared with edges, diameter, average degree, average clustering, density and average shortest path Results: Fibonacci TGO has approximately 50 fewer edges at 100 nodes and constant diameter 4.Average degree of Fibonacci TGO is less which is approximately 3 and having 0.7 high average clustering over random Regular. As the number of nodes increases density decreases.TGO is having a better path than random regular. Finally, Fibonacci TGO mesh has better performance and connectivity over realtime meshes in wireless networks. Conclusion: We propose Fibonacci based TGO mesh in the following steps. The major part of this formation was categorized into 2 steps. In the first step based on the input nodes small individual Fibonacci based trimet are generated with 3, 5, 8, 13, and 21… nodes. In the second phase all these trimet will connect to from a Fibonacci based TGO. Now both these meshes are analyzed with network science parameters. It was observed that in all cases Fibonacci based TGO has better connectivity over real time random mesh. Results are generated automatically by using NetworkX package in python language.