A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

Abstract  Wireless ad hoc networks are envisioned to be randomly deployed in versatile and potentially hostile environments. Hence, providing secure and uninterrupted communication between the un-tethered network nodes becomes a critical