论文部分内容阅读
在大规模移动自组织网中,利用节点位置信息辅助建立路由被认为是一种有效提高无线网络路由可扩展性的方法.提出了一种可扩展与高效的、适用于移动自组织网络的路由算法——分簇覆盖的节点位置信息辅助路由算法(CLAR).CLAR使用如最小簇改变(LCC)算法,建立并保持的单跳分簇结构为拓扑.已有文献证明,LCC是更新成本最小的保持簇头节点密度均一的分簇算法.CLAR利用网络节点的位置信息提高无线网络路由的网络层性能,由目标节点的位置信息预测并构造一个较小的、形状为等腰三角形、矩形或圆形的区域.该区域需保证覆盖目标节点可能存在的位置,且根据源节点与目标节点间的相对位置决定该区域适宜的形状,从而限制源节点在一个较小的“请求域”内寻找可用路由,而不是在网络内盲目寻找.仿真实验结果表明,与其他路由算法相比较,CLAR路由算法在路由建立所需时长、路由代价、平均时延及数据包冲突等参数上表现优良.同时,算法保持了低平均时延、高数据包到达率、低控制开销及低路由寻找次数等优势.
In large-scale mobile ad hoc networks, the use of node location information to assist in the establishment of routing is considered as an effective way to improve the scalability of wireless network routing.Expanding a scalable and efficient routing for mobile ad hoc networks Algorithm - Clustered Covered Node Location Information Aided Routing Algorithm (CLAR) .CLAR uses a topology of one-hop clustering structures established and maintained using, for example, the LCC algorithm. It has been documented that LCC is the least costly update Clustering algorithm to keep the density of cluster head nodes uniform.CLAR uses the location information of network nodes to improve the network layer performance of wireless network routing and predicts and constructs a smaller network with isosceles triangle, This area is guaranteed to cover the possible location of the target node, and the appropriate shape of the area is determined according to the relative position of the source node and the target node, so as to limit the source node in a smaller “request domain” Instead of searching blindly in the network.The simulation results show that compared with other routing algorithms, CLAR routing algorithm in the routing When the desired length, excellent performance on the cost of routing parameters, average latency and packet conflicts. At the same time, the algorithm maintains the low average latency, high packet arrival rate, low control and low cost route to find the number of other advantages.