Document Type : Innovative Paper

Authors

1 Department of Electrical Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran

2 Iran University of Science and Technology

Abstract

Background and Objectives: Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to the sink. Spatiotemporal CS (STCS), with the use of spatial and temporal correlation of sensor readings, can increase the compression rate in WSNs, thereby reducing the cost of communication. 
Methods: In this paper, a new method of STCS technique based on the geographic adaptive fidelity (GAF) protocol is proposed which can effectively reduce the communication cost and energy consumption in WSNs. In the proposed method, temporal data is obtained from random selection of temporal readings of cluster head (CH) sensors located in virtual cells in the clustered sensors' area and spatial data will be formed from the data readings of CHs located on the routes. Accordingly, a new structure of sensing matrix will be created. 
Results: The results of proposed method show that the proposed method as compared to the method proposed in ‎[29], which is the most similar method in the literature, reduces energy consumption in the range of 22% to 43% in various scenarios which were implemented based on the number of required measurements at the sink (M) and the number of measurements in the routes (mr).
Conclusion: In the proposed method, based on spatio-temporal CS (STCS), a new structure of sensing matrix is created that can increase the compression rate, thereby reducing the communication cost in the WSNs.


======================================================================================================
Copyrights
©2018 The author(s). This is an open access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, as long as the original authors and source are cited. No permission is required from the authors or the publishers.
======================================================================================================

Keywords

Main Subjects

[1] H. Zheng, F. Yang, X. Tian, X. Gan, X. Wang, S. Xiao, “Data gathering with compressive sensing in wireless sensor networks: A random walk based approach,” IEEE Transactions on Parallel and Distributed Systems, 26 (1): 35-44, 2015.

[2] J. Haupt, W. Bajwa, M. Rabbat, R. Nowak, “Compressed sensing for networked data: A different approach to decentralized compression,” IEEE Signal Processing Magazine, 25(2): 92-101, 2008.

[3] S. Li, L. Xu, X. Wang, “Compressed sensing signal and data acquisition in wireless sensor networks and Internet of things,” IEEE Transactions on Industrial Informatics, 9(4): 2177-2186, 2013.

[4] B. Ali, N. Pissinou, K. Makki, “Identification and validation of spatio-temporal associations in wireless sensor networks,” in Proc. SENSORCOMM, Athens, Greece: 496-501, 2009.

[5] O. Younis, S. Fahmy, “HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Transactions on Mobile Computing, 3(4): 366-379, 2004.

[6] N. A. Pantazis, D. D. Vergados, “A survey on power control issues in wireless sensor networks,” IEEE Communications Surveys & Tutorials, 9(4): 86-107, 2007.

[7] S. Wang, Z. Chen, “LCM: A link-aware clustering mechanism for energy-efficient routing in wireless sensor networks,” IEEE Sensors Journal, 13(2): 728-736, 2013.

[8]  D. Bhattacharyya, T. H. Kim, S. Pal, “A comparative study of wireless sensor networks and their routing protocols,” Sensors, 10(12): 10506-10523, 2010.

[9] M. Bhuiyan, G. Wang, A. Vasilakos, “Local area prediction-based mobile target tracking in wireless sensor networks,” IEEE Transactions on Computers, 64(7): 1968-1982, 2015.

[10] E. Xu, Z. Ding, S. Dasgupta, “Target tracking and mobile sensor navigation in wireless sensor networks,” IEEE Transactions on Mobile Computing, 12(1): 177-186, 2013.

[11] A. Vempaty, O. Ozdemir, K. Agrawal, H. Chen, P. Varshney, “Localization in wireless sensor networks: Byzantines and mitigation techniques,” IEEE Transactions on Signal Processing, 61(6): 1495-1508, 2013.

[12] Y. Xu, J. Heidemann, D. Estrin, “Geography-informed energy conservation for Ad-Hoc routing,” in Proc. of the 7th Annual International Conference on Mobile Computing and Networking (MobiCOM): 70-84, Rome, Italy, 2001.

[13] F. Shang, J. Liu, “Multi-hop topology control algorithm for wireless sensor networks,” Journal of Networks, 9(7): 1407-1414, 2012.

[14] D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, 52(4): 1289-1306, 2006.

[15] E. Candes, J. Romberg, T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, 52(2): 489-509, 2006.

[16] E. Candes and M. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine, 25(2): 21-30, Mar. 2008.

[17] M. B. Wakin, M. F. Duarte, S. Sarvotham, D. Baron, R. G. Baraniuk, “Recovery of jointly sparse signals from few  random,” in Proc. 15th ACM MobiCom: 145-156, Beijing, China, 2009.

[18] E. Candes, T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies,” IEEE Transactions on Information Theory, 52(12): 5406-5425, 2006.

[19] E. Candes, T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, 51(12): 4203-4215, 2005.

[20] E. Candes, J. Romberg, T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics, 59(8): 1207-1223, 2006.

[21] J. Tropp, A. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on Information Theory, 53(12): 4655-4666, 2007.

[22] M. Duarte, R. Baraniuk, “Kronecker compressive sensing,” IEEE Transactions on Image Processing, 21(2): 494-504, 2012.

[23] E. Candes, “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathematique, 346(9/10): 589-592, 2008.

[24] E. Candes, J. Romberg, “Sparsity and incoherence in compressive sampling,” Inverse Problems, 23(3): 969-985, 2007.

[25] J. Haupt, R. Nowak, “Signal reconstruction from noisy random projections,” IEEE Transactions on Information Theory, 52(9): 4036-4048, 2006.

[26] M. Leinonen, S. Member, “Sequential compressed sensing with progressive signal reconstruction in wireless sensor networks,” IEEE Transactions on Wireless Communication, 14(3): 1622-1635, 2015.

[27] M. Duarte, R. Baraniuk, “Kronecker product matrices for compressive sensing,” in Proc. IEEE Int. Conf. Acoust. Speech Signal Process.: 3650-3653, Dallas, TX, USA, 2010.

[28] M. Mahmudimanesh, A. Khelil, N. Suri, “Balanced spatio-temporal compressive sensing for multi-hop  wireless sensor networks,” presented at the IEEE 9th Int. Conf. on Mobile Ad Hoc and Sensor Systems, Las Vegas, USA, 2012.

[29] X. Li, X. Tao, Z. Chen, “Spatio-temporal compressive sensing based data gathering in wireless sensor networks,” IEEE Wireless Communications Letters, 7(2): 198-201, 2018.

[30] X. Li, X. Tao, G. Mao, “Unbalanced expander based compressive data gathering in clustered wireless sensor networks,” IEEE Access, 5): 7553-7566, 2017.

[31] L. Quan, S. Xiao, X. Xue, C. Lu, “Neighbour-aided spatial-temporal compressive data gathering in wireless sensor networks,” IEEE Communications Letters, 20(3): 578-581, 2016.

[32] W. Heinzelman, A. Chandrakasan, H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, 1(4): 660-670, 2002.

[33] H. Zheng, J. Li, X. Feng, W. Guo, Z. Chen, N. Xiong, “Spatial-temporal data collection with compressive sensing in mobile sensor networks,” Sensors, 17(11): 1-22, 2017.

[34] W. Cai, M. Zhang, “Spatio-temporal correlation–based adaptive sampling algorithm for clustered wireless sensor networks,” International Journal of Distributed Sensor Networks, 14(8): 1-14, 2018.

[35] S. Chen, J. Liu, K. Wang, M. Wu, “A hierarchical adaptive spatio-temporal data compression scheme for wireless sensor networks,” Wireless Networks, 25(1): 429–438, 2019.

[36] S. Mehrjoo, F. Khunjush, “Accurate compressive data gathering in wireless sensor networks using weighted spatio-temporal compressive sensing,” Telecommunication Systems, 68(1): 79-88, 2018.

[37] Y. Zhou, L. Yang, L. Yang, M. Ni, “Novel energy-efficient data gathering scheme exploiting spatial-temporal correlation for wireless sensor networks,” Wireless Communications and Mobile Computing: 1-10, 2019.


LETTERS TO EDITOR

Journal of Electrical and Computer Engineering Innovations (JECEI) welcomes letters to the editor for the post-publication discussions and corrections which allows debate post publication on its site, through the Letters to Editor. Letters pertaining to manuscript published in JECEI should be sent to the editorial office of JECEI within three months of either online publication or before printed publication, except for critiques of original research. Following points are to be considering before sending the letters (comments) to the editor.


[1] Letters that include statements of statistics, facts, research, or theories should include appropriate references, although more than three are discouraged.

[2] Letters that are personal attacks on an author rather than thoughtful criticism of the author’s ideas will not be considered for publication.

[3] Letters can be no more than 300 words in length.

[4] Letter writers should include a statement at the beginning of the letter stating that it is being submitted either for publication or not.

[5] Anonymous letters will not be considered.

[6] Letter writers must include their city and state of residence or work.

[7] Letters will be edited for clarity and length.

CAPTCHA Image