Clustering Protocol for Sensor Networks

Authors:
Arjan Durresi;Vamsi Paruchuri;Leonard Barolli
Affiliations:
Louisiana State University, USA;Louisiana State University, USA;Fukuoka Institute of Technology, Japan
Venue:
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Year:
2006

Citing 0
Cited 2

Energy-efficient mobile data collection in wireless sensor networks with delay reduction using wireless communication

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
On reducing delay in mobile data collection based wireless sensor networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach which is based on The Covering Problem that aims at covering an area with minimum possible circular disks assuming ideal conditions. CP is a lightweight protocol that does not require any neighborhood information and imposes lesser communication overhead. We present simulation results to show the efficiency of CP in both ideal cases and randomly distributed networks. Moreover, CP is scalable with respect to density and network size.t.