Distributed resource management and matching in sensor networks

We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over time, events (fires, crime reports, cars looking for parking) arise one-by-one at arbitrary nodes, and need to be quickly...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 International Conference on Information Processing in Sensor Networks s. 97 - 108
Hlavní autoři: Gao, Jie, Guibas, Leonidas, Milosavljevic, Nikola, Dengpan Zhou
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 13.04.2009
IEEE
Edice:ACM Conferences
Témata:
Computer networks
Computer science
Computer systems organization > Architectures > Distributed architectures
Computing methodologies > Modeling and simulation > Simulation evaluation
Costs
Distributed computing
Distributed Matching
Event detection
Fires
Intelligent sensors
Mathematics of computing > Mathematical analysis > Mathematical optimization
Networks > Network services > Network management
Optimal matching
Resource management
Sensor Networks
Software and its engineering > Software organization and properties > Software system structures > Distributed systems organizing principles
Theory of computation > Design and analysis of algorithms > Data structures design and analysis > Pattern matching
Theory of computation > Design and analysis of algorithms > Mathematical optimization
Vehicles
ISBN:1424451086, 9781424451081
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over time, events (fires, crime reports, cars looking for parking) arise one-by-one at arbitrary nodes, and need to be quickly matched to and serviced by an appropriate nearby resource, without knowledge of future requests, and without the ability to alter any decision once it has been made. We develop distributed algorithms to direct available resources in the network to these events (or vice versa) in a coordinated fashion, so that no two resources are assigned to the same event, and the total distance of the events from their matched resources is minimized. The key idea is to extract, in a preprocessing stage, a well-separated tree metric that approximates the original network metric by a logarithmic distortion, allowing greedy matching algorithms to generate close to optimal matchings, and enabling communication-efficient probing-based algorithms for events to detect nearby available resources. The distributed matching algorithm requires no global coordination and achieves polylogarithmic performance ratio in both online and offline settings. Simulation experiments corroborate the theoretical results on solution quality and further evaluate the communication costs of our scheme in practice.
ISBN:1424451086
9781424451081
DOI:10.5555/1602165.1602176