首页 | 本学科首页   官方微博 | 高级检索  
   检索      

一种用于GAF协议的优化邻居表算法
引用本文:谈昨非,刘兴长,丁勇,胡峻浩.一种用于GAF协议的优化邻居表算法[J].后勤工程学院学报,2013(6):91-96.
作者姓名:谈昨非  刘兴长  丁勇  胡峻浩
作者单位:[1]后勤工程学院后勤信息与军事物流工程系,重庆401311 [2]后勤工程学院.管理科学与工程系,重庆401311
摘    要:GAF协议是一种基于地理信息的无线传感器网络路由协议,由于采用多跳传输,将导致热区的产生。提出了一种优化邻居表算法,可以有效辨识GAF虚拟网格内的节点密度,从而选择密度大的网格通行,以均衡热区能耗,延长网络寿命。仿真结果验证了该算法的可行性。

关 键 词:GAF协议  邻居表  节点密度  热区  Dijkstra算法

An Optimized Neighbour Algorithm Used in GAF Protocol
Tan Zuo-fei,Liu Xing-chang,Ding Yong,Hu Jun-hao.An Optimized Neighbour Algorithm Used in GAF Protocol[J].Journal of Logistical Engineering University,2013(6):91-96.
Authors:Tan Zuo-fei  Liu Xing-chang  Ding Yong  Hu Jun-hao
Institution:(a. Dept. of Logistics Information & Logistics Engineering, b. Dept. of Management Science & Engineering, LEU, Chongqing 401311, China)
Abstract:GAF protocol is a routing algorithm of wireless sensor networks which is based on geographic information. Multi hop communication of wireless sensor networks gives rise to hot spot. In this paper, an optimized neighbour algorithm is proposed. This algorithm could distinguish the density of virtual cell, so as to choose the cell with higher density. It can balance the load of nodes in hot spot and lengthen the life time of networks. Simulation results validate the feasibility of the algorithm.
Keywords:GAF protocol  neighbour  density of nodes  hot spot  algorithm of Dijkstra
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号