2018 International Symposium on Networks, Computers and Communications (ISNCC)最新文献_第3页

An Enhanced Architecture for Serial Fusion based Multi-biometric Verification System 基于串行融合的多生物特征验证系统的改进体系结构

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530995

M. Hossain, Jundong Chen, K. Rahman

{"title":"An Enhanced Architecture for Serial Fusion based Multi-biometric Verification System","authors":"M. Hossain, Jundong Chen, K. Rahman","doi":"10.1109/ISNCC.2018.8530995","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530995","url":null,"abstract":"The traditional architecture of serial fusion based multi-biometric verification systems places an average performing or the worst performing individual verifier in the final stage. Because the final stage gives the verification decision using a single threshold and takes on the most confusing samples which are rejected by all previous stages, an average or the worst performing individual verifier may incur high verification errors in the final stage, which may negatively impact the performance of the whole system. Unfortunately, it is not possible to place a strong individual verifier in the final stage of a traditional architecture because if we place a strong individual verifier in the final stage, we will have to place a weak individual verifier in an earlier stage. Studies show that placing a weak individual verifier in an earlier stage worsens the performance of the whole system by giving more wrong decision earlier. Hence, the challenge is-how can we place the best performing individual verifier in the first stage and at the same time not place an average or the worst performing individual verifier in the final stage? In this paper, we address this challenge. We have come up with a very simple but effective solution. We have proposed a modification to the traditional architecture of serial fusion based multi-biometric verification systems. With rigorous experiments on the NIST multi-modal dataset and using three serial fusion based multi-biometric verification schemes, we demonstrated that our proposed architecture significantly improves the performance of serial fusion based multi-biometric verification systems.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114183785","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

Cloud Stock Exchange for Telecommunication 电信云证券交易所

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531052

Ákos Leiter

引用次数: 2

Design of a Photoconductive Antenna for Pulsed-Terahertz Spectroscopy with Polarization Diversity 具有极化分集的脉冲太赫兹光导天线设计

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530985

Salman Behboudi Amlashi, A. Araghi, G. Dadashzadeh

引用次数: 4

An Efficient Jamming Rejection Scheme of FH-Based Adaptive Beamforming System for High-Mobility Communication Links 高移动通信链路中基于跳频的自适应波束形成系统的有效抗干扰方案

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531077

Qi Zeng, Junfang Zhong, Xianhua Niu

引用次数: 1

A Complexity-less Approach for Automated Development of Data-intensive Web Applications 数据密集型Web应用程序自动化开发的低复杂性方法

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531027

T. Panetti, A. D’Ambrogio

{"title":"A Complexity-less Approach for Automated Development of Data-intensive Web Applications","authors":"T. Panetti, A. D’Ambrogio","doi":"10.1109/ISNCC.2018.8531027","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531027","url":null,"abstract":"This paper illustrates an approach, denoted as MDA-VIEW, for the automated generation of Web-based applications in the data management domain. The run-time application generated by use of the MDA-VIEW approach is ready to be deployed into a multi-tenant cloud environment. The approach takes into account both the fact that create, read, update and delete (CRUD) operations contribute to a large part of software development in data-intensive applications and the fact that modern databases can be used for storing additional information like data model documentation and integrity checks. By using the proposed approach, CRUD operations, integrity checks and user documentation can be auto-generated from the physical data model specified in standard UML by use of a conventional CASE tool. We define MDA-VIEW as a complexity-less approach, meaning that developers can easily create very complex applications by auto-generating them from data model definitions. The paper also describes a proof of concept by illustrating both the approach implementation and an example application to the generation of a data-intensive business software.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267955","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

Joint Beamforming Design and BBU Computational Resources Allocation in Heterogeneous C-RAN with QoS Guarantee 具有QoS保证的异构C-RAN联合波束形成设计与BBU计算资源分配

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530999

Mostafa M. Abdelhakam, M. M. Elmesalawy

引用次数: 2

Comparative Analysis of IoT Communication Protocols 物联网通信协议比较分析

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530963

Burak H. Çorak, F. Y. Okay, Metehan Guzel, Sahin Murt, S. Özdemir

引用次数: 40

Lightweight IoT Group Key Establishment Scheme Using One-way Accumulator 使用单向累加器的轻量级物联网组密钥建立方案

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531034

Teklay Gebremichael, Ulf Jennehag, M. Gidlund

{"title":"Lightweight IoT Group Key Establishment Scheme Using One-way Accumulator","authors":"Teklay Gebremichael, Ulf Jennehag, M. Gidlund","doi":"10.1109/ISNCC.2018.8531034","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531034","url":null,"abstract":"Group communication in the context of Internet of Things (IoT) is an efficient and fast way of broadcasting group messages. A message needs to be sent securely to maintain confidentiality of data and privacy of users. The main challenges in sharing group keys consist in designing and implementing a group key establishment scheme that is feasible for devices with limited computational capabilities. Existing group establishment schemes do not offer a good solution for resource-constrained IoT devices, a solution that provides secure group key management procedures when new nodes join or leave the group without compromising the security of the system. In this paper, we propose a lightweight and computationally secure group key establishment scheme suitable for resource constrained IoT networks. The proposed scheme is based on elliptic curve cryptography and cryptographic one-way accumulators. We show how to combine the aforementioned concepts to design a group key establishment scheme that guarantees both forward and backward secrecy. Finally, we show how the established group key is updated when the group size dynamically changes and how the proposed solution can be used with block and stream ciphers.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121988202","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}

引用次数: 10

The Bufferboost Effect: when Drops and Redundancy boost the Throughput Bufferboost效应:当下降和冗余提高吞吐量

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530998

Carlo Augusto Grazia, Martin Klapež, M. Casoni

{"title":"The Bufferboost Effect: when Drops and Redundancy boost the Throughput","authors":"Carlo Augusto Grazia, Martin Klapež, M. Casoni","doi":"10.1109/ISNCC.2018.8530998","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530998","url":null,"abstract":"In this paper, we present and characterize a phenomenon that arises when network congestion is met with packet redundancy at a distributed bottleneck. Congestion typically causes packet drops at the queueing level, especially when Active Queue Management techniques are employed to mitigate the bufferbloat effect. Redundancy may be present in the form of packet replication over different paths, as a solution to increase network resilience and network availability guarantees. When both network congestion and packet redundancy are in place, a counterintuitive throughput-boosting effect may originate from them. We named this phenomenon bufferboost, for the key role played by packet drops introduced to avoid bufferbloat effects. The contributions of this paper are the definition of the buffer-boost phenomenon, its modelling through a mathematical upper bound formulation, its isolation in an emulated environment for reproducibility and its validation through an extensive numerical evaluation that also verifies the introduced model. Results show that bufferboost is a favorable side effect able to boost network throughput.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116201342","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

Experimental evaluation of SAPC-R: an adaptive power control protocol for mobile sensors 移动传感器自适应功率控制协议SAPC-R的实验评估

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531046

D. Basu, G. S. Gupta, Yan Zhang, A. Nag, L. Doyle

{"title":"Experimental evaluation of SAPC-R: an adaptive power control protocol for mobile sensors","authors":"D. Basu, G. S. Gupta, Yan Zhang, A. Nag, L. Doyle","doi":"10.1109/ISNCC.2018.8531046","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531046","url":null,"abstract":"Transmission power control in energy-constrained mobile wireless sensor nodes is a necessary means to extend the battery lifetime and reduce the overall operational expenditure. The body-wearable sensors are perhaps the best examples when they are used for tracking and monitoring health of individuals and to carry out data analysis for possible symptoms of any disease. In indoor environments, the challenge is increased manifold due to complex multi-path propagation and temporal variation of link quality. This paper has enhanced our previous work on the state based adaptive power control protocol (SAPC) to suit well in indoor dynamic radio environments. The proposed protocol adjusts the state-transition rate $R$ (drop-off rate) from a higher to a lower state, depending on the radio link quality. This improvement is implemented in SAPC protocol and renamed as SAPC-R. This protocol is compared with an existing practical adaptive power control protocol (P-ATPC) that can track variations in the radio link quality, and select an appropriate transmission power level and the number of retransmissions. The aim is to keep the algorithm computationally simple as it will run on battery powered devices and therefore are energy-constrained. Simulation results show that SAPC-R can save at least 25% energy as compared to P-ATPC. Results from the experiments that were conducted inside a University building show that by using the SAPC-R algorithm, energy consumption per successful transmission can be reduced by at least 15% as compared to P-ATPC while the packet success rates are comparable. This is a significant improvement, given the small changes in current consumption corresponding to the large changes in transmission power in present-day low power wireless transmitters.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121469320","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