rough set based ad-hoc on demand distance vector routing algorithm for manets
The existing reactive routing algorithms in Mobile Ad-hoc Networks (MANETs) generally send route request packet to all the neighbor nodes when it needs to find the destination. This greatly reduces the performance of network and consumes much of the bandwidth. The existing routing algorithms such as Ad-hoc On-demand Routing Algorithm (AODV) and Dynamic Source Routing (DSR) are suitable for networks with frequent changing topology. In this paper we propose a technique to reduce broadcasting by finding equivalence classes based on rough set concept among the neighbors of a source node. This protocol tries to establish a long term valid path from source node to destination node. This means the protocol is of more use full in several applications such as multimedia and video conferences.
rough set route request aodv equivalence class