Towards Fair Leader Election in Wireless Networks
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.
Unable to display preview. Download preview PDF.
- 4.Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-Resilient Information Exchange. In: IEEE InfoCom 2009 (2009)Google Scholar
- 6.Hayashi, T., Nakano, K., Olariu, S.: Randomized initialization protocols for packet radio networks. In: IPPS/SPDP, p. 544. IEEE Computer Society, Los Alamitos (1999)Google Scholar
- 7.Janson, S., Szpankowski, W.: Analysis of an asymmetric leader election algorithm. Electr. J. Comb. 4(1) (1997)Google Scholar
- 11.MacKenzie, A., Wicker, S.B.: Stability of multipacket slotted aloha with selfish users and perfect information. In: INFOCOM (2003)Google Scholar