21
On Tree-Based Convergeca sting in Wireless Sensor Networks V. Annamalai, S. K. S. Gupta, L. Schwieb ert IEEE 2003 Speaker : Chi-Chih Wu

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

Embed Size (px)

Citation preview

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 Cha

nnel Allocation Algorithm (CTCCAA) Simulations Conclusions

Introduction

Broadcast The process of information dissemination from a node t

o all other node

Convergecast the aggregation of data collected at each node towards

a central node

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

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 fo

r convergecasting at the network layer Reliability is achieved by using a contention based MAC

layer Contention

Resource wastage Increase latency

Introduction

Goals Constructing an efficient tree for both

broadcasting as well as convergecasting Allocating wireless communication channels to

ensure collision-free communication

System Model And Problem Description

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 Description

Constraints If the children of one group are in the transmission rang

e 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 Description

Constraints If dist(nodes1,B) < dist(node2,B) then PCS(nod

e1) > 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

Covergecasting Tree Construction and Channel Allocation Algorithm (CT

CCAA)

Covergecasting Tree Construction and Channel Allocation Algorithm (CT

CCAA)

Simulations

Simulations

Simulations

Simulations

Simulations

Simulations

Simulations

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

THANK YOU