Presentation is loading. Please wait.

Presentation is loading. Please wait.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Published byChloe Sharp Modified over 9 years ago

Similar presentations

Presentation on theme: "A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering."— Presentation transcript:

1 A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering IEEE WCNC 2004 Speaker: Hao-Chun Sun

2 Outline Introduction Energy Consumption Model Dynamic Query-tree Energy Balancing Algorithm (DQEB) Simulation Results Conclusion

3 Introduction -background- Sensor network Use Querying to collect information across the whole sensor network. A set of sensors is specifically asked to report information of interest. Query Sink Sensor network

4 Introduction -background- Basic Sensor Network Query Procedure flooding

5 Introduction -background- Sensor network characteristics Limited power Lower processing ability Limited bandwidth Smaller memory

6 Introduction -background- Optimal Sensor Network Query Procedure Broadcast Tree Protocols Minimum energy broadcast tree problem is NP-complete. Many approximate algorithms is proposed.

7 Introduction -motivation- These protocols are useful only for the development of static trees. These protocols are un-weighted protocols whose assumptions are valid only when the nodes are first deployed. Query Broadcast Tree Non-leaf Nodes Leaf Nodes Sink

8 Introduction -motivation- Focus on Developing techniques to improve the querying procedure to minimize energy consumption and maximize the sensor network lifetime. Distributed the broadcast load evenly on nodes so that the energy distribution is balanced. DQEB update the query tree structure to avoid uneven energy depletion.

9 Energy Consumption Model Sensor network query tree Sink Non-leaf nodes Leaf nodes Query Broadcast Tree Non-leaf Nodes (Receive, Forward) Non-leaf Nodes (Receive, Forward) Leaf Nodes (Receive) Leaf Nodes (Receive) Sink

10 Energy Consumption Model -weight- Every node is associated with a weight. ω : [0, 1], nodes weight is initialized to 0., β is the power attenuation factor and determines the rate at which depleting power affects the weight of a node. P is its remaining battery lifetime. Desire to increase the weight faster as the remaining battery becomes lower.

11 Energy Consumption Model -energy cost- The energy cost of broadcast depends on the number of leaf and non-leaf nodes in query tree as well as the amount of remaining batter power at a node., Tx power= λ× Rx power (γ)  Minimum

12 Dynamic Query-tree Energy Balancing Algorithm (DQEB) Assumptions A cluster structure Only involves the cluster heads Nodes have uniform hardware, software and battery capacity. Nodes are energy-aware. A query tree is assumed to exist with the sink node as the root and all nodes in the network being either leaf or non-leaf nodes of the tree.

13 Dynamic Query-tree Energy Balancing Algorithm (DQEB) Overview UC triggers DQEB algorithm. Neighborhood Information Synchronization (NIS) algorithm Designated parents (DP) selection from alternative parents (AP) 9(0.1) 1(0.1) 7(0.3) 8(0.3) 2(0.3) 3(0.5) 4(0.2)6(0.4) 5(0.6) Update Coordinator (UC)

14 Dynamic Query-tree Energy Balancing Algorithm (DQEB) Neighborhood Information Synchronization Algorithm Neighborhood Information Table (NIT) State information of neighbors  ID, route to root, state,…. Periodic “Hello” message to detect node failure. If a node’s state information changes in the interval between hello messages, the hello message is substituted by the changed information.

15 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) K={ } C={3,4,5,7} A={2,3,4,6,8,9} K={ } C={3,4,5,7} A={2,3,4,6,8,9} (w5/d5)

16 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

17 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

18 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

19 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5) DP={9,8,6,3}

20 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Set-Covering problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5) DP={9,8,6,3}

21 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

22 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5) DP={9,6,3}

23 Dynamic Query-tree Energy Balancing Algorithm (DQEB) Differentiating APs Sibling AP Offspring AP Independent AP i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w8/d8) (w5/d5) Sibling AP Offspring AP Independent AP

24 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) K={ } C={3,4,5,7} A={2,3,4,6,8,9} K={ } C={3,4,5,7} A={2,3,4,6,8,9} (w5/d5) C={3,4,5,6,7} A={2,8,9} C={3,4,5,6,7} A={2,8,9}

25 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) K={ } C={3,4,5,6,7} A={2,8,9} K={ } C={3,4,5,6,7} A={2,8,9} (w5/d5)

26 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

27 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

28 Dynamic Query-tree Energy Balancing Algorithm (DQEB) A Greedy algorithm for parent selection Disconnected Problem i 5 4 3 14 7 6 8 15 1 9 10 11 12 2 13 C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} C={3,4,5,7} A= A1={2,4,9} A2={3,4} A3={6} A4={6,8} (w9/d9) (w2/d2) (w3/d3) (w4/d4) (w6/d6) (w7/d7) (w8/d8) (w5/d5)

29 Dynamic Query-tree Energy Balancing Algorithm (DQEB) Resolving Update Conflicts Two nodes trigger DQEB concurrently. Lock mechanism Once the UC triggers all its children for their APs’ information, all children will freeze themselves. Any UC that does not get a response from some of its children waits for a given time.

30 Simulation Results Network Size: 600 m x 600 m Nodes number: 1000 Nodes positions: Uniformly distributed Network is connected and Query tree has been constructed initially. λ=3 β=3, w=(1-P) β

31 Simulation Results Power Distribution Balance v.s Time

32 Simulation Results Life Time v.s Death Rate threshold

33 Simulation Results Power STD v.s Connectivity

34 Simulation Results Life Time v.s Connectivity

35 Conclusion We proposed an energy aware, distributed protocol to dynamically update query tree structures in sensor network. Decisions are taken at each non-leaf node to locally minimize the cost of the broadcast tree by switching a non-leaf node with low remaining power to a leaf node so that its energy depletion rate is decreased.

Download ppt "A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering."

Similar presentations

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.

CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.

Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.

1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
1 Distributed Adaptive Sampling, Forwarding, and Routing Algorithms for Wireless Visual Sensor Networks Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas.

1 Distributed Adaptive Sampling, Forwarding, and Routing Algorithms for Wireless Visual Sensor Networks Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas.
Network Correlated Data Gathering With Explicit Communication: NP- Completeness and Algorithms R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano,

Network Correlated Data Gathering With Explicit Communication: NP- Completeness and Algorithms R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano,
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:

Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.

Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.

Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
Scalable and Distributed GPS free Positioning for Sensor Networks Rajagopal Iyengar and Biplab Sikdar Department of ECSE, Rensselaer Polytechnic Institute.

Scalable and Distributed GPS free Positioning for Sensor Networks Rajagopal Iyengar and Biplab Sikdar Department of ECSE, Rensselaer Polytechnic Institute.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea

Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol

M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.

07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
Grammati Pantziou 1, Aristides Mpitziopoulos 2, Damianos Gavalas 2, Charalampos Konstantopoulos 3, and Basilis Mamalis 1 1 Department of Informatics, Technological.

Grammati Pantziou 1, Aristides Mpitziopoulos 2, Damianos Gavalas 2, Charalampos Konstantopoulos 3, and Basilis Mamalis 1 1 Department of Informatics, Technological.

Similar presentations

Ads by Google