Formal Model for (k)-Neighborhood Discovery Protocols

Raphaël Jamet (1) , Pascal Lafourcade (2)

1 VERIMAG - IMAG - VERIMAG
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

Neighborhood discovery is a critical part of wireless sensor networks, yet little work has been done on formal verification of the protocols in presence of both intruder nodes and mobility. We present a formal trace-based model to verify protocols doing neighborhood discovery, and we provide a formal definition of (1)neighborhood and (k)-neighborhood. We also analyze a protocol from the literature, and show some conditions needed for its correctness. Finally, we present the groundwork for a protocol which discovers (k)-neighborhood based on (1)-neighborhood data under some assumptions, and prove that it remains secure even if an intruder interferes.

Mots clés: Formal verification Wireless Sensors Networks Communication Protocols Neighborhood Discovery; Formal verification; Wireless Sensors Networks; Communication Protocols; Neighborhood Discovery

Domaines: Cryptographie et sécurité [cs.CR]

Raphaël Jamet, Pascal Lafourcade. Formal Model for (k)-Neighborhood Discovery Protocols. Advances in Network Analysis and its Applications, 18, 2013, Advances in Network Analysis and its Applications. Mathematics in Industry, 978-3-642-30903-8. ⟨10.1007/978-3-642-30904-5_8⟩. ⟨hal-03885239⟩