Abstract
The facility location problem has occupied a central place in operations research since the early 1960’s, as it models design decisions on the placement of factories, warehouses, schools, or hospitals to serve a set of customers efficiently. For an overview of previous work see the survey chapter by Cornuejols, Nemhauser & Wolsey in [289]. Recently, it has received renewed research interest because it can be used to place servers or proxies in communication networks [380].
We apply the facility location problem to configuration and deployment issues in wireless sensor networks.More specifically, we discuss how algorithms for the facility location problem can be used to assign functionality to certain nodes in a wireless sensor network, i.e., choose a subset of designated nodes as service providers of a particular service.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Frank, C. (2007). Facility Location. In: Wagner, D., Wattenhofer, R. (eds) Algorithms for Sensor and Ad Hoc Networks. Lecture Notes in Computer Science, vol 4621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74991-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-74991-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74990-5
Online ISBN: 978-3-540-74991-2
eBook Packages: Computer ScienceComputer Science (R0)