Figure 1: Illustrations of the CF, the DF, and the MF schemes in a one-dimensional network. Nodes are assumed to be evenly distributed. In the CF scheme, nodes send to the closest neighbor. Direct transmissions toward the data sink are employed in the DF scheme. In the MF scheme, multihop forwarding is used with hop distance of units.