2nd National Conference on Computing, Communication and Sensor Network |
Foundation of Computer Science USA |
CCSN - Number 4 |
None 2011 |
Authors: Prakashgoud Patil, Umakant Kulkarni, N. H. Ayachit |
bac4a607-c66a-4371-b06f-32fda95ab85e |
Prakashgoud Patil, Umakant Kulkarni, N. H. Ayachit . Some Issues in Clustering Algorithms for Wireless Sensor Networks. 2nd National Conference on Computing, Communication and Sensor Network. CCSN, 4 (None 2011), 18-23.
Wireless Sensor Networks (WSNs) present new generation of real time embedded systems with limited computation, energy and memory resources that are being used in wide variety of applications where traditional networking infrastructure is practically infeasible. In recent years many approaches and techniques have been proposed for optimization of energy usage in Wireless Sensor Networks. In order to gather information more efficiently, wireless sensor networks are partitioned into clusters. However, these methods are not without problems. The most of the proposed clustering algorithms do not consider the location of the base station. This situation causes hot spots problem in multi-hop wireless sensor networks. Unequal clustering mechanisms, which are designed by considering the base station location, to some extent solve this problem. In this paper, we present issues related to these approaches.