A Complete Analysis of Current Routing Protocols in Mobile Adhoc Networks
By Balamurugan Balusamy
The wireless networks are playing a vital role for the world of technology. The wireless networks are also called as mobile network. In mobile networks are basically classified into two main categories. The first is known as the “infrastructure networks”. These types of networks are fixed and wired gateways. The bridges for these networks are known as “base station”. A mobile unit with in these networks connects to, and communicates with, the nearest base station that is within its communication radius. As the mobile travels out of range of one base station and into the range of another, a “handoff” occurs from the old base station to the new, and the mobile is able to continue communication seamlessly throughout the network. The second type of mobile wireless network is the infrastructure less mobile network, commonly known as an “ad hoc network ”. Infrastructure less networks has no fixed routes; all nodes can travel throughout the network and can communicate dynamically. The mobile nodes are working as network routers, which discover and maintain routes to other nodes in the network. This article I discussed the routing protocols designed for these ad hoc networks by first describing the operation of each of the protocols and then comparing their various characteristics. The next section presents a discussion of two subdivisions of ad hoc routing protocols. Another section discuss current table-driven protocols, while a later section describes those protocols which are classified as on-demand protocols, followed by demand-driven and on-demand protocols. Cluster head Gateway Switch Routing The Cluster head Gateway Switch Routing (CGSR) protocol differs from the previous protocol in the type of addressing and network organization scheme employed. Instead of a “flat” network, CGSR is a clustered multi hop mobile wireless network with several heuristic routing schemes [4]. In this method a cluster head controlling a group of ad hoc nodes, a framework for code separation, channel access, routing, and bandwidth allocation can be achieved. A cluster head selection algorithm is utilized to elect a node as the cluster head using a distributed algorithm within the cluster. In cluster head method we are having one main disadvantage, because frequently the nodes change the cluster head this will adversely affect routing protocol performance. The nodes are busy in cluster head selection rather than relaying. Hence, instead of invoking cluster head reselection every time the cluster membership changes, a Least Cluster Change (LCC) clustering algorithm is introduced. Using LCC, cluster heads only change when two cluster heads come into contact, or when a nodes moves out of contact of all other cluster heads. The Wireless Routing Protocol The Wireless Routing Protocol (WRP) described in [5] is a table-based protocol with the goal of maintaining routing information among all nodes in the network. Each node in the network is responsible for maintaining four tables. •
Previous Article :: Next Article
|
