By Topic

Evaluation of heuristic algorithms for scheduling, routing and power allocation in traffic sensitive spatial TDMA Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Somarriba, O. ; Dept. of Commun. Syst., R. Inst. of Technol. (KTH), Kista

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 ldquoconflict-freerdquo 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-to-end network throughput.

Published in:

Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. 6th International Symposium on

Date of Conference:

1-3 April 2008