Authors: A. Nagaraju; S. Ramachandram
Addresses: Department of Computer Science, Central University of Rajasthan, Kishangarh, Rajasthan, India ' Department of Computer Science and Engineering, Osmania University, Hyderabad, AP, India
Abstract: A Mobile Ad-Hoc Network (MANET) consists of wireless hosts which may move often. The movement of hosts results in frequent changes in paths. In these cases, finding a path from source to destination becomes difficult. The well-known Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) are routing protocols which are in vogue to determine a route when no route exists or a route breaks. As such to establish a new path from source to destination, it broadcasts control packets (route request packets), which increase the network bandwidth consumption. As MANETs have limited bandwidth, it is essential to reduce the control packets. We propose mathematical models which use the concept of rough set and Weighted Rough Set (WRS) to minimise the route request packets in the existing AODV and DSR routing protocols. Rough set theory is a mathematical tool to deal with vagueness, uncertainty; and WRS theory is an extension to rough set theory which also considers the importance of the objects.
Keywords: rough sets; weighted rough set; WRS; AODV; DSR; dynamic source routing; routing protocols; route requests; redundant broadcasting; MANETs; mobile ad-hoc networks; mobile networks; mathematical modelling.
International Journal of Wireless and Mobile Computing, 2014 Vol.7 No.2, pp.103 - 122
Received: 19 Mar 2013
Accepted: 16 Jul 2013
Published online: 06 Mar 2014 *