1 / 21

On Tree-Based Convergecasting in Wireless Sensor Networks

On Tree-Based Convergecasting in Wireless Sensor Networks. V. Annamalai, S. K. S. Gupta, L. Schwiebert IEEE 2003 Speaker : Chi-Chih Wu. Outline. Introduction System Model And Problem Description Covergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA) Simulations

palmer-hale
Download Presentation

On Tree-Based Convergecasting in Wireless Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. On Tree-Based Convergecasting in Wireless Sensor Networks V. Annamalai, S. K. S. Gupta, L. Schwiebert IEEE 2003 Speaker : Chi-Chih Wu

  2. Outline • Introduction • System Model And Problem Description • Covergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA) • Simulations • Conclusions

  3. Introduction • Broadcast • The process of information dissemination from a node to all other node • Convergecast • the aggregation of data collected at each node towards a central node

  4. Introduction • An example of this communication pattern • Environment monitoring application • Collisions • multiple nodes simultaneously transmit to the same node over the same channel • a receiver is in the transmission range of another communication taking place over the same channel

  5. Introduction • Chalermek Intanagonwiwat et al. , “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks” • This paradigm can be used for both broadcasting and for convergecasting at the network layer • Reliability is achieved by using a contention based MAC layer • Contention • Resource wastage • Increase latency

  6. Introduction • Goals • Constructingan efficient tree for both broadcasting as well as convergecasting • Allocating wireless communication channels to ensurecollision-free communication

  7. System Model And Problem Description

  8. System Model And Problem Description • The problem of determining optimal channel allocation is NP-hard • Base station has complete information about the location of the nodes • All nodes have equal transmission range

  9. System Model And Problem Description • Constraints • If the children of one group are in the transmission range of another group’s parent then the two groups’ children must have different PCC(i) for communicating with their parent if available or they should use different set of {PCS(i)}

  10. System Model And Problem Description • Constraints • If dist(nodes1,B) < dist(node2,B) then PCS(node1) >PCS(node2) else PCS(node1) < PCS(node2) • No two children of a group share the same slot for communication with their parent • Children for each node are selected based on proximity criterion

  11. Covergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA)

  12. Covergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA)

  13. Simulations

  14. Simulations

  15. Simulations

  16. Simulations

  17. Simulations

  18. Simulations

  19. Simulations

  20. Conclusions • We have proposed an algorithm that constructs a tree and assigns schedule for convergecasting • Our algorithm constructs the tree such that it reduces the total time taken for convergecasting and this will be useful in reducing the wastage of power

  21. THANK YOU

More Related