Mobility-aware mesh construction algorithm for low data-overhead multicast ad hoc routing
First Claim
1. A mobile node of an ad hoc network, comprising:
- a wireless communication interface configured to support ad hoc communications with a plurality of other mobile nodes;
a memory configured to store multicast trees; and
at least one automated processor configured to support at least a multicast communication through the wireless communication interface dependent on the stored multicast trees, and to select a communication path based on a composite function of at least a reliability metric and a communication data-overhead metric, wherein low data-overhead paths are selected with increasing probability with an increasing reliability.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
20 Claims
-
1. A mobile node of an ad hoc network, comprising:
-
a wireless communication interface configured to support ad hoc communications with a plurality of other mobile nodes; a memory configured to store multicast trees; and at least one automated processor configured to support at least a multicast communication through the wireless communication interface dependent on the stored multicast trees, and to select a communication path based on a composite function of at least a reliability metric and a communication data-overhead metric, wherein low data-overhead paths are selected with increasing probability with an increasing reliability. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method for controlling an ad hoc network, comprising:
-
communicating between an ad hoc network node and a plurality of other ad hoc network nodes through a communication interface; maintaining, at the ad hoc network node, a plurality of multicast trees; and hosting and routing communications through the ad hoc network, with at least one automated processor, in dependence on the plurality of multicast trees, wherein a communication path is probabilistically selected based on a composite function of at least a communication reliability metric and a communication data-overhead metric, wherein low data-overhead paths are selected with increasing probability with an increasing reliability. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A method for controlling an ad hoc network, comprising:
-
automatically maintaining a plurality of multicast trees, hosting communications and routing communications in a mobile ad hoc network through an automated wireless communication interface; and automatically selecting communications paths for communication through the automated wireless interface from a plurality of possible communication paths, dependent on at least the maintained multicast trees, a reliability metric and a communication data-overhead metric, wherein low data-overhead paths to a communication destination are selected with increasing probability with an increasing reliability of a respective path.
-
Specification