Results 1 
3 of
3
Minimum cost multicast trees in ad hoc networks
 Proceedings of the 2006 IEEE International Conference on Communications (ICC 2006
, 2006
"... Abstract — We propose a simple nearlyoptimal heuristic algorithm for multicast tree construction in static ad hoc networks. The objective is to deliver a data packet from a source node to a set of destination nodes with a sequence of transmissions so that the sum of given transmissionrelated costs ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We propose a simple nearlyoptimal heuristic algorithm for multicast tree construction in static ad hoc networks. The objective is to deliver a data packet from a source node to a set of destination nodes with a sequence of transmissions so that the sum of given transmissionrelated costs is minimized. Also a bruteforce enumeration method is described to obtain optimal solutions to the problem in unit cost case. Performance of the algorithms is compared against existing methods by simulations. I.
TOPOLOGYAWARE MULTICASTING IN PHASED MOBILE AD HOC NETWORKS FOR ELEARNING
, 2012
"... ive rsi ty of ..."
(Show Context)