Tuzcu, AtakanArslan, Hilal2022-02-152022-02-15202297830308562502367-3370https://doi.org/10.1007/978-3-030-85626-7_27https://hdl.handle.net/20.500.14034/471International Conference on Intelligent and Fuzzy Systems, INFUS 2021 -- 24 August 2021 through 26 August 2021 -- -- 264409Graphs are one of the compact ways to represent information about real-life and intelligent system networks like wireless sensor networks. Betweenness centrality is an important network measure that evaluates the significance of a node based on the shortest paths and is widely used in biological, social, transportation, complex, and communication networks. In this study, we implement an efficient algorithm computing betweenness centrality of nodes for real-world and wireless multi-hop networks. Large sparse graphs are stored using compressed sparse row storage format and modified version of Dijkstra’s algorithm is used to compute shortest paths. We conduct a comprehensive experimental study on real-world networks as well as wireless sensor networks that are state-of-the-art technologies for different applications such as intelligence structures, industrial and home automation as well as health care. We evaluate the effect of network dimension on the time needed to compute betweenness centrality. Experimental results demonstrate that computation time required to compute betweenness centrality varies from 0.9 to 52.5 s when the number of vertices changes from 10,000 to 60,000. We also observe that the proposed algorithm efficiently computes betweenness centrality for networks coming from machine learning, power network, and networks obtained from optimization problems as well as computational fluid dynamics. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.eninfo:eu-repo/semantics/closedAccessBetweenness centralityShortest pathsSparse networksWireless multi-hop networksConference Object10.1007/978-3-030-85626-7_273072172242-s2.0-85115050065Q4