基于路径网络的无线广播模型最短路径搜索

The Shortest Path Search of Radio Broadcast Model Based on Path Network

针对广播模型采用的传统最短路径计算的不足,本文结合路径网络的特点,提出椭圆边界算法EBA,通过把网络分割成区,将其放在任一分区到另一分区的最小和最大可能距离的信息检索中,并利用相邻辖区算法NRA,解决极端情况下,搜索空间过大和广播周期过长的问题,使其在内存、访问延迟时间和CPU时间的性能优于传统的方法,并通过仿真实验验证其有效性。

Aimed at the shortcomings of traditional shortest path calculation used in broadcasting model, through dividing the network into regions, this paper proposes the Elliptical Boundary Algorithm EBA in the information retrieval of the minimum and maximum possible distance from any region to another region, and uses the next region algorithm NRA to solve the problem of excessive search space and long broadcast cycle in extreme cases. The performance of memory, access delay time and CPU time is better than traditional methods, and its effectiveness is verified by simulation experiments.