一种基于二分图匹配模型的多播寻呼机制

发布时间：2018-04-25 17:58

本文选题：多播寻呼 + 二分图匹配　；参考：《系统仿真学报》2013年05期

【摘要】：针对多播业务中,无线网络如何在带宽和时延受限的情况下,实现对于多个处于空闲状态的移动用户的跟踪定位问题,提出了一种有效的基于二分图匹配模型的多播寻呼机制。其主要思想是:首先通过利用信息论中熵的概念对移动用户的位置不确定性进行分析,为了减少位置更新开销,采用LZ78压缩算法实现位置更新和位置概率预测。然后多播寻呼系统为减少寻呼开销和时延,在每个寻呼周期内为所有移动用户分配的寻呼小区驻留概率之和最大,且满足带宽限制和用户公平性。针对该目标,基于二分图匹配的多播寻呼算法BMPS构建二分图模型,将位置概率转化为权值,通过动态修改权值,获取二分图最大权完美匹配,实现用户与寻呼小区之间的最优分配方案。仿真实验结果表明,基于二分图匹配的多播寻呼算法能够有效实现寻呼开销和时延的总体性能优化,且减少了用户冲突对寻呼性能影响。
[Abstract]:In order to solve the problem of how to track and locate multiple mobile users in idle state under the condition of limited bandwidth and delay, an effective multicast pager system based on bipartite graph matching model is proposed in this paper. The main idea is as follows: firstly, by using the concept of entropy in information theory, the location uncertainty of mobile users is analyzed. In order to reduce the cost of location updating, LZ78 compression algorithm is used to realize location updating and location probability prediction. Then in order to reduce the paging overhead and delay, the multicast paging system assigns to all mobile users the maximum sum of the resident probability of the paging cell in each paging period, and satisfies the bandwidth limitation and user fairness. Aiming at this target, a bipartite graph model is constructed based on BMPS, which is based on bipartite graph matching. The position probability is transformed into weight value, and the maximum weight perfect matching is obtained by dynamically modifying the weight value. The optimal allocation scheme between the user and the paging cell is realized. Simulation results show that the multicast paging algorithm based on bipartite graph matching can effectively optimize the overall performance of paging overhead and delay and reduce the impact of user conflicts on paging performance.
【作者单位】：中国科学院研究生院;中国科学院计算技术研究所无线通信技术研究中心;
【基金】：国家自然科学基金-青年科学基金项目(61201231) 重大专项TD-LTE系统(2012ZX03003005-00)
【分类号】：TP393.02

【共引文献】