Security Schemes for Wireless Sensor Networks with Mobile Sink
Abstract
Mobile sinks are vital in many wireless sensor applications for efficient data collection,
data querying, and localized sensor reprogramming. Mobile sinks prolong the lifetime of
a sensor network. However, when sensor networks with mobile sinks are deployed in a
hostile environment, security became a critical issue. They become exposed to varieties
of malicious attacks. Thus, anti threats schemes and security services, such as mobile
sink?s authentication and pairwise key establishment, are essential components for the
secure operation of such networks.
Due to the sensors, limited resources designing efficient security schemes with
low communication overhead to secure communication links between sensors and MS
(Mobile Sink) is not a trivial task. In addition to the sensors limited resources, sink mobility
required frequent exchange of cryptography information between the sensors and
MS each time the MS updates its location which imposes extra communication overhead
on the sensors.
In this dissertation, we consider a number of security schemes for WSN (wireless
sensor network) with MS. The schemes offer high network?s resiliency and low communication
overhead against nodes capture, MS replication and wormhole attacks.
We propose two schemes based on the polynomial pool scheme for tolerating
nodes capture: the probabilistic generation key pre-distribution scheme combined with
polynomial pool scheme, and the Q-composite generation key scheme combined with
polynomial pool scheme. The schemes ensure low communication overhead and high
resiliency.
For anti MS replication attack scheme, we propose the multiple polynomial
pools scheme that provide much higher resiliency to MS replication attack as compared
to the single polynomial pool approach.
Furthermore, to improve the network resiliency against wormhole attack, two defensive
mechanisms were developed according to the MS mobility type. In the first
technique, MS uses controlled mobility. We investigate the problem of using a single
authentication code by sensors network to verify the source of MS beacons, and then we
develop a defensive approach that divide the sensor network into different authentication
code?s grids. In the second technique, random mobility is used by MS. We explore the
use of different communication channels available in the sensor hardware combined with
polynomial pool scheme.
Subject
Wireless Sensor NetworkKey Pre-Distribution Schemes
Data Collection Schemes in Sensor Networks
Pairwise Key Establishment in Sensor Networks
Mobile Sensor Networks
Citation
Rasheed, Amar Adnan (2010). Security Schemes for Wireless Sensor Networks with Mobile Sink. Doctoral dissertation, Texas A&M University. Available electronically from https : / /hdl .handle .net /1969 .1 /ETD -TAMU -2010 -05 -7844.
Related items
Showing items related by title, author, creator and subject.
-
Singh, Abhay Kumar (Texas A&M University, 2006-10-30)In chemical processes, online measurements of all the process variables and parameters required for process control, monitoring and optimization are seldom available. The use of soft sensors or observers is, therefore, ...
-
Yang, Yanxiang; Hu, Jiang; Porter, Dana O.; Marek, Thomas H.; Hillyer, Charles C.; Sun, Lijia (United States. Patent and Trademark Office; Texas A&M University. Libraries, 12/6/2022)Disclosed are various embodiments for optimized sensor deployment and fault detection in the context of agricultural irrigation and similar applications. For instance, a computing device may execute a genetic algorithm ...
-
Chandanala, Roja Ramani (2012-02-14)Network coding and duty-cycling are two popular techniques for saving energy in wireless sensor networks. To the best of our knowledge, the idea to combine these two techniques, for even more aggressive energy savings, ...