Sang Hak Lee , Tae Choong Chung

The KIPS Transactions:PartC, Vol. 11, No. 7, pp. 923-930, Dec. 2004
10.3745/KIPSTC.2004.11.7.923,   PDF Download:

Abstract

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating existing wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper, we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more energy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

Statistics
Cite this article