Throughput-Delay Scaling for Two Mobile Overlaid Networks

W. Zhang, C. Yeo
{"title":"Throughput-Delay Scaling for Two Mobile Overlaid Networks","authors":"W. Zhang, C. Yeo","doi":"10.1109/GLOCOM.2010.5683829","DOIUrl":null,"url":null,"abstract":"In this paper, we study the throughput and delay scaling laws of two coexisting mobile networks. By considering that both the primary and secondary networks are mobile and move according to random walk model, we propose a multi-hop transmission scheme. Based on the assumption that the secondary node can help to relay the primary packet, we show that the secondary network can achieve the same throughput and delay scaling laws as in stand-alone network D_s(m)=Θ(mλ_s(m)). Furthermore, for primary network, it is shown that the throughput-delay tradeoff scaling law is given by D_p(n)=Θ(√{n\\log{n}}λ_p(n)), when the primary node is chosen as relay node. If the relay node is a secondary node, the scaling law is D_p(n)=Θ(√{n^{β}\\log{n}}λ_p(n)), where β>1. The novelties of this paper lie in: i) Detailed study of the delay scaling law of the secondary network in the complex scenario where both the primary and secondary networks are mobile; ii) The impact of buffer delay on the primary and secondary networks due to the presence of preservation region. We explicitly analyze the buffer delay and obtain an expression as D^{II}_{S_R}(m)=Θ(1/√{n^{β-1}a_s(m)}).","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"101 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5683829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we study the throughput and delay scaling laws of two coexisting mobile networks. By considering that both the primary and secondary networks are mobile and move according to random walk model, we propose a multi-hop transmission scheme. Based on the assumption that the secondary node can help to relay the primary packet, we show that the secondary network can achieve the same throughput and delay scaling laws as in stand-alone network D_s(m)=Θ(mλ_s(m)). Furthermore, for primary network, it is shown that the throughput-delay tradeoff scaling law is given by D_p(n)=Θ(√{n\log{n}}λ_p(n)), when the primary node is chosen as relay node. If the relay node is a secondary node, the scaling law is D_p(n)=Θ(√{n^{β}\log{n}}λ_p(n)), where β>1. The novelties of this paper lie in: i) Detailed study of the delay scaling law of the secondary network in the complex scenario where both the primary and secondary networks are mobile; ii) The impact of buffer delay on the primary and secondary networks due to the presence of preservation region. We explicitly analyze the buffer delay and obtain an expression as D^{II}_{S_R}(m)=Θ(1/√{n^{β-1}a_s(m)}).
两个移动覆盖网络的吞吐量-延迟缩放
本文研究了两种共存移动网络的吞吐量和时延缩放规律。考虑到主网络和从网络都是移动的,并且按照随机游走模型移动,我们提出了一种多跳传输方案。基于辅助节点可以帮助中继主数据包的假设,我们证明辅助网络可以实现与独立网络相同的吞吐量和延迟缩放规律D_s(m)=Θ(mλ_s(m))。此外,对于主网络,当选择主节点作为中继节点时,吞吐量-延迟权衡缩放律为D_p(n)=Θ(√{n\log{n}}λ_p(n))。若中继节点为次级节点,则标度规律为D_p(n)=Θ(√{n^{β}\log{n}}λ_p(n)),其中β>1。本文的新颖之处在于:1)详细研究了主从网络均为移动网络的复杂场景下副网络的时延缩放规律;ii)由于保留区域的存在,缓冲延迟对主从网络的影响。我们显式地分析了缓冲延迟,得到了D^{II}_{S_R}(m)=Θ(1/√{n^{β-1}a_s(m)})的表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信