a decentralised coordination algorithm for maximising sensor coverage in large sensor networks
DESCRIPTION
A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks. Ruben Stranders , Alex Rogers and Nicholas R. Jennings School of Electronics and Computer Science University of Southampton, UK. This work is about constructing large sensor networks. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/1.jpg)
1
A Decentralised Coordination Algorithm for Maximising Sensor Coverage in
Large Sensor NetworksRuben Stranders, Alex Rogers and Nicholas R. Jennings
School of Electronics and Computer ScienceUniversity of Southampton, UK
![Page 2: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/2.jpg)
2
This work is about constructing large sensor networks
Frequency assignment problem
Maintain good sensor quality
Efficient (polynomial time) algorithms
![Page 3: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/3.jpg)
3
These networks consist of many resource constrained sensing devices
Sensor
1. Deployment
![Page 4: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/4.jpg)
4
These networks consist of many resource constrained sensing devices
2. Construct communication network
Radio Link
![Page 5: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/5.jpg)
5
Sensing quality is modelled by a submodular set function
Q({1, 3}) – Q({1}) ≥ Q({1, 2, 3}) – Q({1, 2})Models the diminishing returns of adding a sensor
1 1
33
2
![Page 6: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/6.jpg)
6
Sensing quality is modelled by a submodular set function
Examples (Guestrin 2005):• Mutual Information• Area Coverage• Entropy
1 1
33
2
![Page 7: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/7.jpg)
7
Frequency allocation is one of the key challenges
Equivalent to (multi-agent) graph colouring
Communication graph
![Page 8: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/8.jpg)
8
Frequency allocation is one of the key challenges
Communication graph
![Page 9: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/9.jpg)
9
Frequency allocation is one of the key challenges
Garbled Reception
Colouring the communication graph is not sufficient
![Page 10: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/10.jpg)
10
Frequency allocation is one of the key challenges
We need to consider the conflict graph(Square of the communication graph)
![Page 11: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/11.jpg)
11
Frequency allocation is one of the key challenges
We need to consider the conflict graph(Square of the communication graph)
![Page 12: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/12.jpg)
12
The frequency allocation is one of the key challenges
Multi-agent graph colouring occurs often in sensor networkse.g. Coordination of sense/sleep cycles
![Page 13: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/13.jpg)
13
Frequency allocation is a difficult challenge for two reasons
1. Might need many frequencies
Reduced bandwidth
2. NP-hard problem Poor approximationsRequires lots of resources
or
![Page 14: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/14.jpg)
14
Our approach deactivates sensors to simplify the problem
![Page 15: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/15.jpg)
15
Specifically, our approach is to make the communication graph triangle-free
Colourable with threecolours
Colouring can be foundin linear time
Might need many colours
Colouring is NP-hard
Arbitrary Graph Triangle-free Graph(K3-minor free)
![Page 16: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/16.jpg)
16
Specifically, our approach is to make the communication graph triangle-free
Colourable with threecolours
Colouring can be foundin linear time
Might need many colours
Colouring is NP-hard
Arbitrary Graph Triangle-free Graph(K3-minor free)
![Page 17: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/17.jpg)
17
Specifically, our approach is to make the communication graph triangle-free
Triangle-free Graph(K3-minor free)
Colourable with threecolours
Colouring can be foundin linear time
![Page 18: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/18.jpg)
Specifically, our approach is to make the communication graph triangle-free
Colourable with threecolours
Colouring can be foundin linear time
Triangle-free Graph(K3-minor free)
18
Colourable with sixcolours
Colouring is easy
Square of Triangle-free Graph
Communication Graph
Conflict Graph
![Page 19: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/19.jpg)
19
However, by deactivating sensors, we lose sensing quality
Sensor coveragearea
![Page 20: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/20.jpg)
20
However, by deactivating sensors, we lose sensing quality
Sensing quality is given by submodular function
![Page 21: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/21.jpg)
21
Maximising quality while simplifying frequency allocation is still NP-hard
Maximise sensing quality subject to graph being triangle-free
Maximising submodular function subject to p-independence constraint
![Page 22: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/22.jpg)
22
Therefore, we developed two efficient approximate algorithms
Arbitrary Graph Triangle-free Graph
![Page 23: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/23.jpg)
23
The centralised algorithm iteratively selects sensors that improve quality
• Creating a triangle
Each iteration, activate the sensor that:
without
• Maximises quality increase
![Page 24: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/24.jpg)
24
The centralised algorithm iteratively selects sensors that improve quality
![Page 25: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/25.jpg)
25
The centralised algorithm iteratively selects sensors that improve quality
Step 1
![Page 26: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/26.jpg)
26
The centralised algorithm iteratively selects sensors that improve quality
Step 2
![Page 27: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/27.jpg)
27
The algorithm terminates when no remaining sensor can be activated
Can’t add:creates triangle!
Can’t select any more sensors.
![Page 28: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/28.jpg)
28
The algorithm terminates when no remaining sensor can be activated
DoneCan’t select any more sensors.
![Page 29: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/29.jpg)
29
The centralised algorithm achieves at least 1/7th of the optimal quality
This follows from submodularity and p-independence
Greedy Optimal
![Page 30: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/30.jpg)
30
The centralised algorithm achieves at least 1/7th of the optimal quality
p-independence system
Need to remove at most p sensors after adding an arbitrary sensor to retain triangle-freeness
![Page 31: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/31.jpg)
31
The centralised algorithm achieves at least 1/7th of the optimal quality
p-independence system
Need to remove at most p sensors after adding an arbitrary sensor to retain triangle-freeness
![Page 32: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/32.jpg)
32
The centralised algorithm achieves at least 1/7th of the optimal quality
p-independence system
Need to remove at most p sensors after adding an arbitrary sensor to retain triangle-freeness
p = 6
![Page 33: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/33.jpg)
33
The centralised algorithm achieves at least 1/7th of the optimal quality
Greedily maximising submodular function
subject to p-independence constraint
QG ≥ 1/(1+p) Q*
QG ≥ 1/7 Q*
(Nemhauser, 1978)
![Page 34: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/34.jpg)
34
Using similar techniques, we created a decentralised algorithm
![Page 35: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/35.jpg)
35
Using similar techniques, we created a decentralised algorithm
In every triangle deactivate the sensor that blocks the two with highest quality
1 2
3 4
Central Idea
![Page 36: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/36.jpg)
36
Using similar techniques, we created a decentralised algorithm
Sensors activate themselves asynchronously 1 2
3 4
![Page 37: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/37.jpg)
37
Sensor checks if it is part of a triangle
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
![Page 38: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/38.jpg)
38
Sensors check if activating themselves block sensors with higher quality
Is the sensor part of a triangle?
Yes: we have to deactivate at least one of these
1 2
3 4No: the sensor can remain active
![Page 39: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/39.jpg)
39
Sensor checks if its contribution is smaller than that of the other two
Q({1, 2}) ≤ Q({2, 3})
Q({1, 3}) ≤ Q({2, 3})and
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
![Page 40: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/40.jpg)
40
and✓✓
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
Q({1, 2}) ≤ Q({2, 3})
Q({1, 3}) ≤ Q({2, 3})
Sensor checks if its contribution is smaller than that of the other two
![Page 41: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/41.jpg)
41
If so, it deactivates itself
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
Sensor checks if its contribution is smaller than that of the other two
![Page 42: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/42.jpg)
42
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
![Page 43: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/43.jpg)
43
and✘✓
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
Q({2, 3}) ≤ Q({3, 4})
Q({2, 4}) ≤ Q({3, 4})
![Page 44: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/44.jpg)
44
Sensors check if activating themselves block sensors with higher quality
1 2
3 4
![Page 45: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/45.jpg)
45
The algorithm terminates when the sensor is no longer part of a triangle
Done
![Page 46: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/46.jpg)
49
Both algorithms efficiently compute a triangle-free network
Original
![Page 47: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/47.jpg)
50
Both algorithms efficiently compute a triangle-free network
Centralised
![Page 48: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/48.jpg)
51
Both algorithms efficiently compute a triangle-free network
Decentralised
![Page 49: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/49.jpg)
52
0
0
0
0
To evaluate the algorithms, we simulated sensor deployments
1
1
Unit squareenvironment
R300 sensors
![Page 50: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/50.jpg)
53
Both algorithms provide >70% sensing quality of the original deployment
0.1 0.2 0.3 0.4 0.50.600000000000001
0.700000000000001
0.800000000000001
0.900000000000001
1
OptimalCentralisedDecentralised
Loss from restricting solution( < 20% )
Loss from suboptimalsolution( < 10% )Se
nsin
g Q
ualit
y
Sensing Radius
![Page 51: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/51.jpg)
55
0
0
0
0
We also considered a dynamic environment, where sensors can fail
1
1
R
When a sensor fails:Centralised: rerun algorithm with remaining sensors
Decentralised: rerun algorithm if a neighbour fails
![Page 52: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/52.jpg)
56
Both algorithms achieve a coverage over time close to the optimal
0.10 0.20 0.30 0.40 0.500
500
1000
1500One at a timeCentralisedDecentralisedAll active
Cove
rage
x T
ime
Sensing Radius
Upper bound on achievable performance
![Page 53: A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks](https://reader035.vdocuments.site/reader035/viewer/2022070422/568165dc550346895dd8f3a7/html5/thumbnails/53.jpg)
57
In conclusion, our algorithms create sensor networks with high quality
Simplify the frequency assignment problem
Provide good sensor quality
Polynomial time algorithms for constructing and colouring
57