Application and Security of WSNs Using Dominating Sets in Graph Theory

Wireless sensor networks (WSNs) consists of spatially distributed autonomous sensor nodes to monitor physical or environmental conditions because of that they have widespread applications in human communities and existence world. Like other computer and telecommunication networks, wireless sensor networks are susceptible to regarding destructive threats and attacks and simple hardware of these electronic devices prevents applying defensive mechanisms called networks. Positioning key is of main performances of coding in all kinds of applications in which security is considered as an anxiety. Despite the nature of limited resources on sensor nodes limits using current routing and security mechanisms in wireless sensor networks. Secure routing protocol design because of being under the influence of resource limitations and physical nodes of the sensor is essential for wireless sensor networks. In this paper, we study topology control and virtual backbone based on dominating sets for wireless sensor networks. We deal with the performance evaluation of connected dominating set construction algorithms.

Autorentext

Amir Hassani Karbasi received Ph.D. in 2018 and has worked on "Design and security analysis of lattice-based cryptographic structures". His research interests include Public Key Cryptography, Lattice-based Cryptography, Cryptographic primitives, Hash Functions, Blockchain, Computer and Network Security, IoT and Rings and Semi-Ring Theory.