|
The DTS works as follows. First the cells that will be visited are identified based
on the node population. A travel path is then selected according to the criterion for the
inter-cell link cost in the graph representation of the grid. The nodes in the designated
cells on the path set routes as if the sink is located at the center of the cell, i.e., by
employing the virtual gateway model discussed in the previous section. Nodes in
unvisited cells forward their data to the closest cell that is part of the sink tour. When
the sink travels to go to the individual virtual gateway positions in the designated cells
and receives the data. Fig. 4 shows network configuration issues summary of the DTS algorithm. It
should be noted that the sink travel speed and the presence of data collection latency
are not factored in this paper for simplicity of the presentation. The DTS algorithm
can be easily extended to factor in data freshness constraints.
|
