A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks

Goutam Chakraborty, Debasish Chakraborty, Norio Shiratori

    Research output: Contribution to journalArticle

    4 Citations (Scopus)

    Abstract

    Packet Radio networks are to provide data communications among a set of nodes distributed over a wide region. Transmission from nodes is broadcast in nature. Where direct communication between two nodes is not possible, connection is established in multiple hops. A time division multiple access (TDMA) protocol is adopted for conflict free communication among different nodes. The goal is to find a conflict free transmission schedule for different nodes at different time-slots of a fixed length time frame, called TDMA cycle. The optimization criterion is primarily to (1) minimize the TDMA cycle length, and then to (2) maximize the number of transmissions. The problem is proved to be NP-complete. A randomized algorithm is proposed, which is very efficient to achieve the first optimization criterion. The results are shown to be superior compared to other recently reported competitive algorithms.

    Original languageEnglish
    Pages (from-to)74-85
    Number of pages12
    JournalComputer Communications
    Volume28
    Issue number1
    DOIs
    Publication statusPublished - 2005 Jan 31

    Fingerprint

    Time division multiple access
    Heuristic algorithms
    Communication
    Network protocols

    Keywords

    • Optimum transmission schedule
    • Packet radio network
    • Time division multiple access

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks. / Chakraborty, Goutam; Chakraborty, Debasish; Shiratori, Norio.

    In: Computer Communications, Vol. 28, No. 1, 31.01.2005, p. 74-85.

    Research output: Contribution to journalArticle

    Chakraborty, Goutam ; Chakraborty, Debasish ; Shiratori, Norio. / A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks. In: Computer Communications. 2005 ; Vol. 28, No. 1. pp. 74-85.
    @article{f751472bac80425fa355686598540361,
    title = "A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks",
    abstract = "Packet Radio networks are to provide data communications among a set of nodes distributed over a wide region. Transmission from nodes is broadcast in nature. Where direct communication between two nodes is not possible, connection is established in multiple hops. A time division multiple access (TDMA) protocol is adopted for conflict free communication among different nodes. The goal is to find a conflict free transmission schedule for different nodes at different time-slots of a fixed length time frame, called TDMA cycle. The optimization criterion is primarily to (1) minimize the TDMA cycle length, and then to (2) maximize the number of transmissions. The problem is proved to be NP-complete. A randomized algorithm is proposed, which is very efficient to achieve the first optimization criterion. The results are shown to be superior compared to other recently reported competitive algorithms.",
    keywords = "Optimum transmission schedule, Packet radio network, Time division multiple access",
    author = "Goutam Chakraborty and Debasish Chakraborty and Norio Shiratori",
    year = "2005",
    month = "1",
    day = "31",
    doi = "10.1016/j.comcom.2004.06.009",
    language = "English",
    volume = "28",
    pages = "74--85",
    journal = "Computer Communications",
    issn = "0140-3664",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks

    AU - Chakraborty, Goutam

    AU - Chakraborty, Debasish

    AU - Shiratori, Norio

    PY - 2005/1/31

    Y1 - 2005/1/31

    N2 - Packet Radio networks are to provide data communications among a set of nodes distributed over a wide region. Transmission from nodes is broadcast in nature. Where direct communication between two nodes is not possible, connection is established in multiple hops. A time division multiple access (TDMA) protocol is adopted for conflict free communication among different nodes. The goal is to find a conflict free transmission schedule for different nodes at different time-slots of a fixed length time frame, called TDMA cycle. The optimization criterion is primarily to (1) minimize the TDMA cycle length, and then to (2) maximize the number of transmissions. The problem is proved to be NP-complete. A randomized algorithm is proposed, which is very efficient to achieve the first optimization criterion. The results are shown to be superior compared to other recently reported competitive algorithms.

    AB - Packet Radio networks are to provide data communications among a set of nodes distributed over a wide region. Transmission from nodes is broadcast in nature. Where direct communication between two nodes is not possible, connection is established in multiple hops. A time division multiple access (TDMA) protocol is adopted for conflict free communication among different nodes. The goal is to find a conflict free transmission schedule for different nodes at different time-slots of a fixed length time frame, called TDMA cycle. The optimization criterion is primarily to (1) minimize the TDMA cycle length, and then to (2) maximize the number of transmissions. The problem is proved to be NP-complete. A randomized algorithm is proposed, which is very efficient to achieve the first optimization criterion. The results are shown to be superior compared to other recently reported competitive algorithms.

    KW - Optimum transmission schedule

    KW - Packet radio network

    KW - Time division multiple access

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

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

    U2 - 10.1016/j.comcom.2004.06.009

    DO - 10.1016/j.comcom.2004.06.009

    M3 - Article

    VL - 28

    SP - 74

    EP - 85

    JO - Computer Communications

    JF - Computer Communications

    SN - 0140-3664

    IS - 1

    ER -