Mobile Lightweight Wireless Systems. First International ICST Conference, MOBILIGHT 2009, Athens, Greece, May 18-20, 2009, Revised Selected Papers

Research Article

Fast Randomized STDMA Link Scheduling

Download98 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-03819-8_2,
        author={Sergio Gomez and Oriol Gras and Vasilis Friderikos},
        title={Fast Randomized STDMA Link Scheduling},
        proceedings={Mobile Lightweight Wireless Systems. First International ICST Conference, MOBILIGHT 2009, Athens, Greece, May 18-20, 2009, Revised Selected Papers},
        proceedings_a={MOBILIGHT},
        year={2012},
        month={6},
        keywords={Spatial-TDMA Wireless Mesh Networks Scheduling Routing Wireless Multi-Hop},
        doi={10.1007/978-3-642-03819-8_2}
    }
    
  • Sergio Gomez
    Oriol Gras
    Vasilis Friderikos
    Year: 2012
    Fast Randomized STDMA Link Scheduling
    MOBILIGHT
    Springer
    DOI: 10.1007/978-3-642-03819-8_2
Sergio Gomez1, Oriol Gras1, Vasilis Friderikos1,*
  • 1: King’s College London
*Contact email: vasilis.friderikos@kcl.ac.uk

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.