CStorage: Decentralized compressive data storage in wireless sensor networks

详细信息    查看全文

• 作者：Ali Talari ; ^a ; ^{ali.talari@okstate.edu" class="auth_mail" title="E-mail the corresponding author} ; ^{alitalari@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Nazanin Rahnavard^b ; ^{nazanin@eecs.ucf.edu" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Compressive sensing/sampling ; Distributed data storage ; Wireless sensor networks ; Probabilistic broadcasting ; Data dissemination
• 刊名：Ad Hoc Networks
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：37
• 期：part_P2
• 页码：475-485
• 全文大小：1451 K

文摘

In this paper, we employ compressive sensing (CS) to design a distributed compressive data storage (CStorage) algorithm for wireless sensor networks (WSNs). First, we assume that no neighbor information or routing table is available at nodes and employ the well-known probabilistic broadcasting (PB) to disseminate sensors reading throughout the network to form compressed samples (measurements) of the network readings at each node. After the dissemination phase, a data collector may query any arbitrary set of M ≪ N nodes for their measurement and reconstruct all N readings using CS. We refer to the first implementation of CStorage by CStorage-P.

Next, we assume that nodes collect two-hop neighbor information and design a novel parameterless and scalable data dissemination algorithm referred to by alternating branches (ABs), and design CStorage-B. We discuss the advantages of CStorage-P and CStorage-B and show that they considerably decrease the total number of required transmissions for data storage in WSNs compared to existing work.