6th International ICST Symposium on Modeling and Optimization

Research Article

Evaluation of Heuristic Algorithms for Scheduling, Routing and Power Allocation in Traffic Sensitive Spatial TDMA Wireless Ad Hoc Networks

Download599 downloads
  • @INPROCEEDINGS{10.4108/ICST.WIOPT2008.3212,
        author={Oscar Somarriba},
        title={Evaluation of Heuristic Algorithms for Scheduling, Routing and Power Allocation in Traffic Sensitive Spatial TDMA Wireless Ad Hoc Networks},
        proceedings={6th International ICST Symposium on Modeling and Optimization},
        publisher={IEEE},
        proceedings_a={WIOPT},
        year={2008},
        month={8},
        keywords={Access protocols  Algorithm design and analysis  Communication system traffic control  Heuristic algorithms  Media Access Protocol  Mobile ad hoc networks  Routing  Scheduling algorithm Telecommunication traffic Time division multiple access},
        doi={10.4108/ICST.WIOPT2008.3212}
    }
    
  • Oscar Somarriba
    Year: 2008
    Evaluation of Heuristic Algorithms for Scheduling, Routing and Power Allocation in Traffic Sensitive Spatial TDMA Wireless Ad Hoc Networks
    WIOPT
    IEEE
    DOI: 10.4108/ICST.WIOPT2008.3212
Oscar Somarriba1,*
  • 1: Department of Communication Systems, The Royal Institute of Technology (KTH), Electrum 418, S-164-40 Kista, Sweden.
*Contact email: oscars@radio.kth.se

Abstract

Major design issues in Wireless Ad Hoc Networks is the design of the routing algorithms and the Medium Access Control (MAC) protocols. Spatial TDMA (STDMA) is a “conflict-free” MAC protocol for these networks, thus enabling high spectral utilization. In link-oriented STDMA, the schedule specifies when particular radio links will be activated. Moreover, the use of power control and heuristic routing algorithms have the potential of improving STDMA network performance. Besides Power and Traffic Adaptive STDMA, in this paper we also, as a comparison, include optimal STDMA. To obtain the optimal STDMA scheduling combined with routing and power allocation, a convex optimization problem is solved using the method reported in [1]. Our results show that one of the heuristic routing algorithms can provide near optimal solutions regarding end-toend network throughput.