Abstract
This study underscores the critical role of graph theory in optimizing the functionality of Wireless Sensor Networks (WSNs). Our research aims to enhance network efficiency by utilizing a variety of centrality metrics, including degree, betweenness, closeness, eigenvector, Katz, PageRank, subgraph, harmonic, and percolation centrality, to identify pivotal nodes. Employing an extended Barabási-Albert model graph of a 50-node network, our methodology focuses on pinpointing nodes crucial for optimal data processing, monitoring, and analysis in WSNs. This comprehensive approach deepens our understanding of sensor networks and significantly boosts operational efficiency by leveraging strategic node functionalities. The findings from our study are poised to revolutionize network management strategies, promoting the development of more robust and efficient WSN operations.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
