Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.

Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.

Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.

Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.

Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.