Ad hoc网络的移动性、高度动态拓扑使得实时多媒体传输受到严重影响,为了解决多媒体通信中的传输不稳定和丢包问题,应用Markov过程提出了基于概率度的分簇算法(PD)。该算法首先在当前时刻预测下一时刻任意两点间链路的连通性,然后选取...Ad hoc网络的移动性、高度动态拓扑使得实时多媒体传输受到严重影响,为了解决多媒体通信中的传输不稳定和丢包问题,应用Markov过程提出了基于概率度的分簇算法(PD)。该算法首先在当前时刻预测下一时刻任意两点间链路的连通性,然后选取链路的连通概率较高的节点作为簇头。仿真结果表明,PD算法成簇数目少于最高连通度算法(HD),而且簇内节点无重叠,从而有效降低了分簇结构的维护开销。由于簇成员数量并不明显多于HD,因此说明PD算法效率较高,而且没因分簇数目减少给簇首增加负担。最后在此分簇基础上,结合UDP协议,给出了一种基于概率度分簇的ad hoc网络实时多媒体通信方案,不仅使得传输稳定,而且解决了数据包失序和丢包问题。展开更多
The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The ...The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.展开更多
文摘The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.
