{"title":"基于低秩张量的异构无线传感器网络数据恢复","authors":"Jingfei He, Guiling Sun, Y. Zhang, Tianyu Geng","doi":"10.1109/ISCC.2016.7543805","DOIUrl":null,"url":null,"abstract":"An effective way to reduce the energy consumption of energy constrained wireless sensor networks is reducing the number of collected data, which causes the recovery problem. In this paper, we propose a novel data recovery method based on low-rank tensors for the heterogeneous wireless sensor networks with various sensor types. The proposed method represents the collected high-dimensional data as low-rank tensors to effectively exploit the spatiotemporal correlation that exists in the various data. Furthermore, an algorithm based on the alternating direction method of multipliers is developed to solve the resultant optimization problem efficiently. Experimental results demonstrate that the proposed method significantly outperforms the sparsity constraint method and matrix completion method for each type of signals.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Data recovery in heterogeneous wireless sensor networks based on low-rank tensors\",\"authors\":\"Jingfei He, Guiling Sun, Y. Zhang, Tianyu Geng\",\"doi\":\"10.1109/ISCC.2016.7543805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An effective way to reduce the energy consumption of energy constrained wireless sensor networks is reducing the number of collected data, which causes the recovery problem. In this paper, we propose a novel data recovery method based on low-rank tensors for the heterogeneous wireless sensor networks with various sensor types. The proposed method represents the collected high-dimensional data as low-rank tensors to effectively exploit the spatiotemporal correlation that exists in the various data. Furthermore, an algorithm based on the alternating direction method of multipliers is developed to solve the resultant optimization problem efficiently. Experimental results demonstrate that the proposed method significantly outperforms the sparsity constraint method and matrix completion method for each type of signals.\",\"PeriodicalId\":148096,\"journal\":{\"name\":\"2016 IEEE Symposium on Computers and Communication (ISCC)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Symposium on Computers and Communication (ISCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2016.7543805\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium on Computers and Communication (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2016.7543805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data recovery in heterogeneous wireless sensor networks based on low-rank tensors
An effective way to reduce the energy consumption of energy constrained wireless sensor networks is reducing the number of collected data, which causes the recovery problem. In this paper, we propose a novel data recovery method based on low-rank tensors for the heterogeneous wireless sensor networks with various sensor types. The proposed method represents the collected high-dimensional data as low-rank tensors to effectively exploit the spatiotemporal correlation that exists in the various data. Furthermore, an algorithm based on the alternating direction method of multipliers is developed to solve the resultant optimization problem efficiently. Experimental results demonstrate that the proposed method significantly outperforms the sparsity constraint method and matrix completion method for each type of signals.