Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/16497
Title: Maximizing the lifetime of wireless sensor networks through intelligent clustering and data reduction techniques
Authors: Cordina, Mario
Debono, Carl James
Keywords: Wireless sensor networks
Intelligent sensors
Neural networks (Computer science)
Routing protocols (Computer network protocols)
Issue Date: 2009
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Cordina, M., & Debono, C. J. (2009). Maximizing the lifetime of wireless sensor networks through intelligent clustering and data reduction techniques. IEEE Wireless Communications and Networking Conference, Budapest. 1-6.
Abstract: Wireless sensor networks are generally deployed in remote areas where no infrastructure is available. This imposes the use of battery operated devices which seriously limits the lifetime of the network. In this paper we present a cluster-based routing algorithm which is based on Fuzzy-ART neural networks to maximize the life span of such networks. Results show that the energy saving obtained improves the network lifetime by 79.6%, 17.1% and 22.4% (in terms of First Node Dies) when compared to LEACH, a centralised version of LEACH and a self-organizing map (SOM) neural network-based clustering algorithm respectively. Furthermore, this paper explores the use of a base station centric predictive filtering algorithm to reduce the amount of transmitted data leading to a further increase in network lifetime.
URI: https://www.um.edu.mt/library/oar//handle/123456789/16497
Appears in Collections:Scholarly Works - FacICTCCE

Files in This Item:
File Description SizeFormat 
Conference paper - Maximizing the Lifetime of Wireless Sensor Networks through Intelligent Clustering and Data Reduction Techniques.pdf
  Restricted Access
Maximizing the lifetime of wireless sensor networks through intelligent clustering and data reduction techniques506.91 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.