Secured Routing Using Neighbour Coverage with Minimum Overhead in Ad Hoc Networks

Abstract

A wireless ad hoc network is a dispersed type of wireless network. The network is called as ad hoc as it does not rely on any pre existing infrastructure. Routing decisions are ready by node itself, so the determination of which node to forward data is prepared dynamically based on network connectivity. The overhead of a route discovery cannot be neglected. In this, Neighbour coverage protocol proposes for reducing routing overhead and to utilize the neighbour coverage knowledge and the probabilistic mechanism, which can radically decrease the number of retransmissions to reduce the routing overhead, and can also improve the routing performance. Due to high mobility of nodes in ad hoc networks, there exist regular link breakages, which lead to frequent path failures and route discoveries. ALERT dynamically partitions the network field into zones and arbitrarily chooses nodes in zones as intermediate relay nodes, which form a non-traceable unsigned route. In addition, it conceals the data initiator/receiver among many initiators/receivers to build up source and destination anonymity protection. Thus, ALERT offers anonymity security to sources, destinations, and routes for effective counter intersection and timing attacks and overheads are reduced.