Skip to main content

Maximum Lifetime Broadcast in Mobile Sensor Networks

  • Conference paper
Book cover Ad-hoc, Mobile, and Wireless Network (ADHOC-NOW 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 7960))

Included in the following conference series:

Abstract

In this paper we investigate the Maximum Lifetime Broadcast (MLB) problem, i.e. the problem of extending network lifetime when a series of broadcast operations is executed, in sensor networks with mobile nodes. For this problem, we present two localized algorithms (nodes use only 2-hop information), namely LPrim and LMCP, which are based on trees with minimum highest cost edges and shortest paths trees, respectively. The algorithms were evaluated through simulations under three distinct mobility models and compared against common broadcasting techniques (broadcasting based on a Connected Dominating Set and Flooding). According to our experiments, LPrim outperformed alternative solutions in terms of the number of successfully executed broadcasts (network lifetime) and in terms of the energy consumed by broadcast.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Calamoneri, T., Clementi, A., Fusco, E., Silvestri, R.: Maximizing the number of broadcast operations in random geometric ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 22, 208–216 (2011)

    Article  Google Scholar 

  2. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 346–359. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: IEEE INFOCOM, pp. 22–31 (2000)

    Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)

    Google Scholar 

  6. Dietrich, I., Dressler, F.: On the lifetime of wireless sensor networks. ACM Transactions on Sensor Networks 5(1) (January 2009)

    Google Scholar 

  7. Elkin, M., Lando, Y., Nutov, Z., Segal, M., Shpungin, H.: Novel algorithms for the network lifetime problem in wireless settings. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds.) ADHOC-NOW 2008. LNCS, vol. 5198, pp. 425–438. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Elkin, M., Lando, Y., Nutov, Z., Segal, M., Shpungin, H.: Novel algorithms for the network lifetime problem in wireless settings. Wireless Networks 17, 397–410 (2011)

    Article  Google Scholar 

  9. Distributed Computing Group ETH. Sinalgo - simulator for network algorithms, http://disco.ethz.ch/projects/sinalgo/

  10. Kang, I., Poovendran, R.: Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks. Mobile Networks and Applications 10, 879–896 (2005)

    Article  Google Scholar 

  11. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer (2008)

    Google Scholar 

  12. Lee, S.H., Radzik, T.: Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network. In: Li, X.-Y., Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2012. LNCS, vol. 7363, pp. 14–27. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Nunes, B., Barboza, F., Assis, F.: A localized algorithm for the maximum lifetime broadcast problem with asymmetric edge costs. In: Proc. of the 12th IEEE Int. Symp. on Network Computing and Applications, NCA (August 2012)

    Google Scholar 

  14. Nutov, Z., Segal, M.: Improved approximation algorithms for maximum lifetime problems in wireless networks. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 41–51. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Orda, A., Yassour, B.-A.: Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. In: Proc. of the 6th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, MobiHoc 2005, pp. 426–437 (2005)

    Google Scholar 

  16. Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communications and Networks 4, 59–70 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nunes, B., Barboza, F., Assis, F. (2013). Maximum Lifetime Broadcast in Mobile Sensor Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39247-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics