改进吞吐量的自组织网络中的机会中继

S. K. Malekee, Ehsan Rahimi, M. Mayiami
{"title":"改进吞吐量的自组织网络中的机会中继","authors":"S. K. Malekee, Ehsan Rahimi, M. Mayiami","doi":"10.1109/ICCITECHNOL.2012.6285791","DOIUrl":null,"url":null,"abstract":"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Opportunistic relaying in ad-hoc networks for throughput improvement\",\"authors\":\"S. K. Malekee, Ehsan Rahimi, M. Mayiami\",\"doi\":\"10.1109/ICCITECHNOL.2012.6285791\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.\",\"PeriodicalId\":435718,\"journal\":{\"name\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHNOL.2012.6285791\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文考虑同一频段内的n个移动源-目的对和m个中继节点。在以前的工作中,假设自组织节点是固定的,这导致SINR较低的用户无法通过中继进行通信。在这里,我们提出了一种方案,该方案以机会主义的方式管理移动性,使自组织节点满足较低的SINR阈值才能活跃并成功传输。对均匀随机分布在恒定区域上的n个源-目的对和m个中继计算新的信噪比阈值。这个阈值为1-√(log n/n)/R,这导致吞吐量的下限增加。此外,我们研究了节点移动所需的时间,并估计其为Θ(√(log n))。与之前计算的顺序为Θ(n)的排队延迟项相比,这个时间可以忽略不计。仿真结果和分析计算都表明,在延迟没有明显变化的情况下,我们获得了更好的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Opportunistic relaying in ad-hoc networks for throughput improvement
In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the BEP performance of binary noncoherent modulation schemes in frequency-nonselective M2M double Hoyt fading channels Sequential spectrum sensing based on higher-order statistics for cognitive radios TPC-H benchmarking of Pig Latin on a Hadoop cluster Enhanced Slotted ALOHA protocol with collision processing and relay cooperation Case study: Impacts on information systems governance, agility and strategic flexibility of simultaneous implementation of several process approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1