Skip to main content

Basic Computations in Wireless Networks

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show that it is possible to estimate the number stations in the network within a factor 2 from the correct value in time O(log n log log n). We further show that if no station can detect collisions, the same task can be accomplished within a factor of 3 in time O(log2 n) and maximum energy O(log n) per node, with high probability. Finally, we present an algorithm that computes the minimum value held by the stations in the wireless network in time O(log2 n).

This work was partially supported by the European Union under IST FET Integrated Project 015964 AEOLUS.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bhuvaneswaran, R.S., Bordim, J.L., Cui, J., Nakano, K.: Fundamental Protocols for Wireless Sensor Networks. In: Proc. of the 15th International Parallel and Distributed Processing Symposium, IPDPS 2001 (2001)

    Google Scholar 

  2. Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, G.C., Smith, S.J., Zagha, M.: An Experimental Analysis of Parallel Sorting Algorithms. Theory of Computing Systems 31(2), 135–167 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bordim, J.L., Nakano, K., Shen, H.: Sorting on Single-Channel Wireless Sensor Networks. In: Proc. of the International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2002), pp. 153–158 (2002)

    Google Scholar 

  4. Elson, J., Estrin, D.: Time Synchronization for Wireless Station Networks. In: Proc. of the 15th International Parallel and Distributed Processing Symposium (IPDPS 2001), Workshop on Parallel and Distributed Computing Issues in Wireless and Mobile Computing (2001)

    Google Scholar 

  5. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 279–289. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Weak Communication in Radio Networks. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 965–972. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  8. Nakano, K., Olariu, S.: Energy-Efficient Initialization Protocols for Radio Networks with No Collision Detection. In: Proc. of the 2000 International Conference on Parallel Processing (ICPP 2000), pp. 263–270 (2000)

    Google Scholar 

  9. Nakano, K., Olariu, S.: Randomized Leader Election Protocols in Radio Networks with No Collision Detection. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 362–373. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Reif, J.H., Valiant, L.G.: A Logarithmic Time Sort for Linear Size Networks. Journal of the ACM 34(1), 60–75 (1987)

    Article  MathSciNet  Google Scholar 

  11. Singh, M., Prasanna, V., Rolim, J., Raghavendra, C.: Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays. In: Conti, M., Giordano, S., Gregori, E., Olariu, S. (eds.) PWC 2003. LNCS, vol. 2775, pp. 1–11. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Willard, D.E.: Log-logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM Journal on Computing 15, 468–477 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caragiannis, I., Galdi, C., Kaklamanis, C. (2005). Basic Computations in Wireless Networks. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_54

Download citation

  • DOI: https://doi.org/10.1007/11602613_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics