Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks

DOI10.1016/J.JPDC.2007.10.002zbMath1243.68321OpenAlexW2027726219MaRDI QIDQ436764

Bing-Hong Liu, Ming-Jer Tsai, Ping-Chin Huang

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.10.002

zbMATH Keywords

mobile computingmulticastdistributed algorithmnetwork topologybandwidth consumption

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• E-ODMRP: enhanced ODMRP with motion adaptive refresh
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• On the performance and feasibility of multicast core selection heuristics

This page was built for publication: Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks