Skip to main content

Frugal Sensor Assignment

  • Conference paper
Distributed Computing in Sensor Systems (DCOSS 2008)


When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In general, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In the dynamic setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help based on the value of the mission, the sensor’s remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Bar-Noy, A., Brown, T., Johnson, M., La Porta, T., Liu, O., Rowaihy, H.: Assigning sensors to missions with demands. In: ALGOSENSORS 2007 (2007)

    Google Scholar 

  2. Byers, J., Nasser, G.: Utility-based decision-making in wireless sensor networks. In: Proceedings of MOBIHOC 2000 (2000)

    Google Scholar 

  3. Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162–166 (2006)

    Article  MathSciNet  Google Scholar 

  4. Kaplan, L.: Global node selection for localization in a distributed sensor network. IEEE Transactions on Aerospace and Electronic Systems 42(1), 113–135 (2006)

    Article  Google Scholar 

  5. Karp, B., Kung, H.: Greedy perimeter stateless routing for wireless networks. In: Proceedings of MobiCom 2000, Boston, MA, August 2000, pp. 243–254 (2000)

    Google Scholar 

  6. Lu, J., Bao, L., Suda, T.: Coverage-Aware Sensor Engagement in Dense Sensor Networks. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds.) EUC 2005. LNCS, vol. 3824, pp. 639–650. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Mullen, T., Avasarala, V., Hall, D.L.: Customer-driven sensor management. IEEE Intelligent Systems 21(2), 41–49 (2006)

    Article  Google Scholar 

  8. Perillo, M., Heinzelman, W.: Optimal sensor management under energy and reliability constraints. In: WCNC 2003 (2003)

    Google Scholar 

  9. Rowaihy, H., Eswaran, S., Johnson, M., Verma, D., Bar-Noy, A., Brown, T., La Porta, T.: A survey of sensor selection schemes in wireless sensor networks. In: SPIE Defense and Security Symposium (2007)

    Google Scholar 

  10. Rowaihy, H., Johnson, M., Brown, T., Bar-Noy, A., La Porta, T.: Assigning Sensors to Competing Missions. Technical Report NAS-TR-0080-2007, Network and Security Research Center, Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, USA (October 2007)

    Google Scholar 

  11. Shih, K., Chen, Y., Chiang, C., Liu, B.: A distributed active sensor selection scheme for wireless sensor networks. In: Proceedings of the IEEE Symposium on Computers and Communications (June 2006)

    Google Scholar 

  12. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

  13. Zhao, F., Shin, J., Reich, J.: Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine 19(2), 61–72 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Sotiris E. Nikoletseas Bogdan S. Chlebus David B. Johnson Bhaskar Krishnamachari

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johnson, M.P. et al. (2008). Frugal Sensor Assignment. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds) Distributed Computing in Sensor Systems. DCOSS 2008. Lecture Notes in Computer Science, vol 5067. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69169-3

  • Online ISBN: 978-3-540-69170-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics