Research on Multimedia Signal Acquisition Strategy Based on Compressed Sensing

In this paper, the reliability of data transmission in social networks is thoroughly studied and analyzed using wireless sensor network topology technology. This paper, based on the introduction of sensor network reliability analysis-related technology, combined with the characteristics, and needs of the sensor network itself, focuses on the study of the reliability analysis of the sensor network under the state of perturbation scheme. Based on the idea of making full use of data changes to respond to the sensor state, this paper takes the actual monitoring data of the wireless sensor network as the research object, selects the temporal correlation and spatial correlation of the measured environmental data as the reliability index by extracting the features of the wireless sensor network data, and proposes the Evidential reasoning rule- (ER-) based wireless sensor network data reliability assessment model based on Evidential reasoning rule (ER) is proposed. The data are mined, analyzed, and quantified from the perspective of content popularity, and the interest indicators of nodes on data under content popularity are analyzed to derive stable interest quantification values. Combined with the network properties, i.e., node autoassembly community, we analyze the data dissemination characteristics of social networks in wireless sensor network topology environment and derive the upper and lower bounds of data transmission capacity under node interest-driven and its variation on network performance. Social relationships among nodes affected by social attributes are considered; in turn, the data forwarding behavior of nodes is modeled using data transmission probability and data reception probability; finally, the data forwarding process is analyzed and a closed expression for the average end-to-end transmission capacity is derived in turn.

Classification of sensory data is a major research problem in wireless sensor networks and it can be widely used in reducing the data transmission in wireless sensor networks effectively and also in process monitoring. In order to examine the huge size of data set in stream model generated by sensor network, it will be analyzed different sensor's output signal, topology of sensors network, number of sensor parameters and number of acquisition data. In our wind energy monitoring, sensor node monitors six attributes: speed, direction, temperature, pressure, humidity, and battery voltage. Every attribute value is set as four measures: average, instantaneous, minimum, and maximum. This paper presents several data mining techniques applied on the wireless sensor network's data considered: Naïve Bayes, k-nearest neighbor, decision trees, IF-THEN rules, and neural networks. Before classification, the data was clustered in order to be labeled. A similarity based algorithm, k-means, was selected in the clustering process for its simplicity and efficiency. A conclusion that decision trees are a suitable method to classify the large amount of data considered is made finally according to the mining result and its reasonable explanation.

For the purpose of saving the resources of wireless sensor networks, it is necessary to fuse the existing data in wireless sensor networks. When using the current method to fuse data in wireless sensor networks, the fusing time is too long to remove the noise signal in wireless sensor networks effectively. In the process of fusing, data packet loss is easy to occur. There are some problems such as low fusion efficiency, poor denoising performance and high packet loss rate. A multi-path data hierarchical fusion method based on routing algorithm is proposed in this paper. The redundant node decision method based on mesh partitioning is combined with the grid algorithm and EECRS protocol to establish a routing protocol based on redundant node elimination, and the redundant data existing in the redundant nodes of the wireless sensor network is removed. Based on the statistical data of the data, the probability density function is deduced and analyzed, and the noise filtering matrix is constructed to optimize the measurement matrix and remove the noise existing in the wireless sensor network. The multi-path scheduling technology is used to synthesize the pheromone table and the data forwarding flow table, and the ant is used to actively monitor the link QOS real-time information in the path finding process to update the pheromone table and the flow table, and calculate the link idle rate according to the update result. According to the calculation result, the data transmission path is selected, and the multi-path data layer fusion is completed. The experimental results show that the proposed method has high fusion efficiency, good denoising performance and low packet loss rate.

In wireless sensor network, the storage amount of information is high, and the transmission and scheduling of control information is reasonable. The node communication model, network structure model, and energy consumption model are constructed. On this basis, the high-density data in wireless sensor network are scheduled to optimize the time for nodes to perform tasks. The nodes in the network are fully scheduled to control the generation time of packets in the network and the generation time of packets in the network. Experimental results show that in different iterations, the proposed method has lower node delay and node energy consumption, with values less than 0.2 and 2, respectively, and the maximum data fusion quality can reach 98, with high fusion benefits, so as to improve the transmission and scheduling efficiency and quality of high-density data in wireless sensor network.

The use of wireless multimedia sensor networks (WMSNs) for surveillance applications has attracted the interest of many researchers. As with traditional sensor networks, it is easy to deploy and operate WMSNs. With inclusion of multimedia devices in wireless sensor networks, it is possible to provide data to users that is more meaningful than that provided by scalar sensor-based systems alone; however, producing, storing, processing, analyzing, and transmitting multimedia data in sensor networks requires consideration of additional constraints, including energy, processing power, storage capacity, and communication. Furthermore, as multimedia sensors produce much more data than scalar sensors, more manpower is required to analyze multimedia data. To overcome these constraints and challenges, this paper aimed to propose a system architecture and a set of procedures for WMSNs that facilitate automatic classification of moving objects using scalar and multimedia sensors. Methods and standards for detecting and classifying a moving object, as well as transmission of the results, are described in detail. The hardware for each sensor node includes a built-in camera, a passive infrared motion sensor, a vibration sensor, and an acoustic sensor. An application using our proposed methods was developed and embedded in the multimedia sensor node. In addition, a sink station was set up and the data produced by the sensor network was collected by this server. The classification performance of the application was tested using video recorded by the sensor node. The effect of the proposed methods on power consumption was also tested and measured. The experimental results show that the proposed approach is sufficiently lightweight to be used for real-world surveillance applications.

In this paper, we study two problems of providing reliable data transmission and developing aggregation techniques for correlated data in wireless sensor networks. A system with forward error correction (FEC) can provide an objective reliability while using less transmission power than a system without FEC. Because of the additional parity bits and encoding/decoding energy consumptions, we study the effect of FEC on energy efficiency. We propose to use LDPC codes for FEC. We show that wireless sensor networks using LDPC codes are almost 45% more energy efficient than those that use BCH codes, which were shown to be 15% more energy efficient than the best performing convolutional codes. Then we study the problem of providing aggregation for two and three correlated nodes in wireless sensor networks. We propose to use LDPC codes in wireless sensor networks for source and channel coding to obtain a two-fold energy savings. For two correlated nodes, we study both distributed source coding and joint source-channel coding. While distributed source coding using LDPC codes was studied before, joint source-channel coding using LDPC codes is introduced for the first time. The difference between our work in distributed source coding using LDPC codes and the previous work lies in the LDPC code design procedure. The simulation results show that our proposed design criteria improves the performance of the source coding. The convergence of the non-uniform LDPC code of our design technique is almost 60% closer to the Slepian-Wolf limit. For three correlated nodes, we study distributed source coding using LDPC codes. We simplified the problem of design procedure to randomly punctured LDPC codes. This is a new approach for designing LDPC codes and the simulation results for code of length 1000 shows that the convergence of the LDPC code is achieved at compression rate 0.3174 which is only 0.08 away from the Slepian-Wolf limit.

In this paper propose an several concepts for optimal algorithm of aggregation of data in wireless sensor network. Given analysis of problems for information aggregation in wireless sensor network. Proposed optimise of structure the node and given basic concepts for reducing energy consumption. Also proposed network partitioning into piconet with next clustering. In final proposed are two modifications for ant algorithms to optimize data collection in wireless sensor network.

Wireless Sensor and Actor Networks (WSANs) have received increased attention from the research community in the recent years. This is mainly because as an extension to Wireless Sensor Networks(WSN), they have the ability to actively participate in the environment trough the actors. However, this introduces new challenges as to how to transfer commands between nodes, actors and central station who may be from different manufacturers and use different communication protocols. Another important aspect is the ability of the WSAN to present the data to the interested party or to receive the command from the operator, and do this with in the simplest and most user friendly way as possible. In this paper we propose architecture for interconnection between different layers of WSANs and the central stations that would allow building a simple interface that would ease the operation with WSANs in view of Control and Data Acquisition.

Wireless sensor networks (WSNs) are vulnerable, that is, they can be physically or remotely exposed to destructive effects. In other words, security is critical in many wireless sensor network applications. Sensor readings are used to locate events such as fires, floods, etc. Because wireless sensor networks are vulnerable, there is a need to protect the network by detecting the introduction of false data. We have developed an algorithm to identify and fix malicious data in the network. The developed optimized swarm intelligence algorithm is applied to different datasets to analyze its performance. A simulator is used to test the algorithm. The analysis and simulation results show the detection and correction of malicious data in wireless sensor networks. In this paper we test simulation of data injection attack in WSN and reach the accuracy of 95% using Matlab.

Reliable transmission of data over the lossy wireless medium can be achieved by using an acknowledgement (ack) scheme. However, acks can be quite energy-consuming and should be used sparingly in energy-constrained networks. The simplest of acknowledgement schemes is the stop-and-wait ARQ (swack). Recent work proposes an implicit acknowledgement scheme (iack) which seems to be energy-saving, as there are no separate ackowledgements sent. IEEE 802.11e proposes a hop-by-hop block ack (eack). We modify this scheme to suit WSNs and propose that the choice of the ack scheme that would keep the network in- tact for the longest time depends on the tree overlay and the data and ack packet lengths. We theoretically compare the maximum energy spent for sending and re- ceiving acknowledgements for these three types of ack schemes. We then give a guideline to choose the most energy-saving of these three types of acknowledge- ments for convergecast in a wireless sensor network (WSN) applications with a routing tree overlay and continuous event generation rate.KeywordsWireless Sensor NetworkMedium Access ControlData PacketMedium Access Control LayerPacket LengthThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Wireless multimedia sensor networks with sensing and processing abilities of multimedia data have recently emerged as one of the most important technologies for high quality monitoring. The routing scheme for multimedia data is an important research issue addressed in wireless multimedia sensor networks. In this paper, we propose a disjointed multipath routing scheme for real-time data transmission in wireless multimedia sensor networks. The proposed scheme uses a hybrid routing protocol based on Bluetooth and Zigbee in order to overcome the limitation of low bandwidth in conventional sensor networks. The proposed scheme also performs disjointed multipath routing based on competition to alleviate the delay of routing path setup. To show the superiority of our proposed scheme, we compare it with the existing scheme through performance evaluation. Our experimental results show that our proposed scheme reduces the end-to-end delay by about 30% and the routing path setup costs by about 22% over the existing scheme. Our scheme also increases data reception rates by about 690% over the existing scheme on average.

Data aggregation processes aim to reduce the amount of exchanged data in wireless sensor networks and consequently minimize the packet overhead and optimize energy efficiency. Securing the data aggregation process is a real challenge since the aggregation nodes must access the relayed data to apply the aggregation functions. The data aggregation security problem has been widely addressed in classical homogeneous wireless sensor networks, however, most of the proposed security protocols cannot guarantee a high level of security since the sensor node resources are limited. Heterogeneous wireless sensor networks have recently emerged as a new wireless sensor network category which expands the sensor nodes’ resources and capabilities. These new kinds of WSNs have opened new research opportunities where security represents a most attractive area. Indeed, robust and high security level algorithms can be used to secure the data aggregation at the heterogeneous aggregation nodes which is impossible in classical homogeneous WSNs. Contrary to the homogeneous sensor networks, the data aggregation security problem is still not sufficiently covered and the proposed data aggregation security protocols are numberless. To address this recent research area, this paper describes the data aggregation security problem in heterogeneous wireless sensor networks and surveys a few proposed security protocols. A classification and evaluation of the existing protocols is also introduced based on the adopted data aggregation security approach.

Energy consumption is the key design criterion for routing data in wireless sensor Network. Recently the use of multiple sinks instead of single is considered as a research topic for energy saving. The objective is to maximize the network lifetime by reducing distance from source node to sink during data transmission. This paper proposes a network partitioning algorithm based on selection of farthest node from k-Nearest Neighbour Graph. After partitioning, a restricted flooding-based routing protocol is used for data transmission. It is shown that the network lifetime significantly increases in a partitioned network in comparison with a non-partitioned network.

Due to recent developments in pervasive and ubiquitous computing, health care systems can provide well-informed and high-quality patient care services. A care provider can receive a simplified, adaptive, and latest view of the medical data. Although the medical file is unique, the distributed record could be accessible from any place at any time by care providers. Pervasive health care information systems allow overcoming the problem of heterogeneity of technologies and services in this domain and the papers selected for this special issue represent a good panel for addressing this challenge. Of course, the selected topics and papers are not an exhaustive representation of the area of Pervasive Health Care Services and Technologies. Nonetheless, they represent the rich and many-faceted knowledge, that we have the pleasure of sharing with the readers. We would like to thank the authors for their excellent contributions and patience in assisting us. Finally, the fundamental work of all reviewers on these papers is also very warmly acknowledged.

In practical applications, because of some reasons, such as node failure or link failure, data loss is a normal occurrence in wireless sensor networks. For many applications on which data has a great impact, it is important to recover the lost data. Because of the sensory data has spatial correlation and temporal correlation, it is difficult to recover the lost data. Consider this, in this paper, we propose a novel algorithm based on the Markov Random Field to reduce the data error ratio during the data recovery process. In our proposed algorithm, we use the curved face recovery to utilize the spatial correlation in the sensory data, then we explore the temporal correlation between data in wireless sensor networks so that it can improve the accuracy of data recovered. A large amount of experiments show that, compared to other relevant works, the data recovery algorithm we proposed can reduce the error rate of the fitting data, especially data lost seriously in the wireless sensor network.