Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network |
| |
Authors: | Venkatesh Ramaiyan Eitan Altman Anurag Kumar |
| |
Affiliation: | (1) Dept. of ECE, Indian Institute of Science, Bangalore, India;(2) INRIA, Sophia-Antipolis, France |
| |
Abstract: | We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that
might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed
destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we
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 average speed v sampled from a given probability distribution. The source node communicates data packets (or fragments) of the file to the
destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination
node only, and hence, every packet communication involves two hops. In this setup, we study the source node’s sequential decision
problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network.
We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize
the expected file transfer delay, i.e., expected value of the maximum of the packet sojourn times. In the infinite file size
case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average
queueing delay at the source node buffer and the average transit delay in the relay vehicle. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|