Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models

DOI10.1080/17445760600568048zbMath1098.68012OpenAlexW2083892570MaRDI QIDQ5481720

Antonio F. G. Skarmeta, Pedro M. Ruiz

Publication date: 10 August 2006

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760600568048

zbMATH Keywords

Steiner treemobility awaremulticast ad hoc routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Cites Work

• Unnamed Item
• A fast algorithm for Steiner trees
• An 11/6-approximation algorithm for the network Steiner problem
• The complexity of designing a network with minimum diameter
• Routing to Multiple Destinations in Computer Networks
• Approximations for Steiner trees with minimum number of Steiner points

This page was built for publication: Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models