Rough set based ad-hoc on demand distance vector routing algorithm for MANETs

Authors:
A Nagaraju;S Ramachandram
Affiliations:
Kamala Institute of Tech & Science, Huzurabad, Karimnagar, Andhrapradesh;Osmania University, Hyderabad, Andhrapradesh
Venue:
Proceedings of the 2nd Bangalore Annual Compute Conference
Year:
2009

Citing 10
Cited 2

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
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
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
Flooding in wireless ad hoc networks

Computer Communications

A strategy to reduce flooding in grid Fisheye State routing GFSR protocol with weighted rough set model using MANET

International Journal of Mobile Network Design and Innovation
Reduce redundant broadcasting in MANETs using rough sets

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.