Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On-demand routing in multi-hop wireless mobile ad hoc networks
On-demand routing in multi-hop wireless mobile ad hoc networks
Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Mobile Ad Hoc Routing Using Rough Set Theory
ICHIT '06 Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02
Extensions in Mobile Ad Hoc Routing Using Variable Precision Rough Sets
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Rough set based ad-hoc on demand distance vector routing algorithm for MANETs
Proceedings of the 2nd Bangalore Annual Compute Conference
Adaptive partial dominating set algorithm for mobile ad-hoc networks
Proceedings of the 2nd Bangalore Annual Compute Conference
Flooding in wireless ad hoc networks
Computer Communications
| Hi-index | 0.00 |
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.