Optimal Scheduling for Interference Mitigation by Range Information

The multiple access scheduling decides how the channel is shared among the nodes in the network. Typically scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several algorithms for generating an optimal schedule in terms of ch...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on mobile computing 2017-11, Vol.16 (11), p.3167-3181
Main Authors: Yajnanarayana, Vijaya, Magnusson, Klas E. G., Brandt, Rasmus, Dwivedi, Satyam, Handel, Peter
Format: Magazinearticle
Language:English
Subjects:
5G mobile communication
5G-communication
ad-hoc networks
Algorithms
Computer simulation
cooperative communication
Millimeter wave communication
mmWave communication
mobile networks
Multiple access
Network topology
Nodes
Peer-to-peer computing
position dependent communication
Robot sensing systems
Scheduling
Sensor networks
swarm networks
Throughput
traveling sales man (TSP) problem
Traveling salesman problems
ultra wideband (UWB) communication
Utilization
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The multiple access scheduling decides how the channel is shared among the nodes in the network. Typically scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several algorithms for generating an optimal schedule in terms of channel utilization for multiple access by utilizing range information in a fully connected network. We also provide detailed analysis for the proposed algorithms performance 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. The proposed methods have several favorable properties for the scalable systems. We show that the proposed techniques yields better channel utilization and throughput as the number of nodes in the network increases. We provide simulation results in support of this claim. The proposed methods indicate that the throughput can be increased on average by 3-10 times for typical network configurations.
ISSN:1536-1233
1558-0660
1558-0660
DOI:10.1109/TMC.2017.2688417