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

Data query based on data cache and channel switch in multi-radio wireless sensor networks

Jisuanji Xuebao/Chinese Journal of Computers 2012年第11期35卷 2403-2414页

作者： Zhang, Yan-Qing Li, Jin-Bao Guo, Long-Jiang 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

Due to the nature of multi-radio multi-channel wireless sensor networks, such as the quality of service of the links, channel conflict etc., we investigated the problem of data query based on data cache and channel switch, and proved it to be an NP-complete problem. Firstly, we constructed a LP equation based on the data flow conservation and link-channel constraint etc. to formulate the problem, then designed a polynomial approximate algorithm. The algorithm used dynamic programming strategy to minimize the delay of unit data packet transmission from cache nodes to the query node, greedily chose a cache node with the smallest delay of unit data packet transmission, and collected the new covered data packets. Theoretical analysis and experimental results indicate that the proposed algorithm can reduce the communicate delay and improve the efficiency of query effectively.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

MPMC: An algorithm for data aggregation scheduling in multi-channel and multi-power wireless sensor networks

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2012年第7期49卷 1568-1578页

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

Data aggregation is a fundamental and yet time-consuming task in WSNs, especially in high-density WSNs. Therefore, people have focused on the problem of minimum-latency data aggregation. The problem has been already proved that it is an NP-hard. This paper proposes a cluster-based data aggregation scheduling algorithm called MPMC in multi-channel and multi-power WSNs to minimize the data aggregation latency. The paper adopts the idea of that the low power is used for packet transmission in inner-cluster and high power is used for packet transmission between clusters. This paper analyzes the number of channel under different topologies that approaches a constant. In simulation experiments, MPMC compares with the best algorithm based on single channel and the best algorithm based on multi-channel. Simulation results show that the MPMC algorithm proposed in this paper achieves the minimum average latency.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Distributed multi-dimensional probabilistic Top-k query processing in sensor networks

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2012年第SUPPL.1期40卷 389-393+397页

作者： Zhu, Jinghua Guan, Xuemin Department of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150080 China

A distributed multi-dimensional probabilistic Top-k (DMPT) query processing algorithm was proposed for sensor networks. DMPT exploited Skyline operator to get the Top-k results and reduced data transmissions and query delay through feedback and filtering mechanism. Data uncertainty, multi-dimensional attributes, distributed network and energy limitation were considered in DMPT, and the Top-k results were attained by computing.Skylayers of data. Experiments on real and simulated data are conducted to demonstrate that DMPT has better energy efficiency and faster response compared with traditional algorithm.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Research on the reliability of MAC protocols for multi-radio sensor networks

Research on the reliability of MAC protocols for multi-radio...

引用

International Conference on Pervasive computing. Signal Processing and Applications

作者： Guo, Yahong Zhang, Desheng School of Information Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang 150080 China

ISBN: (纸本)9780769541808

In this paper, the concept of multi-radio sensor networks is introduced, and the reliability for multi-radio MAC protocol is researched extensively, via establishing a probability model of reliability. To be specific, the reliability of MAC protocols for multi-radio nodes are studies from single-hop and multi-hop, respectively. Furthermore, the upper and lower bounds of these reliabilities are provided. Lastly, the performance rate between single-radio and multi-radio MAC protocols is proposed. The experiment results show that the reliability of multi-radio MAC protocols is much higher than that of single-radio MAC protocol. In addition, the experiment results roughly coincide with theoretical analysis. © 2010 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Opportunistic routing in multi-power wireless sensor networks

Opportunistic routing in multi-power wireless sensor network...

引用

6th China Conference of Wireless Sensor Networks, CWSN 2012

作者： Guo, Yahong Guo, Xiaohang Zhang, Yanqing Zhu, Jinghua Li, Jinbao School of Information Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Heilongjiang University Harbin Heilongjiang 150080 China

ISBN: (纸本)9783642362514

In this paper, we investigate on the opportunistic routing in Multi-Power Wireless Sensor Networks (MP WSNs). We first propose a routing metric called METT of opportunistic routing in MP WSNs, and model the power selecting process as a Markov decision process for computing.the METT metric. We describe the METT-based opportunistic routing problem, and design a polynomial time optimal algorithm for getting the optimal routing and power selection scheme. Theory analysis and experiments show that the proposed multi-power opportunistic routing can improve the data transmission efficiency, significantly reduce the energy consumption and the end-to-end transmission delay. © 2013 Springer-Verlag.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Neighbor discovery algorithm based on the regulation of duty-cycle in mobile sensor network

Neighbor discovery algorithm based on the regulation of duty...

引用

8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013

作者： Li, Jinbao Yang, Jian Zhang, Yanqing Guo, Longjiang Li, Yingshu School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang 150080 China Department of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9783642397004

In this paper, aiming at the problem that the node discovers its neighbor nodes, when it is moving in mobile sensor network, we propose an algorithm for dynamical regulating the duty cycle of the node which needs to discover it neighbor node. This algorithm uses the boundary nodes in the communication range of the node to predict potential neighbor nodes, applies passion point process to predict the number of nodes in communication range of the node, regulates the duty-cycle of the node based on the model of balls and boxes, and then schedules the waking time of the node periodically by using the duty-cycle which is regulated to finish the detection. Finally, theoretical analysis and simulation experiments show that the proposed algorithm can discover more neighbor nodes in the short period of time with less energy. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Bidirectional Representation Recommendation Based On Relevance Information Enhancement To Solve User Interest Drift

A Bidirectional Representation Recommendation Based On Relev...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Nan Li, Kun Jiang, Xuefeng Li, Jinbao College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing Heilongjiang University Harbin China Qilu University of Technology Shandong Artificial Intelligence Institute School of Mathematics and Statistics Jinan China

ISBN: (纸本)9798350304855

The phenomenon that user interests change dynamically over time is called user interest drift, which makes it difficult for recommendation systems to obtain users' real interests. In order to better provide users with personalized services, it is very important to study recommendation methods that can be applied to user interest drift. However, the new interests of users are often very different from the interests that users have interacted with historically. It makes the correlation between the original user's historical interaction and the user's new interest very weak. Meanwhile, the information contained in user's sessions is not enough to support the inference of the new interest, resulting in a serious decrease in model performance. To alleviate the above problem, we propose a bidirectional representation recommendation based on relevance information enhancement to solve user interest drift (RA-Bert). The model is based on Bert and uses bidirectional self-attention mechanism to represent user sessions. In this model, we design a relevance information enhancement module to adaptively capture the information associated with the user's new interest from neighbors' sessions. Then, we integrate the relevance information into user's history sessions, which can effectively enhance the correlation between user's history sessions and the new interest. Further, in order to effectively supplement the missing relevance information in users' sessions, we design a new attention unit, which explicitly models the difference information between users and neighbors. Extensive experiments have demonstrated the effectiveness of our approach. Our code is publicly available at the link: https://***/LucasZen/paper_code. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Cross-level Relational Graph Contrastive Learning for Bundle Recommendation

Cross-level Relational Graph Contrastive Learning for Bundle...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Nan Sun, Jiabao Li, Jinbao College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang University Harbin China Qilu University of Technology Shandong Artificial Intelligence Institute School of Mathematics and Statistics Jinan China

ISBN: (纸本)9798350304855

Different from the traditional recommendation system which regards a single item as an atomic unit, the purpose of bundle recommendation is to recommend a set of items to users. In recent years, some work often uses the model based on GNN to solve the bundle recommendation problem. However, compared with the traditional recommendation models, the GNN-based bundle recommendation has a more serious data sparse problem, which significantly reduces the performance of the model. Meanwhile, due to the lack of modeling ability of complex interactive information and dependent information, it is still far from enough to learn the representation of users and bundles. In view of the advantages of contrast learning in mining its own supervisory signals, we propose a model named Cross-level relational graph Contrastive Learning for Bundle Recommendation (CL2BRec). Different from previous contrastive learning methods, our method learns representations of users and bundles from multiple relational graphs of different levels through a crossview contrastive learning paradigm. Specifically, we regard the user-item/bundle graph as a local interaction relation view, the bundle-item graph as a local dependency relation view, and the user-bundle-item tripartite graph as a global structure view to build a cross-level bundle recommendation model. Extensive experiments conducted on two benchmark datasets demonstrate that CL2BRec outperforms the state-of-the-art methods by over 12.56% and 8.6%, respectively. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

M-cube: A duty cycle based multi-channel MAC protocol with multiple channel reservation for WSNs

M-cube: A duty cycle based multi-channel MAC protocol with m...

引用

16th IEEE International Conference on parallel and Distributed Systems, ICPADS 2010

作者： Li, Jinbao Zhang, Desheng Guo, Longjiang Ji, Shouling Li, Yingshu School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang 150080 China Department of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9780769543079

In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can make nodes to choose one actually idle channel from all the expected idle channels. Therefore, M-cube can avoid data packet collisions resulted by the triple hidden terminal problems. By minimizing the lower bound of the average number of times of channel switching in M-cube, the optimal duty cycle is obtained through theoretical analysis. To validate the effectiveness of multiple channel reservation and dynamic optimal duty cycling, extensive simulations and real test bed experiments were conducted. Both the simulation and experiment results show that when the number of channels is large or network loads are heavy, M-cube improves energy efficiency and throughput significantly compared with other works in the literature. © 2010 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Quick-merge sort algorithm based on Multi-core linux

Quick-merge sort algorithm based on Multi-core linux

引用

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Yong Liu Yan Yang School of Computer Science and Technology Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781479925667

Sorting a list of input numbers is one of the most fundamental problems in the field of computer science. This paper presents an efficient implementation and detailed analysis of quick sort algorithm called QM-sort on Multi-core CPU architectures. Our QM-sort has two stages. The first stage is making blocks sorted, and the second stage is merging the sorted blocks. At the first stage, we propose a parallel quick sort algorithm named BPQsort. The run time of BPQsort achieves 40%-50% better than Qsort (STL), so we make blocks sorted more efficient. On the other hand, our algorithm can read file in parallel, thus reduce the time of reading file from disk. At the second stage, our parallel merge algorithm can operate the data on consecutive memory. Thus we avoid the expensive unaligned load/store operations, thus make our merge algorithm faster. At last, the run time of QM-sort is 10%-15% better than quick sort based on OpenMP.

关键词： Linux Instruction sets Hardware Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：