By Topic

Graph theoretic multiple access interference reduction for CDMA based radio LAN

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

3 Author(s)
Gurcan, M.K. ; Dept. of Electr. & Electron. Eng., Imperial Coll. London, UK ; Abas, A.E.P. ; Imran, M.A.

In ad hoc W-CDMA wireless LANs, simultaneous transmissions between transmitter-receiver pairs generate multiple access interference (MAI), which limits the throughput. Reducing MAI increases this throughput limit. This is achieved by scheduling transmissions such that the average number of simultaneous transmissions in each frame is reduced. MAI is minimized by allowing the least interfering links to transmit together. This paper proposes a graph theoretic algorithm that groups all links into a minimum number of subsets, based on the objective of minimizing MAI in each set. Simulations show that the proposed technique achieves around 100% improvement in system capacity over the scheme where all links transmit simultaneously.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

20-24 June 2004