Genetic Algorithm for Clustering in Wireless Adhoc Sensor Networks

Authors:
Rajeev Sachdev;Kendall E. Nygard
Affiliations:
North Dakota State University, Fargo, USA 58102;North Dakota State University, Fargo, USA 58102
Venue:
GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
Year:
2009

Citing 4
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)
Exact and approximation algorithms for clustering

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

Sensor networks pose a number of challenging conceptual and optimization problems. A fundamental problem in sensor networks is the clustering of the nodes into groups served by a high powered relay head, then forming a backbone among the relay heads for data transfer to the base station. We address this problem with a genetic algorithm (GA) as a search technique.