wsn

Wireless Sensor Networks

Large number of heterogeneous sensor devices

Ad Hoc Network
communication, processing, memory capabilities

Sophisticated sensor devices

WSN

Project Goals
Devise a set communication mechanisms s.t. they
Minimize energy consumption Maximize network nodes lifetimes Distribute energy load evenly throughout a network Are scalable (distributed)

WSN

wsn

Minimum-energy unicast

WSN

Unicast communication model

Link-based model
each link weighed how to chose a weight?

B 1 1 C 1

Power-Aware Metric [Chang00]

Maximize nodes lifetimes include remaining battery energy (Ei)

B

x x 2 c (e r ) 1 E i ij ij 0 Ei
e energy spent in transmi tting ij r energy spent in receiving 0
WSN

cBC

C cCD

cAB

cAE

cED

wsn

Unicast problem description

Definitions

undirected graph G = (N, L) links are weighed by costs the path A-B-C-D is a minimum cost path from node A to node D, which is the onehop neighbour of the sink node minimum costs at node A are total costs aggregated along minimum cost paths

C B A

Minimum cost topology

Minimum Energy Networks [Rodoplu99] optimal spanning tree rooted at one-hop neighbors of the sink node each node considers only its closest neighbors - minimum neighborhood
WSN

Building minimum cost topology

Minimum neighborhood

Finding a minimum neighborhood

notation: N i - minimum neighborhood of node i N P1: minimum number of nodes enough to ensure connectivity P2: no node N i falls into the relay space of any other node nodes maintain a matrix of mutual link costs among neighboring nodes (cost matrix) the cost matrix defines a subgraph H on the network graph G
1 c21 c31 c41 c51 c12 1 c32 c42 c52 c13 c23 1 c43 c53 c14 c24 c34 1 c54 c15 c25 c35 c45 1
WSN

Ni

C A

wsn

Finding minimum neighborhood

We apply shortest path algorithm to find optimal spanning tree rooted at the given node
subgraph H

Theorem 1: The nodes that immediately follow the root node constitute the minimum neighborhood of the root node Theorem 2: The minimum cost routes are contained in the minimum neighborhood Each node considers just its min. neighborhood
WSN

Distributed algorithm
Each node maintains forwarding table

E.g. [originator next hop cost distance]

Phase 1: find minimum neighborhood Phase 2: each node sends its minimum cost to it neighbors upon receiving min. cost update forwarding table

Eventually the minimum cost topology is built

WSN

wsn

An example of data routing

Different routing policies

Properties

different packet priorities nuglets [Butt01] packets flow toward nodes with lower costs
WSN

energy efficiency scalability increased fault-tolerance

10

Minimum-energy broadcast

WSN

wsn

Broadcast communication model

b Eab Eac Ebc

11

Omnidirectional antennas By transmitting at the power level max{Eab,Eac} node a can reach both node b and node c by a single transmission Wireless Multicast Advantage (WMA) [Wieselthier et al.]

Trade-off between the spent energy and the number of newly reached nodes Power-aware metric

include remaining battery energy (Ei) embed WMA (ej/Nj)

b

Every node j is assigned a broadcast cost c j

1 eX j

cb j

Ej Ej

X2

Nj
X3

node j ' s neighbourh ood node j ' s uncovered set

U ( j)

Oij overlappin g set of nodes i and j Uj

WSN

Broadcast cover problem (BCP)

Set cover problem
F {S ,..., S m}, S j N 1 Covering C F s.t. N j : S cost (S j ) associated with S j cost (C )
j:S j C

12

Example:
C

S1

S2

S3

j
S4

C1={S1, S2, S3} C2={S3, S4, S5} C*=

cost (S ) j
C

S5

C1 , cost (C1 ) C2 , cost (C1 )

cost (C2 ) cost (C2 )

BCP
Sj Nj

Find cover C * arg min {cost (Ci )}

i

Greedy algorithm:

cost (S j ) e j cost (C ) broadcast cover cost

at each iteration add the set Sj that minimizes ratio cost(Sj)/(#newly covered nodes)

Find cover that minimizes broadcast cover cost The set of forwarding nodes belong to a tree rooted at originator
WSN

1 eX j

Ej Ej

X2

cb j

U ( j)

X3

wsn

Distributed algorithm for BCP

Phase 1: learn neighborhoods (overlapping sets) Phase 2: (upon receiving a bcast msg) 1: if neighbors covered HALT 2: recalculate the broadcast cost 3: wait for a random time before re-broadcast 4: if receive duplicate msg in the mean time goto 1:

13

Random time calculation

random number distributed uniformly between 0 and

cib c0b

WSN

Simulations
GloMoSim [UCLA]

14

scalable simulation environment for wireless and wired networks

average node degree ~ 6

average node degree ~ 12

WSN

wsn

Simulation results (1/2)

15

WSN

Simulation results (2/2)

16

WSN

wsn

Conclusion and future work

Power-Aware Metrics

17

trade-off between residual battery capacity and transmission power are necessary each node executes a simple localized algorithm link based model node based model Can we do better by exploiting WMA properly?

Scalability

Unicast communication

Broadcast communication

WSN

Minimum-energy broadcast
b Pab Pbc

18

Propagation model: Pab kdab , [2..6] Omnidirectional antennas Wireless Multicast Advantage (WMA) [Wieselthier et al.] Minimum-energy broadcast: if (Pac Pab < Pbc) then transmit at Pac

Pac

Challenges:

What are good criteria for selecting forwarding nodes?

As the number of destination increases the complexity of this formulation increases rapidly. Requirement for distributed algorithm. - forwarding nodes Broadcast Incremental Power (BIP) [Wieselthier et al.] Add a node at minimum additional cost Centralized Cost (BIP) <= Cost (MST) Take MST as a reference Branch exchange heuristic to embed WMA in MST
4 2 8 4 9
5 10

Improvements?

1 2 4 7

5 5

WSN