The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
A dynamic core based multicast routing protocol for ad hoc wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Neighbor supporting ad hoc multicast routing protocol
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
Flooding in wireless ad hoc networks
Computer Communications
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper we present DPUMA, a mesh-based multicast routing protocol specifically designed to reduce the overhead needed to deliver multicast packets, saving bandwidth and energy, two of the scarcest resources in MANETS. The two main features of DPUMA are: (1) for each multicast group, it periodically floods a single control packet to build the mesh, elect the core of the mesh and get two-hop neighborhood information; and (2), it computes the mesh’s k-dominating set to further reduce overhead induced by flooding the mesh when forwarding data packets. These two characteristics contrast with other protocols that blindly flood the net in different stages to construct their routing structure (mesh or tree), to elect the leader of the structure, and that exchange hello messages to get neighborhood information. Using detailed simulations, we show over different scenarios that our protocol achieves similar or better reliability while inducing less packet transmission overhead than ODMRP, MAODV and PUMA which is DPUMA’s predecessor.