Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models
From MaRDI portal
Publication:5481720
Recommendations
Cites work
- A fast algorithm for Steiner trees
- An 11/6-approximation algorithm for the network Steiner problem
- Approximations for Steiner trees with minimum number of Steiner points
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- Routing to Multiple Destinations in Computer Networks
- The complexity of designing a network with minimum diameter
Cited in
(6)- Epidemic-based reliable and adaptive multicast for mobile ad hoc networks
- Scalable multicasting: The core-assisted mesh protocol
- A novel scheme for supporting integrated unicast and multicast traffic in ad hoc wireless networks
- scientific article; zbMATH DE number 2088406 (Why is no real title available?)
- E-ODMRP: enhanced ODMRP with motion adaptive refresh
- Link stability based multicast routing scheme in MANET
This page was built for publication: Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481720)