Abstract—As wireless sensor networks are used extensively in environment and habitat monitoring, the large volume of data transmission can increase the workload of the sensor nodes and reduce their useful lifetime. The compressive sampling techniques have been proposed to reduce the volume of data transmission when the data is sparse in certain domain. While finding the optimal routing path that minimizes data traffic is an NP-complete problem, a near-optimal routing protocol in the literature requires omniscient knowledge of the entire network and thus incurs extensive message exchanges in real applications. In this paper, we propose a distributed algorithm that uses local minimization to dynamically construct a routing path to reduce the data traffic for compressive sampling based aggregation. This algorithm does not require the omniscient knowledge of the global network topology and incurs much lower overhead than the near optimal solution, and therefore, is more suitable for practical applications.
Index Terms—Compressive sensing, data aggregation, distributed algorithm, routing.
Tsung-Yi Tsai is with the Quanta, Taiwan (e-mail: emilwings@gmail.com). Wei-Chi Lan and Min-Te Sun are with the Department of Computer Science and Information Engineering, National Central University, Taiwan (e-mail: weichilan@gmail.com, msun@csie.ncu.edu.tw).
Chunlei Liu is with the Department of Mathematics and Computer Science, Valdosta State University, GA 31698 USA (e-mail: cliu@valdosta.edu).
[PDF]
Cite:Tsung-Yi Tsai, Wei-Chi Lan, Chunlei Liu, and Min-Te Sun, "Distributed Compressive Data Aggregation in Large-Scale Wireless Sensor Networks," Journal of Advances in Computer Networks vol. 1, no. 4, pp. 295-300, 2013.
