Sökning: "Routing algorithms"

Visar resultat 1 - 5 av 72 avhandlingar innehållade orden Routing algorithms.

  1. 1. Slack-Time Aware Dynamic Routing Schemes for on-chip networks

    Författare :Daniel Andreasson; Jönköping University; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Network on Chip; Dynamic Routing; Router design; Routing algorithms; Slack-time; Electronics; Elektronik; Computer science;

    Sammanfattning : Network-on-Chip (NoC) is a new on-chip communication paradigm for future IP-core based System-on-Chip (SoC), designed to remove a number of limitations of today’s on-chip interconnect solutions. A NoC interconnects cores by means of a packet switched micro-network, which improves scalability and reusability, resulting in a shorter time to market. LÄS MER

  3. 2. Deadlock Free Routing in Mesh Networks on Chip with Regions

    Författare :Rickard Holsmark; Shashi Kumar; Petru Eles; Axel Jantsch; Jönköping University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Networks on Chip; Mesh Topology; Routing Algorithms; Wormhole Switching; Deadlock; Application Specific Routing; Systems engineering; Systemteknik; TECHNOLOGY;

    Sammanfattning : There is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structureson silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. LÄS MER

  4. 3. Geographic Routing in Intermittently-connected Mobile Ad Hoc Networks : Algorithms and Performance Models

    Författare :Erik Kuiper; Simin Nadjm-Tehrani; Di Yuan; Mats Ekman; Timothy Brown; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Communication is a key enabler for cooperation. Thus to support efficient communication humanity has continuously strived to improve the communication infrastructure. This infrastructure has evolved from heralds and ridden couriers to a digital telecommunication infrastructures based on electrical wires, optical fibers and radio links. LÄS MER

  5. 4. Centralized Routing for Prolonged Network Lifetime in Wireless Sensor Networks

    Författare :Ewa Hansen; Mats Björkman; Mikael Nolin; Dag Nyström; Thiemo Voigt; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Wireless sensor networks; routing; energy efficiency; asymmetric communicaiton; communication; power consumption; computer networks; trådlösa sensornät; trådlös; kommunikation; energikonsumtion; Computer science; Datavetenskap; Computer Science; datavetenskap;

    Sammanfattning : In this thesis centralized routing methods for wireless sensor networks have been studied. The aim has been to prolong network lifetime by reducing the energy consumed by sensor-node communication.Wireless sensor networks are rapidly becoming common in application areas where information from many sensors is to be collected and acted upon. LÄS MER

  7. 5. Energy and Route Optimization of Moving Devices

    Författare :Sarmad Riazi; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Energy optimization; industrial robots; vehicle routing problems; automated guided vehicles.; scheduling; routing;

    Sammanfattning : This thesis highlights our efforts in energy and route optimization of moving devices. We have focused on three categories of such devices; industrial robots in a multi-robot environment, generic vehicles in a vehicle routing problem (VRP) context, automated guided vehicles (AGVs) in a large-scale flexible manufacturing system (FMS). LÄS MER