利用网络编码进行移动社交网络病毒式传播

Z. Narmawala, S. Srivastava
{"title":"利用网络编码进行移动社交网络病毒式传播","authors":"Z. Narmawala, S. Srivastava","doi":"10.1109/INDICON.2014.7030651","DOIUrl":null,"url":null,"abstract":"Delay tolerant ad hoc network between mobile devices is a promising paradigm which can avoid significant cost of cellular data transfer. Many interesting applications such as peer-to-peer file transfer, micro-blogging etc. are possible on this network. We propose viral spread (Many-to-all broadcast) for such networks. Viral spread can be useful to variety of such applications as well as for routing protocols which require flooding of control messages. As these devices are carried by humans, we exploit properties of human mobility like overlapping community structure and heterogeneous popularity of nodes for efficient forwarding. Buffering all packets from all sources of community at each node is prohibitive. As buffer space is limited and buffer occupancy level also has an impact on energy requirements, to reduce buffer usage, we probabilistically buffer received packet for forwarding. To offset for the loss in performance due to this, we employ network coding. Network coding is a mechanism in which nodes encode two or more incoming packets and forward encoded packets instead of forwarding them as it is. To compare performance of viral spread, we also modify epidemic routing from unicast to broadcast and from deterministic buffering all the packets to probabilistic buffering. As simulation results suggest, viral spread achieves significantly high packet delivery percentage and low average delivery delay than modified epidemic routing. From simulation results, we also suggest optimal values of forwarding probability and generation size to be used in viral spread.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"515 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Viral spread in mobile social network using network coding\",\"authors\":\"Z. Narmawala, S. Srivastava\",\"doi\":\"10.1109/INDICON.2014.7030651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delay tolerant ad hoc network between mobile devices is a promising paradigm which can avoid significant cost of cellular data transfer. Many interesting applications such as peer-to-peer file transfer, micro-blogging etc. are possible on this network. We propose viral spread (Many-to-all broadcast) for such networks. Viral spread can be useful to variety of such applications as well as for routing protocols which require flooding of control messages. As these devices are carried by humans, we exploit properties of human mobility like overlapping community structure and heterogeneous popularity of nodes for efficient forwarding. Buffering all packets from all sources of community at each node is prohibitive. As buffer space is limited and buffer occupancy level also has an impact on energy requirements, to reduce buffer usage, we probabilistically buffer received packet for forwarding. To offset for the loss in performance due to this, we employ network coding. Network coding is a mechanism in which nodes encode two or more incoming packets and forward encoded packets instead of forwarding them as it is. To compare performance of viral spread, we also modify epidemic routing from unicast to broadcast and from deterministic buffering all the packets to probabilistic buffering. As simulation results suggest, viral spread achieves significantly high packet delivery percentage and low average delivery delay than modified epidemic routing. From simulation results, we also suggest optimal values of forwarding probability and generation size to be used in viral spread.\",\"PeriodicalId\":409794,\"journal\":{\"name\":\"2014 Annual IEEE India Conference (INDICON)\",\"volume\":\"515 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Annual IEEE India Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON.2014.7030651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Annual IEEE India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2014.7030651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

移动设备间容错自组织网络是一种很有前途的模式,它可以避免蜂窝数据传输的巨大成本。许多有趣的应用程序,如点对点文件传输、微博等,都可以在这个网络上实现。我们建议为这样的网络进行病毒式传播(多对全广播)。病毒式传播对于各种此类应用程序以及需要大量控制消息的路由协议都很有用。由于这些设备是由人类携带的,我们利用人类移动性的特性,如重叠的社区结构和节点的异构流行度来进行有效的转发。在每个节点缓冲来自所有社区源的所有数据包是不允许的。由于缓冲区空间有限,并且缓冲区占用水平也会影响能源需求,因此为了减少缓冲区的使用,我们对接收到的数据包进行概率缓冲以进行转发。为了弥补由此带来的性能损失,我们采用了网络编码。网络编码是一种机制,其中节点对两个或多个传入数据包进行编码,并转发编码后的数据包,而不是原样转发。为了比较病毒传播的性能,我们还将流行病路由从单播修改为广播,并将所有数据包的确定性缓冲修改为概率缓冲。仿真结果表明,与改进的流行病路由相比,病毒传播路由实现了较高的分组投递率和较低的平均投递延迟。从模拟结果中,我们还提出了病毒传播中转发概率和代大小的最优值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Viral spread in mobile social network using network coding
Delay tolerant ad hoc network between mobile devices is a promising paradigm which can avoid significant cost of cellular data transfer. Many interesting applications such as peer-to-peer file transfer, micro-blogging etc. are possible on this network. We propose viral spread (Many-to-all broadcast) for such networks. Viral spread can be useful to variety of such applications as well as for routing protocols which require flooding of control messages. As these devices are carried by humans, we exploit properties of human mobility like overlapping community structure and heterogeneous popularity of nodes for efficient forwarding. Buffering all packets from all sources of community at each node is prohibitive. As buffer space is limited and buffer occupancy level also has an impact on energy requirements, to reduce buffer usage, we probabilistically buffer received packet for forwarding. To offset for the loss in performance due to this, we employ network coding. Network coding is a mechanism in which nodes encode two or more incoming packets and forward encoded packets instead of forwarding them as it is. To compare performance of viral spread, we also modify epidemic routing from unicast to broadcast and from deterministic buffering all the packets to probabilistic buffering. As simulation results suggest, viral spread achieves significantly high packet delivery percentage and low average delivery delay than modified epidemic routing. From simulation results, we also suggest optimal values of forwarding probability and generation size to be used in viral spread.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信