By Topic

Iterative hybrid graph and interference aware scheduling algorithm for STDMA 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 $31
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

2 Author(s)
Christophides, F. ; King''s Coll. London, London ; Friderikos, V.

An algorithm that combines graph colouring with signal-to-interference plus noise ratio information to allocate transmission rights in a spatial time division multiple access (STDMA) network is presented. The proposed iterative algorithm extends graph-based algorithms by allowing feasible schedules to be found with high spatial timeslot reuse.

Published in:

Electronics Letters  (Volume:44 ,  Issue: 8 )