Secure Sector Based Bi-path Clustering and Routing Protocol for WSNs. / Zang, Yihong; Thomas, Johnson P.; Ghinea, Gheorghita; Thomas, Mathews; Darwish, Salaheddin.

Proc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012. 2012. p. 777-784 6296048.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Abstract

Security and efficient routing are two important parameters in sensor networks. In this paper we propose SSBCR (Secured Sector Based Bi-path Clustering and Routing) protocol that takes both these two issues into consideration. It uses a 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. Simulations have been done for both small and large areas, low and high density, on-route and non-route connectivity scenarios. Simulation results show that the proposed protocol not only provides security but also maximizes sensor network lifetime and achieves a high probability of connectivity, particularly when the network is large.

Original languageEnglish
Title of host publicationProc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012
Pages777-784
Number of pages8
DOIs
Publication statusPublished - 6 Sep 2012
Event11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - Liverpool, United Kingdom
Duration: 25 Jun 201227 Jun 2012

Conference

Conference11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012
CountryUnited Kingdom
CityLiverpool
Period25/06/1227/06/12
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 28370270