Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 46 for “"Routing Metric"”.

  1. Inverse Reinforcement Learning and Routing Metric Discovery

    Uncovering the metrics and procedures employed by an autonomous networking system is an important problem with applications in instrumentation, traffic engineering, and game-theoretic studies of multi-agent environments. This thesis presents a method for utilizing inverse reinforcement learning …

    vt Repository record for Inverse Reinforcement Learning and Routing Metric Discovery (opens in a new tab)

  2. A new routing metric for wireless mesh networks

    … nodes. To achieve such transmission, a routing algorithm should select better paths by taking the quality of wireless links into account. Simple path selection based on minimal hop count often leads to poor performance due to the fact that paths with low hop count often have higher …

    iastate Repository record for A new routing metric for wireless mesh networks (opens in a new tab)

  3. Design, implementation and simulation of wireless mesh networks routing protocols with link quality and interference awareness

    Routing metrics are vital when determining the performance of Wireless Mesh Networks (WMNs). During the implementation of routing protocols, routing metrics are assigned to different paths and the calculation of the best paths is a function for predicting the best routing path. This study proposes …

    nwu-za Repository record for Design, implementation and simulation of wireless mesh networks routing protocols with link quality and interference awareness (opens in a new tab)

  4. An Automatic Solution to Checking Compatibility between Routing Metrics and Protocols

    Routing metrics are important mechanisms to adjust routing protocols' path selection according to the needs of a network system. However, if a routing metric design does not correctly match a particular routing protocol, the protocol may not be able to find an optimal path; routing loops can be …

    vt Repository record for An Automatic Solution to Checking Compatibility between Routing Metrics and Protocols (opens in a new tab)

  5. Cognitive routing for wireless ad hoc networks

    This thesis examines the design of cognitive routing to improve wireless ad hoc network performance in terms of throughput and delay, as well as reducing the impact of relaying on the network, without deteriorating end-to-end capacity. Routing metrics are designed to replace the conventional …

    whiterose Download PDF for Cognitive routing for wireless ad hoc networks (opens in a new tab)

  6. Integration of network coding, spatial diversity and opportunistic routing/forwarding in wireless mesh networks

    … coding, spatial diversity and opportunistic routing/forwarding capitalize on the broadcast nature of the wireless links to improve the network performance. These techniques target different network conditions and usually are considered in separation. In this thesis a cross-layer based …

    ets-quebec Download PDF for Integration of network coding, spatial diversity and opportunistic routing/forwarding in wireless mesh networks (opens in a new tab)

  7. Attacks and countermeasures on routing protocols in wireless networks

    <p>Routing in wireless networks is not an easy task as they are highly vulnerable to attacks. The main goal of this work is to study the routing performance and security aspects of wireless ad hoc and mesh networks. Most of the routing protocols use hop-count as the routing metric. Hop count metric …

    iastate Repository record for Attacks and countermeasures on routing protocols in wireless networks (opens in a new tab)

  8. Energy efficiency in wireless networks

    … power control at the MAC layer and power aware routing at the network layer. One poweraware routing metric is minimizing the aggregate transmission power on a path from source to destination. This metric has been used along with BASIC-like power control under the assumption that it can save …

    tamu Repository record for Energy efficiency in wireless networks (opens in a new tab)

  9. Performance evaluation of ETX on grid based wireless mesh networks

    … services. The Expected Transmission Count (ETX) routing metric has been put forward recently as an advanced routing metric to provide high QoS for static WMNs. Most previous research in this area suggests that ETX outperforms other routing metrics in throughput and efficiency. However, it has …

    unsw Repository record for Performance evaluation of ETX on grid based wireless mesh networks (opens in a new tab)

  10. Flexible and Scalable Routing Approach for Mobile Ad Hoc Networks by Function Approximation of Q-Learning

    … source to a destination in a network is known as routing. Dynamic topology and unstable link states are the main problems facing routing in MANETs. This thesis employs reinforcement learning, namely Q-learning to develop a routing mechanism. Features inspired from the network are used in …

    calgary Repository record for Flexible and Scalable Routing Approach for Mobile Ad Hoc Networks by Function Approximation of Q-Learning (opens in a new tab)

  11. A Cross-Layer Design for Reducing Packet Loss Caused by Fading in a Mobile Ad Hoc Network

    … to fading. Secondly we show that modifying the routing metric can improve system performance. We show that a cross-layer design for the TSP protocols and routing metrics that jointly considers both link and network performance results in better system performance compared to selecting each …

    clemson Repository record for A Cross-Layer Design for Reducing Packet Loss Caused by Fading in a Mobile Ad Hoc Network (opens in a new tab)

  12. Flow-based dynamic routing in uncertain network environments

    In this dissertation we study flow-based dynamic routing schemes. We propose routing schemes to achieve good network level performance such as flow blocking rate, and user level performance such as flow throughput. The design principle is to route a flow so that we can satisfy its Quality of …

    texas Repository record for Flow-based dynamic routing in uncertain network environments (opens in a new tab)

  13. Exploiting MAC-layer cooperative retransmission in wireless mesh networks

    … wireless networks, data transmissions using a routing path formed by multiple poor-quality wireless links may consume excessive amounts of network bandwidth without ensuring a satisfactory end-to-end PDR. This motivates the development of efficient algorithms that can find high-throughput paths …

    unsw Repository record for Exploiting MAC-layer cooperative retransmission in wireless mesh networks (opens in a new tab)

  14. Development of an energy and geographic aware opportunistic network coding scheme

    … throughput of a network by coding packets. Geo-Routing is a routing method that operates by using the geographical distances between nodes as the routing metric. Opportunistic Routing is a routing method that exploits the broadcast characteristics of wireless networks. In this thesis, we …

    nwu-za Repository record for Development of an energy and geographic aware opportunistic network coding scheme (opens in a new tab)

  15. On-demand routing with unidirectional link support for mobile ad hoc networks

    … the network to be heterogeneous and as a result, routing paths between nodes can be formed via links that are both symmetrical and asymmetrical. The design of efficient and reliable routing schemes that can exploit and utilise all types of link is therefore, a major challenge in MANET. The key …

    strathclyde Repository record for On-demand routing with unidirectional link support for mobile ad hoc networks (opens in a new tab)

  16. Toward perpetual wireless networks: opportunistic large arrays with transmission thresholds and energy harvesting

    … research is the design and analysis of a novel routing metric called communications using HESS (CHESS), which extends the rechargeable battery (RB)-life by relaying exclusively with supercapacitor (SC) energy, and is asymptotically optimal with respect to the number of nodes in the network.

    gatech Repository record for Toward perpetual wireless networks: opportunistic large arrays with transmission thresholds and energy harvesting (opens in a new tab)

  17. Renewable Energy-Aware Routing in the Internet

    … This thesis introduces a new backbone Internet routing protocol that performs routing considering the different renewable energy availability at various geographical locations. A Border Gateway Protocol (BGP)-based routing algorithm using a new metric is proposed to increase the utilization of …

    rit Repository record for Renewable Energy-Aware Routing in the Internet (opens in a new tab)

  18. Σχεδίαση, ανάπτυξη και υλοποίηση πρωτοκόλλων ασφαλούς και ενεργειακά αποδοτικής δρομολόγησης δεδομένων σε δίκτυα ασύρματων αισθητήρων

    … in order to support self-organization, routing has to be performed in a cooperative manner, making them vulnerable to significant security threats. These intricacies have mandated the design of novel routing protocols that suit the needs of the application at hand, addressing the …

    greece Repository record for Σχεδίαση, ανάπτυξη και υλοποίηση πρωτοκόλλων ασφαλούς και ενεργειακά αποδοτικής δρομολόγησης δεδομένων σε δίκτυα ασύρματων αισθητήρων (opens in a new tab)

  19. Congestion-Aware Cross-Layer Design for Wireless Ad Hoc Networks

    … the wireless physical, data link, dynamic source routing (DSR) routing protocol models have been included in the simulation. Simulations show that the performance begins to drop at the moderate offered load due to congestion. In addition, the mobility and fading cause the route failures and packet …

    usf Repository record for Congestion-Aware Cross-Layer Design for Wireless Ad Hoc Networks (opens in a new tab)

  20. Adaptive Multicast Routing Protocol Based on Reinforcement Learning

    … (PDR) or high overhead. These methods rely on metrics like hop count to find the optimal path to the destination. Once the path is selected, all packets are sent over the same path as long as it is available. However, a path that is deemed optimal at a specific instance of time may not retain …

    carleton Repository record for Adaptive Multicast Routing Protocol Based on Reinforcement Learning (opens in a new tab)

Page 1 of 3