Scheduling Mobile Nodes for Cooperative Data Transport in Sensor Networks
Message Ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, the authors propose three schemes enabling multiple ferries to coordinate in collecting and delivering the data. They analyze the performance of each scheme and establish bounds on the average and worst-case delay. The latter bounds are useful in offering performance guarantees.