Scribd Logo
Upload

Welcome to Scribd!

  • Abstract

    Uploaded by

    Mohan Raj K
    24 views1 page
    This document analyzes delay performance in multi-hop wireless networks where routes between source-destination pairs are fixed. It develops a new queue grouping technique to handle complex correlations in the service process caused by the multi-hop nature and shared wireless medium. An interference model is assumed that constrains links that can be served simultaneously. This is used to obtain a fundamental lower bound on delay for any scheduling policy. A methodology is presented to derive such lower bounds. For a special case of a clique network, an optimal policy is designed. For a tandem queue network where the optimal policy is known, the expected delay matches the lower bound. The lower bounds provide insights into designing near-optimal scheduling policies.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document analyzes delay performance in multi-hop wireless networks where routes between source-destination pairs are fixed. It develops a new queue grouping technique to handle complex correlations in the service process caused by the multi-hop nature and shared wireless medium. An interference model is assumed that constrains links that can be served simultaneously. This is used to obtain a fundamental lower bound on delay for any scheduling policy. A methodology is presented to derive such lower bounds. For a special case of a clique network, an optimal policy is designed. For a tandem queue network where the optimal policy is known, the expected delay matches the lower bound. The lower bounds provide insights into designing near-optimal scheduling policies.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    24 views1 page

    Abstract

    Uploaded by

    Mohan Raj K
    This document analyzes delay performance in multi-hop wireless networks where routes between source-destination pairs are fixed. It develops a new queue grouping technique to handle complex correlations in the service process caused by the multi-hop nature and shared wireless medium. An interference model is assumed that constrains links that can be served simultaneously. This is used to obtain a fundamental lower bound on delay for any scheduling policy. A methodology is presented to derive such lower bounds. For a special case of a clique network, an optimal policy is designed. For a tandem queue network where the optimal policy is known, the expected delay matches the lower bound. The lower bounds provide insights into designing near-optimal scheduling policies.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks

    ABSTRACT

    We analyze the delay performance of a multi-hop wireless network in which the routes between source-destination pairs are fixed. We develop a new queue grouping technique to handle the complex correlations of the service process resulting from the multi-hop nature of the flows and their mutual sharing of the wireless medium. A general set based interference model is assumed that imposes constraints on links that can be served simultaneously at any given time. These interference constraints are used to obtain a fundamental lower bound on the delay performance of any scheduling policy for the system. We present a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, we design a policy that is sample path delay optimal. For the tandem queue network, where the delay optimal policy is known, the expected delay of the optimal policy numerically coincides with the lower bound. The lower bound analysis provides useful insights into the design and analysis of optimal or nearly optimal scheduling policies.

    You might also like