on tree based convergecasting in wireless sensor networks n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
On Tree-Based Convergecasting in Wireless Sensor Networks PowerPoint Presentation
Download Presentation
On Tree-Based Convergecasting in Wireless Sensor Networks

Loading in 2 Seconds...

play fullscreen
1 / 21

On Tree-Based Convergecasting in Wireless Sensor Networks - PowerPoint PPT Presentation


  • 88 Views
  • Uploaded on

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

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'On Tree-Based Convergecasting in Wireless Sensor Networks' - palmer-hale


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
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
Outline
  • Introduction
  • System Model And Problem Description
  • Covergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA)
  • Simulations
  • Conclusions
introduction
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
introduction1
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
introduction2
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
introduction3
Introduction
  • Goals
    • Constructingan efficient tree for both broadcasting as well as convergecasting
    • Allocating wireless communication channels to ensurecollision-free communication
system model and problem description1
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
system model and problem description2
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)}
system model and problem description3
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
conclusions
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