Skip to main content

On Message Complexity of Extrema Propagation Techniques

  • Conference paper

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

Abstract

In this paper we discuss the message complexity of some variants of the Extrema Propagation techniques in wireless networks. We show that the average message complexity, counted as the number of messages sent by each given node, is \(\mathrm{O}\left(\log n\right)\), where n denotes the size of the network.

We indicate the connection between our problem and the well known and deeply studied problem of the number of records in a random permutation. We generalize this problem onto an arbitrary simple and locally finite graphs, prove some basic theorems and find message complexity for some classical graphs such us lines, circles, grids and trees.

Keywords

  • Independent Random Variable
  • Line Graph
  • Classical Graph
  • Standard Normal Variable
  • Message Complexity

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supported by grant N N206 369739 of the Polish National Science Center.

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: Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems, pp. 88–93 (2009), http://gsd.di.uminho.pt/members/cbm/ps/IEEEfastFinalICAS2009.pdf

  2. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 113–122 (2006)

    Google Scholar 

  3. Cichoń, J., Lemiesz, J., Zawada, M.: On Cardinality Estimation Protocols for Wireless Sensor Networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 322–331. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  4. Cichoń, J., Lemiesz, J., Szpankowski, W., Zawada, M.: Two-phase cardinality estimation protocols for sensor networks with provable precision. In: IEEE WCNC 2012 Conference Proceeding, IEEE Xplore (2012)

    Google Scholar 

  5. Yang, M.C.K.: On the distribution of the inter-record times in an increasing population. J. Appl. Probab., 148–154 (1975)

    Google Scholar 

  6. Rényi, A.: Théorie des ’el’ements saillants d’une suite d’observations. Ann. Fac. Sci. Univ. Clermont-Ferrand, 7–13 (1962)

    Google Scholar 

  7. Steele, J.M.: The bohnenblust—spitzer algorithm and its applications. J. Comput. Appl. Math. 142, 235–249 (2002), http://portal.acm.org/citation.cfm?id=586795.586814

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Billingsley, P.: Probability and Measure, 3rd edn. Wiley-Interscience (1995)

    Google Scholar 

  9. Arnold, B., Balakrishnan, N., Nagaraja, H.: A First Course in Order Statistics. John Wiley & Sons, New York (1992)

    MATH  Google Scholar 

  10. Devroye, L.: Applications of the theory of records in the study of random trees. Acta Informatica 26, 123–130 (1988)

    CrossRef  MathSciNet  MATH  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

Cichoń, J., Lemiesz, J., Zawada, M. (2012). On Message Complexity of Extrema Propagation Techniques. In: Li, XY., Papavassiliou, S., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2012. Lecture Notes in Computer Science, vol 7363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31638-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31638-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)