GEAR协议中贪婪算法及查询消息传播优化方法  

Optimized Method of Greedy Algorithm and Transmission of Query Message in GEAR Protocol

作　　者：唐冰清[1] 张玲华[1] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《计算机技术与发展》2013年第1期135-138,146,共5页Computer Technology and Development

基　　金：江苏省"青蓝工程"科技创新团队资助课题;江苏省高校优势学科建设工程资助项目(PAPD)

摘　　要：基于GEAR路由协议的路由空洞问题和域内传播能耗问题,提出了一种优化方法。依据该方法,在节点邻居列表中增加sum域用来记录比本节点估计代价小的邻居节点数,若某节点所有小于其估计代价的邻居节点的sum域值均为零,该节点将被纳入查询消息的黑名单域中,在查询消息传送到事件区域代表节点的过程中,sum域值不为零、未被纳入黑名单的代价最小的邻居节点将被选中为下一跳节点,查询消息在事件区域中传播时,事件区域内的节点寻找估计代价最小的邻居节点作为自己的唯一母节点,母节点会将其记录为自身子节点,当前节点的所有子节点将被选中为路径的下一跳节点。实验证明,该方法有助于躲避一跳内空洞节点,并减少了事件区域内传送查询消息的能耗。Based on the routing void problem and transmission energy consumption problem of GEAR routing protocol, an optimized method is proposed By the method, nodes added sum value in their neighbor list to note the number of neighbor nodes whose estimation cost is lower than current estimation cost. If sum value of all neighbor nodes whose cost is less than node＇s estimation cost are zero, the node will be added in blacklist. During the course of transmitting of query message to delegate node of event region,the node which has lowest estimate value, not belongs to blacklist and the sum region of is not zero will be selected as next hop node. When query message transmitted in the event region ,all nodes in event region find the lowest cost value neighbor node in event area as their only parent node which at the same time records it as self-child node, all child nodes will be selected as the next hop node. Experiments show that this method helps to avoid one-hop-hole nodes,and saves transmission energy consumption in event region.

关 键 词：GEAR 路由空洞 洪泛传播 母节点 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]