Towards Fair Leader Election in Wireless Networks

Authors:
Zbigniew Gołebiewski;Marek Klonowski;Michał Koza;Mirosław Kutyłowski
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology, and Institute of Computer Science, Wrocław University,;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:
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Year:
2009

Citing 11
Cited 4

Log-logarithmic selection resolution protocols in a multiple access channel

SIAM Journal on Computing
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Randomized Initialization Protocols for Packet Radio Networks

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized Leader Election Protocols in Radio Networks with No Collision Detection

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Secure communication over radio channels

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Of malicious motes and suspicious sensors: on the efficiency of malicious interference in wireless networks

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Adversary immune size approximation of single-hop radio networks

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Secure initialization in single-hop radio networks

ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
When random sampling preserves privacy

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Randomized leader election protocols in noisy radio networks with a single transceiver

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Repelling Sybil-type attacks in wireless ad hoc systems

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Security problems of systems of extremely weak devices

Annales UMCS, Informatica - Security Systems
Countermeasures against sybil attacks in WSN based on proofs-of-work

Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Efficient and robust data aggregation using untrusted infrastructure

Proceedings of the 6th International Conference on Security of Information and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a leader election problem in ad-hoc single hop radio sensor network with an adversary. The aim of the adversary is to be chosen as a leader. In many scenarios it can be a staring point for performing other attacks and taking control over the whole network. In our paper we show that in typical and well-known algorithms it is not possible to avoid this threat, i.e. the adversary can always use such strategy, that the node under its control becomes a leader with high probability. This attack is efficient even if the adversary controls very small number of nodes. Moreover, we show that it is not even possible in practice to detect such malicious behaviour. Our second contribution is a new leader election algorithm that provides, to some extent, immunity against this types of attack. We consider several realistic network models and we design appropriate methods for each of them. We also show that in some scenarios it is not possible to prevent the adversary from becoming the leader.