An Overlapping Clustering Approach for Routing in Wireless Sensor Networks

Zhenquan Qin, Can Ma, Lei Wang, Jiaqi Xu and Bingxian Lu

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 3, 867385

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/867385 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:3:p:867385

DOI: 10.1155/2013/867385

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().