Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Solutions to hidden terminal problems in wireless networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Current multicast routing protocols for mobile ad hoc networks can be classified into two categories, tree-based protocols and mesh-based protocols. Mesh-based protocols have high packet delivery ratios compared to tree-based protocols, but incur more control overhead. Though the control overhead involved in tree-based protocols is low, the performance in terms of packet delivery ratio of such protocols, decreases with increasing mobility. This is due the lack of proper tree maintenance mechanisms. We propose an efficient multicast routing protocol called preferred link-based multicast protocol that uses a preferred link approach for forwarding JoinQuery packets. This approach reduces control overhead during the forwarding of JoinQuery packets. In this approach only a subset of neighbors of a node, that are termed as preferred nodes, are made eligible for further forwarding of JoinQuery packets. These preferred nodes are selected using our preferred link-based algorithm. We conducted extensive simulation experiments to evaluate the proposed protocol and have compared our protocol with some of the existing protocols. The simulation results show that our protocol performs better than the other multicast protocols in terms of packet delivery ratio and control overhead. Further, we have extended our multicast protocol to support unicast and multicast traffic simultaneously. This unified approach for routing is analyzed in order to study the impact of unicast traffic on multicast traffic, and vice versa. Performance evaluation of the unified approach, that we term as preferred link-based unified routing, was carried out through extensive simulation experiments.