无线多跳网络中基于到达间的丢包缓解流内干扰

Taewoon Kim, Wooyeol Choi, Hyuk Lim
{"title":"无线多跳网络中基于到达间的丢包缓解流内干扰","authors":"Taewoon Kim, Wooyeol Choi, Hyuk Lim","doi":"10.1145/1853079.1853087","DOIUrl":null,"url":null,"abstract":"In CSMA-based wireless multi-hop networks, consecutive packets on a single multi-hop path interfere with each other, causing hidden/exposed terminal problems and frequent contention. This phenomenon is called intra-flow interference and is considered as one of the principal factors degrading the throughput performance, since it increases the number of collisions as well as backoff intervals. Here, we propose a probabilistic packet dropping algorithm that mitigates the intra-flow interference on wireless multi-hop networks. In the proposed algorithm, a wireless node classifies all flows into several 1-hop forwarding domains, which are determined by the next relay node. For this classification, each node regards the flows that will pass the same 1-hop neighbor as ones belonging to the same forwarding domain. Each node probabilistically drops incoming packets if the inter-arrival time of incoming packets belonging to the same forwarding domain is so short as to make intra-flow interference. Through extensive simulation studies, we show that the proposed algorithm effectively reduce the intra-flow interference, and increases the overall throughput as well as fairness on wireless multi-hop networks.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Alleviating intra-flow interference by inter-arrival based packet dropping in wireless multi-hop networks\",\"authors\":\"Taewoon Kim, Wooyeol Choi, Hyuk Lim\",\"doi\":\"10.1145/1853079.1853087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In CSMA-based wireless multi-hop networks, consecutive packets on a single multi-hop path interfere with each other, causing hidden/exposed terminal problems and frequent contention. This phenomenon is called intra-flow interference and is considered as one of the principal factors degrading the throughput performance, since it increases the number of collisions as well as backoff intervals. Here, we propose a probabilistic packet dropping algorithm that mitigates the intra-flow interference on wireless multi-hop networks. In the proposed algorithm, a wireless node classifies all flows into several 1-hop forwarding domains, which are determined by the next relay node. For this classification, each node regards the flows that will pass the same 1-hop neighbor as ones belonging to the same forwarding domain. Each node probabilistically drops incoming packets if the inter-arrival time of incoming packets belonging to the same forwarding domain is so short as to make intra-flow interference. Through extensive simulation studies, we show that the proposed algorithm effectively reduce the intra-flow interference, and increases the overall throughput as well as fairness on wireless multi-hop networks.\",\"PeriodicalId\":409750,\"journal\":{\"name\":\"International Conference of Future Internet\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference of Future Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1853079.1853087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference of Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1853079.1853087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在基于csma的无线多跳网络中,单个多跳路径上的连续数据包相互干扰,导致隐藏/暴露终端问题和频繁的争用。这种现象被称为流内干扰,被认为是降低吞吐量性能的主要因素之一,因为它增加了碰撞次数和后退间隔。在此,我们提出了一种概率丢包算法,以减轻无线多跳网络的流内干扰。在该算法中,无线节点将所有流划分为若干个1跳转发域,由下一个中继节点确定。对于这种分类,每个节点都将经过同一1跳邻居的流视为属于同一转发域的流。如果同一转发域的入方向报文间到达时间过短,会造成流内干扰,则各节点有可能丢弃入方向的报文。通过大量的仿真研究,我们表明该算法有效地减少了流内干扰,提高了无线多跳网络的总体吞吐量和公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Alleviating intra-flow interference by inter-arrival based packet dropping in wireless multi-hop networks
In CSMA-based wireless multi-hop networks, consecutive packets on a single multi-hop path interfere with each other, causing hidden/exposed terminal problems and frequent contention. This phenomenon is called intra-flow interference and is considered as one of the principal factors degrading the throughput performance, since it increases the number of collisions as well as backoff intervals. Here, we propose a probabilistic packet dropping algorithm that mitigates the intra-flow interference on wireless multi-hop networks. In the proposed algorithm, a wireless node classifies all flows into several 1-hop forwarding domains, which are determined by the next relay node. For this classification, each node regards the flows that will pass the same 1-hop neighbor as ones belonging to the same forwarding domain. Each node probabilistically drops incoming packets if the inter-arrival time of incoming packets belonging to the same forwarding domain is so short as to make intra-flow interference. Through extensive simulation studies, we show that the proposed algorithm effectively reduce the intra-flow interference, and increases the overall throughput as well as fairness on wireless multi-hop networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信