摘要
为解决三维传感器网络中应用地理路由算法引起的路由空洞问题,引入树型网络路由算法,提出一种新的地理路由算法——基于树型网络的贪婪算法(GAT)。根据三维传感器网络拓扑结构信息,GAT生成一个树型网络拓扑,并为每个节点分配ID信息,当基于真实地理位置的贪婪算法遇到路由空洞时,采用树型网络路由算法作为恢复机制,保证了数据分组的可达性。GAT克服了三维空间中贪婪算法的路由空洞问题,可以保证三维传感器网络中任意节点之间数据分组的可达性。仿真实验验证了GAT在三维空间的可行性以及高效的路由性能。
To address the hole problem of geographic routing in 3D sensor networks, a new geographic routing algorithm,named Greedy Algorithm based on Tree-network（ GAT）, was proposed based on tree-network routing algorithm. First, GAT generateed a tree network topology and allocated ID information to each node according to the topology of 3D sensor network.When the greedy algorithm based on the real geographic positions encountered the hole problem, the greedy algorithm based on tree-network routing algorithm helped it recover from the dead end situation, and thus the accessibility of the data packets was ensured. At last, the feasibility and the efficient routing performance of GAT in three-dimensional space were verified by simulations.
出处
《计算机应用》
CSCD
北大核心
2014年第A02期31-33,51,共4页
journal of Computer Applications
