A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
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
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On the Performance and Feasibility of Multicast Core Selection Heuristics
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Adaptive core multicast routing protocol
Wireless Networks
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage
IEEE Transactions on Mobile Computing
An efficient core migration protocol for QoS in mobile ad hoc networks
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
Mobility control and its applications in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This paper proposes a method to reduce the cost of a core-based group-shared multicast tree, where the cost is evaluated by the total bandwidth consumption of multicasting packets among all group members. Due to the broadcast nature of radio transmissions, we find that the challenge of determining minimum cost multicast tree can be approximated by finding the multicast tree with a minimum number of non-leaves (the minimum non-leaf multicast tree problem). However, we also find that the minimum non-leaf multicast tree problem is NP-complete. Thus, a method is proposed to dynamically reduce the number of non-leaves in an existing multicast tree. Experimental results show that our method reduces the cost of the multicast tree in both geometrically and randomly distributed network models and the random waypoint mobility model.