Preventing the cluster formation attack against the hierarchical OLSR protocol

Authors:
Gimer Cervera;Michel Barbeau;Joaquin Garcia-Alfaro;Evangelos Kranakis
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;LUSSI Dept., Institut Telecom, Telecom Bretagne, Cesson-Sevigne, France;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Year:
2011

Citing 7
Cited 0

Password authentication with insecure communication

Communications of the ACM
Secure OLSR

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Cluster-based OLSR extensions to reduce control overhead in mobile ad hoc networks

IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Performance evaluation of video streaming over ad hoc networks using flat and hierarchical routing protocols

Mobile Networks and Applications
Inside-Out OLSR Scalability Analysis

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Hierarchical Optimized Link State Routing (HOLSR) protocol enhances the scalability and heterogeneity of traditional OLSR-based Mobile Ad-Hoc Networks (MANETs). It organizes the network in logical levels and nodes in clusters. In every cluster, it implements the mechanisms and algorithms of the original OLSR to generate and to distribute control traffic information. However, the HOLSR protocol was designed with no security in mind. Indeed, it both inherits, from OLSR, and adds new security threats. For instance, the existence of misbehaving nodes can highly affect important HOLSR operations, such as the cluster formation. Cluster IDentification (CID) messages are implemented to organize a HOLSR network in clusters. In every message, the hop count field indicates to the receiver the distance in hops to the originator. An attacker may maliciously alter the hop count field. As a consequence, a receiver node may join a cluster head farther away than it appears. Then, the scalability properties in a HOLSR network is affected by an unbalanced distribution of nodes per cluster. We present a solution based on the use of hash chains to protect mutable fields in CID messages. As a consequence, when a misbehaving node alters the hop count field in a CID message, the receiver nodes are able of detecting and discarding the invalid message.