22
Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks Sajjad Rostami Azad University of Qazvin Thursday, May 28, 2015 ws processed and recommended for publication to the Editor-in-Chief by Associate Editor Dr. Srinivasa Autors: K. Suganthi(a), B. Vinayagasundaram(b) , J. Aarthi(a) a:Department of Computer Technology, Anna University, Chennai 600044, India b:Department of Information Technology, Anna University, Chennai 600044, India

Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

Embed Size (px)

Citation preview

Page 1: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

Randomized fault-tolerant virtual backbone tree to improve the

lifetime of Wireless Sensor Networks

Sajjad RostamiAzad University of Qazvin

Thursday, May 28, 2015

Reviews processed and recommended for publication to the Editor-in-Chief by Associate Editor Dr. Srinivasan Rajavelu.

Autors: K. Suganthi(a), B. Vinayagasundaram(b) , J. Aarthi(a)a:Department of Computer Technology, Anna University, Chennai 600044, Indiab:Department of Information Technology, Anna University, Chennai 600044, India

Page 2: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Today’s Topics Introduction to wireless sensor networks (WSN) Network lifetime

Virtual backbones

Issues and challenges

Proposed FTVBT model Randomized FTVBT

Conclusion

Page 3: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

What’s the WSN? deployed in a region that needs to be monitored Large numbers of sensors

low power low cost memory/computationally-constrained

Scope of energy consumption by WSNs Communication Sensing computation

Page 4: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Network lifetime & Virtual backbone network lifetime has been defined in various

ways: mean expiration time specific fraction of nodes remains first loss of reporting

Virtual backbone algorithms: Energy-aware Virtual Backbone Tree (EVBT) Multihop cluster-based stable backbone tree Virtual backbone Tree Algorithm for Minimal energy

consumption (ViTAMin).

Page 5: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Energy-efficient routing algorithms cluster

Use a hop limit-based model where the sink is within the hop limit of a cluster member that transfers the data directly to the sink node

virtual backbone-based routing provide an infrastructure for efficient communication

with the sink node All of the communication between a particular sensor

node and the sink node occurs via the tree nodes

Page 6: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Backbone Construction algorithms EVBT

the sink node transmits a broadcast request (BCR) packet to all of the nodes in its sensing range

m-EVBT ViTAMin finds the shortest path to the sink for each tree

node by adding a distance parameter to track the existing BCR packet

Page 7: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Strategies used to select the tree nodes

Page 8: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Strategies used to select the tree nodes Modified EVBT (m-EVBT)

Reduces the total energy consumption by utilizing the distance between nodes and energy

Like EVBT, the energy consumption information is

passed via an EVBT construction request (ECR) packet

Only nodes with energy greater than the threshold are considered for selection as tree nodes

Distributed Breadth First Search are run

Page 9: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Issues and challenges

Page 10: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model

Page 11: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model(Backbone construction)

Page 12: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model(Finding a suitable parent for child tree nodes)

Page 13: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model(Finding a parent of associated non-tree nodes)

Page 14: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model(Backbone reconstruction)

Page 15: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT model(Backbone Reconstruction (continued))

Page 16: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Randomized FTVBT

FTVBT selects tree nodes deterministically based

on a fitness factor.

Instead of always selecting the tree with the

highest fitness factor, it is possible to select all of

the tree nodes as parents based on their fitness

factor.

Page 17: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT maintains the N-N lifetime Let path(n) be the path from the sink to a node n

For all nodes ‘n’ the path is identified through the tree nodes

When the nodes are far apart, it might not be possible to cover it using a single virtual backbone

when the number of dependents is greater than the average number of reachable local tree nodes, the number of dependents is reduced

Ideally, this value should be twice the average number of dependents in nearby tree nodes

Page 18: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

FTVBT maintains the N-N lifetime some of the non-tree nodes are converted into

tree nodes when it is necessary to cover all the nodes

According to the N-of-N lifetime concept, if there are few nodes left in the deployed area, backbones must be formed that comprise part of the network

Until the number of alive nodes becomes zero, the sink collects data and maintains the NN lifetime

Page 19: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Simulation

Page 20: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Simulation

Page 21: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Conclusion FTVBT method identifies hotspots and distributes

the dependents across tree nodes, thereby: Increasing the durability of the virtual backbone Increasing the overall network lifetime of WSNs

Page 22: Randomized fault-tolerant virtual backbone tree to improve the lifetime of Wireless Sensor Networks

iSchool

Thanks for Attention