Date of Award


Publication Type

Master Thesis

Degree Name



Computer Science


Mixed Integer Linear Formulation, Mobile Nodes, Path Finding, Wireless Sensor Networks


Jaekel, Arunita




Wireless Sensor Networks (WSN) are a collection of sensor nodes that sense their surroundings and relay their proximal information for further analysis. They utilize wireless communication technology to allow monitoring areas remotely. A major problem with WSNs is that the sensor nodes have a set sensing radius, which may not cover the entire field space. This issue would lead to an unreliable WSN that sometimes would not discover or report about events taking place in the field space. Researchers have focused on developing techniques for improving area coverage. These include allowing mobile sensor nodes to dynamically move towards coverage holes through the use of a path planning approach to solve issues such as maximizing area coverage. An approach is proposed in this thesis to maximize the area of network coverage by the WSN through a Mixed Integer Linear Programming (MILP) formulation which utilizes both static and mobile nodes. The mobile nodes are capable of travelling across the area of interest, to cover empty ‘holes’ (i.e. regions not covered by any of the static nodes) in a WSN. The goal is to find successive positions of the mobile node through the network, in order to maximize the network area coverage, or achieve a specified level of coverage while minimizing the number of iterations taken. Simulations of the formulation on small WSNs show promising results in terms of both objectives.