Adversary immune size approximation of single-hop radio networks

Authors:
J̧edrzej Kabarowski;Mirosław Kutyłowski;Wojciech Rutkowski
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology;Institute of Mathematics and Computer Science, Wrocław University of Technology;Institute of Mathematics and Computer Science, Wrocław University of Technology
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 7
Cited 5

Randomized Initialization Protocols for Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Efficient algorithms for leader election in radio networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Reliable broadcasting without collision detection

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Secure initialization in single-hop radio networks

ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks

Towards Fair Leader Election in Wireless Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless 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
Time-optimal information exchange on multiple channels

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Immune size approximation algorithms in ad hoc radio network

EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Monitoring churn in wireless networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design a time and energy efficient algorithm concerning size approximation for single-hop radio networks. The most important feature of the algorithm is that it is immune against an adversary that may scramble a certain number of communication steps. The previous algorithms presented in the literature provide false estimations if an adversary causes certain communication collisions.