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 sele...
详细信息
The issue of inaccurate user portrait recommendations for short-Term conversations is solved. The classical recommendation is based on an assumption: The user's historical behavior can represent the user's sta...
详细信息
The proposed method in this paper proposes an end-to-end unsupervised semantic segmentation architecture DMSA based on four loss functions. The framework uses Atrous Spatial Pyramid Pooling (ASPP) module to enhance fe...
详细信息
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 ...
详细信息
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.
In structural health monitoring system, it usually needs to arrange lots of sensor nodes. In order to get the monitoring data in real time, frequent data collection is essential will consume so much energy, especially...
详细信息
In structural health monitoring system, it usually needs to arrange lots of sensor nodes. In order to get the monitoring data in real time, frequent data collection is essential will consume so much energy, especially when the data is multi-dimensional. To reduce communication messages in the frequent data collection applications and as far as possible to extend the network lifetime. This paper proposes a data collection algorithm based on wavelet-segment constant compression(W-SDC), applies compressive sampling theory, and compress the messages with W-SDC before data transmitted, thereby this algorithm reduces the amount of data transmission. When the network is large-scale, it could save communication costs greatly, and extend the network lifetime. The total messages of traditional data collection method is O(N2), compressive data gathering method is O(MN), while the total communication costs of this algorithm is O(mN), where m
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 lat...
详细信息
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.
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 sw...
详细信息
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.
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 p...
详细信息
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.
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 d...
详细信息
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...
详细信息
暂无评论