Performance Analysis of Lifetime Maximizing Trees for Data Aggregation in Wireless Sensor Networks

Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 1

Abstract

In this paper the performance of the proposed DLMT and CLMT algorithms are compared. These proposed algorithms tend to extend the node lifetime. Decentralized lifetime maximizing tree(DLMT) features in nodes with higher energy to be chosen as data aggregating parents while Centralized Lifetime Maximizing Tree(CLMT) features with the dentification of the bottleneck node to collect data in a central manner among given set of nodes. Simulation results show that the functional lifetime is enhanced by 147% when data is aggregated via DLMT and by 139% when data is aggregated via CLMT. Proposed DLMT algorithm has shown 13% additional lifetime saving without increasing the delay. Packet delivery ratio show remarkable increase when the tree depth is considered in these tree structures.

Authors and Affiliations

Deepali Virmani , , Satbir Jain

Keywords

Related Articles

Extracting Noun Phrases in Subject and Object Roles for Exploring Text Semantics

In tune with the recent developments in the automatic retrieval of text emantics, this paper is an attempt to extract one of the most fundamental semantic units from natural language text. The context is intuitively ext...

QoS- unbroken traffic lane streaming in Road network

At present situation travel becomes the biggest hassle for everyone. In this proposed research paper I have used GPS system to find out the shortest path to make your travel at ease. Through this navigation process it is...

Partial fingerprint matching based on SIFT Features

Fingerprints are being extensively used for person identification in a number of commercial, civil, and forensic applications. The current Fingerprint matching technology is quite mature for matching full prints, matchin...

Context Ontology Construction For Cricket Video

Content based video retrieval systems are not complete in semantic sense. To improve the efficiency and the effectiveness of the retrieval system the content based retrieval systems must be equipped with the semantic bas...

Improved FCM algorithm for Clustering the IRIS data

In this paper we present clustering method is very sensitive to the initial center values, requirements on the data set too high, and cannot handle noisy data the proposal method is using information entropy to initializ...

Download PDF file
  • EP ID EP97298
  • DOI -
  • Views 139
  • Downloads 0

How To Cite

Deepali Virmani, , Satbir Jain (2011). Performance Analysis of Lifetime Maximizing Trees for Data Aggregation in Wireless Sensor Networks. International Journal on Computer Science and Engineering, 3(1), 276-285. https://europub.co.uk./articles/-A-97298