TY - GEN
T1 - Key distribution in mobile heterogeneous sensor networks
AU - Durresi, Arjan
AU - Bulusu, Vijay
AU - Paruchuri, Vamsi
AU - Durresi, Mimoza
AU - Jain, Raj
PY - 2006
Y1 - 2006
N2 - Key predistribution is a popular technique for key distribution in sensor networks. The existing predistribution schemes are designed for nodes with no or limited mobility. The existing schemes make use of only one key pool to establish links between the stationary and the mobile nodes. This restricts the mobility of nodes to one specific network. If the same key pool is used in multiple networks, the compromise of keys in one network would lead to compromise of keys in all the networks. We present two different solutions to this problem. The first approach uses a separate disjoint key pool to establish links between the stationary and mobile nodes of the network. In the second approach we take a large key pool and segment it into smaller key pools. Each of these segments acts as the key pool for different stationary sensor networks. The mobile nodes get keys from the aggregate of all these segments. The aggregate key pool can have some segments which can be used for future deployments. We compare the two schemes and analyze their performance. It is assumed that the stationary nodes of the sensor networks are securely connected.
AB - Key predistribution is a popular technique for key distribution in sensor networks. The existing predistribution schemes are designed for nodes with no or limited mobility. The existing schemes make use of only one key pool to establish links between the stationary and the mobile nodes. This restricts the mobility of nodes to one specific network. If the same key pool is used in multiple networks, the compromise of keys in one network would lead to compromise of keys in all the networks. We present two different solutions to this problem. The first approach uses a separate disjoint key pool to establish links between the stationary and mobile nodes of the network. In the second approach we take a large key pool and segment it into smaller key pools. Each of these segments acts as the key pool for different stationary sensor networks. The mobile nodes get keys from the aggregate of all these segments. The aggregate key pool can have some segments which can be used for future deployments. We compare the two schemes and analyze their performance. It is assumed that the stationary nodes of the sensor networks are securely connected.
UR - https://www.scopus.com/pages/publications/50949117721
U2 - 10.1109/GLOCOM.2006.943
DO - 10.1109/GLOCOM.2006.943
M3 - Conference contribution
AN - SCOPUS:50949117721
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -