Skip to main content

Extreme Propagation in an Ad-Hoc Radio Network - Revisited

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7654)

Abstract

We consider the algorithm by Baquero, Almeida and Menezes that computes extreme values observed by nodes of an ad hoc network. We adapt it to meet specific technical features of communication in wireless networks with a single channel based on time multiplexing. Our approach leads to substantial reduction of the number of messages transmitted as well as execution speed-up.

The paper was partially supported by EU Operational Programme Innovative Economy 2007-2013 POIG.01.03.01-02-002/08-00.

This is a preview of subscription content, access via your institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baquero, C., Almeida, P.S., Menezes, R.: Fast estimation of aggregates in unstructured networks. In: Calinescu, R., Liberal, F., Marín, M., Herrero, L.P., Turro, C., Popescu, M. (eds.) ICAS, pp. 88–93. IEEE Computer Society (2009)

    Google Scholar 

  2. Cai, Z., Lu, M., Wang, X.: Distributed initialization algorithms for single-hop ad hoc networks with minislotted carrier sensing. IEEE Trans. Parallel Distrib. Syst. 14(5), 516–528 (2003)

    CrossRef  Google Scholar 

  3. Cichoń, J., Kutyłowski, M., Zawada, M.: Power of discrete nonuniformity - optimizing access to shared radio channel in ad hoc networks. In: MSN, pp. 9–15. IEEE Computer Society (2008)

    Google Scholar 

  4. Cichoń, J., Lemiesz, J., Zawada, M.: On Message Complexity of Extrema Propagation Techniques. In: Li, X.-Y., Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2012. LNCS, vol. 7363, pp. 1–13. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  5. Kroller, A., Pfisterer, D., Buschmann, C., Fekete, S.P., Fischer, S.: Shawn: A new approach to simulating wireless sensor networks (2005)

    Google Scholar 

  6. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Ruppert, E., Malkhi, D. (eds.) PODC, pp. 113–122. ACM (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Błaśkiewicz, P., Kutyłowski, M., Wodo, W., Wolny, K. (2012). Extreme Propagation in an Ad-Hoc Radio Network - Revisited. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34707-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34706-1

  • Online ISBN: 978-3-642-34707-8

  • eBook Packages: Computer ScienceComputer Science (R0)