Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS...
-
Upload
dale-mclaughlin -
Category
Documents
-
view
213 -
download
0
Transcript of Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS...
![Page 1: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/1.jpg)
Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks
Jakob Salzmann
INSS 2007,07.06.2007, Braunschweig
Institute of Applied Microelectronics and
Computer Engineering University of
Rostock
![Page 2: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/2.jpg)
2
Outline
Motivation
Clustering
Routing
Conclusion & Outlook
![Page 3: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/3.jpg)
3
Motivation
Photo: Jason Hill, UCB
Cheaper and smaller, but more nodes
Main problem: energy consumption
![Page 4: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/4.jpg)
4
Dividing the network into clustersLess Communication
Hierarchical Structure
Clustering I
Clusterhead consumes more energy
Problem: Different position in a cluster Different transmission range
New Clusterheads have to check for connections Communication overhead
Our goal: Limits for clusters which allow unconditional role changes
Lifetime increase by role changing
Sensor node Sink Clusterhead
![Page 5: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/5.jpg)
5
Clustering II
Grid with quadratic cells
Max cell size restricted byTransmission rangeSensing range
Transmission Range RT Sensing Range RS
L
2
)2;min( TS RRL
L
L
![Page 6: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/6.jpg)
6
Clustering III
Sensor node
Sink
Clusterhead
Switched-off node
Estimation of the virtual
grid
Determining the
Clusterhead in each cell
Temporary switch-off
remaining nodes without
loss of performance
Emerging of clusters with
different lifetimes
Low populated Cluster
Well populated Cluster
![Page 7: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/7.jpg)
7
Scale Free Networks
US airline systemInternet
Network results from preferred connection
Many nodes with few connections, few nodes with many connections
Robust against random attacks
Our goal: Adoption of Scale free behavior to our developed
clustering algorithm
![Page 8: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/8.jpg)
8
Routing Algorithm
Sink Switched-off node Low populated Cluster
Well populated Cluster
Our approach:Starting with the sinkAfter attending the network, nodes connect with all unconnected nodes in range
Built up a network with scale free behavior
Optimizations:Range ReductionLimited ConnectivityWait and See
Well populated cluster become hubs
![Page 9: Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.](https://reader036.fdocuments.in/reader036/viewer/2022081603/56649eb15503460f94bb7b81/html5/thumbnails/9.jpg)
9
Conclusion & Outlook
ResultsDeveloped a clustering algorithm
Unconditional role changingConsiders coverage and connectivity
Applied a routing algorithmScale free behaviorRobust against random failures
Future WorkImprovement of cell sizesStronger cross linking for improved robustness