Evaluation of Heuristic Algorithms for Scheduling, Routing and Power Allocation in Traffic Sensitive Spatial TDMA Wireless Ad Hoc Networks
2008 (English)In: 2008 6TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1 AND 2, NEW YORK: IEEE , 2008, 443-447 p.Conference paper (Refereed)
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 . Our results show that one of the heuristic routing algorithms can provide near optimal solutions regarding end-to-end network throughput.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2008. 443-447 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-31553DOI: 10.1109/WIOPT.2008.4586107ISI: 000262438100060ScopusID: 2-s2.0-51949085778ISBN: 978-1-4244-3121-2OAI: oai:DiVA.org:kth-31553DiVA: diva2:408186
6th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc, and Wireless Networks Berlin, GERMANY, APR 01-03, 2008
QC 20110404 2011-04-042011-03-182011-04-05Bibliographically approved