Optimal Routing Between Clusters Based on Circular Search Method in WSN
In order to solve the problem of the nodes' energy consumption balance caused by single hop routing algorithm in LEACH protocol. By calculation and analysis of the optimal number of hops of inter cluster multi-hops, the cluster head node got an ideal path to the base station. A ring search meth...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2015-02-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015026/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to solve the problem of the nodes' energy consumption balance caused by single hop routing algorithm in LEACH protocol. By calculation and analysis of the optimal number of hops of inter cluster multi-hops, the cluster head node got an ideal path to the base station. A ring search method was proposed to find the optimal path close to the ideal path. Then, a multi-hops routing algorithm from the cluster head to the base station was obtained. The experimental results show that the performance of the multi-hops routing algorithm from the cluster head to the base station compared with LEACH protocol is higher in the balance of nodes' energy consumption and prolong the network lifetime. |
|---|---|
| ISSN: | 1000-0801 |