Show simple item record

dc.contributor.authorZang, Yihong
dc.date.accessioned2014-04-15T18:33:25Z
dc.date.available2014-04-15T18:33:25Z
dc.date.issued2007-05-01
dc.identifier.urihttps://hdl.handle.net/11244/8274
dc.description.abstractSecurity and efficient routing are two important parameters in sensor networks. There are few protocols that consider both routing and security. Existing methods suffer from computational overheads. In this thesis we propose SSBBCR (Secured Sector Based Bi-path Clustering and Routing) protocol that takes both these two issues into consideration. It uses bi-path routing algorithm to decrease the computational overhead as well as energy dissipation in the nodes. A key pre-distribution scheme is proposed such that nodes in the route share keys while those that are not in the route do not share keys with nodes that are in the route. Simulation results show that the proposed protocol maximizes the sensor network lifetime and achieves a high probability of connectivity. The proposed approach achieves the best performance when the network is large and the sensor nodes are deployed over a large area.
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.titleSecured Sector Based Bi-path Clustering and Routing Protocol for Wireless Sensor Network
dc.typetext
osu.filenameZang_okstate_0664M_2234.pdf
osu.collegeArts and Sciences
osu.accesstypeOpen Access
dc.description.departmentComputer Science Department
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record