End-to-end delay in wireless random networks

The focus of this letter is to derive a scaling law for the ene-to-end delay of wireless random networks under node mobility, where n nodes randomly move with the speed of v. To that end, we apply the cover time analysis and relate it to the delay scaling law. As a result, we derive that the mean delay per S-D pair as ¿(n) or ¿(¿(n)/v), and the worst case delay is ¿(n log n) or ¿(¿(n) log n/v), corresponding to one slot time length that is either constant or 1/v¿(n).