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

Abstract

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.