Fast Randomized STDMA Link Scheduling

Sergio Gomez, Oriol Gras, Vasilis Friderikos

    Research output: Chapter in Book/Report/Conference proceedingConference paper

    1 Citation (Scopus)

    Abstract

    In this paper a fast randomized parallel link swap based packing (RSP) algorithm for timeslot allocation in a spatial time division multiple access (STDMA) wireless mesh network is presented. The proposed randomized algorithm extends several greedy scheduling algorithms that utilize the physical interference model by applying a local search that leads to a substantial improvement in the spatial timeslot reuse. Numerical simulations reveal that compared to previously scheduling schemes the proposed randomized algorithm can achieve a performance gain of up to 11%. A significant benefit of the proposed scheme is that the computations can be parallelized and therefore can efficiently utilize commoditized and emerging multi-core and/or multi-CPU processors.
    Original languageEnglish
    Title of host publicationUnknown
    Place of PublicationNEW YORK
    PublisherSpringer
    Pages15 - 24
    Number of pages10
    ISBN (Print)978-3-642-03818-1
    Publication statusPublished - 2009
    Event1st International ICST Conference on Mobile Lightweight Wireless Systems (MOBILIGHT) - Athens, Greece
    Duration: 18 May 200920 May 2009

    Publication series

    NameMOBILE LIGHTWEIGHT WIRELESS SYSTEMS

    Conference

    Conference1st International ICST Conference on Mobile Lightweight Wireless Systems (MOBILIGHT)
    Country/TerritoryGreece
    CityAthens
    Period18/05/200920/05/2009

    Fingerprint

    Dive into the research topics of 'Fast Randomized STDMA Link Scheduling'. Together they form a unique fingerprint.

    Cite this