A topology-independent link activation scheduling framework in multihop CDMA packet radio networks

Yi-Sheng Su, S. Su, Jung-Shian Li
{"title":"A topology-independent link activation scheduling framework in multihop CDMA packet radio networks","authors":"Yi-Sheng Su, S. Su, Jung-Shian Li","doi":"10.1109/LCN.2005.19","DOIUrl":null,"url":null,"abstract":"In this paper, we study topology-independent link activation transmission scheduling protocols for multihop code-division multiple-access (CDMA) packet radio networks. We focus on quality-of-service (QoS) provisioning for each communication link in mobile environments. An interference model for wireless multihop packet radio networks, which is more practical than that adopted in earlier literature, is considered. Under this interference model, an approach to guaranteeing conflict-free transmission slots in each frame for each communication link is proposed. We then present a topology-independent link activation scheduling framework based on the theory of group divisible (GD) designs. The proposed framework guarantees conflict-free transmission slots in each frame for each communication link by mathematical properties of GD designs. With the proposed framework, we study and evaluate one series of GD design construction. We then propose topology-independent link activation scheduling algorithms based on the results derived. The proposed schemes are designed for different objectives: maximizing the minimum system throughput and minimizing the schedule frame length. Analysis results show that the proposed algorithms outperform previously known schemes","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2005.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we study topology-independent link activation transmission scheduling protocols for multihop code-division multiple-access (CDMA) packet radio networks. We focus on quality-of-service (QoS) provisioning for each communication link in mobile environments. An interference model for wireless multihop packet radio networks, which is more practical than that adopted in earlier literature, is considered. Under this interference model, an approach to guaranteeing conflict-free transmission slots in each frame for each communication link is proposed. We then present a topology-independent link activation scheduling framework based on the theory of group divisible (GD) designs. The proposed framework guarantees conflict-free transmission slots in each frame for each communication link by mathematical properties of GD designs. With the proposed framework, we study and evaluate one series of GD design construction. We then propose topology-independent link activation scheduling algorithms based on the results derived. The proposed schemes are designed for different objectives: maximizing the minimum system throughput and minimizing the schedule frame length. Analysis results show that the proposed algorithms outperform previously known schemes
多跳CDMA分组无线网中拓扑无关的链路激活调度框架
本文研究了多跳码分多址(CDMA)分组无线网络中拓扑无关的链路激活传输调度协议。我们专注于为移动环境中的每个通信链路提供服务质量(QoS)。提出了一种比以往文献更实用的无线多跳分组无线网干扰模型。在此干扰模型下,提出了一种保证每条通信链路每帧无冲突传输时隙的方法。然后,我们提出了一个基于群可分设计理论的拓扑无关链路激活调度框架。该框架利用遗传算法设计的数学特性,保证了每条通信链路的每一帧的传输槽无冲突。在此框架下,我们对一系列的GD设计施工进行了研究和评价。在此基础上提出了与拓扑无关的链路激活调度算法。所提出的方案是针对不同的目标而设计的:最大化最小系统吞吐量和最小化调度帧长度。分析结果表明,所提出的算法优于先前已知的算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书