Joint routing and scheduling for data collection with compressive sensing to achieve order-optimal latency
- Authors
- Yu, Xiaohan; Baek, Seung Jun
- Issue Date
- 27-10월-2017
- Publisher
- SAGE PUBLICATIONS INC
- Keywords
- Wireless sensor networks; compressive sensing; graph theory; data aggregation; connected dominating set
- Citation
- INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, v.13, no.10
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS
- Volume
- 13
- Number
- 10
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/81859
- DOI
- 10.1177/1550147717737968
- ISSN
- 1550-1329
- Abstract
- We consider a joint routing and scheduling scheme for data collection in wireless sensor networks leveraging compressive sensing under the protocol interference model. We propose the construction of a connected dominating set as a network backbone for efficient routing. A hybrid compressive sensing technique, which combines conventional and compressive data gathering schemes, is used to aggregate data over the backbone. Pipelined scheduling is developed for fast aggregation of compressed data over the backbone. We set the communication range of sensor nodes to an appropriate value to control the size of the backbone and demonstrate that the proposed scheme can achieve order-optimal latency for data gathering. We extend the proposed scheme to the physical interference model and show that comparable latency is achievable under physical interference model. In addition, the proposed scheme is shown to be energy-efficient, in that it can achieve order-optimal energy consumption given that the sensor data sparsity is of constant order. Simulation results show the effectiveness of the proposed scheme in terms of latency and energy consumption.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.