This document summarizes research on the dynamic coverage of mobile sensor networks. It studies how sensor movement allows for locations that were initially uncovered to become covered over time, enabling detection of intruders that could not be detected by a stationary sensor network. However, this improved coverage comes at the cost of locations alternating between covered and uncovered as sensors move. The time it takes to detect a randomly located intruder is proven to be exponentially distributed based on parameters like sensor density and speed. For mobile intruders, a game theoretic approach derives optimal mobility strategies, with sensors choosing random directions and intruders remaining stationary, representing a Nash equilibrium.