Skip to Main Content
In recent years, various routing protocols have been proposed for ad hoc networks. Most of these protocols are based upon simulation and security. These protocols still lack in terms of performance efficiency of routing protocols such as avoidance of route breaking, sensing of breakage in route, security and reliability (basically authentication of mobile hops in the real ad hoc networks. i.e. during data packets transmission, if link is disconnected or lost then in place of retransmission or reestablishment of route, node/router focused on using the best available route which forwards data packets through hops/nodes). The paper presents an approach in which, each node communicates to its' surrounding nodes/routers with calculated probability, and reduces the overhead of the routing protocols. In the proposed approach, the routing tables based upon calculated probability are being maintained. This enables to select the most optimal path for transmitting the data packets by sensing the breaking of route so that it can avoid the broken route and simultaneously authenticate the hops/nodes. Routes are executed in which all nodes' communication depend on the probability and the topology of the network, i.e. it helps to detect the mobility of nodes. By using probabilistic approach, we are adding significant improvement onstandard metrics of AODV protocols. We are using a new recent modeling formalism, called the omega-calculus, which will naturally and succinctly model our proposed protocol, and is able to make the routing tables based upon probabilistic approach, sensing of neighbors, detects and maintains the table due to mobility of nodes, authentication of new nodes, and listing of broadcasts and unicast.