A tagging-based medium access scheme for wireless data applications in CDMA/TDM networks

A. Anpalagan, E. Sousa
{"title":"A tagging-based medium access scheme for wireless data applications in CDMA/TDM networks","authors":"A. Anpalagan, E. Sousa","doi":"10.1109/PIMRC.2001.965280","DOIUrl":null,"url":null,"abstract":"In this paper, a packet scheduling scheme based on real-time channel conditions and avoidance of dominant inter-cell interferers is proposed and studied. This scheme is implemented by the distribution of tags by receivers among transmitters. We focus on reverse links of a CDMA/TDM system where for every slot, each base station issues M(/spl ges/1) tags to M mobile users (MU) based on the ranked reverse link gains. The number of tags thus issued depends on the expected traffic, the number of cells and the propagation conditions in the network. Two types of tags can be issued: eg, hard and soft tags. A MU will transmit only if it receives a tag from its home base station (BS) and no hard tag from any other BS. Hence, in our scheme, MU that not only have stronger channel pins to their respective home BS but also cause relatively lower inter-cell interference are scheduled for transmissions. This scheme is hence a cooperative approach whereby good-neighbor behaviour is exhibited. Soft-tagging offers flexibility in allowing MU that cause moderate inter-cell interference to transmit under certain conditions such as longer starved time. Simulation results in shadow and a Rayleigh failing environment are presented to show that our scheme outperforms the conventional scheme by 30% in transmit bit energy when M = 10 in a 9-cell network with 100 MU uniformly distributed.","PeriodicalId":318292,"journal":{"name":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2001.965280","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, a packet scheduling scheme based on real-time channel conditions and avoidance of dominant inter-cell interferers is proposed and studied. This scheme is implemented by the distribution of tags by receivers among transmitters. We focus on reverse links of a CDMA/TDM system where for every slot, each base station issues M(/spl ges/1) tags to M mobile users (MU) based on the ranked reverse link gains. The number of tags thus issued depends on the expected traffic, the number of cells and the propagation conditions in the network. Two types of tags can be issued: eg, hard and soft tags. A MU will transmit only if it receives a tag from its home base station (BS) and no hard tag from any other BS. Hence, in our scheme, MU that not only have stronger channel pins to their respective home BS but also cause relatively lower inter-cell interference are scheduled for transmissions. This scheme is hence a cooperative approach whereby good-neighbor behaviour is exhibited. Soft-tagging offers flexibility in allowing MU that cause moderate inter-cell interference to transmit under certain conditions such as longer starved time. Simulation results in shadow and a Rayleigh failing environment are presented to show that our scheme outperforms the conventional scheme by 30% in transmit bit energy when M = 10 in a 9-cell network with 100 MU uniformly distributed.
在CDMA/TDM网络中无线数据应用的一种基于标记的介质访问方案
本文提出并研究了一种基于实时信道条件和避免优势小区间干扰的分组调度方案。该方案是通过接收器在发射器之间分配标签来实现的。我们关注的是CDMA/TDM系统的反向链路,在每个时隙中,每个基站根据反向链路增益的排名向M个移动用户(MU)发放M(/spl ges/1)个标签。因此,发出的标签数量取决于预期的流量、小区数量和网络中的传播条件。可以发布两种类型的标签:例如,硬标签和软标签。MU只有在接收到来自其家庭基站(BS)的标签而没有从任何其他基站接收到硬标签时才会发送。因此,在我们的方案中,MU不仅对各自的家庭BS具有更强的信道引脚,而且对小区间干扰也相对较小。因此,这一方案是一种合作方式,睦邻行为得以展现。软标签提供了灵活性,允许MU引起适度的细胞间干扰在某些条件下传输,如较长的饥饿时间。在阴影和Rayleigh失效环境下的仿真结果表明,在100 MU均匀分布的9小区网络中,当M = 10时,该方案的传输比特能量比传统方案高30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信