Change search
ReferencesLink to record
Permanent link

Direct link
Optimal Scheduling for Interference Mitigation by Range Information
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0002-4265-9490
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0002-5329-575X
KTH, School of Electrical Engineering (EES), Signal Processing.
Show others and affiliations
(English)Manuscript (preprint) (Other academic)
Abstract [en]

This paper describes several algorithms for generating an optimal schedule for multiple access on a shared channel by utilizing range information in a fully connected network. We also provide detailed analysis for the proposed algorithms in terms of their complexity, convergence, and effect of non-idealities in the network. The performance of the proposed schemes are compared with non-aided methods to quantify the benefits of using the range information in the communication. We argue that the proposed techniques yield significant benefits as the number of nodes in the network increases. We provide simulation results in support of the claim. The proposed methods indicate that the throughput can be increased on average by 3-10 times for typical network configurations.

National Category
Signal Processing
URN: urn:nbn:se:kth:diva-181486OAI: diva2:899568

QS 2016

Available from: 2016-02-02 Created: 2016-02-02 Last updated: 2016-02-16Bibliographically approved

Open Access in DiVA

fulltext(474 kB)28 downloads
File information
File name FULLTEXT01.pdfFile size 474 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Search in DiVA

By author/editor
Yajnanarayana, VijayaMagnusson, Klas E. G.Brandt, Rasmus
By organisation
Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 28 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 51 hits
ReferencesLink to record
Permanent link

Direct link