Optimal Target Set Selection via Opinion Dynamics

Prince Sharma, Shailendra Shukla
{"title":"Optimal Target Set Selection via Opinion Dynamics","authors":"Prince Sharma, Shailendra Shukla","doi":"10.1109/PDGC.2018.8745846","DOIUrl":null,"url":null,"abstract":"The solution for handling the issue of mobile data is gaining significance due to the exponential rise in data traffic in recent years. Data traffic offloading becomes a challenging problem, if it is dependent only on infrastructure (femtocells, Bluetooth, WiFi). Opportunistic communications(mobile social networks, Delay tolerant networks) can enhance the offloading efficiently if the target nodes(helper nodes) are chosen optimally. In this paper, we have considered this problem and propose a Target Set Selection algorithm based on Opinion Dynamics. The opinion vector provides a weighed feedback for the community to select the helper nodes. To validate our algorithm, we have compare it with existing algorithm like heuristic approach and greedy approach of target set selection. Our result shows that the number of nodes identified in the Target Set can further be reduced by nearly 13% when compared with degree based greedy approach. Result also shows that our approach is nearly 58% better than the heuristic approach, infrastructure-based approach in terms of traffic forwarding via helper node.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC.2018.8745846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The solution for handling the issue of mobile data is gaining significance due to the exponential rise in data traffic in recent years. Data traffic offloading becomes a challenging problem, if it is dependent only on infrastructure (femtocells, Bluetooth, WiFi). Opportunistic communications(mobile social networks, Delay tolerant networks) can enhance the offloading efficiently if the target nodes(helper nodes) are chosen optimally. In this paper, we have considered this problem and propose a Target Set Selection algorithm based on Opinion Dynamics. The opinion vector provides a weighed feedback for the community to select the helper nodes. To validate our algorithm, we have compare it with existing algorithm like heuristic approach and greedy approach of target set selection. Our result shows that the number of nodes identified in the Target Set can further be reduced by nearly 13% when compared with degree based greedy approach. Result also shows that our approach is nearly 58% better than the heuristic approach, infrastructure-based approach in terms of traffic forwarding via helper node.
基于意见动态的最优目标集选择
由于近年来数据流量呈指数级增长,处理移动数据问题的解决方案变得越来越重要。如果数据流量仅依赖于基础设施(femtocells、蓝牙、WiFi),那么数据流量卸载将成为一个具有挑战性的问题。机会性通信(移动社交网络、容错网络)可以通过优化目标节点(辅助节点)的选择,有效地提高网络的卸载效率。本文考虑了这一问题,提出了一种基于意见动态的目标集选择算法。意见向量为社区选择辅助节点提供了一个加权反馈。为了验证我们的算法,我们将其与现有的目标集选择的启发式方法和贪心方法进行了比较。我们的结果表明,与基于度的贪婪方法相比,在目标集中识别的节点数量可以进一步减少近13%。结果还表明,在通过辅助节点转发流量方面,我们的方法比启发式方法(基于基础设施的方法)好近58%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信