Date Added: Jan 2011
The authors study a scheduling problem in a mobile network scenario where vehicles are used as relays. A fixed source node wants to transfer a file of a known size to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, they consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with speed ?? from a given distribution. The source node communicates packets of the file to the destination node using these vehicles as relays.