A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The Ad Hoc on-demand distance-vector protocol
Ad hoc networking
Introduction to Algorithms
Stochastic properties of the random waypoint mobility model
Wireless Networks
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
We propose multicast extensions to the location prediction-based routing protocol (NR-MLPBR and R-MLPBR) for mobile ad hoc networks to simultaneously reduce the number of tree discoveries, number of links and the hop count per path from the source to the multicast group. The multicast extensions work as follows: Upon failure of a path to the source, a receiver node attempts to locally construct a global topology using the location and mobility information collected during the latest global broadcast tree discovery. NR-MLPBR predicts a path that has the minimum number of hops to the source and R-MLPBR predicts a path to the source that has the minimum number of non-receiver nodes. If the predicted path exists in reality, the source accommodates the path as part of the multicast tree and continues to send the multicast packets in the modified tree. Otherwise, the source initiates another global broadcast tree discovery.