Generic placeholder image

International Journal of Sensors, Wireless Communications and Control

Author(s): Shanmuk Srinivas Amiripalli*, Veeramallu Bobba and P. Naga Srinivasu

DOI: 10.2174/2210327911666210118143058

DownloadDownload PDF Flyer Cite As
Design and Analysis of Fibonacci Based TGO Compared with Real-time Mesh using Graph Invariant Technique

Page: [230 - 234] Pages: 5

  • * (Excluding Mailing and Handling)

Abstract

Background: Graph analytics is one of the foremost established and unique strategies utilized in taking care of present-day designing issues. In this study, this procedure was applied to networks. The connectivity of gadgets is one of the intense issues distinguished in wireless systems. To deal with this issue, a unique Fibonacci-based TGO was proposed for a superior network.

Methods: The proposed model attempts to construct a trimet graph based on the Fibonacci arrangement, implying that a cluster is formed with 3, 5, 8, 13, 21... hubs. To frame Fibonacci-based TGO, each of these hubs is recursively connected with a trimet diagram. For the random regular graph, the practical mesh is invariant. Edges, diameter, average degree, average clustering, density, and average shortest path are currently being compared for both meshes.

Results: Fibonacci TGO has approximately 50 edges at 100 nodes and a constant diameter of 4. The average degree of Fibonacci TGO is less, which is approximately 3, having 0.7 high average clustering over random regular. As the number of nodes increases, the density decreases.TGO is having a better path than the random regular model. Finally, Fibonacci TGO mesh has better performance and connectivity over real-time meshes in wireless networks.

Conclusion: We have proposed Fibonacci-based TGO mesh in the following steps. This formation is split into two stages. Fibonacci-dependent trimets based on the input nodes are created in the first stage, with 3, 5, 8, 13, and 21... nodes. These trimets will be connected in the second step to create a Fibonacci-based TGO. Both meshes are now being studied using network science parameters. In any scenario, Fibonacci-based TGO has better connectivity over the real-time random mesh. The NetworkX package in the Python language is used to produce the results automatically.

Keywords: Graph invariant technique, mesh, graph analytics, trimet graph optimization, topology, NetworkX.

Graphical Abstract

[1]
Amiripalli SS, Bobba V. A Fibonacci based TGO methodolo-gy for survivability in ZigBee topologies. Int J Sci Technol Res 2020; 9(2): 878-81.
[2]
Amiripalli SS, Bobba V. Research on network design and analysis of TGO topology. Int J Net Virtual Organisations 2018; 19(1): 72-86.
[http://dx.doi.org/10.1504/IJNVO.2018.093925]
[3]
Amiripalli SS, Bobba V. Trimet graph optimization (TGO) based methodology for scalability and survivability in wire-less networks. International Journal of Advanced Trends in Computer Science and Engineering 2019; 8(6): 3454-60.
[http://dx.doi.org/10.30534/ijatcse/2019/121862019]
[4]
Shang Y. Attack robustness and stability of generalized k-cores. New J Phys 2019; 21(9): 093013.
[http://dx.doi.org/10.1088/1367-2630/ab3d7c]
[5]
Amiripalli SS, Bobba V. An Optimal TGO Topology Method for a Scalable and Survivable Network in IOT Communication Technology. Wireless Personal Communications 2019; 107(2): 1019-40.
[http://dx.doi.org/10.1007/s11277-019-06315-z]
[6]
Amiripalli SS, Bobba V. Impact of trimet graph optimization topology on scalable networks. J Intell Fuzzy Syst 2019; 36(3): 2431-42.
[http://dx.doi.org/10.3233/JIFS-169954]
[7]
Frascolla V, Dominicini CK, Paiva MHM, et al. Optimizing C-RAN Backhaul topologies: A resilience-oriented approach us-ing graph invariants. Appl Sci (Basel) 2019; 9(1): 136.
[http://dx.doi.org/10.3390/app9010136]
[8]
Kamalesh VN, Shanthala KV, Ravindra V, Chandan BK, Pa-van MP, Bomble PP. On the design of fault tolerant k-connected network topologies. Int J Innov Manag Technol 2015; 6(5): 339-42.
[http://dx.doi.org/10.18178/ijimt.2015.6.5.626]
[9]
Du H, Fan J, He X, Feldman MW. A genetic simulated anneal-ing algorithm to optimize the small-world network generating process Complexity 2018; 2018.
[http://dx.doi.org/10.1155/2018/1453898]
[10]
Bannapure M, Patil VL. Ant Colony Optimization for random network. 2014; IEEE Global Conference on Wireless Compu-ting & Networking (GCWCN) 41-6.
[http://dx.doi.org/10.1109/GCWCN.2014.7030844]
[11]
Firoozbahrami M, Rahmani AM. Suitable Node Deployment based on Geometric Patterns Considering Fault Tolerance in Wireless Sensor Networks. Int J Comput Appl 2012; 975: 8887.
[12]
Amiripalli SS, Kollu VVR, Jaidhan BJ. SrinivasaChakravarthi L, Raju VA. Performance improvement model for airlines connectivity system using network science. International Journal of Advanced Trends in Computer Science and Engi-neering 2020; 9(1): 789-92.
[http://dx.doi.org/10.30534/ijatcse/2020/113912020]
[13]
Pal M, Sahu P, Jaiswal S. LevelTree: A New Scalable Data Center Networks Topology. 2018 International conference on Advances in Computing, Communication Control and Networking (ICACCCN), Greater Noida (UP), India. 482-6.
[http://dx.doi.org/10.1109/ICACCCN.2018.8748304]
[14]
Vestin J, Kassler A. Resilient SDN based small cell backhaul networks using mmWave bands. 2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM). 1-3
[http://dx.doi.org/10.1109/WoWMoM.2016.7523543]
[15]
Bao NH, Su GQ, Wu YK, Kuang M, Luo DY. Reliability-sustainable network survivability scheme against disaster failures. 2017; International Conference on Computer, Infor-mation and Telecommunication Systems (CITS) 334-7.
[http://dx.doi.org/10.1109/CITS.2017.8035299]
[16]
Amiripalli SS, Bobba V. An Optimal Graph based ZigBee Mesh for Smart Homes. JSIR 2020; 79(4): 318-22.
[17]
Amiripalli SS, Kumar AK, Tulasi B. Introduction to TRIMET along with its properties and scopeAIP Conference Proceedings 1705(1): 020032.
[http://dx.doi.org/10.1063/1.4940280]
[18]
Panigrahi D. Survivable network design problems in wireless networks. Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms. 1014-27.
[http://dx.doi.org/10.1137/1.9781611973082.78]
[19]
Geyer F. Performance evaluation of network topologies using graph-based deep learning. Proceedings of the 11th EAI In-ternational Conference on Performance Evaluation Methodol-ogies and Tools. 20-7.
[http://dx.doi.org/10.1145/3150928.3150941]
[20]
Shai O, Preiss K. Graph theory representations of engineering systems and their embedded knowledge. Artif Intell Eng 1999; 13(3): 273-85.
[http://dx.doi.org/10.1016/S0954-1810(99)00002-3]
[21]
Chowdary PR, Challa Y, Jitendra MSNV. Identification of MITM Attack by Utilizing Artificial Intelligence Mechanism in Cloud Environments. J Phys Conf Ser 2019; 1228(1): 012044.
[http://dx.doi.org/10.1088/1742-6596/1228/1/012044]
[22]
Amiripalli SS, Venkatarao R, Jitendra MSNV, Mycherla NMJ. Detecting emotions of student and assessing the performance by using deep learning. International Journal of Advanced Trends in Computer Science and Engineering 2020; 9(2): 1641-5.
[http://dx.doi.org/10.30534/ijatcse/2020/112922020]
[23]
Wu X, Cao Q, Jin J, Li Y, Zhang H. Nodes Availability Analy-sis of NB-IoT Based Heterogeneous Wireless Sensor Net-works under Malware Infection. Wirel Commun Mob Comput 2019.
[http://dx.doi.org/10.1155/2019/4392839]