Based on the principle of QR loop iterations, this paper implements a parallel algorithm based on the hardware of GPU (Graphic Process Unit) by using routines from CUDA (Computer Unified Device Architecture) to find t...
详细信息
ISBN:
(纸本)9781479925667
Based on the principle of QR loop iterations, this paper implements a parallel algorithm based on the hardware of GPU (Graphic Process Unit) by using routines from CUDA (Computer Unified Device Architecture) to find the eigenvalues of general matrices. CPU and GPU computing card form a client-server computing framework. Here, CPU can be regarded as a client and GPU card is considered as a computing server. For the experiment environment, this paper chooses a GPU card with the model of NVIDIA GeForce GTX460 as a server side and a CPU with the model of Intel Core i5-760 quad-core as a client side. Win7 64-bit is selected as the operating system. The parallel implementation consists of two parts:PA H and PA QR. PA H is a procedure that transforms a matrix A into the Hessenberg matrix B. PA QR is the actual parallel algorithm of the QR iterations that is imposed on the Hessenberg matrix B for finding eigenvalues of the general matrix A. The speedup ratio of the proposed algorithm is jarless when the number of iterations becomes greater. The experimental results show that the parallel implementation with CUDA on GPU only makes use of less running time than traditional sequential algorithms. The speedup ratio of PA H is between 1.79 and 7.81. The speedup ratio of PA QR is between 3.24 and 118.9. Especially, when the order of general matrix equals 8192, the amount of iterations becomes 10000. The speedup ratio of the PA-H and the PA QR can run up to 7.81 and 118.9 respectively.
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 no...
详细信息
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 p...
详细信息
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.
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 w...
详细信息
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.
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...
详细信息
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 d...
详细信息
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.
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 wir...
详细信息
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...
详细信息
Energy saving and the tracking performance are two important issues in moving target tracking. This paper presents a Voronoi structure-based nodes selection algorithm, which constructs a network model based on the pro...
详细信息
In order to improve the network spatial reuse and maximize the network throughput, this paper presents a physical conflict model based power allocation and link scheduling algorithm (PPLA). Firstly, PPLA picks availab...
详细信息
In order to improve the network spatial reuse and maximize the network throughput, this paper presents a physical conflict model based power allocation and link scheduling algorithm (PPLA). Firstly, PPLA picks available set of parallel links using hexagon coloring method. With physical conflict model, it further obtains the minimum power vector which corresponds to parallel links set. The experimental results indicate that the algorithm can increase network spatial reuse ratio and improve throughput significantly.
暂无评论