Graph Theory Application in Selective Encryption Mechanism for Wireless Ad Hoc Networks
Wireless ad hoc network is basically a decentralized type of wireless network in which each node forward data to other nodes. The decision of which node forwards data at a particular time is made dynamically based on the network connectivity. Due to the lack of central coordination and open air propagation of signals, ad hoc networks are more vulnerable to security threats and attacks. Hence a proper security mechanism needs to be implemented in order to protect them from cryptic attacks. This paper proposes a selective encryption mechanism using message specific key and spanning tree concept of graph theory. Since, only selected packets are encrypted using selective encryption scheme it reduces the communication overhead.