DocumentCode :
584766
Title :
Design of MAP-REDUCE and K-MEANS based network clustering protocol for sensor networks
Author :
Patole, J.R. ; Abraham, Jibi
Author_Institution :
Dept. of Comput. & IT, Eng., Coll. of Eng., Pune, Pune, India
fYear :
2012
fDate :
26-28 July 2012
Firstpage :
1
Lastpage :
5
Abstract :
A Wireless Sensor Network (WSN) consists of a large number of small sensors with limited battery power. Prolonged network lifetime, scalability, node mobility and load balancing are important requirements for many WSN applications. Clustering the sensor nodes is an effective technique to achieve these goals. The different clustering algorithms also differ in their objectives. This paper proposes a new method to achieve these goals and the proposed method depends on MAP-REDUCE programming model and K-MEANS clustering algorithm.
Keywords :
protocols; resource allocation; wireless sensor networks; workstation clusters; WSN; k-means clustering algorithm; limited battery power; load balancing; map-reduce programming model; network clustering protocol; network lifetime; network scalability; node mobility; sensor node clustering; wireless sensor network; Abstracts; Clustering algorithms; Communication system security; Programming; Protocols; Wireless communication; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing Communication & Networking Technologies (ICCCNT), 2012 Third International Conference on
Conference_Location :
Coimbatore
Type :
conf
DOI :
10.1109/ICCCNT.2012.6395888
Filename :
6395888
Link To Document :
بازگشت