A faster approximation algorithm for the Steiner problem in graphs
Acta Informatica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A network architecture providing host migration transparency
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IP-based protocols for mobile internetworking
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Multicast routing extensions for OSPF
Communications of the ACM
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Online tracking of mobile users
Journal of the ACM (JACM)
Data broadcasting strategies over multiple unreliable wireless channels
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Challenges of Mobile Computing
Computer
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Flow-oriented protocols for scalable wireless networks
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The Journal of Supercomputing
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
IMWS '01 Revised Papers from the NSF Workshop on Developing an Infrastructure for Mobile and Wireless Systems
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Energy-efficient broadcasting in all-wireless networks
Wireless Networks
Stable protocols for the medium access control in wireless networks
DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Optimal multichannel data transmission in computer networks
Computer Communications
Analysis of the performance of dynamic multicast routing algorithms
Computer Communications
Hi-index | 0.00 |
An important problemin both wireless and wired communication networks is to be able to efficiently multicast information to a group of network sites. Multicasting reduces the transmission overhead of both wireless and wired networks and the time it takes for all the nodes in the subset to receive the information. Since transmission bandwidth is a scarce commodity especially in wireless networks, efficient and near minimum-cost multicast algorithms are particularly useful in the wireless context. In this paper, we discuss methods of establishing efficient and near minimum-cost multicast routing in communication networks. In particular, we discuss an efficient implementation of a widely used multicast routing method which can construct a multicast tree with a cost no greater than twice the cost of an optimal tree. We also present two efficient multicast tree constructions for a general version of the multicast routing problem in which a network consists of different classes of nodes, where each class can have one or more nodes of the same characteristic which is different fromthe characteristics of nodes fromother classes. Because of their efficient running times, these multicast routing methods are particularly useful in the mobile communication environments where topology changes will imply recomputation of the multicast trees. Furthermore, the proposed efficient and near minimum-cost multicast routing methods are particularly suited to the wireless communication environments, where transmission bandwidth is more scarce than wired communication environments.