Home // EMERGING 2012, The Fourth International Conference on Emerging Network Intelligence // View article
Authors:
Cosmin Cirstea
Mihail Cernaianu
Aurel Gontean
Keywords: clustering, adaptive separation distance, load distribution, wireless sensor networks
Abstract:
Cluster based wireless sensor networks have the advantage of reduced energy consumption and increased message delivery compared to the situations where no hierarchical communication is used. Cluster heads (CHs) play the important role of performing data gathering and aggregation from surrounding nodes and thus must be efficiently chosen. This paper describes a CH election algorithm for wireless sensor networks (WSNs) based on LEACH that uses adaptive separation distance and load distribution (LEACH-ASDLD) in order to enhance network lifetime and message delivery. The proposed algorithm considers the number of neighbors in the vicinity of each node as well as the expected packet size to be transmitted in electing the appropriate CH, thus distributing network load among key sensors within the network rather than evenly distributing the load among all nodes. Using adaptive separation distance determines the number of CHs per round and ensures their uniform spread over the observation area. In order to determine the importance of using adaptive separation distance combined with load distribution we have performed Matlab simulations and compared our algorithm with a minimum separation distance (MSD) algorithm entitled Improved Minimum Separation Distance (IMSD), an enhancement to MSD. Our simulations show that using the proposed algorithm can extend the lifetime of the network and provide increased message delivery by up to 15% depending on the simulated network and packet sizes.
Pages: 37 to 42
Copyright: Copyright (c) IARIA, 2012
Publication date: September 23, 2012
Published in: conference
ISSN: 2326-9383
ISBN: 978-1-61208-239-4
Location: Barcelona, Spain
Dates: from September 23, 2012 to September 28, 2012