Date of Degree


Document Type


Degree Name





Amotz Bar-Noy

Subject Categories

Computer Sciences | Mathematics


Mobile sensors are located on a barrier represented by a line segment, and each sensor has a single energy source that can be used for both moving and sensing. Sensors may move once to their desired destinations and then coverage/communication is commenced. The sensors are collectively required to cover the barrier or in the communication scenario set up a chain of communication from endpoint to endpoint. A sensor consumes energy in movement in proportion to distance traveled, and it expends energy per time unit for sensing in direct proportion to its radius raised to a constant exponent.

The first focus is of energy efficient coverage. A solution is sought which minimizes the sum of energy expended by all sensors while guaranteeing coverage for a predetermined amount of time. The objective of minimizing the maximum energy expended by any one sensor is also considered.

The dual model is then studied. Sensors are equipped with batteries and a solution is sought which maximizes the coverage lifetime of the network, i.e. the minimum lifetime of any sensor.

In both of these models, the variant where sensors are equipped with predetermined radii is also examined. Lastly, the problem of maximizing the lifetime of a wireless connection between a transmitter and a receiver using mobile relays is considered.

These problems are mainly examined from the point of view of approximation algorithms due to the hardness of many of them.