On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

Abstract

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol.To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum Key Distribution Networks

“…If a node does not receive a Hello message from a neighbor within a fixed dead interval In addition, DSDV uses triggered updates when the network topology suddenly changes. If periodic and triggered updates occur in a short period of time, the values may be merged and only the periodic update will be performed [59,85]. In contrast, GPSRQ relies on the knowledge of the geographical position and state of links to neighbors, which provides a high level of network scalability.…”

“…4, where a lower value means a better quantum channel state. In the example shown in 2) The Public Channel Status Metric: Instead of using popular approaches from conventional or overlay networks [30,59], we use meta-data of keys such as the time duration of the key establishment process to effectively assess the state of the public channel. We define P m,s,i with Equation (7) to evaluate the state of the public channel between nodes s and i where T last,s,i is the length of time spent on the establishment of the key material at the time of measurement and T maximal,s,i is the maximum time that can be tolerated for the establishment of the key.…”

Usability of Destination-Sequenced Distance Vector Routing Protocol Routes

“…This paper addressed the question of the usability of destination-sequenced distance vector routing protocol routes. The work summarized the measurements that were performed using NS-3 v3.28 4 simulator with BRITE random topology generation. Our measurements of 3960 simulations, showed that, in general, 19.32% routes were used.…”

“…However, if possible, the node will strive to merge triggered and periodic changes into one packet to minimize the information being sent. The period in which such an approach is considered is 5 seconds before sending a periodic report [4], [13]. It is important to note that DSDV uses the same message format for both periodicals and triggered reporting.…”

“…On the other hand, protocols that continuously exchange information about all possible paths are designated as proactive protocols. Such protocols, keep up-to-date information about the state of the network through exchanges of information on network topology or exchanges of routing tables even no data traffic exists [3], [4]. Aiming to simplify the problem by introducing a hierarchical network organization, hybrid protocols are based on the combination of proactive and reactive routing.…”