检索结果-内蒙古大学图书馆

Power adjustable cross-layer network protocol in dense wireless sensor networks

Ruan Jian Xue Bao/Journal of Software 2016年 27卷 11-20页

作者： Ni, Lin-Yu Li, Jin-Bao School of Computer Science and Technology Heilongjiang University Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

A cross layer network strategy with power regulation is proposed for the wireless sensor networks with dense nodes. Under this strategy, nodes use different transmission power for data transmission and so that each node has a predetermined number of its neighbor nodes, or node degree. It thus guarantees the network connectivity, and can effectively reduce the competition conflict between nodes. The nodes in the network are divided according to the hierarchy. The upper node with the minimum transmission power is selected as the father node to construct the routing tree, and the candidate father node sets for the nodes are calculated. In the case of the failure of the father node, candidate father nodes are selected for transmission to solve the problem. The experimental results show that this strategy can improve the network throughput and the rate of data transmission. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

The parallel processing for promoter data base on OpenMP

The parallel processing for promoter data base on OpenMP

引用

International Conference on Electronic Engineering and Information Science, ICEEIS 2015

作者： Shi, Y. Lu, J. Zheng, J.J. College of Computer Science and Technology Heilongjiang University China College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781138027725

The promoters of Arabidopsis and the Poplar are parallel processed and analyzed in this paper. The mainly works include three parts: First, The Motif data are parallel matched with both plant promoter data based on OpenMP. Then, the matching result is processed by frequent mining technology. The experimental result shows that the parallel processing time based on OpenMP is far less than the serial time. Second, to increase the calculation accuracy, the algorithm of solving the P value is improved by the prime split method. At last, according to the frequent process result, the shared frequent items of the two plants are analyzed. © 2015 Taylor & Francis Group, London.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Research on Neutral Mutation Algorithm in DNA Polymorphism Testing based on OpenMP

Research on Neutral Mutation Algorithm in DNA Polymorphism T...

引用

2015 IEEE Advanced Information Technology,Electronic and Automation Control Conference(IAEAC 2015)

作者： Jun Li Jun Lu Ruiqing Jing Qiong Wang Cheng Chang College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province

ISBN: (纸本)9781479919819

Soybean genotypes are adopted as the data source and the Tajima's D statistical method is parallel implemented by OpenMP *** method is used for testing neutral mutation hypothesis of DNA *** setting the sliding window size,all chromosomes containing the massive windows with multiple SNP sites are parallel processed,then the number of individual in sample,the number of segregating sites(S) and average number of nucleotide differences(π) are *** parameters filtering,the Tajima's D values for the effective SNP sites in each sliding window are parallel *** to the experimental data,the serial/parallel algorithms are compared and the conclusion shows that the efficiency of testing neutral mutation can be improved by using the OpenMP *** is a realistic significance for processing massive biological information data.

关键词： genotype Tajima's D OpenMP SNP

来源：评论

学校读者我要写书评

暂无评论

Research on Jukes-Cantor Model parallel Algorithm Based on OpenMP

Research on Jukes-Cantor Model Parallel Algorithm Based on O...

引用

2015大数据技术及应用论坛

作者： Kang Wan Jun Lu Jiaju Zheng Zihan Ren College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province

The parallel algorithm of the evolutionary distance between different species is implemented by using Open MP parallel technique in this paper. In order to get the best degree of algorithm parallelism, the method of making loop variable corresponding to the rower and column labels of distance matrix is adopted. It is to say that the double loop can be converted into single loop to improve the parallel efficiency. The serial algorithm and parallel algorithm are compared in this paper. The experiment result shows that the highest speedup is14.1. It improves the running efficiency of the program. It is a great significance to dealing with massive bioinformatics data.

关键词： OpenMP parallel Evolutionary distance Distance matrix

来源：评论

学校读者我要写书评

暂无评论

Research on parallel F-statistics estimation algorithm based on OpenMP

Research on Parallel F-statistics estimation algorithm based...

引用

2015 IEEE Advanced Information Technology,Electronic and Automation Control Conference(IAEAC 2015)

作者： Ruiqing Jing Jun Lu Jun Li Kang Wan Haoyu Zhang College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province

ISBN: (纸本)9781479919819

The genetic variation information file of glycine max is adopted as experimental data in this *** genetic variation information of soybean is processed and the corresponding algorithm is paralleled by the OpenMP parallel *** experiment extracted the corresponding biologic information of population individuals from genetic variation information,implemented corresponding process and *** relevant serial algorithm and parallel algorithm are compared and *** experiment results show that the efficiency of the data processing and analysis of F statistic are effectively improved by OpenMP parallel technology[l].It has actual significance on processing massive bioinformatic data.

关键词： F-statistics OpenMP population differentiation variation site

来源：评论

学校读者我要写书评

暂无评论

parallel optimization computing in universal combinatorial coding

Parallel optimization computing in universal combinatorial c...

引用

2014 International Conference on Mechatronics, Electronic, Industrial and Control Engineering, MEIC 2014

作者： Gao, Tingting Lu, Jun Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin150080 China College of Computer Science and Technology East University of Heilongjiang Harbin China

ISBN: (纸本)9789462520424

Universal combinatorial coding derives from the combination principle and its core is ordinal calculation. The solution of ordinal is a process of computing permutation and combination values. But permutation and combination computing is very time-consuming. As a result, adopting optimized methods or parallel techniques to increase ordinal calculation efficiency is very necessary. parallel optimization algorithms of the ordinal in universal combinatorial coding are advanced based on CPU multi-core and multi-thread techniques in this paper, including prime splitting and unequal parallel algorithms. Firstly, the thesis simplifies the multiplication and division calculations of the ordinal parallel computing through prime splitting optimization. Secondly, the thesis analyzes the deficiency of equal parallel that the unbalanced computing time of each part will lead to inefficient parallel computing of the ordinal, and then proposes the unequal parallel algorithm to shorten the ordinal number calculation. The experiment results of prime splitting and unequal parallel algorithm proved that two parallel optimizations are better in improving the efficiency of ordinal computing. © 2014. The authors - Published by Atlantis Press.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on combinatorial encryption method

Research on combinatorial encryption method

引用

2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014

作者： Lu, Jun Mo, Juan Lv, Xingfeng Zhang, Zhuo College of Computer Science and Technology Heilongjiang University College of CS HLJU Harbin China Key Laboratory of Database and Parallel Computing Heilongjiang Province KLDPC HLJU Harbin China

ISBN: (纸本)9781479931965

Combinatorial encryption algorithm is advanced. Combinatorial encryption method makes use of the variety of ordinal in universal combination code. Firstly, the theory of universal combinatorial coding is expatiated. Secondly, researches are done in combinatorial encryption characteristic, key generating method, encryption and decryption algorithms. At last, key space is analyzed. Combinatorial encryption technology breaks through the thought of encryption. It is based on combinatorial theory and the code element is adopted as the basic unit in encryption computing. Furthermore, the key generating method is unique. Combinatorial encryption technology makes a new attempt to cipher system. © 2014 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Minimum latency data aggregation scheduling in MR-MC wireless sensor networks

引用

Tongxin Xuebao/Journal on Communications 2014年第10期35卷 192-199页

作者： Li, Jin-Bao Wang, Meng Guo, Long-Jiang School of Computer Science and Technology Heilongjiang University Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensor networks is a NPC problem and many solutions have been proposed. In multi-radio multi-channel networks, the latency may be lower as a node may receive transmission data from other different nodes simultaneously. It formulates the minimum latency data aggregation scheduling into an optimization problem with joint consider of tree structure, time slot assignment, channel assignment and radio assignment. The problem is divided into constructing data aggregation tree and designing a node schedule subproblems. For each subproblem, heuristic algorithm has been proposed. The simulation results show that the proposed algorithm achieve good performance.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Density and distance based probabilistic broadcasting algorithm in mobile sensor networks

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2014年第1期51卷 151-160页

作者： Shen, Yue Guo, Longjiang Li, Jinbao School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150001 China

Broadcasting is the most basic manner to transmit messages in mobile wireless sensor networks. However, existing relevant broadcasting algorithms in mobile wireless sensor networks need a large number of intermediate forwarding nodes. The large number of intermediate forwarding nodes causes a mass of redundant message packages. Massive redundant messages will consume much energy and lead to a short life period of mobile wireless sensor networks. This paper proposes a broadcasting algorithm named node density and distance-based probability (NDDP for short). The average forwarding ratio of the algorithm is only 5S/(Nπr2), where S is the area of the networks, N is the amount of nodes in the networks, and r is communication range. Then the average receipt ratio of NDDP is more than 95 percent in theoretical analysis and more than 92 percent in the ns-2 simulation results. Denser the network is, the more energy saving the algorithm is. Simulation results also show that NDDP outperforms the two algorithms in Smite and Sidewinder not only on the aspect of stability but also on energy conservation.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Channel allocation and routing strategy in multi-radio multi-channel wireless sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 103-112页

To address the problems of transmission delay, transmission conflicts and low throughput in Wireless sensor networks, this paper proposes a channel allocation and routing strategy in Multi-Radio Multi-Channel Networks. The strategy is to dynamically establish a k-ary n-cube topology. It not only uses the optimal static channel allocation algorithm to improve the throughput of nodes but also employs the dimension order routing algorithm to reduce transmission conflicts. This method is suitable for the network of density nodes with many communication conflicts. It can also be used in both single hop and multi hop network environment. The experiment results show that compared with traditional methods, the channel allocation and routing strategy based on the k-ary n-cube topology can effectively reduce end to end delay, network conflicts and energy consumption, prolong the network lifetime and increase the throughput of network. ©2014 ISCAS.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：