Impact of Sink Node Placement onto Wireless Sensor Networks Performance Regarding Clustering Routing and Compressive Sensing Theory

Subject Areas : Renewable energy

Shima Pakdaman Tirani ¹ , Avid Avokh ²

1 - MSc Student - Department of Electrical Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Isfahan, Iran
2 - Assistant Professor - Department of Electrical Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Isfahan, Iran

Received: 2015-10-19 Accepted : 2016-01-12 Published : 2016-04-20

Keywords: خوشه بندی, شبکه های حسگر بی سیم, نمونه برداری فشرده, محل گره چاهک, تعداد ارسال ها,

Abstract :

Wireless Sensor Networks (WSNs) consist of several sensor nodes with sensing, computation, and wireless communication capabilities. The energy constraint is one of the most important issues in these networks. Thus, the data-gathering process should be carefully designed to conserve the energy. In this situation, a load-balancing strategy can enhance the resources utilization, and consequently, increase the network lifetime. Furthermore, recently, the sparse nature of data in WSNs has been motivated the use of the compressive sensing as an efficient data gathering technique. Using the compressive sensing theory significantly leads to decreasing the volume of the transmitted data. Taking the above challenges into account, the main goal of this paper is to jointly consider the compressive sensing method and the load-balancing in WSNs. In this regards, using the conventional network model, we analyze the network performance in several different states. These states challange the sink location in term of the number of transmissions. Numerical results demonstrate the efficiency of the load-balancing in the network performance.

References:

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, “Wireless sensor networks: A survey”, Computer Networks, Vol. 38, No. 4, pp. 393-422, Mar. 2002.

[2] D. Ebrahimi, C. Assi, “Compressive data gathering using random projection for energy efficient wireless sensor networks”, Ad Hoc Networks, Vol. 16, pp. 105-119, May 2014.

[3] M. Balouchestani, K. Raahemifar, S. Krishnan, “Compressed sensing in wireless sensor networks: Survey”, Canadian Journal, Vol. 2, No. 1, pp. 1-4, Feb. 2011.

[4] S. Qaisar, R. Bilal, W. Iqbal, M. Naureen, S. Lee, “Compressive sensing: from theory to applications, A survey”, Communications and Networks, Vol. 15, No. 5, pp. 443-456, Oct. 2013.

[5] X. Wu, Y. Xiong, W. Huang, H. Shen, M. Li, “An efficient compressive data gathering routing scheme for large-scale wireless sensor networks”, Computers and Electrical Engineering, Vol. 39, No. 6, pp. 1935-1946, Aug. 2013.

[6] J. Haupt, W.U. Bajwa, M. Rabbat, R. Nowak, “Compressed sensing for networked data”, IEEE Signal Processing Magazine, Vol. 25, No. 2, pp. 92-101, Mar 2008.

[7] C. Luo, F. Wu, J. Sun, C. W. Chen, “Compressive data gathering for large-scale wireless sensor networks”, Proceeding of the Annual International Conference on Mobile Computing and Networking, pp. 145-156, Sep. 2009.

[8] C. Luo, F. Wu, J. Sun, C.W. Chen, “Efficient measurement generation and pervasive sparsity for compressive data gathering”, IEEE Trans. Wireless Commun., Vol. 9, No. 12, pp. 3728–3738, Dec. 2010.

[9] J. Wang, S. Tang, B. Yin, X.Y. Li, “Data gathering in wireless sensor networks through intelligent compressive sensing ”, Proceeding of the IEEE/INFOCOM, pp. 603-611, March 2012.

[10] X. Wu, Y. Xiong, P. Yang, S. Wan, W. Huang, “Sparsest random scheduling for compressive data gathering in wireless sensor networks”, IEEE Trans. on Wireless Communications, Vol. 13, No. 10, pp. 5867-5877, Oct. 2014.

[11] G. Yang, M. Xiao, S. Zhang, “Data aggregation scheme based on compressed sensing in wireless sensor network”, Information Computing and Applications, ed: Springer, pp. 556-561, Sep 2012.

[12] J. Cheng, Q. Ye, H. Jiang, D. Wang, C. Wang, “STCDG:an efficient data gathering algorithm based on matrix completion for wireless sensor networks,” IEEE Trans. Wireless Commun., Vol. 12, No. 2, pp. 850-861, Feb. 2013.

[13] H. Zheng, S. Xiao, X. Wang, X. Tian, “On the capacity and delay of data gathering with compesive sensing in wireless sensor networks”, Proceeding of the IEEE/GLOBECOM, pp. 1-5, Dec. 2011.

[14] H. Zheng, S. Xiao, X. Wang, X. Tian, M. Guizani, “Capacity and delay analysis for data gathering with compressive sensing in wireless sensor networks”,  IEEE Trans. Wireless Commun., Vol. 12, No. 2, pp. 917-926, Feb. 2013.

[15] J. Luo, L. Xiang, C. Rosenberg, “Does compressed sensing improve the throughput of wireless sensor networks?” Proceeding of the ICC, pp. 1–6, May 2010.

[16] L. Xiang, J. Luo, A. Vasilakos, “Compressed data aggregation for energy efficient wireless sensor networks”, Proceeding of the IEEE/SECON, pp. 46–54, Jun. 2011.

[17] F. Fazel, M. Fazel, M. Stojanovic, “Random access compressed sensing for energy-efficient underwater sensor networks,” IEEE Journal on Selected Areas in Communications, Vol. 29, No. 8, pp. 1660–1670, Sep. 2011.

[18] R. Xie X. Jia, “Transmission-efficient clustering method for wireless sensor networks using compressive sensing,” IEEE Trans. on Parallel and Distributed Systems, Vol. 25, No. 3, pp. 806-815, Mar. 2014.

[19] W. Heinzelman, A. Chandrakasan, H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks”, Proceeding of the IEEE/HICSS, pp. 1-10, Jan. 2000.

[20] E. Candes, M. Wakin, “An introduction to compressive sampling”, Signal Processing Magazine, Vol. 25, No. 2, pp. 21-30, Mar 2008.

[21] 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 Trans. on Parallel and Distributed Systems, Vol. 26, No. 1, pp. 1-10, Feb. 2014.

[22] D. Donoho, “Compressed sensing”, IEEE Trans. on Information Theory, Vol. 52, No. 4, pp. 4036–4048, April 2006.

[23] M. Emre Keskin, I. Kuban Altlnel, N. Aras, C. Ersoy, “Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility”, Ad Hoc Networks, Vol. 17, pp. 18-36, Jun.  2014.