Neighborhood rough set-based route selection for mobile ad hoc networks

The main aim of this paper is to address the problem of redundant broadcast packets using the extension of rough set concept. In general, a rough set is a mathematical tool for dealing with issues of uncertainty. In MANET, mobile nodes are moving from one place to another place in a simulation environment; hence, it creates uncertainty issues. Due to the fast mobility of mobile nodes, network metrics such as bandwidth and hop count vary. The findings were useful in identifying and improving the network's performance. The proposed NRS-based route selection approach has been compared with conventional techniques such as rough set, covering rough set (CRS). The reduced control packets are obtained using pruning concept based on selection of one-hop and two-hop nodes. Eventually, the proposed approach proved that it attains a higher throughput (85%), reducing the route request packets (3406) and delay of data transmission (0.02274 s). Also, two well-known ad hoc routing protocols were used such as Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector (AODV) protocols.