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

Full description

Saved in:

Bibliographic Details
Published in:	2009 International Conference on Information Processing in Sensor Networks pp. 97 - 108
Main Authors:	Gao, Jie, Guibas, Leonidas, Milosavljevic, Nikola, Dengpan Zhou
Format:	Conference Proceeding
Language:	English
Published:	Washington, DC, USA IEEE Computer Society 13.04.2009 IEEE
Series:	ACM Conferences
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!