Examining suitable solutions to optimize energy consumption in wireless sensor networks using memetic algorithm

Number of pages: 92 File Format: word File Code: 30903
Year: 2016 University Degree: Master's degree Category: Electronic Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Examining suitable solutions to optimize energy consumption in wireless sensor networks using memetic algorithm

    Dissertation for master's degree

    Trend: Power Electronics

    Abstract

     

    One of the important design challenges in wireless sensor networks (WSN) is to prolong the lifetime of the system (node), while achieving an acceptable quality of service for the applications. Extending the life of the node is directly related to reducing energy consumption. In WSN, each sensor node works with battery power, and in most cases, especially in remote and hostile environments, it is not easy to recharge and replace. Due to the limited capabilities of sensor nodes, it is usually desirable that the WSN should be expanded with high density and therefore redundancy can be used to increase and optimize the network lifetime. In this thesis, we first examine the researched patterns with the aim of increasing the lifetime of wireless sensor networks, then we present an effective algorithm for lifetime optimization and self-stabilization to enhance the lifetime of wireless sensor networks. Our algorithm seeks to create resistance by maintaining the necessary set of operating nodes and replacing damaged nodes if needed. We present some theoretical and simulation results that fully demonstrate the usefulness of the proposed algorithm. Keywords: lifetime optimization, sensor networks, self-stabilizing reliability algorithm, Weibel distribution A wireless sensor network [1] (WSN) consists of a large number of sensor nodes that are densely distributed around the desired physical phenomenon. These networks provide at least the computational possibility and some sensory tools to sense parameters such as temperature, light, vibration, sound, radiation, humidity, etc. have  The evaluation parameters of wireless sensor networks (WSN) are:

    Lifetime

    Coverage range

    Cost and ease of use

    Response time: real-time applications

    Accuracy: environmental applications

    Security

    Effective sampling rate

    Despite the numerous capabilities these nodes have, but because their energy is powered by batteries. provided with limited power, their lifespan will be limited. In fact, the energy limitation of the nodes and the lifetime of the network is one of the important challenges on the way of these networks. Among the various factors of energy consumption, data routing is considered one of the most important factors. In this thesis, relying on the topic of reducing energy consumption and increasing the lifespan of wireless sensor networks, we explain and examine these challenges.

    1-2- Statement of the problem

    In recent years, the advancement of telecommunication technology and the industry of small electrical and electronic components has led to the construction of small and relatively cheap sensors that are connected to each other through a wireless network. These networks, which are called wireless sensor networks, have become a suitable tool for extracting data from the surrounding environment and monitoring environmental events, and their applications in domestic, industrial and military fields are increasing day by day. Wireless sensor networks are a collection of small sensor nodes that have the ability to monitor and sense their surroundings and send the sensed data to a main station.  The limited energy available in the nodes is the basic challenge of sensor networks, which affects the survival of the network. On the other hand, due to the presence of a large number of sensors in the network or the impossibility of accessing them, replacing or charging the sensors' batteries is not practical. For this reason, providing methods for optimal energy consumption that will ultimately increase the life of the network is strongly felt. Previous researches have shown that by organizing network nodes in clusters, it is possible to increase the energy efficiency and increase the life of the network. In most researches, the time elapsed until the death of the first or last node of the network is called network life. 1-3- Importance and necessity of research Wireless sensor networks, which usually contain hundreds or even thousands of inexpensive sensor nodes, are an ideal solution for various monitoring and surveillance applications, including traffic control, health care, environmental monitoring, battlefield surveillance, etc.  Considering the limitations of sensor nodes in terms of energy resources, the unattended expansion of sensor nodes in the operational environment, as well as the nature of applications of wireless sensor networks, establishing security in these networks is an important and at the same time difficult issue. Because the maintenance of sensor nodes is closely related to their lifetime and the lifetime of sensor networks is usually short, and the reason for this is the limitation.Since the care of sensor nodes has a close relationship with their lifespan and the lifespan of sensor networks is usually short and the reason is the limitation of power supply energy, providing suitable structural models and providing management methods and power-aware algorithms with the aim of increasing the lifespan of sensor networks are among the important research topics.  In this thesis, we will examine these solutions and appropriate algorithms. 1-4- Research goals This research was formed in order to achieve the following goals: 1-4-1- Main goal: Identifying and reviewing effective solutions to optimize energy consumption using the memetic algorithm. 1-4-2- Sub-goals: 1- Identifying the solution effective ways to increase the network lifetime as a result of balancing energy consumption. 2- Examining the importance of optimal energy consumption in wireless sensor networks. 1-5 research questions 1-5-1- Main question How is it possible to optimize energy consumption using the memetic algorithm? 1-5-2 Sub-questions 1- The most effective result of balancing energy consumption What is in a wireless network?

    2- How does congestion control increase the lifespan of a wireless sensor network?

    1-6- Research assumptions

    1-6-1- The main hypothesis

    Congestion control in the network will result in a balance in energy consumption, in which case we will see an increase in network lifetime and optimization of energy consumption.

    1-6-2- Assumptions Secondary

    1- Creating a balance in energy consumption leads to longer network life.

    2- Congestion control in wireless sensor networks by reducing energy consumption increases the life of wireless sensor networks.

    1-7- Definitions of terms

    1-7-1- Definition of network life

    The time elapsed until the first death or the last node of the network is called network life. .

    1-7-2-Definition of memetic algorithm

    Memetic algorithm is a search strategy among a set of optimizing factors that are competitively or cooperatively placed together. In memetic algorithm, we have a set of solutions to solve the problem. In computer networks, when there are many packets in a part of the subnet, the performance decreases. This situation is called crowding. 1-8- Research plan and data analysis method Considering that the purpose of the research is to investigate effective methods to optimize energy consumption using the memetic algorithm, it is a field study and a review of related articles in this field. For this purpose, various sites such as Elsevier and Springer are searched. Since this research is based on the issue of minimizing energy consumption for data analysis The software of this article has been used.

    The history of wireless sensor networks

    The beginning of research in this field goes back to around 1980 when the Defense Advanced Research Projects Agency (DARPA) [2] was working on the Distributed Wireless Networks (DSN) program [3], that is, when ARPANET (a network before the Internet) with an area of ??about 200 hosts was working in universities and scientific centers. DSNs are sensor nodes that are geographically dispersed but interact and cooperate with each other. In addition, each one is autonomous and self-governing, and these networks route information to the node that has the best ability to use this information. Generally, the components used in a DSN are sensors (audio, etc.), communication, processing techniques, and distributed algorithms and software. Melon University researchers developed a communication-oriented operating system called Accent. presented that with flexibility and transparent access to distributed resources, a DSN with error florence capability could be prepared. One of the implemented applications of DSN developed by the Massachusetts Institute of Technology was a helicopter tracking system that used a number of acoustic microphones followed by signal matching and interception techniques. But in line with the initial research on sensor networks, especially DSNs, the technology was not yet fully ready, for example, the sensors were relatively large (for example, a shoe box or larger), which reduced the application range of these networks.

  • Contents & References of Examining suitable solutions to optimize energy consumption in wireless sensor networks using memetic algorithm

    Index:

    Table of Contents

     

    Abstract. 1

    The first chapter of generalities. 2

    1-1- Introduction. 3

    1-2- statement of the problem. 4

    1-3- Importance and necessity of research. 4

    1-4- Research objectives. 5

    1-4-1- the main goal. 5

    1-4-2 - secondary objectives. 5

    1-5 research questions. 5

    1-5-1- The main question. 5

    1-5-2- Sub questions. 5

    1-6- research assumptions. 5

    1-6-1- The main hypothesis. 5

    1-6-2- Secondary assumptions. 6

    1-7- definitions of terms. 6

    1-7-1- Definition of network life. 6

    1-7-2- Definition of memetic algorithm. 6

    1-7-3- Definition of network congestion. 6

    1-8- Research plan and data analysis method 6

    The second chapter of literature and research background. 7

    2-1 History of wireless sensor networks. 8

    2-2- General characteristics of wireless sensor networks (WSN). 13

    2-2-1 communication structure of sensor networks. 14

    2-2-2 design factors. 14

    2-2-3 failure tolerance. 14

    2-2-4 expandability. 15

    2-2-5 production cost. 15

    2-3- hardware features. 15

    2-4 unique features of a wireless sensor network (WSN). 17

    2-5 applications of wireless sensor networks. 18

    2-5-1 Creating security. 18

    2-5-2 environment and living organisms. 19

    2-5-3 Industry. 19

    2-5-4 traffic control. 19

    2-6 Challenges of wireless sensor networks. 20

    2-7 concepts that can be discussed and researched in wireless sensor networks. 23

    2-7-1 Hardware bottlenecks. 23

    2-7-2 Topology. 23

    2-7-3 Reliability. 24

    2-7-4 Scalability. 24

    2-7-5 full price. 25

    2-7-6 Environmental conditions. 25

    2-7-7 Communication media. 25

    2-7-8 consumption power of nodes 25

    2-8 concept of routing in wireless sensor networks. 26

    2-9 Routing challenges in wireless sensor networks. 28

    Chapter 3 congestion control and proposed methods for routing in wireless sensor networks. 33

    3-1 Introduction. 34

    3-2 Congestion in the network. 34

    3-3 Congestion control. 35

    3-4 The difference between congestion control and flow control. 36

    3-5 general principles in flow control. 36

    3-6 congestion prevention policies. 37

    3-7 routing methods. 38

    3-7-1 Flood sending method 38

    3-7-2 clustering based methods. 41

    3-7-3 chain-based method. 46

    3-7-4 methods based on the residual energy of each node (aware of energy) 48

     

    Simulation chapter four. 51

    4-1 Introduction. 52

    4-2 basic principles and sensing model. 54

    4-3 proposed algorithm. 55

    4-4 Analysis of distribution of future lifetimes. 56

    4-5 Node wakeup rate. 58

    4-6 problem formulation. 60

    4-7 self-stabilizing algorithm. 61

    4-8 Self-Confirming Proofs. 61

    4-9 theoretical analysis: Analysis of message complexity. 62

    4-10 Reliability analysis. 65

    4-11 Brief description of PEAS and PCP protocols. 67

    4-11-1 PEAS algorithm. 67

    4-11-2 PCP algorithm. 68

    4-12 simulation results. 69

    Chapter 5 Conclusion. 76

    Conclusion. 77

    Resources. 78

    Abstract. 83

    Source:

    Computer Networks, Androas Tenen Baum, translated by Dr. Pedram.

    Information Technology Magazine, Smart Industry, Year 16/Numbers 2 and 3 consecutively 143 and 144/May and June 1992.

    Computer Highway Magazine, Number 132.

    Foreign sources

    [1] C. Y. Chong, S. P. Kumar, "Sensor Networks: Evolution, Opportunities,

    and Challenges," Proceedings of the IEEE Transaction on Computers, Vol.

    91, pp.23-27, May, 2003.

    [2] G. J. Pottie, W. J. Kaiser, "Wireless Integrated Sensor Networks,"

    Communications of the ACM, May 2000. An overview with more of a

    signal processing viewpoint.

    [3] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, "A Survey on Sensor Networks," IEEE Communications, Aug. 2002, pp.102-114.

    [4] I. F. Akyildiz, W. Su, Y. Sankarsabramaniam and E. Cayirci, "Wireless

    Sensor Networks: A Survey," Computer Networks, Vol. 38, pp.393-422,

    March 2002.

    [5] J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister, "System architecture directions for networked sensors," In Proceedings of the 9th International Conference on Architectural Support for Programming

    Languages ??and Operating Systems, November 2000.

    [6] J. N. Alkaraki and A.E. Kamal, "Routing Techniques in Wireless Sensor Networks: A Survey," IEEE Journal of Wireless Communications, vol. 11, no. 6, Dec. 2004, pp. 6-28.

    [7] D. Estrin, R. Govindan, J. Heidemann, and Satish Kumar, "Next Century Challenges: Scalable Coordination in Sensor Networks," In Proceedings of Mobicom'99, 1999.132

    [8] J. M. Kahn, R. H. Katz and K. S. J. Pister, "Next Century Challenges: Mobile Networking for Smart Dust," Proc. in the 5 th Annual ACM/IEEE

    International Conference on Mobile Computing and Networking (MobiCom 99), Aug. 1999, pp. 271-278.

    [9] D. Estrin, L.Girod, G. Pottie, and M. Srivastava, "Instrumenting the World with Wireless Sensor Networks," in International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2001), Salt Lake City, Utah, May 2001.

    [10] K. Akkaya, and M. Younis, "A Survey on Routing Protocols for Wireless Sensor Networks. Elsevier Adhoc Network Journal, 2005, 325-349.

    [11] J. N. Alkaraki, A. E. Kamal, "On the Correlated Data Gathering Problem in Wireless Sensor Networks," Proceedings of the 9th IEEE Symposium on Computers and Communications, Alexandria, Egypt, July 2004.

    [12] K. Sohraby, D. Minoli, T. Znati, "Wireless Sensor Networks: Technology, Protocols and Applications, " Published by WILEY INTERSCIENCE- 2007.

    [13] C. Schurgers, M. B. Srivastava, "Energy Efficient Routing in Wireless Sensor Networks," Proceedings of the IEEE Military Communications Conference (MilCom'01): Communications for Network-Centric

    Operations-Creating the Information Force, McLean, VA, Oct. 2001.

    [14] S. Hedetniemi, A. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," IEEE Networks, Vol. 18, No. 4, 1988, pp. 319-349.

    [15] W. Heinzelman, A. Chandrakasan, H. Balakrishnan, "Energy-Efficient Communication protocol for Wireless Microsensor Networks," Proceeding of the 33 rd Hawaii International Conference on System Sciences (HICSS'00), Maui, HI, Jan. 2000.

    [16] W. Heinzelman, J. Kulik, H. Balakrishnan, "Adaptive Protocols for Information Dissemination in Wireless Sensor Networks," Proceedings of the 5th ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'99), Seattle, WA, Aug. 1999, pp. 174-185.

    [17] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, Vol. 1, No. 4, October 2002.

    [18] M. Handy, M. Hasse, D. Timmermann, "Low Energy Adaptive Clustering Hierarchy with Deterministic ClusterHead Selection," IEEE MWCN, Stockholm, Sweden, Sep. 2002.

    [19] F. Xiangning, S. Yulin, "Improvement on LEACH protocol of Wireless Sensor Network," In Proceedings of IEEE International Conference on Sensor Technologies and Applications, pp. 260-264, October 2007.

    [20] S. Lindsey, C. Raghavendra, "PEGASIS: Power-Efficient Gathering in Sensor Information Systems," IEEE Aerospace Conference Proceedings, 2002, Vol. 3, No. 9-16, pp. 1125-1130.

    [21] D. Kofman Ravi Mazumdar, N. Shrof Vivek, P. Mhatre, Catherine Rosenberg, "A minimum cost heterogeneous sensor network with a lifetime constraint," IEEE Transactions on Mobile Computing, 04(1):4-15, Jan/Feb

    2005.

    [22] B. Banerjee, and S. Khuller, "A Clustering Scheme for Hierarchical Control in Multi-Hop Wireless Networks," Proc of INFOCOM, April 2001.

    [23] W. Heinzelman, A. Sinha, A. Wang, A.

Examining suitable solutions to optimize energy consumption in wireless sensor networks using memetic algorithm