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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2009 International Conference on Information Processing in Sensor Networks S. 97 - 108
Hauptverfasser:	Gao, Jie, Guibas, Leonidas, Milosavljevic, Nikola, Dengpan Zhou
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 13.04.2009 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!