Search Constraints

Start Over
Filtering by: Subject Routing (Computer network management) Remove constraint Subject: Routing (Computer network management)

Search Results

  • Energy-efficient routing for delay-constrained data traffic in linear wireless sensor networks

    Creator:
    Alesaimi, Hani
    Abstract:
    Linear wireless sensor networks (LWSN) are special class of wireless sensor networks where sensor nodes are deployed in a straight line. Monitoring industrial pipelines, railroads, tunnels, power lines, and borders are applications of LWSNs. Wireless sensors are tiny devices with limited energy resources; therefore, efficient energy routing in LWSNs is...
    Resource Type:
    Masters Thesis
    Full Text:
    in L\SNs, the topology of the network is pre- determined. Although generic \SN routing techniques

  • Reinforcement Learning for Network Routing

    Creator:
    Yalamanchi, Hema Jyothi
    Abstract:
    Efficient routing of information packets in dynamically changing communication networks requires routing policies that adapt to changes in load levels, traffic patterns and network topologies. Reinforcement Learning (RL) is an area of artificial intelligence that studies algorithms that dynamically optimize their performance based on experience in an environment. RL, thus,...
    Resource Type:
    Capstone Project
    Full Text:
    Q-Routing: Reinforcement Learning for Network

  • One-to-many node disjoint paths routing in generalized hypercube, dense Gaussian, and hexagonal mesh networks

    Creator:
    Alsaleh, Omar I.
    Abstract:
    Routing from a single source node to multiple destination nodes using node disjoint paths (NDP) has many important applications in parallel systems. For example, if a source node wants to send distinct messages to distinct destination nodes, then the one-to-many NDP routing is useful. Unlike parallel systems with shared-memory, each...
    Resource Type:
    Dissertation
    Full Text:
    Gaussian Network Gk . . 73 4 One-to-Many NDP Routing in Hexagonal Mesh Network Hk . . . . 147 Chapter 1

  • Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

    Creator:
    Shamaei, Arash
    Abstract:
    Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algo­rithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to...
    Resource Type:
    Dissertation
    Full Text:
    network . . . . . . . . . . . . . . 12 2.8 Six of the twelve turns are allowed in deterministic routing

  • Cross-layer aware routing approach for lifetime maximization in wireless sensor networks with multiple sinks

    Creator:
    Hamid, Arwa Zakaria
    Abstract:
    In wireless sensor networks (WSNs) nodes are battery powered. Therefore, the available energy resources of sensor nodes should be managed efficiently in order to increase the network lifetime. As a result, researchers have proposed routing schemes in order to maximize network lifetime. Even though these schemes increase the network lifetime,...
    Resource Type:
    Masters Thesis
    Full Text:
    increase the network lifetime. As a result, researchers have proposed routing schemes in order to

  • Implementation and performance measurement and analysis of OLSR protocol

    Creator:
    Sinky, Hassan Hussein
    Abstract:
    This paper provides a measurement-based performance evaluation of the Optimized Link State Routing (OLSR) protocol. Two versions of OLSR, OLSR-ETX and OLSR-ETT, are implemented and evaluated on a mesh network that we built from off-the-shelf commercial components. OLSR-ETX uses the Expected Transmission Count (ETX) metric whereas, OLSR-ETT uses the Expected...
    Resource Type:
    Masters Thesis
    Full Text:
    LITERATURE REVIEW 3 3 AN EXPERIMENTAL NETWORK: THE TESTBED 7 4 OPTIMIZED L INK STATE ROUTING 9 4.1 Node

  • Security protocols for linear network coding

    Creator:
    Adeli, Majid
    Abstract:
    Network coding, as the next generation of data routing protocols, enables each intermediate node in a network to process and encode its received data before forwarding it to the next nodes. Hence, the core idea in network coding is to allow a network to encode the data that is being...
    Resource Type:
    Dissertation
    Full Text:
    of data routing protocols, enables each interme- diate node in a network to process and encode its