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 36 for “"Link scheduling"”.

  1. Link scheduling directed graphs using undirected edge colours

    … a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modeled as a graph, typically the same as the communication graph. …

    ubc Repository record for Link scheduling directed graphs using undirected edge colours (opens in a new tab) Download PDF for Link scheduling directed graphs using undirected edge colours (opens in a new tab)

  2. Opportunistic Link Scheduling for Multihop Ad Hoc Wireless Networks

    … In this thesis, we propose an opportunistic link scheduling (OL8), which is a simple enhancement to the IEEE 802.11 DCF protocol and intends to improve the compatibility between TCP and MAC layer protocols in multihop ad hoc networks. With OL8, a link with a good channel condition is allowed …

    mcmaster Repository record for Opportunistic Link Scheduling for Multihop Ad Hoc Wireless Networks (opens in a new tab)

  3. Fractional edge coloring for wireless link scheduling in the physical interference mode

    … (WMNs) in terms of resource management. The Link Scheduling problem aims to improve network capacity and the resource usage of WMNs through adopting a smart strategy for wireless links activation. This strategy guarantees the strict communication between network devices, satisfying the …

    brazil-uerj Repository record for Fractional edge coloring for wireless link scheduling in the physical interference mode (opens in a new tab)

  4. A Time-Efficient Strategy For Relay Selection and Link Scheduling In Wireless Communication Networks

    … considered important issues in the underlying link protocols. Existing link-layer protocols, like ARQ [44] or HARQ [57,67] approaches are designed to achieve this goal by discarding a corrupted packet at the receiver and performing one or more retransmissions until the packet is successfully …

    clemson Repository record for A Time-Efficient Strategy For Relay Selection and Link Scheduling In Wireless Communication Networks (opens in a new tab)

  5. Contiguous Conflict-free Link Scheduling for Efficient V2X Communication in the Next Generation of Wireless Networks

    … a conflict-free manner is NP-hard. Conflict-free scheduling assigns separate resources to the conflicting links and can enjoy from opportunistic resource reuse. In order to solve this NP-hard problem, existing methods, under different simplifications, apply graph theoretic algorithms, namely, …

    toronto-retro Repository record for Contiguous Conflict-free Link Scheduling for Efficient V2X Communication in the Next Generation of Wireless Networks (opens in a new tab)

  6. Resource allocation in WiMAX mesh networks

    … In this thesis, we study routing and link scheduling inWiMAX mesh networks. We present simple joint routing and link scheduling algorithms that have outperformed most of the existing proposals in our experiments. Our session based routing and links scheduling produced results …

    lethbridge Repository record for Resource allocation in WiMAX mesh networks (opens in a new tab)

  7. Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views

    … and when should nodes choose to transmit? While link scheduling answers the above question for point-to-point physical layers which are designed for an interference-avoidance paradigm, we look for answers in cases when interference can be embraced by advanced code design, as suggested by results …

    rice Repository record for Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views (opens in a new tab)

  8. Data-driven design for multihop and multi-band cellular networks

    … resource management, such as multihop routing, link scheduling, and traffic steering, and motivate the re-thinking of traditional solutions. IAB facilitates cost-effective deployment of mmWave cellular networks via multihop self-backhauling, albeit at the cost of poor rate scaling and packet …

    texas Repository record for Data-driven design for multihop and multi-band cellular networks (opens in a new tab)

  9. Throughput optimization in MIMO networks

    … performing interference cancellation, to allow links within interference range to be concurrently active. Furthermore, if the channel is in a deep fade, then multiple antenna elements at the transmitter and/or receiver can be used to transmit a single stream, thereby improving signal quality …

    gatech Repository record for Throughput optimization in MIMO networks (opens in a new tab)

  10. Optimization-based resource allocation and transmission scheduling for wireless networks

    … users. Resource allocation and transmission scheduling play more and more important roles in improving the performance of wireless networks, in terms of energy saving, throughput, delay, etc. In this thesis, we consider three networks with different characteristics and objectives, i.e., …

    manitoba Repository record for Optimization-based resource allocation and transmission scheduling for wireless networks (opens in a new tab)

  11. Algorithms and performance evaluation methods for wireless networks

    … for multicast routing and max-min fair link scheduling in wireless multihop networks. The multicast routing problem is to find a minimum-cost sequence of transmissions which delivers a message from a given source node to a set of destination nodes. We propose three efficient multicast …

    aalto Repository record for Algorithms and performance evaluation methods for wireless networks (opens in a new tab)

  12. Algoritmo de escalonamento utilizando modelo de Ising com campo externo

    … for wireless networks that take into account the link queue size have recently received a lot of attention. In this paper, we propose a distributed algorithm for link scheduling based on Ising’s physical model for antiferromagnetism. This model was adapted, by another work, to consider the size of …

    brazil-uerj Repository record for Algoritmo de escalonamento utilizando modelo de Ising com campo externo (opens in a new tab)

  13. Resource Allocation for Quality of Service in a Heterogeneous Network

    "Finally, we consider a wireless down-link scheduling problem. We study a scheduling rule, which we call the exponential rule, and prove that this rule is throughput-optimal, i.e., it makes the queues stable if there exists any rule which can do so. In the proof we use the fluid limit technique, …

    uiuc Repository record for Resource Allocation for Quality of Service in a Heterogeneous Network (opens in a new tab)

  14. Achilles : Design of a high capacity mesh network with directional antennas

    … discovery, topology broadcast, and link scheduling required for nodeusing directional antennas. By making efficient use of directional antennas, for bothtransmission and reception, and spatial reuse in transmission, Achilles achieves thegoal of a high capacity mesh network. In this …

    nus Repository record for Achilles : Design of a high capacity mesh network with directional antennas (opens in a new tab) Download file for Achilles : Design of a high capacity mesh network with directional antennas (opens in a new tab)

  15. Fundamental Limits Of Spectrum Sharing In Device-To-Device Communication Systems

    … sharing mechanism of informationtheoretic link scheduling (in short, ITLinQ) is proposed which at each time schedules the users that form an ITIS. Furthermore, a distributed way of implementing ITLinQ is presented and it is shown, through numerical analysis, to outperform similar …

    cornell Repository record for Fundamental Limits Of Spectrum Sharing In Device-To-Device Communication Systems (opens in a new tab)

  16. Practical interference management strategies in Gaussian networks

    … study the problem of interference-aware wireless link scheduling. Link scheduling is the problem of allocating a set of transmission requests into as small a set of time slots as possible such that all transmissions satisfy some condition of feasibility. The feasibility criterion has traditionally …

    waterloo Repository record for Practical interference management strategies in Gaussian networks (opens in a new tab)

  17. Experimental evaluation of QCSMA and CSMA for ad-hoc wireless sensor networks on the Telosb platform

    <p>A good link scheduling algorithm is one which is easy to implement and allocates limited resources in order to achieve high performance and acceptable Quality of Service [Jian Bo Srikant]. Maximal Weight Scheduling (MWS), a queue length based scheduling introduced in [Tassiulas Ephremides]is …

    iastate Repository record for Experimental evaluation of QCSMA and CSMA for ad-hoc wireless sensor networks on the Telosb platform (opens in a new tab)

  18. Efficient design of WIMAX/802.16 mesh networks

    … due to several factors, such as lossy wireless links caused by interference from concurrent transmissions, and intra-path interference caused by transmissions on successive hops along a single path. A wireless mesh network WMN consists of a number of stationary wireless mesh routers, forming a …

    concordia Download PDF for Efficient design of WIMAX/802.16 mesh networks (opens in a new tab)

Page 1 of 2