CAJ | 학술논문

为解决车联网中时间约束条件下的数据广播问题，将该问题规约为二分图的约束最小顶点覆盖问题。证明该问题是NP-Hard问题，并提出一种启发式的数据广播算法。实验表明，相对于传统的路由算法，该算法充分考虑节点的联系概率及影响力，对于路由的包投递率和平均数据包端到端延时都有较大提升。
위해결차련망중시간약속조건하적수거엄파문제，장해문제규약위이분도적약속최소정점복개문제。증명해문제시NP-Hard문제，병제출일충계발식적수거엄파산법。실험표명，상대우전통적로유산법，해산법충분고필절점적련계개솔급영향력，대우로유적포투체솔화평균수거포단도단연시도유교대제승。
In order to solve the problem of time constrained data broadcast in VANET,the problem is reduced to constrained min-imum vertex cover problem on bipartite graphs,and is proved as NP-Hard problem,thus a heuristic data broadcast algorithm is proposed.Experiments show that compared with traditional routing algorithm,the proposed algorithm takes the contact probabil-ity and influence of nodes into full consideration,and has much improvement to the packet delivery rate and average packet end-to-end delay.