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

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

来源：评论

学校读者我要写书评

暂无评论

Study on distributed channel allocation and routing forwarding strategy in Dual-Radio sensor networks

引用

Tongxin Xuebao/Journal on Communications 2010年第9 A期31卷 81-89页

作者： Fan, Bin Li, Jin-Bao Guo, Long-Jiang Liu, Xu Ren, Qian-Qian School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

Considering the limited orthogonal channels in wireless sensor networks (WSN), a distributed channel allocation algorithm (DCA) for Dual-Radio WSN was presented. Based on DCA, a routing forwarding strategy (RFS) was proposed as well. DCA avoids conflictions within a path and reduces conflictions among different paths with a small number of channels. Furthermore theoretically prove that when K≥Δ+1, the upper bound of the network throughput is |M|+1, where K is the number of orthogonal channels in WSN, Δ is the largest degree of the network topology graph, and |M| is the number of non-leaf nodes in the network routing tree. Nodes switch channels timely in RFS, and then further dropping the conflict between the paths, effectively transmit data in parallel. Simulation results indicate that DCA and RFS can reduce the latency of data forwarding and the average energy consumption of nodes, as well as increase the throughput significantly.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient algorithm for mobile target prediction and tracking in wireless sensor networks

引用

Tongxin Xuebao/Journal on Communications 2010年第9 A期31卷 135-143页

作者： Liu, Xu Li, Jin-Bao Guo, Long-Jiang Fan, Bin Zhu, Jing-Hua School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

Aiming at the problem of target tracking in wireless sensor networks, an energy efficient algorithm for mobile targets prediction and tracking was proposed. Sleep scheduling mechanism was used to reduce the cost, as well as to guarantee the real-time tracking. The algorithm predicts the trajectory of the target with the Markov chain theory, and the sleeping nodes in the predicted area would be waked up to monitor the targets. In order to predict the target accurately, a location algorithm based on distance vector was triggered to estimate its position. The sensors sleep initiatively to save energy when they did not have the sensing task. Simulation and testbed experimental results indicate that the algorithms can accurately describe the target trajectory, and efficiently reduce the energy consumption.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

keywords generation algorithm based on bipartite graph

引用

Tongxin Xuebao/Journal on Communications 2011年第9 A期32卷 146-152页

作者： Yang, Yan Zhu, Jing-Hua Jin, Hu Li, Wei Department of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang University Harbin 150080 China

To improve the efficiency of keywords generation, a bipartite graph based keywords generation(BGKG) algorithm was proposed. It generated keywords based on search engine logs and built a bipartite graph between query terms and the clicked URLs. It took into account the rank of the URLs in result pages and the order of users' clicking. Experiments were done with real query logs. The results show that keywords generated by BGKG can satisfy the needs of enterprise clients and BGKG is more efficient than other keyword generation algorithms.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

GPU acceleration of finding frequent patterns over large biological sequence

GPU acceleration of finding frequent patterns over large bio...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Shufang Du Longjiang Guo Chunyu Ai Jinbao Li Meirui Ren Yahong Guo School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database and Parallel Computing Harbin Heilongjiang China Division of Math & Computer Science University of South Carolina Upstate Spartanburg SC USA School of Information Science and Technology Heilongjiang University Harbin Heilongjiang China

Biological frequent patterns usually correspond to the important function (or structure) in biological sequences. Along with the rapid growth of biological sequences, it is significant to find frequent patterns over a large bio-sequence efficiently. However, most of existing algorithms need to produce lots of short patterns or projected databases, which influence the efficiency badly and also increase the cost of space. Graphics processing units (GPUs) embracing many core computing.devices, have been extensively applied to accelerate computation performance in many areas. In order to meet the demand of biologists, we redefine the frequent pattern problem with length constraints for finding frequent patterns. We present pruning optimization method for the serial algorithm (POSA), and based on this technique, we propose a parallel algorithm (POPA) which not only reduces the time complexity with a low space cost but also obtains better performance on CUDA. To validate the presented algorithms, we implemented the algorithms on multiple-core CPU and various GPU devices. Also, CUDA optimization techniques are applied to speed up calculation in the paper. Finally, experimental results show that compared with the serial algorithm on CPU with six cores, POSA achieves 1.2~4.5 speedup, and POPA gains 3~20 speedup.

关键词： Arrays Graphics processing units Biology Data mining Indexes parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Cross-layer design for multi-power multi-radio wireless sensor networks

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2011年第SUPPL. 2期31卷 114-118页

作者： Guo, Xiao-Hang Li, Jin-Bao School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

In this paper, we investigate on the optimal routing jointly scheduling, channel and power assignment in multi-power multi-radio WSNs. We first formulate the optimal routing as a linear programming problem, and then design a polynomial time heuristic algorithm. Experiments show that the proposed cross-layer routing significantly reduce the energy consumption and the end-to-end transmission delay.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Recommendation Algorithm Based on Social Trust Clustering

引用

Ruan Jian Xue Bao/Journal of Software 2018年 29卷 21-31页

作者： Zhu, Jing-Hua Wang, Chao Ma, Sheng-Chao School of Computer Science and Technology Heilongjiang University Harbin150080 China Heilongjiang Province Key Laboratory for Database and Parallel Computing Harbin150080 China

Recommender system can solve the information overload problem effectively, and collaborative filtering (CF) is one of the techniques that is widely used in recommendation system. However, the traditional CF technology has problems such as poor scalability, sparse data, and low accuracy of recommendation results. In order to improve the quality of recommendations, this article integrates the trust relationship into the recommendation system in which the trust relationship is clustered by using the clustering (FCM) method. Using the trust cluster to predict implicit trust between users, the trust relationship is finally combined with the user-item relationship to give recommendations. The experimental results on the data set of Douban and Epinions show that compared with traditional CF algorithm, trust based recommendation algorithm and recommendation algorithm for user item clustering, the presented algorithm can greatly improve the recommendation quality and time efficiency. © Copyright 2018, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Anti-theft technology based on wireless sensor network

引用

Ruan Jian Xue Bao/Journal of Software 2011年第SUPPL. 1期22卷 111-121页

作者： Duan, Jin-Sheng Guo, Long-Jiang Liu, Yong Zhu, Jing-Hua Department of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150001 China

There are shortcomings in traditional anti-theft technology which can not satisfy a user's demand. The common ways of anti-theft are limited in wireless sensor networks. On the topic of the shadowing effect in wireless communication, this paper introduces a anti-theft technology based on wireless sensor networks. System can check intrusion by analyzing received signal strengths. This paper establishes a framework of anti-theft system and studies the key technologies. By defining the graph model in anti-theft system, the agent distribution problem is abstracted into edges partitioned by vertices problem. B-EPV algorithm is proposed for obtaining the optimal solution. Blade algorithm is designed for solving k-mode set problem to get steady status of link. This paper constructs experimental environment with real motes and verifies the performance of the system. The result shows low false positives and false negatives in the system. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Efficient Graph Isomorphism Algorithm Based on Canonical Labeling and Its parallel Implementation on GPU

An Efficient Graph Isomorphism Algorithm Based on Canonical ...

引用

IEEE International Conference on High Performance computing.and Communications (HPCC)

作者： Renda Wang Longjiang Guo Chunyu Ai Jinbao Li Meirui Ren Keqin Li School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database and Parallel Computing Harbin Heilongjiang China Department of Computer Science University of South Carolina Upstate Spartanburg SC USA Department of Computer Science State University of New York New Paltz New York USA

The Graph Isomorphism (GI) problem has been extensively studied due to its significant applications. The most effective class of GI algorithms, i.e., canonical labeling algorithms, are suitable for either graphs with high randomness or symmetry, or graphs for which both of them are not strongly held. Also, the core operations of canonical labeling algorithms, i.e., individuation-refinement (IR) and certificate comparison, usually occupy more than 70% of the total running time. How to weaken the limitations of structures and improve the efficiency of these operations are challenges. In this paper, we present an efficient GI algorithm called PEACE, which is particularly suitable for graphs with high randomness or symmetry. We present a parallel implementation of our algorithm on GPUs. We design some new techniques and also use some existing methods to speed up calculations under CUDA. More importantly, these techniques can be applied to all IR-based GI algorithms. We evaluate the proposed algorithm on various graphs to make comprehensive comparison with currently the most efficient canonical labeling algorithms on CPUs. Experimental results show that PEACE is superior to other algorithms on graphs with high symmetry or many automorphisms, and up to 50% performance increase can be achieved in the best case. We also apply our parallel techniques on these algorithms, and compare the performance on CPU and multiple GPU devices. The results show that the techniques make all algorithms gain 15~55 speedup.

关键词： Labeling Graphics processing units Algorithm design and analysis Indexes Arrays Instruction sets Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：