Please use this identifier to cite or link to this item:
https://rda.sliit.lk/handle/123456789/1047
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ratnayake, P | - |
dc.contributor.author | Weragoda, S | - |
dc.contributor.author | Wansapura, J | - |
dc.contributor.author | Kasthurirathna, D | - |
dc.contributor.author | Piraveenan, M | - |
dc.date.accessioned | 2022-02-09T05:00:09Z | - |
dc.date.available | 2022-02-09T05:00:09Z | - |
dc.date.issued | 2021-01 | - |
dc.identifier.citation | Ratnayake, Prasan, Sugandima Weragoda, Janaka Wansapura, Dharshana Kasthurirathna, and Mahendra Piraveenan. 2021. "Quantifying the Robustness of Complex Networks with Heterogeneous Nodes" Mathematics 9, no. 21: 2769. https://doi.org/10.3390/math9212769 | en_US |
dc.identifier.issn | 2227-7390 | - |
dc.identifier.uri | http://rda.sliit.lk/handle/123456789/1047 | - |
dc.description.abstract | The robustness of a complex network measures its ability to withstand random or targeted attacks. Most network robustness measures operate under the assumption that the nodes in a network are homogeneous and abstract. However, most real-world networks consist of nodes that are heterogeneous in nature. In this work, we propose a robustness measure called fitnessincorporated average network efficiency, that attempts to capture the heterogeneity of nodes using the ‘fitness’ of nodes in measuring the robustness of a network. Further, we adopt the same measure to compare the robustness of networks with heterogeneous nodes under varying topologies, such as the scale-free topology or the Erd˝os–Rényi random topology. We apply the proposed robustness measure using a wireless sensor network simulator to show that it can be effectively used to measure the robustness of a network using a topological approach. We also apply the proposed robustness measure to two real-world networks; namely the CO2 exchange network and an air traffic network. We conclude that with the proposed measure, not only the topological structure, but also the fitness function and the fitness distribution among nodes, should be considered in evaluating the robustness of a complex network. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Multidisciplinary Digital Publishing Institute | en_US |
dc.relation.ispartofseries | Mathematics;Vol 9 Issue 21 Pages 2769 | - |
dc.subject | complex networks | en_US |
dc.subject | network robustness | en_US |
dc.subject | network efficiency | en_US |
dc.subject | node heterogeneity | en_US |
dc.title | Quantifying the Robustness of Complex Networks with Heterogeneous Nodes | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.3390/math9212769 | en_US |
Appears in Collections: | Department of Computer Science and Software Engineering-Scopes Research Papers - Dept of Computer Science and Software Engineering Research Papers - Open Access Research Research Papers - SLIIT Staff Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
mathematics-09-02769-v2.pdf | 369.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.