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 compl...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2011-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74412732/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537796898029568 |
|---|---|
| author | LI Zhi-gang1 CHEN Wei-wei1 XIAO Nong2 XIA Ge-ming2 |
| author_facet | LI Zhi-gang1 CHEN Wei-wei1 XIAO Nong2 XIA Ge-ming2 |
| author_sort | LI Zhi-gang1 |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7947a091725442ec8d8dd64699f042cc |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2011-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-7947a091725442ec8d8dd64699f042cc2025-01-14T08:15:07ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2011-01-0132889574412732Research on weak greedy routing over graph embedding for wireless sensor networksLI Zhi-gang1CHEN Wei-wei1XIAO Nong2XIA Ge-ming2The 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.http://www.joconline.com.cn/zh/article/74412732/sensor networksgreedy routingnetwork embeddingload balancedata storage |
| spellingShingle | LI Zhi-gang1 CHEN Wei-wei1 XIAO Nong2 XIA Ge-ming2 Research on weak greedy routing over graph embedding for wireless sensor networks Tongxin xuebao sensor networks greedy routing network embedding load balance data storage |
| title | Research on weak greedy routing over graph embedding for wireless sensor networks |
| title_full | Research on weak greedy routing over graph embedding for wireless sensor networks |
| title_fullStr | Research on weak greedy routing over graph embedding for wireless sensor networks |
| title_full_unstemmed | Research on weak greedy routing over graph embedding for wireless sensor networks |
| title_short | Research on weak greedy routing over graph embedding for wireless sensor networks |
| title_sort | research on weak greedy routing over graph embedding for wireless sensor networks |
| topic | sensor networks greedy routing network embedding load balance data storage |
| url | http://www.joconline.com.cn/zh/article/74412732/ |
| work_keys_str_mv | AT lizhigang1 researchonweakgreedyroutingovergraphembeddingforwirelesssensornetworks AT chenweiwei1 researchonweakgreedyroutingovergraphembeddingforwirelesssensornetworks AT xiaonong2 researchonweakgreedyroutingovergraphembeddingforwirelesssensornetworks AT xiageming2 researchonweakgreedyroutingovergraphembeddingforwirelesssensornetworks |