DocumentCode
616532
Title
An overlapping clustering approach for routing in Wireless Sensor Networks
Author
Can Ma ; Lei Wang ; Jiaqi Xu ; Zhenquan Qin ; Lei Shu ; Di Wu
Author_Institution
School of Software, Dalian University of Technology, China
fYear
2013
fDate
7-10 April 2013
Firstpage
4375
Lastpage
4380
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 and consequently a longer network lifetime.
Keywords
Clustering algorithms; Educational institutions; Energy consumption; Network topology; Routing; Wireless communication; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference (WCNC), 2013 IEEE
Conference_Location
Shanghai, Shanghai, China
ISSN
1525-3511
Print_ISBN
978-1-4673-5938-2
Electronic_ISBN
1525-3511
Type
conf
DOI
10.1109/WCNC.2013.6555282
Filename
6555282
Link To Document