The Information Collection and Intrusion Detection in Mobile Sensor Networks

PhD Thesis Proposal Defence


Title: "The Information Collection and Intrusion Detection in Mobile Sensor
Networks"

by

Mr. Yik KEUNG


Abstract:

Mobile sensor networks (MSNs) have been widely studied in
recent years and are expected to be applied in a variety of
applications such as battlefield surveillance, event detections,
hostile environment monitoring, and wild animal tracking. In this
report, we mainly focus on the challenges of information collection
and intrusion detection in mobile sensor networks.

We study the delay-constrained information coverage problem
in mobile sensor networks. Motivated by real application needs, our
formulation takes advantage of the sensor mobility for sensing
information collection, which takes place when a sensor moves into
the proximity (single hop) of stationary sink nodes. We also study
relay assisted information collection. By taking full advantage of
sensor mobility and rendezvous during senor node encounter, messages
can be delivered to a sink node either directly or through relays by
other sensor nodes. Under the relay assisted case, we study the
message delivery capacity problem in delay-constrained
mobile sensor networks. The message delivery capacity specifies the
maximum percentage of sensing messages that can be successfully
delivered to sink nodes within a given time constraint. This
captures the overall system capacity in term of successful sensing
message delivery.

For the first time, we present the delay-constrained message
delivery capacity formulation in mobile sensor networks. The
objective is to maximize the message delivery capacity subject to
the delay and buffering constraints. We first identify a number of
unique challenges involved in such systems including message relay
and buffer replacement mechanisms, and we derive the capacity bound
under perfect message relay and buffer replacement mechanisms. Due
to the unrealistic assumption for the foreknowledge of sensor moving
trajectories, we next proceed to propose a practical algorithm to
approximate the maximal message delivery capacity based on the
current global network knowledge. Furthermore, a distributed
algorithm is proposed to reduce the control overhead for information
exchange. Finally, we evaluate the algorithms and examine the
sensitivity with respect to  delay constraint, buffer size and
message relay and replacement schemes.

On the other hand, prior works in static sensor environments show
that constructing sensor barriers with random sensor deployment can
be effective for intrusion detection. In response to the recent
surge of interest in mobile sensor applications, we study the
intrusion detection problem in a mobile sensor network, where it is
believed that mobile sensors can improve barrier coverage.
Specifically, we focus on providing k-barrier coverage
against moving intruders. This problem becomes particularly
challenging given that the trajectories of sensors and intruders
need to be captured.

We first demonstrate that this problem is similar to the classical
kinetic theory of gas molecules in physics. We then derive the
inherent relationship between barrier coverage performance and a set
of crucial system parameters including sensor density, sensing
range, sensor and intruder mobility. We examine the correlations and
sensitivity from the system parameters, and we derive the minimum
number of mobile sensors that needs to be deployed in order to
maintain the $k$-barrier coverage for a mobile sensor network.
Finally, we show that the coverage performance can be improved by an
order of magnitude with the same number of sensors when compared
with that of the static sensor environment.


Date:  			Tuesday, 31 August 2010

Time:           	10:00am - 12:00noon

Venue:          	Room 3501
 			lifts 25/26

Committee Members:      Prof. Bo Li (Supervisor)
 			Prof. Qian Zhang (Supervisor)
 			Dr. Lei Chen (Chairperson)
 			Dr. Lin Gu
 			Prof. Chin-Tau Lea (ECE)


**** ALL are Welcome ****