C ONSTRUCTING L OAD -B ALANCED D ATA A GGREGATION T REES IN P ROBABILISTIC W IRELESS S ENSOR N...

CONSTRUCTING LOAD-BALANCED DATA AGGREGATION

TREES IN PROBABILISTIC WIRELESS SENSOR NETWORKS

Jing (Selena) He, Shouling Ji, Yi Pan, Yingshu Li

Department of Computer Science

Georgia State University

OUTLINE

Motivation

Solution Overview

Problem Formulation and Analysis

Performance Evaulation

Conclusion2

3

Motivation• Probabilistic Network Model• Load Balanced Data Aggregation Tree• Challenges

TRANSITIONAL REGION PHENOMENON

Motivation

4

Link Length 0 – 2.6 M 2.6 – 6 M > 6 M

λ > 80% 7 8 0

Total 8 27 15

5

PROBABILISTIC NETWORK MODEL

Motivation

6

LOAD-BALANCED DATA AGGREGATION TREE (LBDAT)

Motivation

7

CHALLENGES

How to measure the traffic load of each node under Probabilistic Network Model (PNM)?

Potential load Actual load

How to find a Load-Balanced Data Aggregation Tree (LBDAT)?

NP-Complete

Motivation

OUTLINE

Motivation

Solution Overview

Problem Formulation and Analysis

Performance Evaluation

Conclusion8

SOLUTION OVERVIEW

9

9Load-Balanced Maximal Independent Set (LBMIS)Connected Maximal Independent Set (CMIS)Load-Balanced Parent Node Assignment (LBPNA)Load-Balanced Data Aggregation Tree (LBDAT)

OUTLINE

Motivation

Solution Overview

Problem Formulation and Analysis

Performance Evaluation

Conclusion10

LOAD-BALANCED MAXIMAL INDEPENDENT SET (LBMIS)

11

11

DS Property Constraint

IS Property Constraint

linearization

Relaxing

(quadratic)

ωi

1 vi is a dominator

0 otherwise

APPROXIMATION ALGORITHM (RANDOM ROUNDING)

12

12

Due to the relaxation enlarged the optimization space, the solution of LP*

LBMIS corresponds to a lower bound to the objective of INPLBMIS .

LOAD-BALANCED MAXIMAL INDEPENDENT SET (LBMIS)

13

CONNECTED MAXIMAL INDEPENDENT SET (CMIS)

14

Relaxing

LOAD-BALANCED PARENT NODE ASSIGNMENT (LBPNA)

15

Each dominatee can be allocated to only one dominator

16

LOAD-BALANCED PARENT NODE ASSIGNMENT (LBPNA)

OUTLINE

Motivation

Solution Overview

Problem Formulation and Analysis

Performance Evaluation

Conclusion17

18

PERFORMANCE EVALUATION

Our method

Other’s Method

LBDAT prolong network lifetime by 42% on average compared with DAT

OUTLINE

Motivation

Solution Overview

Problem Formulation and Analysis

Performance Evaluation

Conclusion19

CONCLUSIONS

LBDAT is NP-Complete, constructed in three steps:Load-Balanced Maximal Independent Set (MDMIS)Connected Maximal Independent Set (CMIS)Load-Balanced Parent Node Allocation (LBPNA)

Approximation algorithms and performance ratio analysis are presented.

20

21

Q & A