|
Since there are an infinite number of possible paths to be considered, the
deployment area is partitioned into a two-dimensional grid of size m — n. In theory the
entire deployment area can be a search space. However, in practice it may be
desirable to limit the travel distance and to prevent the sink from going too far while
moving in order to shorten its tour. The boundary of the allowed travel area can be
stretched to enable more flexibility by expanding the network configuration guide, especially if the
void problem does exist in the network. The size of the cell is a design parameter
which can be determined based on sensor's radio range. Sufficiently small cells make
it possible for a sensor node to reach the sink when it visits its cell. In addition,
appropriate selection of the cell sizes enable nodes in neighboring cells to reach each
other and thus a node can pursues few hops to forward its data to the sink while
passing a neighbor cell.
|
