Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 8 figures

Scientific paper

A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-106723

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.