Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12323/3634
Title: Key pre-distribution protocols in Wireless Sensor Networks using Dominating Sets
Authors: Nuraliyev, Farid
Keywords: Wireless Sensor Network
Centralized Algorithms
Generalized quandangles
Issue Date: 2017
Abstract: It is undeniable that networking technologies, especially wireless communications, have changed our everyday life. The innovations in networking technology especially, at the past two decades has resulted in wireless networking capabilities that have changed the way we create, share, and use information. The wireless Internet together with advances of computing and networking technology entered into realityin the information age which should have supposed to be there a long time ago. These information innovations have the effects on global socioeconomic and cultural conditions. These impacts have extremely had a deep consequence on the operations of military forces and governments’ secure applications. Timely and reliable access to information is key to the success of virtually all government and military functions. Having effective communications and networking resolutions are critical to the any mission success. Revitalization in hardware and new conceptions in wireless network technologies have generated low-cost, multi-serviceable small sensor devices. With the help such devices are created hundreds or thousands of ad hoc tiny sensor nodes disperse crosswise a geographical place. Distributed sensor nodes cooperate among themselves to make a sensing network. A sensor network could serve for access to data anytime, anywhere by gathering, proceeding, analyzing and distributing dataand it is extremely efficient in platforms which have prevalent applications for monitoring. So, with the help of such sensor nodes created a smart environment. WSNs are vulnerable to some damaging attacks. Two by two key predistribution design is fundamental for WSNs origin to resource restrictions in the sensor nodes. We will give attention to symmetric design of combinatorial set system which is known as projective plane for illustrating deterministic key pre-distribution to WSNs. Initially a mathematical model is suggested to the networks. Then we design the different applications for wireless network using connected dominating sets. After that for improving projective plane a modern model is suggested which is key copying and exchanging based on CDS and virtual backbone. Results illustrate ii | P a g e that the combinatorial and CDS-based routing approach gives productivity and strong rate for sensor flexibility, optimal resource allocation and scalability in WSNs.
URI: http://hdl.handle.net/20.500.12323/3634
Appears in Collections:Theses

Files in This Item:
File Description SizeFormat 
Farid Nuraliyev.pdf1.69 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.