Dynamic Destination-Sequenced Distance-Vector Routing Protocol Description: Dynamic Destination-Sequenced Distance-Vector (DSDV) Routing Protocol is a tabledriven routing scheme.

In which path calculation is based on Bellman-Ford algorithm. Each node in the network maintains a forwarding table with attributes for destination address listing all available destinations, Next hop address; hops count metric, sequence number generated by the destination node to prevent the formation of routing loops, Install field to determine when the stale routes must be deleted, Flag and Stable data. figure shows the sample ad hoc network and Table 1 shows the forwarding table used by the Node B. In order to maintain the path each node periodically advertises the forwarding table information such as Destination address, hop count metric and the sequence number generated by the neighbor and its own newer sequence number to its neighbors; the sequence numbers are generally even if a link is present else, an odd number is used. To reduce the amount of information in these packet two types of packet is defined. One is infrequent full dump packet to carry all available routing information other is incremental to carry only the information that is changed. Route table is updated when it receives the update packet with a newer sequence number for the destination, if the sequence number is same then the route with the smallest hop count is chosen. DSDV uses settling time to dampen route fluctuations caused by mobility of nodes.

C B D A G E

Destination A B C D E F G

Next Hop A B C D D D D

Metric 1 0 1 1 2 3 2

Sequence Number S406_A S280_B S156_C S348_D S857_E S050_F S540_G

Install T001_B T001_B T002_B T001_B T001_B T002_B T002_B

Flags

Stable Data Ptr1_A Ptr1_B Ptr1_C Ptr1_D Ptr1_E Ptr1_F Ptr1_G

Advantage: Moderate memory requirement O(n) ; n- number of nodes Ensures loop free paths Does not require nodes to participate in complex update coordination protocol

Disadvantage: Average convergence time Uses battery power and a small amount of bandwidth even when the network is idle Incremental update period Settling time averaging method Full update period

Wireless Routing Protocol Wireless Routing Protocol, is a proactive destination based routing protocol. Unlike DSDV, WRP maintains four different table/list namely distance table, a routing table, a link cost table and a message transmission list; for routing purpose. Distance table of a node is a matrix containing distance for each destination via each neighbor. Routing table is a vector for each destination with entry for identifier, distance to destination, Predecessor and successor of the chosen shortest path for detecting loops and to avoid counting-to-infinity problem; and a marker flag to identify whether the path is simple, loop or invalid. Link cost table contains the cost of sending the information through each of its neighbor and the number of periodic update since an error-free message was received from that neighbor. Update message are used to exchange routing table with its neighbor. MRL contains the sequence number of update message, retransmission counter, a flag to denote whether ACK is sent for the update message, list of updates in the message shortest Nodes communicate about the distance and second-to-last hop for each destination

Advantages: Faster convergence Fewer table updates

Disadvantages: Requires large amount of memory to store multiple tables Nodes should have high processing power Limited scalability

II. CHARACHTERISTICS OF QoS The major challenges in providing QoS in Adhoc wireless networks have certain unique characteristics that pose several difficulties in provisioning QoS. Some of the characteristics are given below.

Adhoc wireless networks do not have any restriction on mobility, the networks topology changes dynamically. Hence

the admitted QoS sessions may suffer due to frequent path breaks, thereby requesting such session to be reestablished over new path.

Adhoc wireless networks maintain both the link-specific state information and flow specific state information. The link-specific state in formation includes bandwidth, delay, delay jitter, loss rate, error rate, stability, cost, and distance value for each link. The flow specific information include session ID, source address, destination address, and QoS requirements of the flow (such as maximum bandwidth requirements, minimum bandwidth requirements, maximum delay, and maximum delay jitter).

Unlike wireless LAN and cellular networks, Adhoc wireless networks do not have central controller to coordinate the activity of nodes. -prone shared radio channel. The radio channel is a broadcast medium by nature. During propagation through the wireless medium, the radio waves suffer from several impairments such as attenuation, multipath propagation, and interference.

The hidden terminal problem is inherent in Adhoc wireless networks. This problem occurs when packets originating from two or more sender node, which are not within the direct transmission range of each other, collide at a common receiver node. It necessitates the retransmission of the packet, which may not be acceptable for flow that has stringent

QoS requirements. The RTS/CTS control packet exchange mechanisms, proposed [3] and adopted later in the IEEE 802.11 standard [4] reduces the hidden terminal problem only to a certain extent.

Resources such as bandwidth, battery life, storage space and processing capabilities are limited in Adhoc wireless networks. Out of these range band width and battery life are critical resource, the availability of which significantly affect the performance of the QoS provisioning mechanism. Hence efficient resource management mechanisms are required for optimal utilization of these scarce resources.

Due to the broadcast nature of the wireless medium, communication through a wireless channel is highly insecure. Therefore security is an important issue in Adhoc wireless networks, especially for military and tactical applications.

Mobile Ad hoc Network mobile, multi-hop wireless network autonomous operation; independent of any fixed infrastructure nodes must cooperate to provide network infrastructure Applications tactical communication ubiquitous computing sensor networks MANET characteristics

 highly dynamic topology, with frequent and unpredictable connectivity changes bandwidth-constrained, variable-capacity links hidden/exposed terminals energy-constrained nodes

MANET routing routes are dynamically discovered route errors occur frequently new routes are discovered fixed network routing protocols arent effective fixed network routing protocols arent effective