期刊文献+

二值传感器网络的分布式稀疏LMS算法 被引量:3

Distributed Sparse LMS Algorithm over Binary Sensor Network
下载PDF
导出
摘要 在基于无线传感器网络的参数估计中,每个节点在数据采集、存储、处理和传输等方面的能力是有限的。二值传感器网络中的每个节点只能提供低精度1比特测量值,与能够提供模拟测量值(无限精度)的传感器相比,二值传感器有较低的使用成本。如何利用低成本二值传感器网络获得较好的参数估计性能近些年已引起广泛关注,基于该二值传感器网络,论文提出了一种分布式稀疏参数估计的自适应最小均方(LMS)算法。该算法采用稀疏惩罚最大似然优化,并结合期望最大化和LMS方法,获得稀疏信号的在线估计。仿真实验表明,尽管只采用1比特测量,提出的算法仍具有较好的收敛性,并且稳定状态的估计误差接近于非1比特测量的同类算法。 In the parameter estimation over wireless sensor networks(WSNs), each node ’ s ability in data acquisition, storage, processing and transmission is limited. In a binary sensor network, each node only can provide low-precision One-bit observations. Compared with the measurement value sensors that can provide analog measurements (infinite accuracy), the binary sensors have lower cost. How to use low-cost binary sensor networks to obtain better parameter estimation performance have attracted extensive attention in recent years. Based on this binary sensor network, an adaptive least mean square (LMS)algorithm for distributed sparse parameter estimation is proposed. The algorithm adopts sparse penalty maximum likelihood optimization, combined with expectation maximization (EM)and Least Mean Square (LMS)method, to obtain the online estimation of sparse signal. Simulation experiment results show that the proposed algorithm, though only using 1-bit measurements, has good convergence, is comparable to the existing algorithms based on analog measurements (infinite accuracy).
作者 王文博 姚英彪 刘兆霆 WANG Wen-bo;YAO Ying-biao;LIU Zhao-ting(School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, Zhejiang 310000, China)
出处 《信号处理》 CSCD 北大核心 2019年第1期86-92,共7页 Journal of Signal Processing
基金 国家自然科学基金(61671192) 浙江省自然科学基金(LY16F010012)
关键词 传感器网络 参数估计 1比特测量值 稀疏 期望最大化 sensor network parameter estimation one-bit observations sparse expectation maximization
  • 相关文献

参考文献2

二级参考文献35

  • 1周四望,林亚平,张建明,欧阳竞成,卢新国.传感器网络中基于环模型的小波数据压缩算法[J].软件学报,2007,18(3):669-680. 被引量:41
  • 2黄海平,沙超,蒋凌云.无线传感器网络技术及其应用[M].北京:人民邮电出版社,2011.
  • 3DONOHO D. Compressed sensing [ J ]. IEEE Tram on In- formationTheory ,2006,52 (4) : 1289-1306.
  • 4B Babadi, M Kalouptsidis, V Tarokh. Asymptotic Achie- vability of the Cramer Rao Bound for Noisy Compressive Sampling[J]. IEEE Transactions on Signal Processing, 2009, 57 (3) : 1233-1236.
  • 5J Wright. Robust Face Recoginition via Sparse Represen-tation[ J ]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(2): 210-227.
  • 6Baraniuk R, Steeghs P. Compressive radar imaging [ C ]. Proceedings of the 2007 IEEE Radar Conference. Waltham ,2007 : 128-133.
  • 7J Romberg. Imaging via compressive sampling[ J]. IEEE Signal Processing Magazine, 2008, 25(2): 14-20.
  • 8G Taub ck and F Hlawatsch. A compressed sensing tech- nique for OFDM channel estimation in mobile environments: Exploiting channel sparsity for reducing pilots [ C ]. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP). l_as Vegas, Nevada, April 2008. 2885-2889.
  • 9W Bajwa, J Haupt, A Sayeed and R Nowak. Joint source channel communication for distributed estimation in sensor networks [ J ]. IEEE Transactions on Signal Processing, 2007, 53(10) : 3629-3653.
  • 10Haifeng Zheng, Shilin Xiao, Xinbing Wang, Xiaohua Tian, Guizani, M. Capacity and Delay Analysis for Data Gathering with Compressive Sensing in Wireless Sensor Networks. IEEE Transactions on Wireless Communica- tions, 2013,12(2) : 917-927.

共引文献28

同被引文献7

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部