Show simple item record

dc.contributor.advisorKak, Subhash C.
dc.contributor.authorYashwanth, Kothapalli
dc.date.accessioned2014-04-15T18:32:55Z
dc.date.available2014-04-15T18:32:55Z
dc.date.issued2011-07-01
dc.identifier.urihttps://hdl.handle.net/11244/8185
dc.description.abstractThis thesis deals with a new approach to key establishment in wireless sensor networks where the nodes have limited memory and communication capabilities. Primitive Pythagorean triples (PPT's) are used in this method in which we store odd numbers on sensor nodes and generate keys from them. This scheme needs at least one common odd number between two nodes to have a communication link, which increases the connectivity between nodes compared to q-composite scheme that requires at least q keys in common to have a communication.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titlePrimitive Pythagorean Triples in Key Management of Sensor Networks
dc.typetext
dc.contributor.committeeMemberThomas, Johnson
dc.contributor.committeeMemberToulouse, Michel
osu.filenameKothapalli_okstate_0664M_11493.pdf
osu.collegeArts and Sciences
osu.accesstypeOpen Access
dc.description.departmentComputer Science Department
dc.type.genreThesis
dc.subject.keywordsprimitive pythogerean triples


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record