New methods of routing for the reduction of energy consumption in wireless sensor network

Publish Year: 1394
نوع سند: مقاله ژورنالی
زبان: English
View: 74

This Paper With 17 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_SJR-4-10_002

تاریخ نمایه سازی: 7 اسفند 1402

Abstract:

Wireless sensor network consist of some nodes. Each node is responsible for gathering environment data and sending it to BS in order for received data to be analyzed. One of the main problems of this kind of network is the little primary energy of nodes and the little space of node memories. Each time data is sensed, node energy is reduced. Continuation of this situation results in the reduction of network lifetime or death. Suitable methods are presented for data transfer from nodes to BS. These methods have been able to optimize energy consumption in comparison with similar previous methods. One of the methods of acceptable optimization of energy consumption and network lifetime is the use of genetic algorithm in the network process of routing. Each method makes to using of different parameters that these parameters have created strengths and weaknesses. In this research, we present useful solutions for the reduction of energy consumption in network by the use of genetic algorithm. The main idea is to consider the methods proposed in recent years. The simulation results of creditable essays have been used to show the strong and weak parts of presented methods. Then, optimization solutions have been proposed by the use of simulation results and the weaknesses of existing methods.Wireless sensor network consist of some nodes. Each node is responsible for gathering environment data and sending it to BS in order for received data to be analyzed. One of the main problems of this kind of network is the little primary energy of nodes and the little space of node memories. Each time data is sensed, node energy is reduced. Continuation of this situation results in the reduction of network lifetime or death. Suitable methods are presented for data transfer from nodes to BS. These methods have been able to optimize energy consumption in comparison with similar previous methods. One of the methods of acceptable optimization of energy consumption and network lifetime is the use of genetic algorithm in the network process of routing. Each method makes to using of different parameters that these parameters have created strengths and weaknesses. In this research, we present useful solutions for the reduction of energy consumption in network by the use of genetic algorithm. The main idea is to consider the methods proposed in recent years. The simulation results of creditable essays have been used to show the strong and weak parts of presented methods. Then, optimization solutions have been proposed by the use of simulation results and the weaknesses of existing methods.

Authors

A.A. Baradaran

Member of Department of Computer Science, Payame Noor University, Kashan, Iran

H. Qamsarizadeh

Student of Department of Computer Science, Azad University (Kashan branch), Kashan, Iran

H. Heidari

Student of Department of Computer Science, Azad University (Kashan branch), Kashan, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • Abbasi, A., Younis, M., 2007. A survey on clustering algorithms ...
  • Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E., 2002. Wireless ...
  • Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E., 2002. Wireless ...
  • Aldosari, S.A., Moura, J.M.F., 2004. Fusion in sensor networks with ...
  • Ataul, B., Shamsul, W., Arunita, J., Subir, B., 2009. A ...
  • Bajaber, F., Awan, I., Adaptive decentralized re-clustering protocol for wireless ...
  • Bari, A., Wazed, S., Jaekel, A., Bandyopadhyay, S., 2009. A ...
  • Bay, H., Ess, A., Tuytelaars, T., Gool, L.V., Speeded-up robust ...
  • Cardei, M., Du, D.Z., 2005. Improving wireless sensor network lifetime ...
  • Chen, J., Chao, X., Xiao, Y., Sun, Y., 2008. Simulated ...
  • Czarlinska, A., Luh, W., Kundur, D., 2007. Attacks on sensing ...
  • Czarlinska, A., Luh, W., Kundur, D., 2008. On privacy and ...
  • Delavar, A.G., Baradaran, A.A., CRCWSN: Presenting a routing algorithm by ...
  • Enan, A.K., Bara’a, A.A., 2011. Energy-aware evolutionary routing protocol for ...
  • Guvensan, M.A., Yavuz, A.G., 2011. On coverage issues in directional ...
  • Hai-Yan, S., Wan-Liang, W., Ngai-Ming, Kwok., Sheng-Yong, Chen., 2012. Game ...
  • Havet, L., Guenard, A., Simonot-Lion, Samovar, F., 2010. An evaluation ...
  • Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H., 2000. Energy efficient communication ...
  • Hoang, D.C., Yadav, P., Kumar, R., Panda, S.K., 2010. A ...
  • Hussain, S., Matin, A.W., 2006. Base station assisted hierarchical clusterbased ...
  • Jiliang, Z., Qiying, C., Caixia, L., Runcai, H., 2010. A ...
  • Kazemeyni, F., Johnsen, E., Owe, O., Balasingham, I., 2011. Group ...
  • Koltsidas, G., Pavlidou, F., 2011. A game theoretical approach to ...
  • Konstantinos, P.F., Theodore, A.T., 2010. A memetic algorithm for optimal ...
  • Li, H., Lai, L., Qiu, R.C., 2011. A denial-of-service jamming ...
  • Liang, C.K., He, M.C., Tsai, C.H.,2010. Movement assisted sensor deployment ...
  • Meghanathan, N., Skelton, G.W., 2007. Intelligent transport route planning using ...
  • Pandremmenou, K., Kondi, L., Parsopoulos, K., 2011. Optimal power allocation ...
  • Sajid, H., Abdul, W., Matin, Obidul, I., Genetic algorithm for ...
  • Salman, Y., Rina, A.R., Ong, H.S., 2009 . A parallel ...
  • Yang, Y., Li, D., Chen, H., 2010. Coverage quality based ...
  • نمایش کامل مراجع