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!
|