Multicast Ad Hoc Routing Through Mobility-Aware Steiner Tree Meshes With Consistency Across Different Mobility Models
The authors study the problem of reducing the data overhead of mesh-based multicast ad hoc routing protocols while maintaining high packet delivery ratios. Their proposed approach adaptively controls the redundancy added by the routing protocol to the minimal data overhead multicast mesh. They show that the problem of finding the minimal data overhead multicast mesh is NP-complete, and they offer a heuristic algorithm to approximate such a mesh. Based on the heuristic algorithm, they propose and evaluate several mesh construction algorithms. They show that the mobility-aware variant being able to control the reliability of the mesh depending upon the mobility of the network offers the best performance.