Adaptive completion of the correlation matrix in wireless sensor networks. Vlachos, E. & Berberidis, K. In *2016 24th European Signal Processing Conference (EUSIPCO)*, pages 1403-1407, Aug, 2016.

Paper doi abstract bibtex

Paper doi abstract bibtex

The correlation structure among the sensor observations is a significant characteristic of the wireless sensor network (WSN) which can be exploited to drastically enhance the overall network performance. This structure is usually expressed as a low-rank approximation of the correlation matrix, although, in many cases the correlation of the captured data is full-rank. Thus, the computation of the full-rank correlation matrix by centralizing all the measurements into one node, puts at risk the privacy of the WSN. To overcome this problem, we impose privacy-preserving restrictions, in order to constrain the cooperation among the nodes, and hence promote the privacy. To this end, the decentralized estimation of the network-wide correlation matrix is obtained via a novel adaptive matrix completion technique, where at each step, a rank-one completion problem is solved. Through simulation experiments it has been verified that proposed algorithm converges to the full rank correlation matrix. Moreover, the proposed algorithm exhibits significantly lower computational complexity than the conventional technique.

@InProceedings{7760479, author = {E. Vlachos and K. Berberidis}, booktitle = {2016 24th European Signal Processing Conference (EUSIPCO)}, title = {Adaptive completion of the correlation matrix in wireless sensor networks}, year = {2016}, pages = {1403-1407}, abstract = {The correlation structure among the sensor observations is a significant characteristic of the wireless sensor network (WSN) which can be exploited to drastically enhance the overall network performance. This structure is usually expressed as a low-rank approximation of the correlation matrix, although, in many cases the correlation of the captured data is full-rank. Thus, the computation of the full-rank correlation matrix by centralizing all the measurements into one node, puts at risk the privacy of the WSN. To overcome this problem, we impose privacy-preserving restrictions, in order to constrain the cooperation among the nodes, and hence promote the privacy. To this end, the decentralized estimation of the network-wide correlation matrix is obtained via a novel adaptive matrix completion technique, where at each step, a rank-one completion problem is solved. Through simulation experiments it has been verified that proposed algorithm converges to the full rank correlation matrix. Moreover, the proposed algorithm exhibits significantly lower computational complexity than the conventional technique.}, keywords = {approximation theory;computational complexity;data privacy;matrix algebra;wireless sensor networks;adaptive matrix completion technique;rank-one completion problem;computational complexity;network-wide correlation matrix decentralized estimation;privacy-preserving restriction;full-rank correlation matrix low-rank approximation;WSN;wireless sensor network;Correlation;Matrix decomposition;Wireless sensor networks;Symmetric matrices;Signal processing algorithms;Europe;Privacy}, doi = {10.1109/EUSIPCO.2016.7760479}, issn = {2076-1465}, month = {Aug}, url = {https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570252301.pdf}, }

Downloads: 0

{"_id":"i92E7okZtNXpStARE","bibbaseid":"vlachos-berberidis-adaptivecompletionofthecorrelationmatrixinwirelesssensornetworks-2016","authorIDs":[],"author_short":["Vlachos, E.","Berberidis, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["E."],"propositions":[],"lastnames":["Vlachos"],"suffixes":[]},{"firstnames":["K."],"propositions":[],"lastnames":["Berberidis"],"suffixes":[]}],"booktitle":"2016 24th European Signal Processing Conference (EUSIPCO)","title":"Adaptive completion of the correlation matrix in wireless sensor networks","year":"2016","pages":"1403-1407","abstract":"The correlation structure among the sensor observations is a significant characteristic of the wireless sensor network (WSN) which can be exploited to drastically enhance the overall network performance. This structure is usually expressed as a low-rank approximation of the correlation matrix, although, in many cases the correlation of the captured data is full-rank. Thus, the computation of the full-rank correlation matrix by centralizing all the measurements into one node, puts at risk the privacy of the WSN. To overcome this problem, we impose privacy-preserving restrictions, in order to constrain the cooperation among the nodes, and hence promote the privacy. To this end, the decentralized estimation of the network-wide correlation matrix is obtained via a novel adaptive matrix completion technique, where at each step, a rank-one completion problem is solved. Through simulation experiments it has been verified that proposed algorithm converges to the full rank correlation matrix. Moreover, the proposed algorithm exhibits significantly lower computational complexity than the conventional technique.","keywords":"approximation theory;computational complexity;data privacy;matrix algebra;wireless sensor networks;adaptive matrix completion technique;rank-one completion problem;computational complexity;network-wide correlation matrix decentralized estimation;privacy-preserving restriction;full-rank correlation matrix low-rank approximation;WSN;wireless sensor network;Correlation;Matrix decomposition;Wireless sensor networks;Symmetric matrices;Signal processing algorithms;Europe;Privacy","doi":"10.1109/EUSIPCO.2016.7760479","issn":"2076-1465","month":"Aug","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570252301.pdf","bibtex":"@InProceedings{7760479,\n author = {E. Vlachos and K. Berberidis},\n booktitle = {2016 24th European Signal Processing Conference (EUSIPCO)},\n title = {Adaptive completion of the correlation matrix in wireless sensor networks},\n year = {2016},\n pages = {1403-1407},\n abstract = {The correlation structure among the sensor observations is a significant characteristic of the wireless sensor network (WSN) which can be exploited to drastically enhance the overall network performance. This structure is usually expressed as a low-rank approximation of the correlation matrix, although, in many cases the correlation of the captured data is full-rank. Thus, the computation of the full-rank correlation matrix by centralizing all the measurements into one node, puts at risk the privacy of the WSN. To overcome this problem, we impose privacy-preserving restrictions, in order to constrain the cooperation among the nodes, and hence promote the privacy. To this end, the decentralized estimation of the network-wide correlation matrix is obtained via a novel adaptive matrix completion technique, where at each step, a rank-one completion problem is solved. Through simulation experiments it has been verified that proposed algorithm converges to the full rank correlation matrix. Moreover, the proposed algorithm exhibits significantly lower computational complexity than the conventional technique.},\n keywords = {approximation theory;computational complexity;data privacy;matrix algebra;wireless sensor networks;adaptive matrix completion technique;rank-one completion problem;computational complexity;network-wide correlation matrix decentralized estimation;privacy-preserving restriction;full-rank correlation matrix low-rank approximation;WSN;wireless sensor network;Correlation;Matrix decomposition;Wireless sensor networks;Symmetric matrices;Signal processing algorithms;Europe;Privacy},\n doi = {10.1109/EUSIPCO.2016.7760479},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570252301.pdf},\n}\n\n","author_short":["Vlachos, E.","Berberidis, K."],"key":"7760479","id":"7760479","bibbaseid":"vlachos-berberidis-adaptivecompletionofthecorrelationmatrixinwirelesssensornetworks-2016","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570252301.pdf"},"keyword":["approximation theory;computational complexity;data privacy;matrix algebra;wireless sensor networks;adaptive matrix completion technique;rank-one completion problem;computational complexity;network-wide correlation matrix decentralized estimation;privacy-preserving restriction;full-rank correlation matrix low-rank approximation;WSN;wireless sensor network;Correlation;Matrix decomposition;Wireless sensor networks;Symmetric matrices;Signal processing algorithms;Europe;Privacy"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2016url.bib","creationDate":"2021-02-13T17:31:52.088Z","downloads":0,"keywords":["approximation theory;computational complexity;data privacy;matrix algebra;wireless sensor networks;adaptive matrix completion technique;rank-one completion problem;computational complexity;network-wide correlation matrix decentralized estimation;privacy-preserving restriction;full-rank correlation matrix low-rank approximation;wsn;wireless sensor network;correlation;matrix decomposition;wireless sensor networks;symmetric matrices;signal processing algorithms;europe;privacy"],"search_terms":["adaptive","completion","correlation","matrix","wireless","sensor","networks","vlachos","berberidis"],"title":"Adaptive completion of the correlation matrix in wireless sensor networks","year":2016,"dataSources":["koSYCfyY2oQJhf2Tc","JiQJrC76kvCnC3mZd"]}