作者: Jinho Choi , Shancang Li , Xinheng Wang , Jeongseok Ha
DOI: 10.1109/WIAD.2012.6296556
关键词: Sensor node 、 Brooks–Iyengar algorithm 、 Iterative method 、 Mobile wireless sensor network 、 Computer science 、 Key distribution in wireless sensor networks 、 Wireless sensor network 、 Algorithm 、 Consensus 、 Distributed algorithm
摘要: In wireless sensor networks, distributed consensus algorithms can be employed for detection. Each node compute its log-likelihood ratio (LLR) from local observations a target event and using an iterative algorithm, the average of sensors' LLRs available to all nodes. While allows each make final decision as statistic overall detection problem with LLRs, it may desirable if or observations, which form full information vector denoted by x, could other purposes more than this paper, we show that have not only but also vector, (or estimate) well-known algorithm. We extend proposed approach estimate x when is sparse based on notion compressed sensing.