Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnergy Efficient WSN: a Cross-layer Graph Signal Processing Solution to Information Redundancy
307
0
0.0
(
0
)
Added by
Alessandro Chiumento Mr.
Publication date
2019
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work an iterative solution to build a network lifetime-preserving sampling strategy for WSNs is presented. The paper describes the necessary steps to reconstruct a graph from application data. Once the graph structure is obtained, a sampling strategy aimed at finding the smallest number of concurrent sensors needed to reconstruct the data in the unsampled nodes within a specific error bound, is presented. An iterative method then divides the sensor nodes into sets to be sampled sequentially to increase lifetime. Results on a real-life dataset show that the reconstruction RMSE can be easily traded off for a larger number of disjoint sampling sets which improve the network lifetime linearly.
rate research
Read More
Collective motion among biological organisms such as insects, fish, and birds has motivated considerable interest not only in biology but also in distributed robotic systems. In a robotic or biological swarm, anomalous agents (whether malfunctioning or nefarious) behave differently than the normal agents and attempt to hide in the chaos of the swarm. By defining a graph structure between agents in a swarm, we can treat the agents properties as a graph signal and use tools from the field of graph signal processing to understand local and global swarm properties. Here, we leverage this idea to show that anomalous agents can be effectively detected using their impacts on the graph Fourier structure of the swarm.
Deep learning, particularly convolutional neural networks (CNNs), have yielded rapid, significant improvements in computer vision and related domains. But conventional deep learning architectures perform poorly when data have an underlying graph structure, as in social, biological, and many other domains. This paper explores 1)how graph signal processing (GSP) can be used to extend CNN components to graphs in order to improve model performance; and 2)how to design the graph CNN architecture based on the topology or structure of the data graph.
Graph signal processing (GSP) is an emerging field developed for analyzing signals defined on irregular spatial structures modeled as graphs. Given the considerable literature regarding the resilience of infrastructure networks using graph theory, it is not surprising that a number of applications of GSP can be found in the resilience domain. GSP techniques assume that the choice of graphical Fourier transform (GFT) imparts a particular spectral structure on the signal of interest. We assess a number of power distribution systems with respect to metrics of signal structure and identify several correlates to system properties and further demonstrate how these metrics relate to performance of some GSP techniques. We also discuss the feasibility of a data-driven approach that improves these metrics and apply it to a water distribution scenario. Overall, we find that many of the candidate systems analyzed are properly structured in the chosen GFT basis and amenable to GSP techniques, but identify considerable variability and nuance that merits future investigation.
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the standard approaches of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical structure used in fields such as neuroscience, critical infrastructure, and robot coordination, further complicates the issue. Recent results generalized the total variation of a graph signal to that of directed variation as a motivating principle for developing a graphical Fourier transform (GFT). Here, we extend these techniques to concepts of signal variation appropriate for indefinite and complex-valued graphs and use them to define a GFT for these classes of graph. Simulation results on random graphs are presented, as well as a case study of a portion of the fruit fly connectome.
Intelligent signal processing for wireless communications is a vital task in modern wireless systems, but it faces new challenges because of network heterogeneity, diverse service requirements, a massive number of connections, and various radio characteristics. Owing to recent advancements in big data and computing technologies, artificial intelligence (AI) has become a useful tool for radio signal processing and has enabled the realization of intelligent radio signal processing. This survey covers four intelligent signal processing topics for the wireless physical layer, including modulation classification, signal detection, beamforming, and channel estimation. In particular, each theme is presented in a dedicated section, starting with the most fundamental principles, followed by a review of up-to-date studies and a summary. To provide the necessary background, we first present a brief overview of AI techniques such as machine learning, deep learning, and federated learning. Finally, we highlight a number of research challenges and future directions in the area of intelligent radio signal processing. We expect this survey to be a good source of information for anyone interested in intelligent radio signal processing, and the perspectives we provide therein will stimulate many more novel ideas and contributions in the future.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
