Motioncast with general Markovian mobility

This paper investigates the capacity, delay and energy consumption for MotionCast (a multicast mechanism for MANETs) with general Markovian mobility. We consider MotionCast in an extended cell partitioned network under a Markovian node mobility model and exactly compute the pernode throughput capacity. A Two hop relay algorithm is proposed to guarantee such capacity, which also achieves a better delay-capacity tradeoff, i.e., Θ(N log k). Considering that redundancy can significantly improve network delay, we present a Two hop relay algorithm with redundancy and study the general influence of redundancy on the capacity and delay of MotionCast network. Moreover, we use the minimum energy function to characterize the energy consumption for the MotionCast network. An accurate piecewise minimum energy function to keep network stable is derived. Furthermore, a simple Minimum energy algorithm is designed, which reduces actual energy consumption arbitrarily close to the minimum energy function at the cost of increasing delay. Our result shows that the proposed algorithm achieves the optimal energy-delay tradeoff.