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

2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)最新文献

筛选
英文 中文
Blockchain-based Crowd-sensing System 基于区块链的人群感知系统
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8605960
Junqin Huang, Lingkun Kong, L. Kong, Z. Liu, Zhiqiang Liu, Guihai Chen
{"title":"Blockchain-based Crowd-sensing System","authors":"Junqin Huang, Lingkun Kong, L. Kong, Z. Liu, Zhiqiang Liu, Guihai Chen","doi":"10.1109/HOTICN.2018.8605960","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8605960","url":null,"abstract":"Crowd-sensing systems have gained considerable interests and adoption in recent years. However, most existing crowd-sensing systems rely on central servers, which are subject to low reliability due to the traditional centralized architecture and high service fee. Motivated by constructing a crowd-sensing system with security and low service fee, we propose a blockchain-based crowd-sensing system (BCS), which replaces traditional triangle architecture by decentralized blockchain system. Also, in order to accelerate the formation of the fabric of trust, BCS implements applications of smart contracts to reward sensing-task workers, which offers reliable anonymity in the meantime. By leveraging blockchain technology, BCS has good performance in privacy protection and system robustness.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133461292","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}
引用次数: 11
Design of Miniature Spectrometer Based on Blockchain Technology 基于区块链技术的微型光谱仪设计
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8606042
Jianwei Yin, Weibin Hong, Ziru Yu, Xiangyang Yu
{"title":"Design of Miniature Spectrometer Based on Blockchain Technology","authors":"Jianwei Yin, Weibin Hong, Ziru Yu, Xiangyang Yu","doi":"10.1109/HOTICN.2018.8606042","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8606042","url":null,"abstract":"The data measured by traditional miniature spectrometers can easily be tampered with, and even if it is provided to others, the authenticity of the data cannot be ensured, and the data value is low. Blockchain network gives each registered miniature spectrometer a unique identity. It guarantees the authenticity of the data, can be fully utilized, and increases the value of the data.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132184650","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}
引用次数: 1
A security architecture of VANET based on blockchain and mobile edge computing 基于区块链和移动边缘计算的VANET安全架构
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8605952
Xiaodong Zhang, Ru Li, Bo Cui
{"title":"A security architecture of VANET based on blockchain and mobile edge computing","authors":"Xiaodong Zhang, Ru Li, Bo Cui","doi":"10.1109/HOTICN.2018.8605952","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8605952","url":null,"abstract":"The development of Vehicular Ad-hoc NETwork (VANET) has brought many conveniences to human beings, but also brings a very prominent security problem. The traditional solution to the security problem is based on centralized approach which requires a trusted central entity which exists a single point of failure problem. Moreover, there is no approach of technical level to ensure security of data. Therefore, this paper proposes a security architecture of VANET based on blockchain and mobile edge computing. The architecture includes three layers, namely perception layer, edge computing layer and service layer. The perception layer ensures the security of VANET data in the transmission process through the blockchain technology. The edge computing layer provides computing resources and edge cloud services to the perception layer. The service layer uses the combination of traditional cloud storage and blockchain to ensure the security of data.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134389901","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}
引用次数: 58
An Insightful Experimental Study of a Sophisticated Interest Flooding Attack in NDN 基于NDN的复杂兴趣泛洪攻击实验研究
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8605965
Lixia Zhao, Guang Cheng, Xiaoyan Hu, Hua Wu, J. Gong, Wang Yang, Chengyu Fan
{"title":"An Insightful Experimental Study of a Sophisticated Interest Flooding Attack in NDN","authors":"Lixia Zhao, Guang Cheng, Xiaoyan Hu, Hua Wu, J. Gong, Wang Yang, Chengyu Fan","doi":"10.1109/HOTICN.2018.8605965","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8605965","url":null,"abstract":"NDN (Named Data Networking), a promising next-generation architecture, puts named content in the first place of the network and is resilient to many existing DDoS attacks. However, Interest Flooding Attack (IFA), a typical NDN-specific DDoS attack, has been widely recognized as a serious threat to the development of NDN. The existing countermeasures against IFA mainly aim at the scenario that attackers send spoofed Interests at a fairly high rate and intermediate routers near the attackers can timely detect the attack by themselves. Instead, this work focuses on a more sophisticated scenario that carefully-crafted attackers send Interests at a respectively lower rate at the beginning but gradually speed up to keep the victims’ PIT sizes increasing to eventually deplete the PIT resource for legitimate users. We conduct an insightful experimental study of such sophisticated IFAs on a real-world network topology and our experimental results demonstrate that the statistics of intermediate routers near the attackers change more gradually and slightly in such an attack, which makes it more difficult for an intermediate router near the attackers to detect by itself. Based on the analytical results of this study, we discuss a potential detection and countermeasure mechanism against such a sophisticated IFA in which a central controller monitors the network from a global view.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133115667","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}
引用次数: 5
Delay-aware Power Saving Mechanism for 802.11 Wireless LANs via NDN 基于NDN的802.11无线局域网延迟感知节能机制
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8605948
Xinfang Xie, Wang Yang, Kaijin Tian
{"title":"Delay-aware Power Saving Mechanism for 802.11 Wireless LANs via NDN","authors":"Xinfang Xie, Wang Yang, Kaijin Tian","doi":"10.1109/HOTICN.2018.8605948","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8605948","url":null,"abstract":"Idle listening (IL) is the major source of power consumption in Wi-Fi interface for mobile station. The reason is that station (STA) does not know when there would be data for it and it has to stay in IL to wait for the data. With the advantages of named data networking, this problem can be solved well, However, stations may have different requirements on delay, the existing power saving mechanism lacks consideration of delay. In order to improve the quality of service (QoS), we apply an innovative network architecture of NDN and mark the real-time requirements of stations in the Interest packets using a flag bit. And we use a priority sending queue to further reduce the latency of the delay-sensitive packets. The requirements of delay and energy efficiency can be satisfied with different settings of the flag bit. The simulation results show that the proposal can reduce the average delay up to 20% compared with the power saving mode in NDN and gain the commendable energy efficiency.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133245837","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
A QoS-supported Multi-constrained Routing Strategy Based on Ant-Colony Optimization for Named Data Networking 命名数据网络中基于蚁群优化的多约束qos路由策略
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8606041
Yong Zheng, Min Han, Liuting He, Ya Li, Guanglin Xing, Rui Hou
{"title":"A QoS-supported Multi-constrained Routing Strategy Based on Ant-Colony Optimization for Named Data Networking","authors":"Yong Zheng, Min Han, Liuting He, Ya Li, Guanglin Xing, Rui Hou","doi":"10.1109/HOTICN.2018.8606041","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8606041","url":null,"abstract":"Named data networking (NDN) is a typical representation and implementation of content-centric networking (CCN) and serves as a basis for the next-generation Internet. To the best of our knowledge, very few studies have considered multi-metric constraints on routing strategies. Therefore, This paper proposes a multi-constrained routing strategy based on ant-colony optimization (ACO) to satisfy the multi-metric requirements for supporting the QoS of NDN. In the proposed routing strategy, namely ACO-McQoS, bandwidth, delay, and cost are defined as metrics. An optimal combination of these metrics is chosen to accommodate different QoS requests. An extensive simulation is conducted among the shortest path routing, maximum bandwidth path routing, random path routing, and ACO-McQoS. The simulation results show that the proposed routing strategy outperforms other.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712228","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}
引用次数: 1
End-to-end Answer Selection via Attention-Based Bi-LSTM Network 基于注意力的Bi-LSTM网络的端到端答案选择
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8606015
Yuqi Ren, Tongxuan Zhang, Xikai Liu, Hongfei Lin
{"title":"End-to-end Answer Selection via Attention-Based Bi-LSTM Network","authors":"Yuqi Ren, Tongxuan Zhang, Xikai Liu, Hongfei Lin","doi":"10.1109/HOTICN.2018.8606015","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8606015","url":null,"abstract":"Many people ask medical questions online, finding the most suitable answer from candidate answers is an important research area in health care. The IEEE HotICN Knowledge Graph Academic Competition given a question and several candidate answers, then sort the candidate answers to get the best answer. We treated this subtask as a binary classification task, sorted the answers by calculating similarity between the question and each answer. In this work, we proposed a neural selection model trained on the training dataset. Our network architecture is based on the combination of Bi-LSTM and Attention mechanism, extended with biomedical word embeddings. Based on this fact, our model achieve state-of-the-art results on answer selection of medical community.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130181337","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
3D-DAG: A High Performance DAG Network with Eventual Consistency and Finality 3D-DAG:具有最终一致性和终局性的高性能DAG网络
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8605990
Joe Zou, Zhongli Dong, Allen Shao, Peng Zhuang, Wei Li, Albert Y. Zomaya
{"title":"3D-DAG: A High Performance DAG Network with Eventual Consistency and Finality","authors":"Joe Zou, Zhongli Dong, Allen Shao, Peng Zhuang, Wei Li, Albert Y. Zomaya","doi":"10.1109/HOTICN.2018.8605990","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8605990","url":null,"abstract":"Blockchain has been widely recognized as the trust machine underpinning the Internet of Things(IoT). However, the poor performance of the existing mainstream platforms renders this expectation unattainable. New technologies like DAG and Hashgraph emerge as promising candidates to address the pressing issues, but their abilities in decentralized consensus are still in question. We propose a 3D-DAG model to address the trilemma of decentralization, scalability and security. Experiment results show that, by adopting the separation of concerns(SOC) architectural principle and a software defined chain(SDC) approach, 3D-DAG can meet challenging requirements expected by IoT applications.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238942","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
A Probability-based Caching Strategy with Consistent Hash in Named Data Networking 命名数据网络中基于概率的一致性哈希缓存策略
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8606014
Yang Qin, Weihong Yang, Wu Liu
{"title":"A Probability-based Caching Strategy with Consistent Hash in Named Data Networking","authors":"Yang Qin, Weihong Yang, Wu Liu","doi":"10.1109/HOTICN.2018.8606014","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8606014","url":null,"abstract":"In-network caching is one of prominent features of Named Data Networking (NDN), which greatly improves the performance of data transmission. In this paper, we propose a probability-based caching strategy with consistent hash (Prob-CH). Prob-CH makes caching decision based on the probability that calculated by jointly considering content’s popularity, node’s betweenness, and distance to consumers. The consistent hashing algorithm is used to guarantee that there is at most one copy cached in the network, which can reduce the redundancy of cache. Moreover, Prob-CH forwards a newly arriving Interest according to a dual forwarding strategy, in which an Interest packet will be guided to producer and its cached node calculated by consistent hashing, respectively. The simulation results show that the proposed Prob-CH caching strategy can achieve better performance in terms of cache-hit ratio, hop counts and server load.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369774","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}
引用次数: 7
A Competitiveness-driven and Secure Incentive Mechanism for Competitive Organizations Data Sharing: A Contract Theoretic Approach 竞争组织数据共享的竞争驱动和安全激励机制:契约理论方法
2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN) Pub Date : 2018-08-01 DOI: 10.1109/HOTICN.2018.8606006
B. Guo, Xiaofang Deng, Q. Guan, Jie Tian
{"title":"A Competitiveness-driven and Secure Incentive Mechanism for Competitive Organizations Data Sharing: A Contract Theoretic Approach","authors":"B. Guo, Xiaofang Deng, Q. Guan, Jie Tian","doi":"10.1109/HOTICN.2018.8606006","DOIUrl":"https://doi.org/10.1109/HOTICN.2018.8606006","url":null,"abstract":"In the era of big data and artificial intelligence, data sharing is desirable for vigorous development of data-driven intelligent services. Although data sharing is supported to a certain extent by current mechanisms and technologies, organizations especially with potential competitive relationships might refuse to share their data. One reason is that data holders worry that data sharing improves competitors’ competitiveness. The other reason is that data sharing suffers huge privacy security risk. To address these problems, in this paper, the concept of competitiveness is introduced as a data sharing transaction driving force to eliminate the competitiveness worry of data holders while differential privacy is adopt to protect their privacy. As there is an information asymmetry between data sharers and data demanders, a contract theoretic approach is proposed to motivate data holders to share data with privacy protection, which is expected to achieve a target of win-win and data sharing security. By designing optimal contracts, the data demander can decide rationally how to pay the data holders given the privacy parameter. Moreover, data holders can choose the contract that maximize their utilities. Numerical results substantiate the effectiveness of the the proposed scheme.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132718144","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
首页 上一页 下一页 尾页
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学术官方微信