الگوریتم WCDG: یک روش جدید برای کاهش مصرف انرژی، افزایش تعادل بار بین گره‌ها و طول عمر در شبکه‌های حسگر بی‌سیم
محورهای موضوعی : مهندسی برق و کامپیوترسمانه عباسی دره‌ساری 1 * , جمشید ابویی 2
1 - دانشگاه یزد
2 - دانشگاه یزد
کلید واژه: شبکه‌های حسگر بی‌سیم نمونه‌برداری فشرده اندازه‌گیری تصادفی تنک تجمیع داده درخت‌های مسیریابی وزن‌دار,
چکیده مقاله :
امروزه شبکه‌های حسگر بی‌سیم به طور گسترده در سیستم‌های نظارتی مورد استفاده قرار می‌گیرند. عمده‌ترین چالش در طراحی این شبکه‌ها، به حداقل رساندن هزینه انتقال داده است. تجمیع داده با استفاده از نظریه نمونه‌برداری فشرده، روشی مؤثر برای کاهش هزینه ارتباطات در گره چاهک می‌باشد. روش‌های تجمیع داده موجود که بر مبنای نمونه‌برداری فشرده عمل می‌کنند، برای هر نمونه اندازه‌گیری نیاز به شرکت تعداد زیادی از گره‌های حسگر دارند که منجر به ناکارآمدی در مصرف انرژی می‌شود. به منظور رفع این مشکل، در این مقاله از اندازه‌گیری‌های تصادفی تنک استفاده می‌‌گردد. از طرفی، تشکیل درخت‌های مسیریابی با هزینه کمتر و توزیع عادلانه بار در سطح شبکه، میزان مصرف انرژی را به طور قابل ملاحظه‌ای کاهش می‌دهند. در این راستا الگوریتم جدیدی با عنوان WCDG ارائه می‌شود که با ایجاد درخت‌های مسیریابی وزن‌دار و بهره‌گیری توأم از نمونه‌برداری فشرده، داده‌های گره‌های هر مسیر را تجمیع و برای گره چاهک ارسال می‌کند. در الگوریتم WCDG با در نظر گرفتن قابلیت کنترل توان در گره‌های حسگر، مسیرهای کارآمدی انتخاب می‌شوند. نتایج شبیه‌سازی‌ها حاکی از آن است که روش پیشنهادی در مقایسه با سایر روش‌ها به طور قابل توجهی عملکرد بهتری از نظر میزان مصرف انرژی و تعادل بار در شبکه دارد.
Wireless senor networks (WSNs) are widely used for the monitoring purposes. One of the most challenges in designing these networks is minimizing the data transmission cost with accurate data recovery. Data aggregation using the theory of compressive sampling is an effective way to reduce the cost of communication in the sink node. The existing data aggregation methods based on compressive sampling require to a large number of nodes for each measurement sample leading to inefficient energy consumption in wireless sensor network. To solve this problem, we propose a new scheme by using sparse random measurement matrix. In this scheme, the formation of routing trees with low cost and fair distribution of load on the network significantly reduces energy consumption. Toward this goal, a new algorithm called “weighted compressive data gathering (WCDG)” is suggested in which by creating weighted routing trees and using the compressive sampling, the data belong to all of nodes of each path is aggregated and then, sent to the sink node. Considering the power control ability in sensor nodes, efficient paths are selected in this algorithm. Numerical results demonstrate the efficiency of the proposed algorithm with compared to the conventional data aggregation schemes in terms of energy consumption, load balancing, and network lifetime.
[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.
[2] J. P. Amaro, F. J. T. E. Ferreira, R. Cortesao, N. Vinagre, and R. P. Bras, "Low cost wireless sensor network for in-field operation monitoring of induction motors," in Proc. IEEE Int. Conf. on Industrial Technology, ICIT'10, pp. 1044-1049, Mar. 2010.
[3] E. Candes and M. Wakin, "An introduction to compressive sampling," Signal Processing Magazine, vol. 25, no. 2, pp. 21-30, Mar. 2008.
[4] D. Donoho, "Compressed sensing," IEEE Trans. on Information Theory, vol. 52, no. 4, pp. 4036-4048, Apr. 2006.
[5] J. Haupt, W. U. Bajwa, M. Rabbat, and R. Nowak, "Compressed sensing for networked data," Signal Processing Magazine, IEEE, vol. 25, no. 2, pp. 92-101, Mar. 2008.
[6] C. Luo, F. Wu, J. Sun, and C. W. Chen, "Compressive data gathering for large-scale wireless sensor networks," in Proc. the 15th Annual Int. Conf. on Mobile Computing and Networking, pp. 145-156, Sep. 2009.
[7] C. Luo, F. Wu, J. Sun, and C. W. Chen, "Efficient measurement generation and pervasive sparsity for compressive data gathering," IEEE Trans. on Wireless Communications, vol. 9, no. 12, pp. 3728-3738, Dec. 2010.
[8] J. Luo, L. Xiang, and C. Rosenberg, "Does compressed sensing improve the throughput of wireless sensor networks?," in Proc. 2010 IEEE Int. Conf. on Communications, ICC'10, 6 pp., May 2010.
[9] J. Wang, S. Tang, B. Yin, and X. Y. Li, "Data gathering in wireless sensor networks through intelligent compressive sensing," in Proc. 31st Annual IEEE Int. Conf. on Computer Communications, INFOCOM'12, pp. 603-611. Mar. 2012.
[10] X. Wu, Y. Xiong, P. Yang, S. Wan, and 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, and S. Zhang, "Data aggregation scheme based on compressed sensing in wireless sensor network," in Information Computing and Applications, vol. 307, pp. 556-561, 2012.
[12] G. Shen, et al., "Novel distributed wavelet transforms and routing algorithms for efficient data gathering in sensor webs," in Proc. NASA Earth Science Technology Conf., ESTC'08, 8 pp., Jun. 2008.
[13] G. Quer, R. Masiero, D. Munaretto, M. Rossi, J. Widmer, and M. Zorzi, "On the interplay between routing and signal representation for compressive sensing in wireless sensor networks," in Proc. Information Theory and Applications Workshop, pp. 206-215, Feb. 2009.
[14] S. Lee, S. Pattem, M. Sathiamoorthy, B. Krishnamachari, and A. Ortega, "Spatially-localized compressed sensing and routing in multi-hop sensor networks," in Proc. Geosensor Networks Springer Berlin Heidelberg, vol. 5659, pp. 11-20, Jul. 2009.
[15] W. Wang, M. Garofalakis, and K. Ramchandran, "Distributed sparse random projections for refinable approximation," in Proc. the 6th Int. Conf. on Information Processing in Sensor Networks, vol. ???, pp. 331-339, Apr. 2007.
[16] S. Lee, S. Pattem, M. Sathiamoorthy, B. Krishnamachari, and A. Ortega, "Compressed sensing and routing in multi-hop networks," University of Southern California CENG, Technical Report, 2009.
[17] X. Wang, Z. Zhao, Y. Xia, and H. Zhang, "Compressed sensing for efficient random routing in multi-hop wireless sensor networks," International J. of Communication Networks and Distributed Systems, vol. 7, no. 3, pp. 275-292, Dec. 2011.
[18] M. T. Nguyen, and K. A. Teague, "Tree-based energy-efficient data gathering in wireless sensor networks deploying compressive sensing," in Proc. the 23rd Wireless and Optical Communication Conf., WOCC'14, 6 pp., May 2014.
[19] D. Ebrahimi and C. Assi, "Compressive data gathering using random projection for energy efficient wireless sensor networks," Ad Hoc Networks, vol. 16, pp. 105-119, May 2014.
[20] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. the 33rd Hawaii Int. Conf. on System Sciences, vol. 8, 10 pp., Jan. 2000.
[21] E. J. Candes and T. Tao, "Near-optimal signal recovery from random projections: universal encoding strategies?," IEEE Trans. on Information Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
[22] E. W. Dijkstra, "A note on two problems in connexion with graphs," in Proc. Numerische Mathematik 1, vol. 1, no. 1, pp. 269-271, Dec. 1959.