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 proceeding › Conference contribution
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 proceeding › Conference contribution
}
TY - GEN
T1 - Secure Sector Based Bi-path Clustering and Routing Protocol for WSNs
AU - Zang, Yihong
AU - Thomas, Johnson P.
AU - Ghinea, Gheorghita
AU - Thomas, Mathews
AU - Darwish, Salaheddin
PY - 2012/9/6
Y1 - 2012/9/6
N2 - 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.
AB - 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.
KW - routing
KW - security
KW - Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=84868089886&partnerID=8YFLogxK
U2 - 10.1109/TrustCom.2012.254
DO - 10.1109/TrustCom.2012.254
M3 - Conference contribution
AN - SCOPUS:84868089886
SN - 978-1-4673-2172-3
SP - 777
EP - 784
BT - 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
T2 - 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012
Y2 - 25 June 2012 through 27 June 2012
ER -