Providing interactive video-on-demand streaming over mobile ad hoc networks is still a challenge. Mobile nodes are dynamically and arbitrarily located in such a manner that interconnections between them change on a continual basis, thereby making timely video-delivery strenuous to achieve. To help to tackle this adversity, this paper proposes two BitTorrent-like algorithms. Their design concept lies in the combination of different criteria to wisely (i) select the nodes which may request video file pieces from another node, and (ii) delimit the video file pieces to be requested with the highest priority. Performance evaluation is carried out by means of simulations, which assess different metrics on scenarios encompassing two client-mobility models and two client-interactivity profiles. The final results highlight the efficiency of our proposals compared to other recent literature works. General conclusions and avenues for further research are included at the end of this paper.

在移动自组织网络上提供交互式视频点播流仍然是一个挑战。动态地和任意地定位移动节点，使得它们之间的互连连续变化，从而使得难以及时实现视频传递。为了帮助解决这一逆境，本文提出了两种类似BitTorrent的算法。它们的设计思想在于不同标准的组合，以明智地（i）选择可以从另一个节点请求视频文件片段的节点，以及（ii）以最高优先级定界要请求的视频文件片段。绩效评估是通过模拟进行的，模拟评估了包含两个客户端移动模型和两个客户端交互配置文件的方案的不同指标。最终结果突出了我们的建议与其他近期文献作品相比的效率。本文的最后包括一般结论和进一步研究的途径。