Int. J. Netw. Comput.最新文献_第4页

Semi-Order Preserving Encryption Technique for Numeric Database 数字数据库的半保序加密技术

Int. J. Netw. Comput. Pub Date : 2019-01-10 DOI: 10.15803/IJNC.9.1_111

Saleh Ahmed, Annisa, Asif Zaman, Zhan Zhang, K. R. Alam, Y. Morimoto

引用次数: 7

Joint design of cooperative protocols and distributed beamforming for multi-hop cognitive radio networks 多跳认知无线网络协同协议与分布式波束形成的联合设计

Int. J. Netw. Comput. Pub Date : 2019-01-10 DOI: 10.15803/IJNC.9.1_53

Wei Chen, Liang Hong, Sudeep Bhattarai, Tony Sanchez, Ebholo Ijieh, Stacie Severyn, Leonard E. Lightfoot

{"title":"Joint design of cooperative protocols and distributed beamforming for multi-hop cognitive radio networks","authors":"Wei Chen, Liang Hong, Sudeep Bhattarai, Tony Sanchez, Ebholo Ijieh, Stacie Severyn, Leonard E. Lightfoot","doi":"10.15803/IJNC.9.1_53","DOIUrl":"https://doi.org/10.15803/IJNC.9.1_53","url":null,"abstract":"The increasingly crowded wireless spectrum has led to the need of new paradigms in wireless communications and the cognitive radio techniques that can offer promising solutions to the spectrum scarcity. In cognitive radio networks licensed primary users and unlicensed secondary users are allowed to coexist in the same frequency spectrum. Beamforming and MIMO technology can be used to minimize the interference from the secondary users to the primary users while improving the quality of communications when each node is equipped with multiple antennas to form an antenna array. However, equipping multiple antennas at each radio node is not feasible in many applications. In this paper, we consider the radio network with single antenna at each node. We first propose a cooperative network architecture in the network layer. The architecture consists of cooperative clusters used for distributed beamforming, and a routing backbone of the clusters that can avoid the interference to the primary users in the relay route. Distributed algorithms are designed for self-formation of the cooperative clusters and routing backbone. Then we propose a computationally efficient secondary users selection scheme in the link layer for the communications between two cooperative clusters while minimizing the interference to the primary users. The simulation results show that the proposed protocols and algorithms are effective and efficient in terms of time and energy.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126635271","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

A Shared Memory Parallel Block Streaming Model for Irregular Applications 不规则应用的共享内存并行块流模型

Int. J. Netw. Comput. Pub Date : 2019-01-10 DOI: 10.15803/IJNC.9.1_70

A. Zope, E. Luke

{"title":"A Shared Memory Parallel Block Streaming Model for Irregular Applications","authors":"A. Zope, E. Luke","doi":"10.15803/IJNC.9.1_70","DOIUrl":"https://doi.org/10.15803/IJNC.9.1_70","url":null,"abstract":"Due to worsening machine balance, a lightweight irregular application can utilize only a small fraction of the peak computational capacity on modern processors. Performance of such an application is also unpredictable due to the scattered data accesses. Even though architectural features such as a cache system, hardware prefetchers etc., that reduce the cost of irregular access, are commonly found in most of the modern processors, their design parameters differ widely from one processor to another. Therefore, a performance improving programming technique still needs extensive tuning to gain maximum benefit on a target processor. In this scenario, achieving portable performance becomes difficult. This work proposes a block streaming machine model and hypothesizes that an algorithm based on the model has predictable execution time. To enable adaptation of this model for irregular applications, we also provide algorithmic transformations that can be used to replace the scattered accesses with streaming accesses in a cost predictable way. Further, we experimentally demonstrate usefulness of the model and the transformations for static lightweight irregular computations such as those performed by a numerical partial differential equation solver on modern multicore processors.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125915929","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

An asynchronous P system with branch and bound for solving the satisfiability problem 求解可满足性问题的带分支定界的异步P系统

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_141

Yuki Jimen, A. Fujiwara

引用次数: 6

Fire Simulation in 3D Computer Animation with Turbulence Dynamics including Fire Separation and Profile Modeling 具有湍流动力学的三维计算机动画中的火灾模拟，包括火灾分离和剖面建模

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_186

Jozef Hladky, R. Durikovic

引用次数: 1

Suppression of performance degradation in traveling direction estimation by using IMU and PCA for PDR 基于IMU和PCA的PDR行向估计性能退化抑制

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_328

M. Fujii, Yuya Sakuma

引用次数: 1

Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication 从右到左并行标量和多标量点乘法的最优表示

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_166

Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn

{"title":"Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication","authors":"Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn","doi":"10.15803/IJNC.8.2_166","DOIUrl":"https://doi.org/10.15803/IJNC.8.2_166","url":null,"abstract":"This paper introduces an optimal representation for a right-to-left parallel elliptic curve scalar point multiplication. The right-to-left approach is easier to parallelize than the conventional left-to-right approach. However, unlike the left-to-right approach, there is still no work considering number representations for the right-to-left parallel calculation. By simplifying the implementation by Robert, we devise a mathematical model to capture the computation time of the calculation. Then, for any arbitrary amount of doubling time and addition time, we propose algorithms to generate representations which minimize the time in that model. As a result, we can show a negative result that a conventional representation like NAF is almost optimal. The parallel computation time obtained from any representation cannot be better than NAF by more than 1%. In addition to that, we devise a time model and propose an algorithm to generate optimal representations for multi-scalar point multiplication (under a condition). Similar to the result of scalar point multiplication, NAF is almost optimal also for multi-scalar point multiplication as the difference of parallel computation time obtained from optimal representation and NAF is less than 1% in all experimental settings.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015137","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

HDR Image Processing from Embedded Cell Phone Camera 嵌入式手机相机的HDR图像处理

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_205

A. Mihalik, Pavol Kunovsky, R. Durikovic

引用次数: 0

An Implementation of ECC with Twisted Montgomery Curve over 32nd Degree Tower Field on Arduino Uno 32度塔场扭曲蒙哥马利曲线ECC在Arduino上的实现

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_341

Yuta Hashimoto, Md. Al-Amin Khandaker, Yuta Kodera, Taehwan Park, Takuya Kusaka, Howon Kim, Y. Nogami

{"title":"An Implementation of ECC with Twisted Montgomery Curve over 32nd Degree Tower Field on Arduino Uno","authors":"Yuta Hashimoto, Md. Al-Amin Khandaker, Yuta Kodera, Taehwan Park, Takuya Kusaka, Howon Kim, Y. Nogami","doi":"10.15803/IJNC.8.2_341","DOIUrl":"https://doi.org/10.15803/IJNC.8.2_341","url":null,"abstract":"The security of Internet of Things (IoT) devices is one of the most important problems to be addressed by the cryptographers and security engineers. The processing ability of IoT devices is limited, therefore light-weight and secure cryptographic tools are necessary for security of them. This paper shows the implementation of 256-bit Elliptic Curve Cryptography (ECC) on an 8-bit microcontroller. The proposed implementation applies towering technique for extension field of degree 32 with a certain 8-bit prime characteristic instead of the 256-bit prime characteristic. It enables to execute 256-bit ECC operations without complicated multiple-precision arithmetic on small computers like 8-bit microcontrollers. This approach efficiently realizes the scalability of the ECC encryption strength. In addition, the authors use a twisted Montgomery curve with a Montgomery ladder technique which enables fast calculations without inversions referring to Curve25519. It is considered resistant to the Side Channel Attack (SCA) since it applies the Montgomery ladder technique for scalar multiplication (SCM). This ECC implementation on Arduino UNO, an 8-bit microcontroller board, can be utilized for a key agreement protocol among IoT devices.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784576","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

Performance Evaluation and Enhancements of a Flood Simulator Application for Heterogeneous HPC Environments 异构HPC环境下洪水模拟器的性能评估与改进

Int. J. Netw. Comput. Pub Date : 2018-07-10 DOI: 10.15803/IJNC.8.2_387

Ryan J. Marshall, S. Ghafoor, Mike Rogers, A. Kalyanapu, T. Dullo

{"title":"Performance Evaluation and Enhancements of a Flood Simulator Application for Heterogeneous HPC Environments","authors":"Ryan J. Marshall, S. Ghafoor, Mike Rogers, A. Kalyanapu, T. Dullo","doi":"10.15803/IJNC.8.2_387","DOIUrl":"https://doi.org/10.15803/IJNC.8.2_387","url":null,"abstract":"This paper presents a practical implementation of a 2D flood simulation model using hybrid distributed-parallel technologies including MPI, OpenMP, CUDA, and evaluations of its performance under various configurations that utilize these technologies. The main objective of this research work was to improve the computational performance of the flood simulation in a hybrid architecture. Modern desktops and small cluster systems owned by domain researchers are able to perform these simulations efficiently due to multicore and GPU computing devices, but lack the expertise needed to fully utilize software libraries designed to take advantage of the latest hardware. By leveraging knowledge of our experimentation environment, we were able to incorporate MPI and multiple GPU devices to improve performance over a single-process OpenMP version up to 18x, depending on the size of the input data. We discuss some observations that have significant effects on overall performance, including process-to-device mapping, communication strategies and data partitioning, and present some experimental results. The limitations of this work are discussed, and we propose some ideas to relieve or overcome such limitations in future work.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131803804","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