An Overlapping Clustering Approach for Routing in Wireless Sensor Networks
The design and analysis of routing algorithm is an important issue in wireless sensor networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k -connected overlapping clustering approach with energy awaren...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-03-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/867385 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The design and analysis of routing algorithm is an important issue in wireless sensor networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k -connected overlapping clustering approach with energy awareness, namely, k -OCHE, for routing in WSNs. The basic idea of this approach is to select a cluster head by energy availability (EA) status. The k -OCHE scheme adopts a sleep scheduling strategy of CKN, where neighbors will remain awake to keep it k connected, so that it can balance energy distributions well. Compared with traditional routing algorithms, the proposed k -OCHE approach obtains a balanced load distribution, consequently a longer network lifetime, and a quicker routing recovery time. |
|---|---|
| ISSN: | 1550-1477 |