Message Delay in Mobile Ad Hoc Networks by Robin Groenevelt In collaboration with Philippe Nain and Ger Koole

Example of MANET

Meeting times are exponential Area = 4x4 km 2 V min = 4km/hour V max = 10km/hour

Meeting times are exponential (2) Area = 4x4 km 2 V min = 4km/hour V max = 10km/hour

Meeting times are exponential (3) Area = 4x4 km 2 V min = 4km/hour V max = 10km/hour

MANET as a Markov Chain State i (i=1,…,N) represents number of copies in network State N+1 is when destination receives the message

MANET as a Markov Chain (2) P(j → j+1) = j/N P(j → N+1) = 1-j/N If C = number of copies when destination reached, then

T = message delay under two-hop relay protocol T*( Θ ) = E[e -ΘT ] = Laplace transform of T where S j = Sojourn time in state i MANET as a Markov Chain (3)

MANET as a Markov Chain (4) S j = Sojourn time in state i S j,1 = Time to enter state i+1 = exp((N-j)λ) S j,2 = Time to enter state N+1 = exp(jλ) S j = min(S j,1,S j,2 ), moreover Therefore

Message Delay two-hop relay This gives the Laplace transform of the message delay: From this the mean delay is easily obtained: It can be shown that

Unrestricted relaying If C U = number of copies when destination reached, then

Message Delay unrestricted relaying LST of message delay under restricted relaying: Expected delay under unrestricted relaying: where γ ≈ is Euler’s constant Number of copies (C U ) is uniformly distributed

Message Delay two-hop relaying

Message Delay unrestricted relaying

Under certain independence assumptions: For the Random Direction (RD) and the Random Waypoint (RW) mobility models: and if V 1 =v=V 2 where ω ≈ is the Waypoint constant. The parameter λ