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
On-line routing in all-optical networks
Theoretical Computer Science
Routing with guaranteed delivery 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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multicast over wireless networks
Communications of the ACM
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Improved bounds for the unsplittable flow problem
Journal of Algorithms
Balancing traffic load in wireless networks with curveball routing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Ad hoc networks beyond unit disk graphs
Wireless Networks
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs
IEEE Transactions on Parallel and Distributed Systems
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Robust position-based routing for wireless ad hoc networks
Ad Hoc Networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A survey of geocast routing protocols
IEEE Communications Surveys & Tutorials
IPv6 Multicast Forwarding in RPL-Based Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dynamic and diverse multicast requests typical of, for example, publish/subscribe and content-based communication. The scheme is built on top of a geographical routing layer. Each message is transmitted along the geometric minimum spanning tree that connects the source and all the destinations. Then, for each edge in this tree, the scheme routes a message through a random intermediate node, chosen independently of the set of multicast requests. The intermediate node is chosen in the vicinity of the corresponding edge such that congestion is reduced without stretching the routes by more than a constant factor. We first evaluate the scheme analytically, showing that it achieves a theoretically optimal level of congestion. We then evaluate the scheme in simulation, showing that its performance is also good in practice.