Trust-Based Stable Matching Approach for Carrier Aggregated Heterogeneous Networks

Yagmur Sabucu, A. E. Pusane, Günes Karabulut-Kurt
{"title":"Trust-Based Stable Matching Approach for Carrier Aggregated Heterogeneous Networks","authors":"Yagmur Sabucu, A. E. Pusane, Günes Karabulut-Kurt","doi":"10.1109/TSP.2018.8441346","DOIUrl":null,"url":null,"abstract":"Carrier aggregation (CA) is proposed to adress the tremendous demands for high data rates in resource limited heterogeneous networks (HetNets). Although the resource allocation problem for CA HetNets has been extensively studied in the literature before, there are still many open challenges, including security threats. Thus, in this paper, a trust-based stable matching (SM) approach is proposed as a solution for selfish user threats in a CA HetNet. The proposed approach aims to provide secure communication to honest users by using a trust index for each user to identify and punish the selfish users gradually. The selfish user identification process in the proposed approach is based on a comparison between the difference of the promised rate and the obtained rate with a predefined threshold after each stable matching round. The identification threshold has a significant role in terms of avoiding false detection of honest users as selfish users as a result of bad channel estimation performances. Additionally, determining an appropriate punishment factor is another essential issue in order to achieve high rate and fairness performances. Thus, appropriate values of the threshold and the punishment factor are investigated in order to achieve a high fairness and low misleading ratio in this study.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2018.8441346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Carrier aggregation (CA) is proposed to adress the tremendous demands for high data rates in resource limited heterogeneous networks (HetNets). Although the resource allocation problem for CA HetNets has been extensively studied in the literature before, there are still many open challenges, including security threats. Thus, in this paper, a trust-based stable matching (SM) approach is proposed as a solution for selfish user threats in a CA HetNet. The proposed approach aims to provide secure communication to honest users by using a trust index for each user to identify and punish the selfish users gradually. The selfish user identification process in the proposed approach is based on a comparison between the difference of the promised rate and the obtained rate with a predefined threshold after each stable matching round. The identification threshold has a significant role in terms of avoiding false detection of honest users as selfish users as a result of bad channel estimation performances. Additionally, determining an appropriate punishment factor is another essential issue in order to achieve high rate and fairness performances. Thus, appropriate values of the threshold and the punishment factor are investigated in order to achieve a high fairness and low misleading ratio in this study.
基于信任的载波聚合异构网络稳定匹配方法
为了解决资源有限的异构网络对高数据速率的巨大需求,提出了载波聚合(CA)技术。尽管CA HetNets的资源分配问题在之前的文献中已经得到了广泛的研究,但仍然存在许多未解决的挑战,包括安全威胁。因此,本文提出了一种基于信任的稳定匹配(SM)方法,作为CA HetNet中自私用户威胁的解决方案。该方法旨在通过对每个用户使用信任指数来逐步识别和惩罚自私的用户,从而为诚实的用户提供安全的通信。该方法的自私用户识别过程是在每一轮稳定匹配后,通过预定义阈值比较承诺速率与获得速率的差值。识别阈值在避免因信道估计性能差而将诚实用户误检测为自私用户方面具有重要作用。此外,确定适当的惩罚因素是另一个重要问题,以实现高速率和公平的表现。因此,本研究探讨了阈值和惩罚因子的适当取值,以达到高公平性和低误导率的目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信