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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2013-03-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/867385 |
| _version_ | 1797710913102413824 |
|---|---|
| author | Zhenquan Qin Can Ma Lei Wang Jiaqi Xu Bingxian Lu |
| author_facet | Zhenquan Qin Can Ma Lei Wang Jiaqi Xu Bingxian Lu |
| author_sort | Zhenquan Qin |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T06:59:11Z |
| format | Article |
| id | doaj.art-8bc8de0fd8634f27a478b0dce14da5c4 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T06:59:11Z |
| publishDate | 2013-03-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-8bc8de0fd8634f27a478b0dce14da5c42023-09-02T23:50:46ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772013-03-01910.1155/2013/867385An Overlapping Clustering Approach for Routing in Wireless Sensor NetworksZhenquan QinCan MaLei WangJiaqi XuBingxian LuThe 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.https://doi.org/10.1155/2013/867385 |
| spellingShingle | Zhenquan Qin Can Ma Lei Wang Jiaqi Xu Bingxian Lu An Overlapping Clustering Approach for Routing in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | An Overlapping Clustering Approach for Routing in Wireless Sensor Networks |
| title_full | An Overlapping Clustering Approach for Routing in Wireless Sensor Networks |
| title_fullStr | An Overlapping Clustering Approach for Routing in Wireless Sensor Networks |
| title_full_unstemmed | An Overlapping Clustering Approach for Routing in Wireless Sensor Networks |
| title_short | An Overlapping Clustering Approach for Routing in Wireless Sensor Networks |
| title_sort | overlapping clustering approach for routing in wireless sensor networks |
| url | https://doi.org/10.1155/2013/867385 |
| work_keys_str_mv | AT zhenquanqin anoverlappingclusteringapproachforroutinginwirelesssensornetworks AT canma anoverlappingclusteringapproachforroutinginwirelesssensornetworks AT leiwang anoverlappingclusteringapproachforroutinginwirelesssensornetworks AT jiaqixu anoverlappingclusteringapproachforroutinginwirelesssensornetworks AT bingxianlu anoverlappingclusteringapproachforroutinginwirelesssensornetworks AT zhenquanqin overlappingclusteringapproachforroutinginwirelesssensornetworks AT canma overlappingclusteringapproachforroutinginwirelesssensornetworks AT leiwang overlappingclusteringapproachforroutinginwirelesssensornetworks AT jiaqixu overlappingclusteringapproachforroutinginwirelesssensornetworks AT bingxianlu overlappingclusteringapproachforroutinginwirelesssensornetworks |