Basic computations in wireless networks

Authors:
Ioannis Caragiannis;Clemente Galdi;Christos Kaklamanis
Affiliations:
Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;,Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 4

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
Log-logarithmic selection resolution protocols in a multiple access channel

SIAM Journal on Computing
Randomized algorithms

Randomized algorithms
Time Synchronization for Wireless Sensor Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fundamental Protocols on Wireless Sensor Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Randomized Leader Election Protocols in Radio Networks with No Collision Detection

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Weak Communication in Radio Networks

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Sorting on Single-Channel Wireless Sensor Networks

ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks

Monitoring churn in wireless networks

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Information dissemination on multiple channels

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-optimal information exchange on multiple channels

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Monitoring churn in wireless networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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(log2n) 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(log2n).