基于网络编码的机会主义社交网络路由算法

Feng Qi, Chun-guang Ma, Yongzhe Zhou, Jun Miao
{"title":"基于网络编码的机会主义社交网络路由算法","authors":"Feng Qi, Chun-guang Ma, Yongzhe Zhou, Jun Miao","doi":"10.3969/J.ISSN.1671-1122.2015.02.009","DOIUrl":null,"url":null,"abstract":"In order to solve opportunistic social network with negative factors that the low success rate of data transmission and the large average network latency, we proposed the a routing algorithm of opportunistic social networks based on network coding(OSN-NC). The intermediate nodes of OSNNC routing algorithm are coded again only on the same target nodes of the coded data packet, so this can reduce the overall number of coded coeffi cients and the complexity of Gaussian elimination, and increase the reliability of data transmission. We use the message transmission strategy of combining PROPHET with network coding within the community, transmission the encoded data packets to the next hop node with greater encounter probability, until it reaches the destination node. We select the greater cumulative probability as the encoding node to complete message forwarding between the communities, until encounter intermediate nodes with the same community, then according to the messaging strategy within community. The simulation results show OSN-NC in improving network throughput and success rate of data transmission, reducing he average transmission delay other properties have signifi cantly improved.","PeriodicalId":148259,"journal":{"name":"Netinfo Security","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Routing Algorithm of Opportunistic Social Networks Based on Network Coding\",\"authors\":\"Feng Qi, Chun-guang Ma, Yongzhe Zhou, Jun Miao\",\"doi\":\"10.3969/J.ISSN.1671-1122.2015.02.009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve opportunistic social network with negative factors that the low success rate of data transmission and the large average network latency, we proposed the a routing algorithm of opportunistic social networks based on network coding(OSN-NC). The intermediate nodes of OSNNC routing algorithm are coded again only on the same target nodes of the coded data packet, so this can reduce the overall number of coded coeffi cients and the complexity of Gaussian elimination, and increase the reliability of data transmission. We use the message transmission strategy of combining PROPHET with network coding within the community, transmission the encoded data packets to the next hop node with greater encounter probability, until it reaches the destination node. We select the greater cumulative probability as the encoding node to complete message forwarding between the communities, until encounter intermediate nodes with the same community, then according to the messaging strategy within community. The simulation results show OSN-NC in improving network throughput and success rate of data transmission, reducing he average transmission delay other properties have signifi cantly improved.\",\"PeriodicalId\":148259,\"journal\":{\"name\":\"Netinfo Security\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Netinfo Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3969/J.ISSN.1671-1122.2015.02.009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Netinfo Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3969/J.ISSN.1671-1122.2015.02.009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了解决机会主义社交网络存在的数据传输成功率低、网络平均时延大等负面因素,提出了一种基于网络编码的机会主义社交网络路由算法(OSN-NC)。OSNNC路由算法的中间节点只在编码数据包的同一目标节点上再次编码,这样可以减少编码系数的总数和高斯消去的复杂度,提高数据传输的可靠性。我们采用PROPHET与社区内网络编码相结合的消息传输策略,将编码后的数据包传输到遇到概率较大的下一跳节点,直至到达目的节点。我们选择累积概率较大的节点作为编码节点完成社团间的消息转发,直到遇到具有相同社团的中间节点,再根据社团内的消息传递策略进行转发。仿真结果表明,OSN-NC在提高网络吞吐量和数据传输成功率、降低平均传输时延等性能方面都有明显改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Routing Algorithm of Opportunistic Social Networks Based on Network Coding
In order to solve opportunistic social network with negative factors that the low success rate of data transmission and the large average network latency, we proposed the a routing algorithm of opportunistic social networks based on network coding(OSN-NC). The intermediate nodes of OSNNC routing algorithm are coded again only on the same target nodes of the coded data packet, so this can reduce the overall number of coded coeffi cients and the complexity of Gaussian elimination, and increase the reliability of data transmission. We use the message transmission strategy of combining PROPHET with network coding within the community, transmission the encoded data packets to the next hop node with greater encounter probability, until it reaches the destination node. We select the greater cumulative probability as the encoding node to complete message forwarding between the communities, until encounter intermediate nodes with the same community, then according to the messaging strategy within community. The simulation results show OSN-NC in improving network throughput and success rate of data transmission, reducing he average transmission delay other properties have signifi cantly improved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信