ABSTRACT

Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347

In this chapter, we consider the problem of deployment of sensor nodes in a

wireless sensor network (WSN) to cover a region with a given number of sensor

nodes. However, the results we present here will also be applicable for placement of

base stations in a cellular mobile network. The overall objective is to place a given

number of sensor nodes in a convex region and assign range to each of them so that

every point in the region is covered by at least one sensor node and the maximum

range assigned is minimized. We assume that the same range is assigned uniformly

to all the sensor nodes and that the sensing ranges and communication ranges of the

sensor nodes are the same.