The energy harvesting multi-way relay channel with intermittent data: the impact of buffer sizes

Burak Varan, Aylin Yener

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    In this paper, a multi-way relay channel is considered with energy harvesting nodes. The harvested energy at each node can be stored in a battery of finite capacity. Additionally, each node employs a data buffer of limited size to store data prior to transmission. Data packets to be exchanged between the nodes arrive at the source nodes in an intermittent fashion. In this setup, the offline sum throughput maximization problem, which turns out to be a convex optimization problem, is solved. The corresponding online problem is formulated, and a backward induction-based optimal solution is proposed. In addition, a near-optimum low complexity solution is presented. It is noted that the solutions for the offline and online throughput maximization problems for the multi-way relay channel also provide solutions for its special cases, e.g., the multi-pair two-way relay channel, the two-way channel, and others. Numerical results are presented to demonstrate the resulting optimal transmission policies for various channel setups, comparing the sum throughput to upper and lower bounds, and demonstrating the impact of buffer sizes at the relay.

    Original languageEnglish (US)
    JournalEurasip Journal on Wireless Communications and Networking
    Volume2015
    Issue number1
    DOIs
    StatePublished - Dec 1 2015

    Fingerprint

    Energy harvesting
    Throughput
    Convex optimization

    All Science Journal Classification (ASJC) codes

    • Signal Processing
    • Computer Science Applications
    • Computer Networks and Communications

    Cite this

    @article{0010bc7738eb498db3f8fe31020015ae,
    title = "The energy harvesting multi-way relay channel with intermittent data: the impact of buffer sizes",
    abstract = "In this paper, a multi-way relay channel is considered with energy harvesting nodes. The harvested energy at each node can be stored in a battery of finite capacity. Additionally, each node employs a data buffer of limited size to store data prior to transmission. Data packets to be exchanged between the nodes arrive at the source nodes in an intermittent fashion. In this setup, the offline sum throughput maximization problem, which turns out to be a convex optimization problem, is solved. The corresponding online problem is formulated, and a backward induction-based optimal solution is proposed. In addition, a near-optimum low complexity solution is presented. It is noted that the solutions for the offline and online throughput maximization problems for the multi-way relay channel also provide solutions for its special cases, e.g., the multi-pair two-way relay channel, the two-way channel, and others. Numerical results are presented to demonstrate the resulting optimal transmission policies for various channel setups, comparing the sum throughput to upper and lower bounds, and demonstrating the impact of buffer sizes at the relay.",
    author = "Burak Varan and Aylin Yener",
    year = "2015",
    month = "12",
    day = "1",
    doi = "10.1186/s13638-015-0286-5",
    language = "English (US)",
    volume = "2015",
    journal = "Eurasip Journal on Wireless Communications and Networking",
    issn = "1687-1472",
    publisher = "Springer Publishing Company",
    number = "1",

    }

    TY - JOUR

    T1 - The energy harvesting multi-way relay channel with intermittent data

    T2 - the impact of buffer sizes

    AU - Varan, Burak

    AU - Yener, Aylin

    PY - 2015/12/1

    Y1 - 2015/12/1

    N2 - In this paper, a multi-way relay channel is considered with energy harvesting nodes. The harvested energy at each node can be stored in a battery of finite capacity. Additionally, each node employs a data buffer of limited size to store data prior to transmission. Data packets to be exchanged between the nodes arrive at the source nodes in an intermittent fashion. In this setup, the offline sum throughput maximization problem, which turns out to be a convex optimization problem, is solved. The corresponding online problem is formulated, and a backward induction-based optimal solution is proposed. In addition, a near-optimum low complexity solution is presented. It is noted that the solutions for the offline and online throughput maximization problems for the multi-way relay channel also provide solutions for its special cases, e.g., the multi-pair two-way relay channel, the two-way channel, and others. Numerical results are presented to demonstrate the resulting optimal transmission policies for various channel setups, comparing the sum throughput to upper and lower bounds, and demonstrating the impact of buffer sizes at the relay.

    AB - In this paper, a multi-way relay channel is considered with energy harvesting nodes. The harvested energy at each node can be stored in a battery of finite capacity. Additionally, each node employs a data buffer of limited size to store data prior to transmission. Data packets to be exchanged between the nodes arrive at the source nodes in an intermittent fashion. In this setup, the offline sum throughput maximization problem, which turns out to be a convex optimization problem, is solved. The corresponding online problem is formulated, and a backward induction-based optimal solution is proposed. In addition, a near-optimum low complexity solution is presented. It is noted that the solutions for the offline and online throughput maximization problems for the multi-way relay channel also provide solutions for its special cases, e.g., the multi-pair two-way relay channel, the two-way channel, and others. Numerical results are presented to demonstrate the resulting optimal transmission policies for various channel setups, comparing the sum throughput to upper and lower bounds, and demonstrating the impact of buffer sizes at the relay.

    UR - http://www.scopus.com/inward/record.url?scp=84926209566&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84926209566&partnerID=8YFLogxK

    U2 - 10.1186/s13638-015-0286-5

    DO - 10.1186/s13638-015-0286-5

    M3 - Article

    AN - SCOPUS:84926209566

    VL - 2015

    JO - Eurasip Journal on Wireless Communications and Networking

    JF - Eurasip Journal on Wireless Communications and Networking

    SN - 1687-1472

    IS - 1

    ER -