|
Mobile Ad-hoc Networks An ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the support of any stand-alone infrastructure or centralized administration.Mobile Ad-hoc networks are self-organizing and self-configuring multihop wireless networks where, the structure of the network changes dynamically. This is mainly due to the mobility of the nodes [8]. Nodes in these networks employ the same random access wireless channel, cooperating in a friendly manner to engaging themselves in multihop forwarding. The nodes in the network not only acts as hosts but likewise as routers that route selective information to/from other nodes in network. In mobile ad-hoc networks where there is no infrastructure help as is the case with wireless networks, and since a destination no de might be out of range of a source node transmitting packets; a routing routine is always necessitated to find a path so as to forward the packets appropriately amid the source and the destination. Within a cell, a base station may reach all mobile nodes without routing thru broadcast in mutual wireless networks. In the case of ad-hoc networks, each node ought to be capable to forward info for other nodes. This produces further and added difficulties along with the troubles of dynamic topology which is unpredictable connectivity changes. • Problems with routing in Mobile Ad-hoc Net-works - Asymmetric links: Most of the wired networks rely on the symmetric links which are always fixed. But this is not a case with ad-hoc networks as the nodes are mobile and constantly altering their position within network. For example consider a MANET (Mobile Ad-hoc Network) where node B sends a signal to node A but this does not tell anything regarding the quality of the connection in the reverse direction. - Routing Overhead: In wireless ad hoc networks, no des oftentimes change their emplacement within network. So, a lot of stale routes are generated in the routing table which leads to unnecessary routing overhead. - Interference: This is the major problem with mobile ad-hoc networks as links come and go depending on the transmission characteristics, one transmission might interfere with another one and no de might overhear transmissions of other nodes and may corrupt the total transmission. - Dynamic Topology: This is also the major problem with ad-hoc routing since the topology is not constant. The mobile node might move or medium characteristics might change. In ad-hoc networks, routing tables must in some way reject these changes in topology and routing algorithms have to be adapted. For example in a fixed network routing table updating takes place for each 30sec. This updating frequency might be very low for ad-hoc networks. • Classification of routing Protocols in MANET’s Classification of routing protocols in MANET’s may be done in a lot of ways, but most of these are done depending on routing system and network structure. According to the routing system the routing protocols may be categorized as Table-driven and source initiated, while depending on the network structure these are classified as at routing, hierarchical routing and geographic position assisted routing. Both the Table-driven and source initiated protocols come under the Flat routing. Table-Driven routing protocols (Proactive) These protocols are likewise called as proactive protocols since they maintain the routing selective information even before it is needed. Each and each node in the network maintains routing info to each other node in the network. Routes selective information is in general kept in the routing tables and is sporadically altered as the network topology changes. Many of these routing protocols come from the link-state routing. There subsist a heap of divergences amongst the protocols that come beneath this category depending on the routing data being modified in each routing table. Furthermore, these routing protocols maintain dissimilar number of tables. The proactive protocols are not suitable for more prominent networks, as they need to maintain node entries for each and each node in the routing table of each node. This causes more overhead in the routing table leading to consumption of more bandwidth. On Demand routing protocols (Reactive) These protocols are also called reactive protocols since they don’t maintain routing info or routing action at the network nodes if there is no communication. If a node wants to send a packet to another node then this proto col searches for the route in an on-demand manner and establishes the connection in order to transmit and receive the packet. The route invention ordinarily occurs by flooding the route request packets allround the network. Destination Sequenced Distance Vector (DSDV) Protocol The destination sequenced distance vector routing protocol is a proactive routing protocol which is a modification of conventional Bellman-Ford routing algorithm. This protocol adds a new attribute, sequence number, to each route table entry at each node. Routing table is maintained at each node and with this table; node transmits the packets to other nodes in the network. This protocol was motivated for the use of data interchange along altering and arbitrary paths of interconnection which may not be close to any base station. Protocol Overview and activities Each node in the network maintains routing table for the transmission of the packets and also for the connectivity to dissimilar stations in the network. These stations list for all the available destinations, and the number of hops required to reach each destination in the routing table. The routing entry is tagged with a sequence number which is originated by the destination station. In order to maintain the consistency, each station transmits and updates it is routing table periodically. The packets being broadcasted amongst stations indicate which stations are accessible and how a lot of hops are required to reach that peculiar station. The packets may be transmitted containing the layer 2 or layer 3 address. Routing info is advertised by broadcasting or multicasting the packets which are transmitted sporadically as when the nodes move within the network. The DSDV protocol requires that each mobile station in the network must constantly, publicize to each of it is neighbors, it is own routing table. Since, the entries in the table my modify very quickly, the publicity must be made ofttimes to make sure that each node may locate it is neighbours in the network. This agreement is placed, to make sure the shortest number of hops for a route to a destination; in this way the node may interchange it is selective information even if there is no direct communicating link. The data broadcast by each node will incorporate it is new sequence number and the following selective information for each new route: - The destination address - The number of hops required to reach the destination and - The new sequence number, in the first place stamped by the destination The transmitted routing tables will also incorporate the hardware address, network address of the mobile host transmitting them. The routing tables will incorporate the sequence number invented by the transmitter and hence the most new destination sequence number is preferent as the basis for making forwarding decisions. This new sequence number is likewise modified to all the hosts in the network which may determine on how to maintain the routing entry for that originating mobile host. After receiving the route information, receiving node increments the metric and transmits info by broadcasting. Incrementing metric is done before transmission because, incoming packet will have to travel one more hop to reach it is destination. Time amid broadcasting the routing selective information packets is the other primary factor to be considered. When the new selective information is received by the mobile host it will be retransmitted soon effecting the most rapid possible dissemination of routing selective information amidst all the co-operating mobile hosts. The mobile host cause broken links as they move from place to place within the network. The broken link may be detected by the layer2 protocol, which may be described as infinity. When the route is broken in a network, then without delay that metric is assigned an infinity metric there by determining that there is no hop and the sequence number is updated. Sequence numbers originating from the mobile hosts are specified to be even number and the sequence numbers generated to indicate infinity metrics are odd numbers. The broadcasting of the data in the DSDV protocol is of two types namely: Full dump and incremental dump. Full dump broadcasting will carry all the routing info while the incremental dump will carry only selective information that has changed since last full dump. Irrespective of the two types, broadcasting is done in network protocol info units (NPDU). Full dump requires multiple NPDU’s while incremental requires only one NPDU to fit in all the information. When an data packet is received from another node, it compares the sequence number with the available sequence number for that entry. If the sequence number is larger, then it will update the routing data with the new sequence number else if the data arrives with the same sequence number it looks for the metric entry and if the number of hops is less than the former entry the new selective information is altered (if info is same or metric is more then it will discard the information). While the nodes data is being modified the metric is increased by 1 and the sequence number is likewise increased by 2. Similarly, if a new node enters the network, it will announce itself in the network and the nodes in the network update their routing data with a new entry for the new node. During broadcasting, the mobile hosts will transmit their routing tables sporadically but due to the ordinary movements by the hosts in the networks, this will lead to neverending burst of new routes transmissions upon each new sequence number from that destination. The solution for this is to delay the publicity of such routes until it shows up a better metric. Operation at Layer2 Address stored in the routing table at the mobile hosts will correspond to the layer at which the DSDV protocol is operated. Layer3 will use network layer addresses for the next hop and destination addresses and layer 2 will use the MAC address for it is operation. A difficultness is arise at the layer 3 operation and a way ought to be provided to resolve these layer-3 addresses into MAC addresses. Otherwise, difficulties like broadcast address solution would be necessitated and loss of bandwidth would be observed. This loss could be significant because such mechanisms will require retransmission by each mobile node. The solution here is to provide layer3 protocol info along with the layer2 data at the layer 2 operation. Each mobile node would advertise, reachability, info when it comes to the layer3 protocols at that destination. Advantages of DSDV - DSDV proto col warrantees loop free paths. - Count to infinity problem is scaled down in DSDV. - We may stay clear from extra traffic with incremental updates rather of full dump updates. - Path Selection: DSDV maintains only the best path rather of preserving multiple paths to each destination. With this, the amount of space in routing table is reduced. Limitations of DSDV - Wastage of bandwidth due to unnecessary publicity of routing info even If there is no modify in the network topology. - DSDV doesn’t help Multi path Routing. - It is di cult to determine a time delay for the advert of routes. - It is di cult to maintain the routing table’s advert for more prominent network. Each and each host in the network will have to maintain a routing table for advertising. But for larger network this would lead to overhead, which consumes more bandwidth. Ad-hoc On-Demand Distance Vector (AODV) Protocol AODV is a very simple, efficient, and effective routing protocol for Mobile Ad-hoc Networks which do not have fixed topology. This algorithm was motivated by the fixed bandwidth that is available in the media that are applied for wireless communications. It borrows most of the beneficial conceptions from DSR and DSDV algorithms. The on demand route invention and route maintenance from DSR and hop-by-hop routing, usage of node sequence numbers from DSDV make the algorithm cope up with topology and routing information. Obtaining the routes strictly on-demand makes AODV a very useful and desired algorithm for MANETs. Working of AODV Each mobile host in the network acts as a specialized router and routes are received as needed, therefore making the network self-starting. Each node in the network maintains a routing table with the routing selective information entries to it is neighbouring no des, and two discerned counters: a node sequence number and a broadcast-id. When a node (say, source node ‘S’) has to commune with another (say, destination node ‘D’), it increments it is broadcast-id and initiates path invention by broadcasting a route request packet RREQ to it is neighbours. The RREQ holds the following fields: - source-addr - source-sequence# -to maintain freshness data when it comes to the route to the source. - dest-addr - dest-sequence# – specifies how fresh a route to the destination will have to be before it is accepted by the source. - hop-cnt The (source-addr, broadcase-id) pair is applied to tell apart the RREQ uniquely. Then the dynamic route table entry establishment begins at all the nodes in the network that are on the path from S to D. As RREQ travels from node to node, it mechanically sets up the reverse path from all these no des back to the source. Each no de that receives this packet records the address of the node from which it was received. This is called Reverse Path Setup. The nodes maintain this data for sufficient time for the RREQ to traverse the network and construct a reply to the sender and time depends on network size. If an intermediate no de has a route entry for the desired destination in it is routing table, it compares the destination sequence number in it is routing table with that in the RREQ. If the destination sequence number in it is routing table is less than that in the RREQ, it rebroadcasts the RREQ to it is neighbours. Otherwise, it unicasts a route reply packet to it is neighbour from which it was received the RREQ if the same request was not processed antecedently (this is identified using the wide case-id and source-addr). Once the RREP is generated, it travels back to the source, based on the reverse path that it has set in it until travelled to this node. As the RREP travels back to source, each node along this path sets a forward pointer to the node from where it is receiving the RREP and records the latest destination sequence number to the request destination. This is called Forward Path Setup. If an intermediate node receives another RREP after propagating the firstborn RREP towards source it checks for destination sequence number of new RREP. The intermediate node updates routing info and propagates new RREP only, - If the Destination sequence number is greater, OR - If the new sequence number is same and hop count is small, OR Otherwise, it just skips the new RREP. This ensures that algorithm is loop-free and only the most effective route is used. Route Table Management Each mobile node in the network maintains a route table entry for each destination of interest in it is route table. Each entry holds the following info: - Destination - Next hop - Number of hops - Destination sequence number - Active neighbours for this route - Expiration time for the route table entry The other utile data contained in the entries along with source and destination sequence numbers is called soft-state selective information affiliated to the route entry. The info when it comes to the active neighbours for this route is maintained so that all active source nodes may be notified when a link along a path to the destination breaks. And the intention of route request time expiration timer is to purge the reverse path routing entries from all the nodes that do not lie on the active route. Interesting conceptions of AODV The conceptions of AODV that make it desirable for MANETs with fixed bandwidth include the following: - Minimal space complexity: The algorithm makes sure that the nodes that are not in the active path do not maintain info in regards to this route. After a node receives the RREQ and sets a reverse path in it is routing table and propagates the RREQ to it is neighbours, if it does not receive any RREP from it is neighbours for this request, it deletes the routing selective information that it has recorded. Advanced uses of AODV - Maximum utilization of the bandwidth: This may be considered the major accomplishment of the algorithm. As the protocol does not require periodic international advertisements, the demand on the available bandwidth is less. And a monotonically increased sequence number counter is maintained by each node in order to supersede any stale cached routes. All the intermediate nodes in an active path updating their routing tables also make sure of greatest or most complete or best possible utilization of the bandwidth. Since, these routing tables will be employed repeatedly if that intermediate node receives any RREQ from another source for same destination. Also, any RREPs that are received by the nodes are equated with the RREP that was propagated last using the destination sequence numbers and are discarded if they are not better than the already passed around RREPs. - Simple: It is simple with each no de behaving as a router, preserving a simple routing table, and the source node initiating path invention request, making the network self-starting. - Most effective routing info: After spreading an RREP, if a node finds receives an RREP with littler hop-count, it updates it is routing info with this better path and propagates it. - Most current routing info: The route data is received on demand. Also, after spreading an RREP, if a no de finds receives an RREP with dandier destination sequence number, it updates it is routing info with this latest path and propagates it. - Loop-free routes: The algorithm maintains loop free routes by using the simple logic of nodes discarding non better packets for same broadcast-id. - Coping up with dynamic topology and broken links: When the nodes in the network move from their places and the topology is changed or the links in the active path are broken, the intermediate node that discovers this link breakage propagates an RERR packet. And the source node re-initializes the path invention if it still desires the route. This ensures quick response to broken links. - Highly Scalable: The algorithm is highly scalable because of the minimum space complexity and broadcasts obviated when it equated with DSDV. Advanced uses of AODV - Because of it is reactive nature, AODV may handle highly dynamic behaviour of Vehicle Ad-hoc networks. - Used for both unicasts and multicasts using the ‘J’ (Join multicast group) flag in the packets. Limitations/Disadvantages of AODV - Requirement on broadcast medium: The algorithm expects/requires that the no des in the broadcast medium may detect each other’s’ broadcasts. - Overhead on the bandwidth: Overhead on bandwidth will be occurred equated to DSR, when an RREQ travels from node to node in the pro cess of discovering the route selective information on demand, it sets up the reverse path in itself with the addresses of all the no des through which it is passing and it carries all this info all it is way. - No reuse of routing info: AODV lacks an effective route maintenance technique. The routing selective information is always received on demand, including for mutual case traffic. - It is vulnerable to misuse: The messages may be misapplied for insider attacks including route disruption, route invasion, node isolation, and resource consumption. - AODV lacks aid for high throughput routing metrics: AODV is designed to aid the shortest hop count metric. This metric favours long, low bandwidth links over short, high-bandwidth links. - High route invention latency: AODV is a reactive routing protocol. This means that AODV does not discover a route until a flow is initiated. This route invention latency result may be high in large-scale mesh networks. Discussion and Conclusion Discussion After reviewing the conception of wireless ad-hoc networks and two routing protocols namely, AODV and DSDV. We would like to make a comparative discussion of both the protocols with their pro’s and con’s. Most of the discussion being made is based on former studies and implementations. - DSDV is a proactive routing proto col, which maintains routes to each and each node in the network, while AODV is a reactive routing protocol which finds the path on demand or whenever the route is required. - Broadcasting in DSDV is done sporadically to maintain routing updates and in AODV, only hello messages are passed around to it is neighbours to maintain local connectivity. - DSDV routing algorithm maintains a sequence number conception for updating the latest selective information for a route. Even, the same conception is adapted by AODV routing protocol. - Due to the periodic updates being broadcasted in DSDV, bandwidth is wasted when the no des are stationary. But, this is not the case with AODV, as it propagates only hello messages to it is neighbours. - For sending info to a peculiar destination, there is no need to find a route as DSDV routing protocol maintains all the routes in the routing tables for each node. While, AODV has to find a route before sending a data. - Overhead in DSDV is more when the network is huge and it becomes hard to maintain the routing tables at each node. But, in AODV overhead is less as it maintains little tables to maintain local connectivity. - DSDV cannot handle mobility at high speeds due to lack of substitute routes consequently routes in routing table is stale. While in AODV this is the other way, as it find the routes on demand. - Throughput decreases comparatively in DSDV as it needs to publicize periodic updates and even-driven updates. If the node mobility is high then occurrence of event driven updates are more. But in AODV it doesn’t publicize any routing updates and accordingly the throughput is stable. Conclusion The study reveals that, DSDV routing protocol consumes more bandwidth, because of the usual broadcasting of routing updates. While the AODV is better than DSDV as it doesn’t maintain any routing tables at nodes which results in less overhead and more bandwidth. From the above, it may be assumed that DSDV routing protocols works better for littler networks but not for larger networks. So, my conclusion is that, AODV routing protocol is best suitable for general mobile ad-hoc networks as it consumes less bandwidth and lower overhead when equated with DSDV routing protocol. |
Ad Hoc Mesh Network
Kind to beginners but likewise utile generally
This entry was posted in mesh-network and tagged ad-hoc networks, MANET, mobile ad-hoc networks, routing information, routing protocol, routing protocols. Bookmark the permalink.