Travel delay in a large wireless ad hoc network

An analysis based on Brownian Motion, including the effect of packet losses, packet retransmission and the over-head delay incurred after each time-out, is used to derive closed form expressions for the average travel time of a packet from its source to a fixed destination. An iterative algorithm is proposed to compute the time it takes for a packet to reach a moving destination node. The value of the optimum time-out interval that minimises average travel time is illustrated with numerical examples.