Skip to main content

Energy-Efficient Task Management

  • Chapter
  • First Online:
  • 2598 Accesses

Part of the book series: Signals and Communication Technology ((SCT))

Abstract

In numerous applications of wireless sensor networks, the reliability of the data collected by sensors is cast as specific QoS requirements expressed in terms of the minimum number of sensors needed to perform various tasks. Designing a long-lived sensor network with reliable performance has always been challenging due to the modest non-renewable energy budget of individual sensors. In order to promote network longevity, this chapter looks at two energy-aware task management protocols: the first protocol is centralized, while the second one is fully distributed. Both protocols assign sensors to tasks based on their remaining energy so that energy expenditure among neighboring sensors is as even as possible. We compare the network longevity, i.e., the functional lifetime of the sensor network, achieved by assigning tasks to sensors using the proposed protocols against an optimal task assignment and also against energy-oblivious protocols. Extensive simulation results have revealed that the performance of the proposed protocols is very close to that of the optimal task assignment. Furthermore, our simulations have shown that the proposed protocols can increase the functional longevity of the network by about 16 %.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    A discrete random variable is said to be lattice if all the values it can assume with positive probability are of the form \(nh\) for some \(h>0\) and integer \(n\).

  2. 2.

    To see why \(\min (S,n)=0\), observe that if \(\min (S,n) > 0\) then all the sensors have a nonzero energy budget and so the feasible task \(T_{m+1}\) can definitely be performed.

  3. 3.

    We assume that CTW messages include information about the number of remaining CTW messages.

References

  1. H.S. Abdelsalam, A virtual infrastructure for mitigating typical challenges in sensors networks, Old Dominion University, December 2010

    Google Scholar 

  2. H. S. AbdelSalam, S. Olariu, Hexagon-based localization technique for wireless sensor networks. in PERCOMW ’09: Proceedings of the Seventh IEEE International Conference on Pervasive Computing and Communications Workshops, Galveston, Texas, IEEE Computer Society, March 2009

    Google Scholar 

  3. H.S. AbdelSalam, S. Olariu, Toward efficient task management in wireless sensor networks. IEEE Trans. Comput. 60, 1638–1651 (2011)

    Google Scholar 

  4. H.S. AbdelSalam, S. Olariu, Bees: Bioinspired backbone selection in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 23, 44–51 (2012)

    Google Scholar 

  5. H.S. AbdelSalam, S. Olariu, S.R. Rizvi, in Tiling-based localization scheme for sensor networks using a single beacon, IEEE Globecom, Dec, 2008

    Google Scholar 

  6. H.S. Abdelsalam, S.R. Rizvi, Energy efficient workforce selection in special-purpose wireless sensor networks. in INFOCOM Student Workshop 2008, IEEE, 1–4, April 2008

    Google Scholar 

  7. H.S. AbdelSalam, S.R. Rizvi, S. Ainsworth, S. Olariu, A durable sensor enabled lifeline support for firefighters. in INFOCOM Workshops (MCN), IEEE, 1–6, April 2008

    Google Scholar 

  8. H.M. Ammari, S.K. Das, Scheduling protocols for homogeneous and heterogeneous k-covered wireless sensor networks. Pervasive Mob. Comput. 7(1), 79–97 (2011)

    Google Scholar 

  9. F. Barsi, A. Bertossi, C. Lavault, A. Navarra, S. Olariu, M.C. Pinotti, V. Ravelomanana, Efficient location training protocols for heterogeneous sensor and actor networks. IEEE Trans. Mob. Comput. 10(3), 377–391 (2011)

    Google Scholar 

  10. T. He, C. Huang, B. Blum, J. Stankovic, T. Abdelzaher, Range-free localization schemes in large scale sensor networks, 2003

    Google Scholar 

  11. R. Nagpal, H.E. Shrobe, J. Bachrach, Organizing a global coordinate system from local information on an ad hoc sensor network. In IPSN, pp. 333–348, (2003)

    Google Scholar 

  12. K. Nakano, S. Olariu, Randomized o (log log n)-round leader election protocols in packet radio networks. in ISAAC ’98: Proceedings of the 9th International Symposium on Algorithms and Computation, pages 209–218, London, springer, 1998

    Google Scholar 

  13. K. Nakano, S. Olariu, Leader election protocols for radio networks. Handb wirel networks mob. comput. pp. 219–242, 2002

    Google Scholar 

  14. D. Niculescu, B. Nath. Ad hoc positioning system (aps) using aoa. in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 3:1734–1743 vol. 3, 30 March-3 April 2003

    Google Scholar 

  15. S. Olariu, M. Eltoweissy, M. Younis, ANSWER: AutoNomouS netWorked sEnsoR system. J. Parallel Distrib. Comput. 67(1), 111–124 (2007)

    Google Scholar 

  16. S. Olariu, I. Stojmenovic, Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting. in INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1–12, April 2006

    Google Scholar 

  17. S. Olariu, A. Wada, L. Wilson, M. Eltoweissy, Wireless sensor networks: leveraging the virtual infrastructure. Network, IEEE, 18(4):51–56, July-Aug, 2004

    Google Scholar 

  18. E. Parzen, Stochastic Processes, pp. 182–183, Holden-Day, Inc., 1962

    Google Scholar 

  19. V. Rajendran, K. Obraczka, J.J. Garcia-Luna-Aceves, Energy-efficient collision-free medium access control for wireless sensor networks. in I.F. Akyildiz, D. Estrin, D.E. Culler, M.B. Srivastava, eds. SenSys, ACM, pp. 181–192, 2003

    Google Scholar 

  20. T. van Dam, K. Langendoen, An adaptive energy-efficient mac protocol for wireless sensor networks. in SenSys ’03: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 171–180, New York, USA, ACM, 2003

    Google Scholar 

  21. A. Wadaa, S. Olariu, L. Wilson, M. Eltoweissy, K. Jones, Training a wireless sensor network. Mob. Networks Appl. 10, 151–168 (2005)

    Google Scholar 

  22. K. Whitehouse, A. Woo, F. Jiang, J. Polastre, D. Culler, Exploiting the capture effect for collision detection and recovery. in EmNets ’05: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors, IEEE Comput. Soc. pp. 45–52, Washington, DC, USA, 2005

    Google Scholar 

  23. R.W. Wolff, Poisson arrivals see time averages. Oper. Res. 30(2), 223–231 (1982)

    Google Scholar 

  24. X. Wu, G. Chen, S.K. Das, On the energy hole problem of nonuniform node distribution in wireless sensor networks. IEEE Int. Conf. Mob. Adhoc Sen. Syst. (MASS), 2006 , pp 180–187, Oct. 2006

    Google Scholar 

  25. L. Yuan, W. Cheng, W. Cheng, X. Du, An energy-efficient real-time routing protocol for sensor networks. Comput. Commun. 30(10), 2274–2283 (2007)

    Google Scholar 

Download references

Acknowledgments

The work presented in this chapter was funded, in part, by NSF grants CNS-0721563 and CNS-1116238.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hady S. AbdelSalam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

AbdelSalam, H.S., Olariu, S. (2014). Energy-Efficient Task Management. In: Ammari, H. (eds) The Art of Wireless Sensor Networks. Signals and Communication Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40009-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40009-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40008-7

  • Online ISBN: 978-3-642-40009-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics