无线传感器网络中基于网络嵌入的弱贪婪路由协议  

Research on weak greedy routing over graph embedding for wireless sensor networks

作　　者：李志刚[1] 陈卫卫[1] 肖侬[2] 夏戈明[2] 

机构地区：[1]解放军理工大学指挥自动化学院,江苏南京210007 [2]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《通信学报》2011年第12期88-95,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(61070201);江苏省自然科学基金资助项目(BK2011119)~~

摘　　要：贪婪路由可以划分为强贪婪和弱贪婪2种路由方式。为了解决目前研究工作中弱贪婪路由协议需要地理位置信息,而强贪婪路由协议需要设计满足贪婪属性的网络嵌入图的问题;同时为了降低操作复杂性,减少能量消耗,提出了一种轻量级的基于树的网络嵌入图(TNEG)构建方法。在基于树的网络嵌入图上,设计了具有局部单调性的贪婪函数,并提出了2个路由规则,然后设计了弱贪婪路由协议TGR和基于双树嵌入的路由协议biTGR。模拟实验表明所提路由协议在路径长度和网络负载等性能上具有明显的优势。The greedy routing in sensor networks can be classified into two categories, strong greedy routing and weak greedy routing. The weak greedy routing protocol needs geographic location and strong greedy routing needs greedy embedding network. In order to solve these problems and minimize operation complexity and energy overhead, a light-weight tree-based network embedding graph （TNEG） was proposed and over the TNEG a local monotone function was designed and two routing rules were proposed, then two weak greedy routing protocols, TGR and biTGR were designed. The simulation shows two protocols achieve good performance on path stretch factor and load balance factor.

关 键 词：无线传感器网络 贪婪路由协议 网络嵌入 负载平衡 数据存储 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]