无线网络在有损信道、M用户和目标场景下的网络编码协作性能分析

Mohamed El-Hihi, Hani H. Attar, A. Solyman, L. Stanković
{"title":"无线网络在有损信道、M用户和目标场景下的网络编码协作性能分析","authors":"Mohamed El-Hihi, Hani H. Attar, A. Solyman, L. Stanković","doi":"10.4236/CN.2016.84023","DOIUrl":null,"url":null,"abstract":"Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k 1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"70 1","pages":"257-280"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Network coding cooperation performance analysis in wireless network over a lossy channel, M users and a destination scenario\",\"authors\":\"Mohamed El-Hihi, Hani H. Attar, A. Solyman, L. Stanković\",\"doi\":\"10.4236/CN.2016.84023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k 1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).\",\"PeriodicalId\":91826,\"journal\":{\"name\":\"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security\",\"volume\":\"70 1\",\"pages\":\"257-280\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4236/CN.2016.84023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/CN.2016.84023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

网络编码(NC)是在世纪之交引入的,它使网络中的节点能够在发送或转发数据之前对数据进行代数组合。多年来,随机网络编码在转发之前随机组合接收到的数据包,导致复杂的乔丹高斯消去(JGE)解码过程,从而得到了广泛的应用。随机NC的有效性是通过节点间的协作实现的。在本文中,我们提出了一种简单,低复杂度的合作协议,该协议以确定性的方式利用NC,从而提高了多样性,数据速率和更简单的JGE解码过程。该系统应用于有耗无线网络。所研究的场景如下:M用户必须将他们的信息发送到一个共同的目的地D,并通过擦除通道在彼此之间交换信息;通常,用户和目的地之间的通道比用户之间的通道差。通过以简单、确定的方式组合来自不同用户的数据包,而不需要在转发到目的地和M个用户之前使用大量的报头信息,可以显著减少用户和目的地之间的流量,从而显著节省带宽。我们试图解决的关键问题是如何在利用用户合作的同时有效地组合每个用户的数据包,以及成功从k 1到10 k 4的D处所有用户恢复信息的概率,因为所提出的组合算法使节点能够生成额外的唯一线性方程来广播,而不是通过ARQ重复相同的方程。并且,每个合作阶段的传输数据包数量从M (M - 1)下降到M (M2 - 1),当使用三个阶段的传输系统而不是一个阶段(两个合作阶段)时,产生2m数据包而不是2 (M2 - 1)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Network coding cooperation performance analysis in wireless network over a lossy channel, M users and a destination scenario
Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k 1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Cooperative Cognitive Radio Spectrum Sensing Based on Correlation Sum Method with Linear Equalization ADS-B Reception Error Correction Based on the LSTM Neural-Network Model Why the Incoherent Paradigm is for the Future Wireless Networks? A Meta-Learning Approach for Aircraft Trajectory Prediction Analyses of Virtual MIMO Multi-User System Performance with Linear Precoding Schemes Using Indoor Measurements at 5 GHz
×
引用
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