Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
From MaRDI portal
Publication:436764
DOI10.1016/J.JPDC.2007.10.002zbMATH Open1243.68321OpenAlexW2027726219MaRDI QIDQ436764FDOQ436764
Authors: Bing-Hong Liu, Ping-Chin Huang, Ming-Jer Tsai
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
Recommendations
Cites Work
- Title not available (Why is that?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- E-ODMRP: enhanced ODMRP with motion adaptive refresh
- On the performance and feasibility of multicast core selection heuristics
Cited In (4)
This page was built for publication: Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436764)