List of Figures

1.1 BSS mode: an Access Point and its network cell.
1.2 IBSS mode.
1.3 An ad hoc network.
1.4 The hidden station problem.
1.5 OLSR packet format.
1.6 HELLO message format.
1.7 TC message format.
1.8 Pure flooding and MPR flooding.
3.1 Node X sends HELLO messages pretending to be C.
3.2 Node X sends HELLO messages advertising a fake link with A.
3.3 Node X sends TC messages pretending to be C.
3.4 A wormhole created by node X.
3.5 A longer wormhole created by two colluding nodes X and X.
3.6 Node X performs an MPR attack.
5.1 Old version of SIGNATURE message format.
5.2 SIGNATURE message format.
5.3 Diagram of HELLO message overhead.
5.4 Diagram of TC message overhead.
7.1 Time difference between clocks.
7.2 Time difference between clocks, after resynchronization.
9.1 The finite state machine for OLSR link state transitions.
9.2 ADVSIG message format.
9.3 Diagram of ADVSIG overhead.
9.4 Diagram of ADVSIG overhead using 64-bit signatures.
10.1 SIGLOC message format.
10.2 Lower bound on the distance between R and S.
10.3 Test of likelihood for declared links.
10.4 Test of likelihood for a direct link (against a wormhole).
10.5 Direction check on the distance between R and S.
10.6 Diagram of SIGLOC overhead.
11.1 Accusation message format.


Security Schemes for the OLSR Protocol for Ad Hoc Networks        Daniele Raffo        PhD Thesis, Université Paris 6       15 SEP 2005