Home // ICN 2013, The Twelfth International Conference on Networks // View article

Yet Another Bounded Broadcasting for Random Key Predistribution Schemes in Wireless Sensor Networks

Authors:
Aishwarya Mishra
Tibor Gyires
Yongning Tang

Keywords: sensor networks, random key predistribution, graph diameter, random graph, theoretical bound

Abstract:
Wireless Sensor Networks (WSNs) have many promising applications involving unattended deployment in hostile territories. Random key predistribution schemes(RKPS) have been proposed to secure these networks. RKPS require broadcasting within the secured sensor network for key discovery and key revocation. Unbounded broadcasting in RKPS could incur large transmission and computational overheads and may not be sustainable on sensor node platforms, due to their limited power resources. Since the requests are triggered by unauthenticated nodes, this broadcasting can be exploited by a sabotaging adversary to deliberately exhaust the power on the sensor nodes and prevent them from performing their intended function. Enforcing the maximum value of the TTL (MAXTTL) on all nodes of the sensor networks can be an effective approach to mitigating this potential threat if it does not impede the function of the RKPS key discovery and revocation. In this paper, we model the RKPS sensor network as a Random Geometric Graph (RGG) and investigate the upper bounds on RGG diameter as guidance for MAXTTL on all RKPS key discovery and key revocation broadcasts. The simulation results show that our approach is practical and does not impede its function.

Pages: 53 to 58

Copyright: Copyright (c) IARIA, 2013

Publication date: January 27, 2013

Published in: conference

ISSN: 2308-4413

ISBN: 978-1-61208-245-5

Location: Seville, Spain

Dates: from January 27, 2013 to February 1, 2013