3736

3530

كارشناسي ارشد

مخابرات-شبكه

اصفهان :دانشگاه صنعتي اصفهان ، دانشكده برق و كامپيوتر

1386

چهارده،153،[II]ص.: مصور،جدول،نمودار

ص.ع. به فارسي و انگليسي

مهدي برنجكوب

محمد دخيل عليان

29/08/86

محمودمدرس هاشمي، مسعود عمومي

مهندسي برق و كامپيوتر

ID3530

به فارسي و انگليسي: قابل رؤيت در نسخه ديجيتال

AbstractBy development of wireless network usage implementing security in those networksseems to be critical Authentication and key agreement are central problems to build upsecure infrastructure for networks On the other hand most of the upcoming wirelessnetworks are going from homogeneous networks toward heterogeneous ones Thephenomenon of the heterogenesis in wireless networks could be studied from two points ofview first wireless network consists of a set of networks with various communicationstandards Second the computation ability and communication range of the mobile nodesare different The purpose of this thesis is to investigate the authentication protocols in theheterogeneous wireless networks with respect to node types in network or communicationstandards From the first heterogenesis point of view in this thesis we proposed a practicalaccounting and authentication protocol for 3G WLAN networks that not only possesseshigher performance than earlier protocols by reducing computations of mobile terminals but also includes non repudiation of service so that all of the nodes in the network withoutany argument can believe that the mobile accounting is valid By the second heterogenesispoint of view recent researches indicate scalability problems for flat ad hoc networks Toaddress the issue of scalability self organizing hierarchical ad hoc architectures are beinginvestigated In this thesis we explore the task of providing entity authentication forhierarchical ad hoc sensor networks Our sensor network consists of devices with varyinglevels of computational and communication capabilities Using this hierarchical network both the routing efficiency and its security have been drastically improved In thesenetworks designing the authentication and key agreement algorithms should be done sothat the minimum computational and processing load imposes on low power sensor nodes In this thesis we present a new type of TESLA certificate to authenticate high power nodesto sensor ones Our protocol also imposes few control messages on the network Sincesensor nodes need to communicate with each other it is necessary to make a shared keybetween them Conventional symmetric key agreement models try to achieve keyagreement between all pairs of nodes without any interaction However this protocol in notscalable thus they are only suitable and optimum for small networks On the last sectionof this thesis it is proposed an algorithm based on symmetric polynomials to establishshared keys between sensor nodes Although this approach imposes low memory cost onsensor nodes it achieves a vast decrease in nodes power consumption in the key agreementprocess

مهدي برنجكوب

محمد دخيل عليان

محمودمدرس هاشمي، مسعود عمومي