EBONC: يک روش جديد خوشه‌بندي آگاه از انرژي، مبتني بر تعداد خوشه بهينه براي شبکه حسگر بي‌سيم متحرک
محورهای موضوعی : مهندسی برق و کامپیوترنسیم نوروزی 1 , هادی طباطبایی ملاذی 2 , محمود فضلعلی 3
1 - وزارت ارتباطات و فناوری اطلاعات
2 - دانشگاه شهید بهشتی
3 - دانشگاه شهید بهشتی
کلید واژه: شبکه حسگر بي‌سيم متحرک خوشه‌بندي انتخاب سرخوشه, الگوريتم شايعه‌پراکني,
چکیده مقاله :
محدوديت انرژي يکي از چالش‌هاي اساسی در شبکه‌هاي حسگر بي‌سيم است که طول عمر شبکه را به صورت مستقيم تحت تأثير قرار مي‌دهد. يک راه حل بهبود کارايي عمومي شبکه و توزيع يکنواخت انرژي در آن، خوشه‌بندي گره‌های شبکه است. انتخاب تعداد خوشه‌ها براي رسيدن به يک گذردهي کارای شبکه کاري بس دشوار است زيرا با افزايش تعداد سرخوشه‌ها، براي رسيدن بسته از مبدأ به مقصد، تعداد پرش‌هاي زيادي مي‌بايست صورت گيرد. افزايش تعداد پرش‌ها باعث پردازش بیشتر اطلاعات و افزایش مصرف انرژي مي‌گردد. اين مقاله، يک روش خوشه‌بندي را با آگاهي از مكان و انرژي گره‌ها ارائه مي‌نمايد که سعي در تشكيل خوشه‌هايي با اندازه بهینه و انتخاب سرخوشه بر اساس سطح انرژي گره‌ها به منظور كاهش مصرف انرژي دارد. روش پيشنهادي محيط شبكه را به دواير متحدالمركزي تقسيم کرده و تعداد خوشه بهينه هر دور را به نحوي که مصرف انرژي شبکه بهبود يابد محاسبه می‌کند. در همين رأستا از الگوريتم شايعه‌پراکني به منظور تبادل انرژي بين گره‌ها استفاده مي‌نمايد. كارايي بهتر اين روش از لحاظ افزايش طول عمر مفيد شبكه در مقايسه با روش‌هاي پيشين نظير ASH از طريق شبيه‌سازي بررسی شده است. روش پيشنهادي از نظر طول عمر شبكه در حدود 25% تا 40% روش ASH را بهبود بخشيده است.
The energy constraint is one of the key challenges in wireless sensor networks that directly affects the network lifetime. Clustering the sensor nodes is one of the possible approaches to improving the energy efficiency by uniformly distributing the energy consumption among the nodes. The number of appropriate clusters plays an important role in the network throughput. A Large number of clusters imply that packets pass more hops to reach the destination, which results in higher energy consumption. In this paper, we devise an energy and location aware clustering scheme that tries to optimize the number of required clusters. Moreover, the cluster heads are chosen according to their energy levels. The devised scheme partitions the network into concentric circles and calculates the appropriate number of clusters to provide an energy efficient network. A gossiping approach is used to provide information exchange mechanism. The performance of the devised approach is compared with ASH scheme. The simulation results show the network lifetime is improved from 25% to 40% in difference network scenarios.
[1] J. Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," Computer Networks, vol. 52, no. 12, pp. 2292-2330, Aug. 2008.
[2] J. Zheng and A. Jamalipour, Wireless Sensor Networks: A Networking Perspective, John Wiley & Sons, 2009.
[3] J. Y. Yu and P. H. J. Chong, "A survey of clustering schemes for mobile ad hoc networks," Communications Surveys & Tutorials, IEEE, vol. 7, no. 1, pp. 32-48, First Quarter. 2005.
[4] Y. Chen, A. Liestman, and J. Liu, "Clustering algorithms for ad hoc wireless networks," in Ad Hoc and Sensor Networks, eds. Y. Pan and Y. Xiao, ch.4, Nova Science Publishers, 2004.
[5] V. Katiyar, N. Chand, and S. Soni, "Clustering algorithms for heterogeneous wireless sensor network: a survey," International J. of Applied Engineering Research, vol. 1, no. 2, pp. 273-287, 2010.
[6] Y. Yan, N. H. Tran, and F. S. Bao, "Gossiping along the path: a direction-biased routing scheme for wireless ad hoc networks," in Proc. IEEE Global Communications Conf., GLOBECOM'11, 6 pp., Dec. 2015.
[7] R. Agarwal and M. Motwani, "Survey of clustering algorithms for MANET," International J. on Computer Science and Engineering, vol. 1, no. 2, pp. 98-104, 2009.
[8] A. Pruteanu and S. Dulman, "ASH: tackling node mobility in large-scale networks," Computing, vol. 94, no. 8-10, pp. 811-832, Sept. 2012.
[9] S. Chinara and S. K. Rath, "A survey on one-hop clustering algorithms in mobile ad hoc networks," J. of Network and Systems Management, vol. 17, no. 1-2, pp. 183-207, Jun. 2009.
[10] A. A. Abbasi and M. Younis, "A survey on clustering algorithms for wireless sensor networks," Computer Communications, vol. 30, no. 14, pp. 2826-2841, Oct. 2007.
[11] S. S. Basurra, et al., "Energy efficient zone based routing protocol for MANETs," Ad Hoc Networks, vol. 25, issue PA, pp. 16-37, Feb. 2015.
[12] J. Y. Yu and P. H. Chong, "3hbac (3-hop between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks," in IEEE Pacific Rim Conf. on Communications, Computers and signal Processing, PACRIM, vol. 1, pp. 318-321, Aug. 2003.
[13] C. R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE J. on Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
[14] T. J. Kwon and M. Gerla, "Efficient flooding with passive clustering (PC) in ad hoc networks," ACM SIGCOMM Computer Communication Review, vol. 32, no. 1, pp. 44-56, Jan. 2002.
[15] J. H. Ryu, S. Song, and D. H. Cho, "Clustering scheme for energy conservation in two-tiered mobile ad hoc networks," Electronics Letters, vol. 37, no. 11, pp. 700-701, May 2001.
[16] T. Ohta, S. Inoue, and Y. Kakuda, "An adaptive multihop clustering scheme for highly mobile ad hoc networks," in Proc. 6th Int.l Symp. on Autonomous Decentralized Systems, ISADS'03, pp. 293-300, Apr. 2003.
[17] A. D. Amis and R. Prakash, "Load-balancing clusters in wireless ad hoc networks," in Proc. 3rd IEEE Symp. on Application-Specific Systems and Software Engineering Technology, pp. 25-32, 24-25 Mar. 2000.
[18] P. Basu, N. Khan, and T. D. Little, "A mobility based metric for clustering in mobile ad hoc networks," in Proc. Int. Conf. on, Distributed Computing Systems Workshop, pp. 413-418, Apr. 2001.
[19] D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. 44th Annual IEEE Symp. on Foundations of Computer Science, pp. 482-491, Oct. 2003.
[20] F. Bai and A. Helmy, "A survey of mobility models in wireless ad hoc networks," to appear on book wireless ad hoc and sensor networks.
[21] V. Vasanthi, M. Romenkumar, N. Ajithsingh, and M. Hemalatha, "A detailed study of mobility models in wireless sensor networks," J. of Theoretical and Applied Information Technology, vol. 33, no. 1, pp. 7-14, Nov. 2001.
[22] T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Communications and Mobile Computing, vol. 2, no. 5, pp. 483-502, Aug. 2002.
[23] T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Communications and Mobile Computing, vol. 2, no. 5, pp. 483-502, Aug. 2002.
[24] K. E. Kannammal and T. Purusothaman, "Performance of improved directed diffusion protocol for sensor networks under different mobility models," J. of Computer Science, vol. 8, no. 5, pp. 694-700, 2012.
[25] R. A. Pushpa, A. Vallimayil, and V. S. Dhulipala, "Impact of mobility models on mobile sensor networks," in Proc. 3rd Int. Conf. on Electronics Computer Technology, ICECT'11, vol. 4, pp. 102-106, Apr. 2011.
[26] A. S. Raghuvanshi, S. Tiwari, R. Tripathi, and N. Kishor, "Optimal number of clusters in wireless sensor networks: a FCM approach," International J. of Sensor Networks, vol. 12, no. 1, pp. 16-24, Jul. 2012.S [27] J. A. Jiang, et al., "CoCMA: energy-efficient coverage control in cluster-based wireless sensor networks using a memetic algorithm," Sensors, vol. 9, no. 6, pp. 4918-4940, 2009.
[28] K. Fall and K. Varadhan, The ns Manual (formerly ns Notes and Documentation), the VINT Project, 47, 2005.
[29] N. Aschenbruck, R. Ernst, E. Gerhards-Padilla, and M. Schwamborn, "BonnMotion: a mobility scenario generation and analysis tool," in Proc. of the 3rd Int. ICST Conf. on Simulation Tools and Techniques, ICST'10, Article No. 51, Mar. 2010.
[30] A. Kumar, Design of Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks, Doctoral dissertation, National Institute of Technology Rourkela, 2012.
