DISTRIBUTED ALGORITHMS FOR CONSTRUCTING APPROXIMATE MINIMUM SPANNING TREES IN WIRELES
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
electronics seminars
Active In SP
**

Posts: 694
Joined: Nov 2009
#1
13-01-2010, 07:46 AM


DISTRIBUTED ALGORITHMS FOR CONSTRUCTING APPROXIMATE MINIMUM SPANNING TREES IN WIRELESS SENSOR NETWORKS --PARALLEL AND DISTRIBUTED SYSTEMS

While there are distributed algorithms for the minimum spanning tree (MST) problem, these algorithms require relatively large number of messages and time, and are fairly involved, making them impractical for resource-constrained networks such as wireless sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local, and energy efficient. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of an approximate MST in wireless networks. Assuming that the nodes are uniformly distributed, we show provable bounds on both the quality of the spanning tree produced and the energy needed to construct them. We show that while NNT produces a close approximation to the MST, it consumes asymptotically less energy than the classical message-optimal distributed MST algorithm due to Gallagery, Humblet, and Spira. Further, the NNTs can be maintained dynamically with polylogarithmic rearrangements under node insertions/deletions. We also perform extensive simulations, which show that the bounds are much better in practice. Our results, to the best of our knowledge, demonstrate the first tradeoff between the quality of approximation and the energy required for building spanning trees on wireless networks, and motivate similar considerations for other important problems.

Technology to use:JAVA
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Kalman Filter-Based Distributed Predictive Control of Large-Scale Multi-Rate pdf study tips 0 377 09-09-2013, 03:32 PM
Last Post: study tips
  Inter Bank Fund Transfer in Distributed Network smart paper boy 1 1,422 01-08-2013, 03:07 PM
Last Post: Guest
  Ensuring Distributed Accountability for Data Sharing in the Cloud report project girl 4 1,977 28-06-2013, 09:47 AM
Last Post: study tips
  Deterministic Memory- Efficient String Matching Algorithms for Intrusion PPT study tips 0 328 18-06-2013, 12:20 PM
Last Post: study tips
  REPORT ON ENSURING DISTRIBUTED ACCOUNTABILITY FOR DATA SHARING IN THE CLOUD project girl 3 1,364 31-05-2013, 01:18 PM
Last Post: Guest
  A MINI PROJECT REPORT ON MINIMUM SPANNING TREE study tips 0 476 01-05-2013, 04:05 PM
Last Post: study tips
  A DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROMING IN NEXT GENERATION MOBILE seminar paper 4 1,726 20-04-2013, 03:20 PM
Last Post: study tips
  distributed cache updating for the dynamic source routing protocol project report tiger 3 2,088 17-04-2013, 10:40 AM
Last Post: Guest
  Minimum Spanning Tree Based Clustering Algorithms pdf study tips 0 437 27-02-2013, 01:52 PM
Last Post: study tips
  Dynamic Resource Allocation in Computing Clouds using Distributed Multiple Criteria study tips 0 391 19-02-2013, 03:28 PM
Last Post: study tips