Application and Security of WSNs Using Dominating Sets in Graph Theory

Amir Hassani Karbasi

ISBN 10: 6139859522 / ISBN 13: 9786139859528

Published by LAP LAMBERT Academic Publishing, 2018

About this Item

Application and Security of WSNs Using Dominating Sets in Graph Theory | Amir Hassani Karbasi | Taschenbuch | 96 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786139859528 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Seller Inventory # 114095995

Bibliographic Details

• Title: Application and Security of WSNs Using Dominating Sets in Graph Theory
• Publisher: LAP LAMBERT Academic Publishing
• Publication Date: 2018
• Language: English
• ISBN 10: 6139859522
• ISBN 13: 9786139859528
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 6D millimeters 220 millimeters width by 150 millimeters height by 6 millimeters depth
• Weight: 161 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.