Relay-Assisted Multicast With Markov Mobility

In this paper, we investigate the capacity and delay tradeoff under multicast scheme in the MANET, based on a general Markovian mobility model. To reduce the delay of the network, we propose a relay-assisted multicast scheme. Specifically, a two-hop relay algorithm is developed, in which Lyapunov drift is utilized to derive the average packet delay. In addition, we utilize the cache in relay nodes and propose the two-hop relay algorithm with redundancy. Theoretical analysis indicates that the network delay is significantly decreased, whereas the capacity remains the same. To guarantee the fairness and efficiency of the network, a two-hop relay selection algorithm with redundancy is proposed to decide which packet to serve in a queue. Moreover, the minimum energy function is applied to characterize the energy consumption of each node. We accordingly derive the accurate minimum energy function under the proposed relay-assisted multicast scheme. Furthermore, we design an efficient minimum energy algorithm, which pushes the actual energy consumption arbitrarily close to the minimum energy function at the cost of increasing delay. Theoretical results show that the optimal energy-delay tradeoff is achieved in our proposed algorithm. Numerous experiments are carried out to evaluate the performance of our proposed algorithms, where the experimental results well conform our theoretical findings.