Priority Based Minimum Delay Algorithm for Channel Allocation in MIMO-OFDM System

T. Kannan, E. Kanniga
{"title":"Priority Based Minimum Delay Algorithm for Channel Allocation in MIMO-OFDM System","authors":"T. Kannan, E. Kanniga","doi":"10.1109/ICCIC.2018.8782368","DOIUrl":null,"url":null,"abstract":"Improving the data speed in the wireless communication is a great challenge on nowadays, because the bandwidth available is limited to a particular frequency. But the number of network users is drastically increased due to digital modern world with smart applications like internet television, high definition video conferencing, online gaming applications and many applications thusly. Where this type of problems cannot be solved by physical change in the network, but technically change the way of communication will improve in the better data quality network. This can be achieved in many ways and in this article; we tried the minimum delay algorithm for the channel allocation in network, while considering the factors like signal to noise ratio (SNR), multipath delay, mean square error (MSE) and many are the delay making things, it is due to network structure. These factors can be reduced by reconstructing the network to our ideal model, but practically it's very complex and difficult. We concentrate on the channel allocation technique can be slightly modified according to our network, delay may be minimized and speed of the network will be fortified. In this thesis, efficient priority based dynamic scheduling algorithm [9] was slightly modified for specified network (WLAN) and simulation was done with MIMO-OFDM system which results in improvement of >10% and results is compared to existing algorithm.","PeriodicalId":355098,"journal":{"name":"2018 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIC.2018.8782368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Improving the data speed in the wireless communication is a great challenge on nowadays, because the bandwidth available is limited to a particular frequency. But the number of network users is drastically increased due to digital modern world with smart applications like internet television, high definition video conferencing, online gaming applications and many applications thusly. Where this type of problems cannot be solved by physical change in the network, but technically change the way of communication will improve in the better data quality network. This can be achieved in many ways and in this article; we tried the minimum delay algorithm for the channel allocation in network, while considering the factors like signal to noise ratio (SNR), multipath delay, mean square error (MSE) and many are the delay making things, it is due to network structure. These factors can be reduced by reconstructing the network to our ideal model, but practically it's very complex and difficult. We concentrate on the channel allocation technique can be slightly modified according to our network, delay may be minimized and speed of the network will be fortified. In this thesis, efficient priority based dynamic scheduling algorithm [9] was slightly modified for specified network (WLAN) and simulation was done with MIMO-OFDM system which results in improvement of >10% and results is compared to existing algorithm.
基于优先级的MIMO-OFDM系统信道分配最小延迟算法
由于可用的带宽被限制在一个特定的频率,提高无线通信中的数据传输速度是一个巨大的挑战。但是,由于数字现代世界的智能应用,如互联网电视,高清视频会议,在线游戏应用和许多应用程序,网络用户的数量急剧增加。其中这类问题不能通过网络的物理改变来解决,但技术上改变通信方式将改善网络中的数据质量。这可以通过多种方式实现,在本文中;在考虑信噪比(SNR)、多径时延、均方误差(MSE)等因素的情况下,我们尝试了网络中信道分配的最小时延算法。这些因素可以通过将网络重构到我们理想的模型来减少,但实际上是非常复杂和困难的。我们的重点是,信道分配技术可以根据我们的网络进行轻微的修改,可以最小化延迟,增强网络的速度。本文针对特定网络(WLAN)对基于高效优先级的动态调度算法[9]进行了些许改进,并在MIMO-OFDM系统中进行了仿真,改进幅度>10%,并与现有算法进行了对比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信