TY - GEN
T1 - Key establishment in sensor networks based on triangle grid deployment model
AU - Zhou, Yun
AU - Zhang, Yanchao
AU - Fang, Yuguang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2005
Y1 - 2005
N2 - Key establishment between neighboring nodes is a fundamental issue for securing sensor networks deployed in unattended and hostile environments. Recent research ofien assumed a probabilistic approach by pre-distributing a random set of secrets to each node such that any two neighboring nodes can establish a direct key with a certain probability or negotiate an indirect key through multi-hop routing after deployment. The shortcomings include poor resilience against node compromise, low secure connectivity, etc. In this paper, we present a key establishment scheme based on a triangle grid deployment model. In contrast to previous proposals, our scheme have higher resilience to node compromise attacks with much smaller memory costs, while maintaining high secure connectivity so that much less energy needs to be consumed in establishing indirect keys through multi-hop or multi-path routing.
AB - Key establishment between neighboring nodes is a fundamental issue for securing sensor networks deployed in unattended and hostile environments. Recent research ofien assumed a probabilistic approach by pre-distributing a random set of secrets to each node such that any two neighboring nodes can establish a direct key with a certain probability or negotiate an indirect key through multi-hop routing after deployment. The shortcomings include poor resilience against node compromise, low secure connectivity, etc. In this paper, we present a key establishment scheme based on a triangle grid deployment model. In contrast to previous proposals, our scheme have higher resilience to node compromise attacks with much smaller memory costs, while maintaining high secure connectivity so that much less energy needs to be consumed in establishing indirect keys through multi-hop or multi-path routing.
UR - http://www.scopus.com/inward/record.url?scp=33847342853&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33847342853&origin=recordpage
U2 - 10.1109/MILCOM.2005.1605881
DO - 10.1109/MILCOM.2005.1605881
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780393937
SN - 9780780393936
VL - 2005
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 1450
EP - 1455
BT - MILCOM 2005: Military Communications Conference 2005
PB - IEEE
T2 - MILCOM 2005: Military Communications Conference 2005
Y2 - 17 October 2005 through 20 October 2005
ER -