Transcript Energy-Balanced m-Coverage and n
Energy-Balanced m-Coverage and n-Connectivity Routing Algorithm for WSN Yuping Dong, Hwa Chang, Zhongjian Zou, Sai Tang ICHIT2010
WSN Power Issue • • • Tiny sensor nodes do not carry much energy.
Long-lasting WSNs reduce cost.
Extreme environment and dense distribution of sensors prohibit battery recharge or replacement.
Energy Efficient Routing Protocols • • • Data Centric Hierarchical Location-based
m-Coverage and n-Connectivity • • m-Coverage => Full coverage of area n-Connectivity => Never lost information
Power Model
E tot
E TX
(
k
,
d
)
E RX
(
k
)
E Idle
E ST
E Sleep E TX
E elec k
amp kd
2
E RX
E elec k E ST
t Trans
E T
arg
etState
Energy-Balanced Routing Algorithm • Routing Setup – Calculate # of sets – Determine node’s hop count – Construct paths
P
w h
HC CurrHC
w e
EL
• Data Transmission
Simulation Results and Comparison
Number of Active Nodes vs. Coverage Ratio Nodes Usage vs. Hop Count
Energy-Aware Routing Algorithm for WSN Applications in Border Surveillance Yuping Dong, Hwa Chang, Zhongjian Zou, Sai Tang HST2010
Multiple Sink Nodes • • • • • Further distribute energy consumption.
Evenly divide the whole area.
Save setup time and transmission energy.
Shorter latency.
Assign local max hop count nodes with random set #s.
Example Networks
EBCCR EAR
Simulation Results
Number of Active Nodes vs. Coverage Ratio Nodes Usage vs. Hop Count