摘要: 分析传统位置管理方案和地理信息路由协议的局限,提出一种K跳分簇位置管理方案,实现了无线节点完整位置信息的维护。基于从该位置管理方案获取的全网拓扑信息,采用启发式搜索算法实现最优地理路由。仿真结果表明,基于分簇位置管理的最优地理路由在移动Ad hoc网络中具有较好的网络性能和较高的可靠性。
关键词:
贪心路由,
分簇位置管理,
簇首选举,
最优地理路由
Abstract: This paper analyzes the limitations of traditional location management scheme and geo-routing, provides a novel location management scheme on K-hops clustering which maintains the whole location information of wireless nodes. Based on the whole network topology information obtained by the K-hops clustering location management scheme, it adopts a heuristic search algorithm to realize optimal geo-routing. Simulation result indicates that the optimal geo-routing based on clustering location management can gain better performance and higher availability on mobile Ad hoc networks.
Key words:
greedy routing,
clustering location management,
cluster-head election,
optimal geo-routing
中图分类号:
杜秀娟;金志刚. 基于分簇位置管理的最优地理路由[J]. 计算机工程, 2009, 35(24): 121-123.
DU Xiu-juan; JIN Zhi-gang. Optimal Geo-routing Based on Clustering Location Management[J]. Computer Engineering, 2009, 35(24): 121-123.