发布求助
文献互助 智能选刊 最新文献

2018 IEEE Symposium on Computers and Communications (ISCC)最新文献

筛选
英文 中文
Affinity-Based User Clustering for Efficient Edge Caching in Content-Centric Cellular Networks 基于亲和力的用户聚类在以内容为中心的蜂窝网络中的高效边缘缓存
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538499
A. Ribeiro, L. Sampaio, A. Ziviani
{"title":"Affinity-Based User Clustering for Efficient Edge Caching in Content-Centric Cellular Networks","authors":"A. Ribeiro, L. Sampaio, A. Ziviani","doi":"10.1109/ISCC.2018.8538499","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538499","url":null,"abstract":"Network densification by small cell networks has become the main alternative for mobile network operators to deal with an ever-increasing traffic growth. In this context, Named Data Networking (NDN), an evolution of Content-Centric Networking (CCN), emerges as an alternative to improve data offloading by the promotion of in-network caching. In this paper, we propose a user clustering scheme that takes advantage of the affinity among users with respect to frequency of content requisition and common interest for content for a more efficient edge caching. The proposed strategy is evaluated in a varied set of scenarios, including different cache sizes, communication models, or concentration levels of content popularity. Simulation results show that the proposed strategy increases both cache hit ratio and data offloading in Content-Centric Cellular Networks.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133819895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A Study on Pseudo CRS Signal Jamming Attacks in LTE Network LTE网络中伪CRS信号干扰攻击研究
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538662
Xiaona Li, Zhongfang Wang
{"title":"A Study on Pseudo CRS Signal Jamming Attacks in LTE Network","authors":"Xiaona Li, Zhongfang Wang","doi":"10.1109/ISCC.2018.8538662","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538662","url":null,"abstract":"LTE is widely used and becoming the primary communication standard in the whole world. But its vulnerability to hostile interference, which is an interesting issue concerned by the scholars, should be paid more attention to. Some smart jammers, especially by means of pseudo signals, can easily attack against LTE network. In order to analyze the impact of pseudo CRS signals on the performance of channel estimation, two pseudo CRS signal jamming schemes are proposed in this paper, i.e., time-pseudo CRS scheme and phase-pseudo CRS scheme. Simulation results prove that the phase-pseudo CRS leads to serious influences to channel estimation which will have negative effects on data demodulation. From the evaluation results of JSR-MSE, the sensitivity to pseudo CRS from high to low is LS-W, LS-L and MMSE-W algorithm.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117061082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Fog Model for Dynamic Load Flow Analysis in Smart Grids 智能电网动态潮流分析的雾模型
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538738
E. B. C. Barros, M. Peixoto, Dionisio Machado Leite Filho, B. Batista, B. Kuehne
{"title":"A Fog Model for Dynamic Load Flow Analysis in Smart Grids","authors":"E. B. C. Barros, M. Peixoto, Dionisio Machado Leite Filho, B. Batista, B. Kuehne","doi":"10.1109/ISCC.2018.8538738","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538738","url":null,"abstract":"In the last 20 years, the amount of energy consumed has grown more than 50% and due to a shortage of energy resources in the future, will not be possible to meet all this demand. The current distribution model transports energy from stations to consumers, but does not consider the use of alternative sources. The smart grids have emerged to allow the inclusion of alternative forms of energy generation in the grid. Yet, to avoid an overload in the system is necessary to calculate the power flow in real time. In this paper, we use Fog Computing as mean to reduce the logical distance between the central distribution and consumption spot. IoT devices in the network edge have more effectiveness and less cost to handle the power flow information. We evaluate the performance of the Newton-Raphson and Gauss-Seidel algorithms with the objective of developing calculations in real time of the load flow problem with the help of fog. Our results have shown that is possible to make a smart grid based on Fog Computing and thus making smart electric networks that react to the environment.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Usable and Secure Cloud-based Biometric Authentication Solution for IoT Devices 可用和安全的基于云的物联网设备生物识别认证解决方案
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538712
C. Vorakulpipat, Takeshi Takahashi, Ekkachan Rattanalerdnusorn, Phithak Thaenkaew, D. Inoue
{"title":"Usable and Secure Cloud-based Biometric Authentication Solution for IoT Devices","authors":"C. Vorakulpipat, Takeshi Takahashi, Ekkachan Rattanalerdnusorn, Phithak Thaenkaew, D. Inoue","doi":"10.1109/ISCC.2018.8538712","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538712","url":null,"abstract":"Biometric authentication is increasingly recognized as an effective technique for secure authentication, but using such authentication with Internet of Things (IoT) devices is difficult. In the present paper, we propose an IoT biometric authentication solution that adopts a cloud-based IoT service platform. We present the proposed system architecture, which uses an IoT service platform and security alerting mechanisms to deal with physical and administrative constraints, including a limited Internet connection, a limited budget, a need for easy development, and a required high level of security. We also demonstrate the feasibility of the proposed solution.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130913907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Feedback-Based Content Poisoning Mitigation in Named Data Networking 命名数据网络中基于反馈的内容中毒缓解
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538609
Wenjing Cui, Yang Li, Yonghui Xin, Chang Liu
{"title":"Feedback-Based Content Poisoning Mitigation in Named Data Networking","authors":"Wenjing Cui, Yang Li, Yonghui Xin, Chang Liu","doi":"10.1109/ISCC.2018.8538609","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538609","url":null,"abstract":"NDN has been widely recognized as a promising architecture for future network where universal in-network caches provide convenient for content distribution. However, the ubiquitous caches mount a significant problem, called content poisoning, in NDN. Most current mitigation schemes aim to mitigate the bogus Data packets in the cache store rather than prohibit evil producers and locate the valid content, or they inhibit both the legitimate sources and evil ones meanwhile during traceback. In this paper, we present a lightweight approach to mitigate content poisoning by clearing bogus Data packets in cache store and help network to adjust forwarding paths to retrieve legitimate Data packets. The proposed scheme can block the evil producer and protect the legitimate producer at the same time. Furthermore, it can detect and resist the content poisoning generated by the intermediate compromised routers too. We implement our scheme by comparing it with Immediate Failover in ndnSIM simulator. Simulation results show that our scheme can alleviate the content poisoning attacks quickly and effectively.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130934851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Secret Sharing Schemes with Hidden Sets 具有隐藏集的秘密共享方案
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538542
Rick Lopes de Souza, M. Vigil, Ricardo Felipe Custódio, Florian Caullery, Lucia Moura, D. Panario
{"title":"Secret Sharing Schemes with Hidden Sets","authors":"Rick Lopes de Souza, M. Vigil, Ricardo Felipe Custódio, Florian Caullery, Lucia Moura, D. Panario","doi":"10.1109/ISCC.2018.8538542","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538542","url":null,"abstract":"Shamir’s Secret Sharing Scheme is well established and widely used. It allows a so-called Dealer to split and share a secret k among n Participants such that at least t shares are needed to reconstruct k, where $0lt/pgtlt t le n$. Nothing about the secret can belearned from less than t shares. To split secret k, the Dealer generates a polynomial f,whose independent term is k and the coefficients are randomly selected using a uniform distribution. A share is a pair $( x,f(x))$ where x is also chosen randomly using a uniform distribution. This scheme is useful, for example, to distribute cryptographic keys among different cloud providers and to create multi-factor authentication. The security of Shamir’s Secret Sharing Scheme is usually analyzed using a threat model where the Dealer is trusted to split and share secrets as described above. In this paper, we demonstrate that there exists a different threat model where a malicious Dealer can compute shares such that a subset of less than t shares is allowed to reconstruct the secret. We refer to such subsets as hidden sets. We formally define hidden sets and prove lower boundson the number of possible hidden sets for polynomials of degree $t -1.$ Yet, we show how to detect hidden sets given a set of n shares and describe how to create hidden sets while sharing a secret using a modification of Shamir’s scheme.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Management Framework for Future Internet Service Providers 未来互联网服务提供商的管理框架
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538490
R. Gomes, Francisco R. P. da Ponte, E. Cerqueira, L. Bittencourt, E. Madeira, M. Gerla
{"title":"Management Framework for Future Internet Service Providers","authors":"R. Gomes, Francisco R. P. da Ponte, E. Cerqueira, L. Bittencourt, E. Madeira, M. Gerla","doi":"10.1109/ISCC.2018.8538490","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538490","url":null,"abstract":"The Internet became the primary medium for content sharing, playing a central role in our modern lives. This new paradigm changed the behavior of the user and the characteristics of the applications, such as multimedia content, real time interaction, among others. Thus, the Internet Service Providers (ISPs) need to evolve, adding new technologies and management strategies to their network infrastructures, resulting in the Future Internet Service Providers (FISPs). Within this context, this paper presents the key technical trends and challenges for the management of FISPs, considering the requirements of user’s applications and the technologies to be standardized. Additionally, we introduce an architectural framework, called Framework for Integrated Management of Future Internet Service Providers (FIM), to expand the key technologies and to address the challenges in both access and edge networks, and to integrate the management of the FISP. A case study is presented to show the suitability of the proposed framework to enhance the management capacity of FISPs.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122435349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic Bandwidth Allocation for Home and SOHO Wireless Networks 家庭和SOHO无线网络的动态带宽分配
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538750
J. C. T. Guimaraes, H. Moura, Jonas R. A. Borges, M. Vieira, L. Vieira, D. Macedo
{"title":"Dynamic Bandwidth Allocation for Home and SOHO Wireless Networks","authors":"J. C. T. Guimaraes, H. Moura, Jonas R. A. Borges, M. Vieira, L. Vieira, D. Macedo","doi":"10.1109/ISCC.2018.8538750","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538750","url":null,"abstract":"Communications using wireless networks nowadays receives an increasing amount of users and devices. This implies in an increasing need for improvements in wireless networks. IEEE 802.11ac standard enables channels wider than 20 MHz bandwidth. But currently, access points allocate channel bandwidth statically, independent of the clients’ configurations. This leads to poor network performance. In this work, we design a system that enables clients to choose the link’s bandwidth they connect to the APs. We validate the system through realistic experiments. We show the trade-off between latency and throughput. Our results show that our system improves the frequency spectrum usage, and provide better throughput/latency for the user.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"358 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120879192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Characterizing User Behavior on Web Mapping Systems Using Real-World Data 使用真实世界数据表征Web映射系统中的用户行为
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538635
Vinícius G. Braga, S. Correa, Vagner José do Sacramento Rodrigues, K. Cardoso
{"title":"Characterizing User Behavior on Web Mapping Systems Using Real-World Data","authors":"Vinícius G. Braga, S. Correa, Vagner José do Sacramento Rodrigues, K. Cardoso","doi":"10.1109/ISCC.2018.8538635","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538635","url":null,"abstract":"This paper presents a thorough characterization of the user behavior patterns during navigation sessions on Web Mapping Systems (WMSs). Using an extension developed for the Google Chrome, we collected data from nearly 170 users of Google Maps. We present the results of the characterization of over 120,000 URLs. The revealed patterns constitute a valuable tool to plan service optimizations as well as the capacity of WMSs to ensure better user experience.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121260698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An Unikernels Provisioning Architecture for OpenStack OpenStack的Unikernels发放架构
2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538618
Luis Augusto Dias Knob, Bruno Xavier, T. Ferreto
{"title":"An Unikernels Provisioning Architecture for OpenStack","authors":"Luis Augusto Dias Knob, Bruno Xavier, T. Ferreto","doi":"10.1109/ISCC.2018.8538618","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538618","url":null,"abstract":"Recently, the development of Unikernels, extremely light operating systems constructed exclusively for virtualized environments, has emerged as another alternative to cloud platforms. Unikernels encourage new paradigms and provisioning techniques, such as immutable servers and microservices. This paper proposes an optimized architecture for Unikernels provisioning in OpenStack. The architecture is based on OSv Unikernels and experiments demonstrated that it can attain satisfactory results, reducing the time of the entire deployment workflow, from the compilation to the initialization of the Unikernels in the compute node.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126118506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信