Agent-based decentralised coordination for sensor networks using the max-sum algorithm
<p style="text-align:justify;">In this paper, we consider the generic problem of how a network of physically distributed, computationally constrained devices can make coordinated decisions to maximise the effectiveness of the whole sensor network. In particular, we propose a new agen...
| Prif Awduron: | , , |
|---|---|
| Fformat: | Journal article |
| Cyhoeddwyd: |
Springer
2013
|
| _version_ | 1826265866737549312 |
|---|---|
| author | Farinelli, A Rogers, A Jennings, N |
| author_facet | Farinelli, A Rogers, A Jennings, N |
| author_sort | Farinelli, A |
| collection | OXFORD |
| description | <p style="text-align:justify;">In this paper, we consider the generic problem of how a network of physically distributed, computationally constrained devices can make coordinated decisions to maximise the effectiveness of the whole sensor network. In particular, we propose a new agent-based representation of the problem, based on the factor graph, and use state-of-the-art DCOP heuristics (i.e., DSA and the max-sum algorithm) to generate sub-optimal solutions. In more detail, we formally model a specific real-world problem where energy-harvesting sensors are deployed within an urban environment to detect vehicle movements. The sensors coordinate their sense/sleep schedules, maintaining energy neutral operation while maximising vehicle detection probability. We theoretically analyse the performance of the sensor network for various coordination strategies and show that by appropriately coordinating their schedules the sensors can achieve significantly improved system-wide performance, detecting up to 50 % of the events that a randomly coordinated network fails to detect. Finally, we deploy our coordination approach in a realistic simulation of our wide area surveillance problem, comparing its performance to a number of benchmarking coordination strategies. In this setting, our approach achieves up to a 57 % reduction in the number of missed vehicles (compared to an uncoordinated network). This performance is close to that achieved by a benchmark centralised algorithm (simulated annealing) and to a continuously powered network (which is an unreachable upper bound for any coordination approach).</p> |
| first_indexed | 2024-03-06T20:30:20Z |
| format | Journal article |
| id | oxford-uuid:30d36a22-95ae-4fa5-930b-e06690aa4807 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T20:30:20Z |
| publishDate | 2013 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:30d36a22-95ae-4fa5-930b-e06690aa48072022-03-26T13:03:57ZAgent-based decentralised coordination for sensor networks using the max-sum algorithmJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:30d36a22-95ae-4fa5-930b-e06690aa4807Symplectic Elements at OxfordSpringer2013Farinelli, ARogers, AJennings, N<p style="text-align:justify;">In this paper, we consider the generic problem of how a network of physically distributed, computationally constrained devices can make coordinated decisions to maximise the effectiveness of the whole sensor network. In particular, we propose a new agent-based representation of the problem, based on the factor graph, and use state-of-the-art DCOP heuristics (i.e., DSA and the max-sum algorithm) to generate sub-optimal solutions. In more detail, we formally model a specific real-world problem where energy-harvesting sensors are deployed within an urban environment to detect vehicle movements. The sensors coordinate their sense/sleep schedules, maintaining energy neutral operation while maximising vehicle detection probability. We theoretically analyse the performance of the sensor network for various coordination strategies and show that by appropriately coordinating their schedules the sensors can achieve significantly improved system-wide performance, detecting up to 50 % of the events that a randomly coordinated network fails to detect. Finally, we deploy our coordination approach in a realistic simulation of our wide area surveillance problem, comparing its performance to a number of benchmarking coordination strategies. In this setting, our approach achieves up to a 57 % reduction in the number of missed vehicles (compared to an uncoordinated network). This performance is close to that achieved by a benchmark centralised algorithm (simulated annealing) and to a continuously powered network (which is an unreachable upper bound for any coordination approach).</p> |
| spellingShingle | Farinelli, A Rogers, A Jennings, N Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title | Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title_full | Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title_fullStr | Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title_full_unstemmed | Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title_short | Agent-based decentralised coordination for sensor networks using the max-sum algorithm |
| title_sort | agent based decentralised coordination for sensor networks using the max sum algorithm |
| work_keys_str_mv | AT farinellia agentbaseddecentralisedcoordinationforsensornetworksusingthemaxsumalgorithm AT rogersa agentbaseddecentralisedcoordinationforsensornetworksusingthemaxsumalgorithm AT jenningsn agentbaseddecentralisedcoordinationforsensornetworksusingthemaxsumalgorithm |