Sensor Coverage Problem in Sparse MANET Environments

摘要

In this paper, we define the problem of sensor coverage in sparse mobile ad hoc networks. Previously, the nodes are assumed static or the number of nodes is large enough to cover the area for the coverage problem in wireless sensor networks. However, in sparse mobile ad hoc network environments, the semantics of the coverage problem differ in that the nodes are free to move in the area and the distance between the nodes should be long enough in order not to overlap the nodes' coverage to maximize the total coverage area in the network. We formulate the sensor coverage problem in sparse mobile ad hoc network environments.