Research on weak greedy routing over graph embedding for wireless sensor networks
|更新时间:2024-10-14
|
Research on weak greedy routing over graph embedding for wireless sensor networks
Vol. 32, Issue 12, Pages: 88-95(2011)
作者机构:
1. 解放军理工大学指挥自动化学院
2. 国防科学技术大学计算机学院
作者简介:
基金信息:
DOI:
CLC:TN929.5;TP212.9
Published:2011
稿件说明:
移动端阅览
LI Zhi-gang1, CHEN Wei-wei1, XIAO Nong2, et al. Research on weak greedy routing over graph embedding for wireless sensor networks[J]. 2011, 32(12): 88-95.
DOI:
LI Zhi-gang1, CHEN Wei-wei1, XIAO Nong2, et al. Research on weak greedy routing over graph embedding for wireless sensor networks[J]. 2011, 32(12): 88-95.DOI:
Research on weak greedy routing over graph embedding for wireless sensor networks
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 em-bedding 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 de-signed.The simulation shows two protocols achieve good performance on path stretch factor and load balance factor.