Presenting a routing method for wireless sensor networks with the aim of increasing the lifetime of the network

Number of pages: 68 File Format: word File Code: 30502
Year: 2014 University Degree: Master's degree Category: Computer Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Presenting a routing method for wireless sensor networks with the aim of increasing the lifetime of the network

    Dissertation for Master's Degree in Computer Science

    Software Orientation

    Abstract

    The increasing use of wireless sensor networks in human life shows the great importance of this technology. Energy limitation in the constituent elements of wireless sensor networks, which are sensor nodes, has always been considered as the most important challenge facing this technology, and for this reason, most of the research conducted in the field of wireless sensor networks has been devoted to the issue of energy. Considering that the way of choosing routes to send information in wireless sensor networks has a significant effect on the energy consumption of the network, in this research, an attempt has been made to provide a solution in the field of routing with the aim of increasing the lifetime of the network. In this method, taking into account the energy consumption history of the sensor nodes, the number of neighbors of the sensor sending data, and the distance from the source to the destination of sending data (one step), a solution has been presented that can have a great effect on increasing the life of the circuit. Simulation and comparison with famous and successful methods of routing in wireless sensor networks show the merit of the proposed method.  

    Key words: wireless sensor networks, routing, PSO algorithm, network lifetime, energy limitation

    Chapter 1

    Introduction

    1 Introduction

    Wireless sensor networks consist of a number of sensor nodes, and usually the size of these nodes is small and they are cheap. All these nodes have the ability to receive information from their surroundings, they can also send or receive data received from the environment to the sensor nodes located in their neighborhood. In this type of networks, the radius of data transmission is limited, and nodes are also limited in terms of information processing and storage. Due to the limited energy of the nodes, most of the routing methods in this type of networks have been proposed with the aim of increasing the lifetime of the network. In this research, a new routing algorithm is introduced, the most important goal of which is to increase the life of the network.

    In most applications of wireless sensor networks, the way nodes are placed in the physical environment is random and does not have a specific and predetermined plan. After being placed in the environment, the nodes automatically form the network structure and for a limited period receive information from the surrounding environment and transfer it to the main station. The energy required to receive information from the environment and send information to other sensors is provided by the batteries embedded in the sensors. Therefore, the energy of these nodes is limited and in most applications, after the battery energy is exhausted, it is very difficult and usually impossible to recharge or replace it.

    Different applications of sensor networks have led to the production of many sensor nodes that are very different in terms of architecture, size, energy consumption and node coverage radius. Table 1-1 shows some of these sensor nodes and their applications [1].

     

    1-1 The necessity of the routing protocol problem and challenges

    Energy limitation has always been the most important challenge facing wireless sensor networks. Considering that a large part of the network energy is spent on sending the information obtained from the environment to the main station, using a suitable routing method can greatly increase the lifetime of the network. Providing a routing protocol for wireless sensor networks faces challenges that arise from the limitations of these networks. Also, these networks are limited in many network resources. For example: communication bandwidth [1], processor unit, storage unit and energy [2,3]. The most important challenges facing the design of routing protocols are [4,5,6]:

    1-1-1 Limited energy capacity

    Considering that sensor nodes take the necessary energy from batteries, therefore they have a limited capacity. When the energy of the node is less than a threshold value, that node will not be able to continue its activity and this will have a great negative impact on the network. Therefore, the energy limitation is the biggest challenge for providing a routing protocol. 1-1-2 Node Location Coordinates Another challenge in providing a routing protocol is node location management. A large number of routing protocols assume that each sensor is equipped with a global positioning system [2] or use positioning algorithms to find the location of the node [5].

    1-1-3 Limitation of hardware resources

    In addition to energy, sensor nodes are also limited in terms of storage and processing. Sensor nodes cannot perform complex and long calculations, and this is a challenge for software development in wireless sensor networks. Therefore, to provide a routing algorithm, in addition to energy, hardware limitations should also be considered.

    1-1-4 large number of nodes and random location in the environment

    Wireless sensor networks are completely dependent on the network application. In most applications, a large number of nodes are randomly placed in the physical environment, which has a significant impact on the efficiency of routing algorithms. 1-1-5 network characteristics (uncertainty of the physical environment) In wireless sensor networks, sensor nodes are placed in a dynamic and unreliable environment. The topology of the network is constantly changing, and these changes are caused by factors such as the end of node energy, physical damage to the node, or disconnection between nodes. A suitable routing protocol should be properly aligned with topology changes. 1-1-6 Data Redundancy Because there is a high data redundancy in wireless sensor networks and the same information may be obtained from different nodes, data consensus techniques can be used in some nodes. Data consensus can greatly reduce the number of information packets that are transmitted to the main station in the network, and therefore has a positive effect on the lifetime of the network. 1-1-7 Diversity of applications of wireless sensor networks Considering that these networks have different applications, it cannot be claimed that a routing protocol is optimal for all applications. Some applications, such as industrial processes or military industries, require fast response and low latency. Other applications, such as temperature and light measurement, are less sensitive, and in them, the lifetime of the network is a higher priority. Considering that in most applications, it is not cost-effective to implement a real wireless sensor network in order to test the performance of a routing protocol, that is why simulation software is used. In these simulators, the network of routing algorithms can be simulated according to its application in the real environment. In the fifth chapter, a number of simulation software for wireless sensor networks have been reviewed. 1-2 Characteristics of wireless sensor networks Energy limitation makes most of the routing protocols provided in other wireless networks not suitable for wireless sensor networks. For example, the flood transmission that is used in computer networks has a high cost for wireless sensor networks and significantly reduces the lifetime of the network [7]. Of course, to implement flood transmission in wireless sensor networks, an alternative method is used, which is known as the rumor method [8]. In this method, when a node wants to send data to another node, it randomly selects a small number of its neighbors, but in the flooding method, all neighbors are selected. Wireless sensor networks have characteristics that distinguish them from other networks such as MANET [3] and mobile phone systems [4]. Some of these features that have been considered in this research are:

    High density of nodes in the environment: usually, wireless sensor networks have a higher density than other networks, and therefore the magnetic waves in the environment of these types of networks are more. Running out of energy cannot be recharged or replaced.

    Limitation of data storage, processing and transmission: compared to other networks, sensor nodes have little storage space and are very limited in terms of the amount of calculations and also the length of the distance they send data.

    Automatic network formation: in this type of network, when a node is placed in the environment, it automatically communicates with the surrounding environment and other neighboring nodes.

  • Contents & References of Presenting a routing method for wireless sensor networks with the aim of increasing the lifetime of the network

    List:

    1 Introduction. 2

    1-1 The necessity of the routing protocol problem and challenges. 3

    1-1-1 limited energy capacity. 4

    1-1-2 Location coordinates of nodes 4

    1-1-3 Limitation of hardware resources. 4

    1-1-4 large number of nodes and random placement in the environment. 4

    1-1-5 network characteristics and physical environment uncertainty. 4

    1-1-6 Data redundancy 5

    1-1-7 Application diversity of wireless sensor networks. 5

    1-2 Characteristics of wireless sensor networks. 5

    1-3 sensor node structure. 7

    1-4 message format. 8

    Summary of the first chapter. 9

    2 related works. 12

       2-1 Introduction. 12

       2-2 types of routing protocols. 12

    2-2-1 Location-based protocols. 13

    2-2-2 data-oriented protocols. 14

    2-2-3 Hierarchical protocols. 15

    2-2-4 motion-based protocols. 17

    2-2-5 Multipath based protocols. 18

    2-2-6 protocols related to heterogeneous networks. 18

    2-2-7 protocols based on quality of service. 19

    2-3 Centralized and distributed routing 19

    2-3-1 Central algorithms. 19

    2-3-2 distributed algorithms 20

    2-4 three-dimensional environment. 20

    Summary of the second season. 21

    3 proposed algorithm. 23

    3-1 types of routing methods. 23

    3-2 Assumptions considered in the simulation. 24

    3-3 PSO algorithm. 26

    3-4 steps of the proposed algorithm. 28

    Summary of the third chapter. 35

    4 Simulation and implementation of the proposed algorithm. 37

    4-1 wireless sensor network simulation software. 37

    4-2 PSO algorithm pseudo code. 39

    4-3 Designing a wireless sensor network simulator. 41

    4-4 data packet. 43

    4-5 pseudocode of the proposed algorithm. 44

    Summary of the fourth chapter. 46

    5 Simulation results. 48

    5-1 Comparison of network life. 49

    5-2 Comparison of information receiving rate. 53

    Summary of chapter 5. 55

    6 Conclusions and suggestions. 57

    6-1 Summary of the discussion. 57

    6-2 Summary of results. 57

    6-3 Suggestions and future works. 58

    References. 60

     

    Source:

     

    [1] http://www.sensorsmag.com/sensors-types available at Aug 2014.

    [2] Ch.Chong, Kumar, S.p, “Sensor networks: evolution, opportunities, and challenges” Proceeding of IEEE, Vol. 91, Aug. 2003, pp. 1247-1256.

    [3] Shah.Rc, Rabaey.J.m “Energy Aware Routing For Low Energy ad hoc Sensor Networks” Proceeding of IEEE, Vol. 1,Mar. 2002, pp. 350-355.

    [4] Sh.Kumar, M.P.Singh, D.k.Singh “Routing Protocols in Wireless Sensor Networks – A Survey” International Journal of Computer Science and Engineering Survey(IJCSES), Vol. 2,Nov. 2010, pp. 63-83.

    [5] P.Kaushik, J.SinghaiEnergy Efficient Routing Algorithm for Maximizing the Minimum Lifetime of Wireless Sensor Network: A Review” International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) Vol. 2,Jun. 2011, pp.25-36.

     

    [6] I.F.Akyildiz, W.Su, Y.Sankarasubramaniam, E.Cayirci “Wireless Sensor Networks: a survey” ELSEVIER.computer Networks, Vol. 38, Mar. 2002, pp. 393-422.

     

    [7] Sh.Kumar, M.P.Singh, D.k.Singh “Routing Protocols in Wireless Sensor Networks –A Survey” IJCSES ??Vol. 2,Nov. 2010, pp. 63-83.

     

    [8] P.Kaushik, J.Singhai,”Energy Efficient Routing Algorithm for Maximizing the Minimum Lifetime of Wireless Sensor Network:A Review” IJASUC Vol. 2,Jun. 2011, pp.25-36.

     

    [9] I.F.Akyilidz, I.H.Kasimoglu,"Wireless sensor and actor networks: Research Challenges", ElSEVIER(ad hoc networks), Vol. 2,Oct. 2004, pp.351-367.

     

    [10] L.J.Villabla, A.L.Sandoval, A.T.Cabrerand, C.B.Abbas, “Routing Protocols in Wireless Sensor Networks” SENSORS, Vol. 9,Oct. 2009, pp.8399-8421.

    [11] J.Shi, A.Calveras, Y.cheng, K.Liu “A Novel Power Efficient Location-Based Cooperative With Transmission Power-Upper-Limit for Wireless Sensor Networks”, SENSORS, Vol. 13,May. 2013, pp. 6448-6476. [12] J. Heidemann,Estrin, "Geography-informed Energy Conservation for ad-hocRouting", Proceeding ACM/IEEE Mobicom01, Vol. 5,Jul. 2001, pp70-84.

    [13] V.Rodoplu, T.H.Meng, "Minimum Energy Mobile Wireless sensor Networks", IEEE Journal on selected area in communications, Vol.17, Aug. 1999, pp1333-1344.

     

    [14] L.Villas, A.Boukerche, H.Ramos, H.Oliviera, R.Arajou, L.Loureiro “A Lightweight and Reliable Routing Approach for In-network aggregation in Wireless Sensor Networks”, IEEE Transactions on Computer, Vol.62, Apr. 2013, pp.676-689.

     

    [15] W.Heinzelman, J.Kulik, H.Balakrishman “Adaptive Protocols for Information Dissemination In Wireless Sensor Networks”, Proceeding ACM/IEEE Mobicom 01, Aug. 1999, pp174-185.

     

    [16] S.Nikolidakis, D.Kandris, D.Vergados, CH.Doligeris “Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering”, Algorithms, Sep. 2013, pp29-42.

     

    [17] N. Sharma, A. Nayyar “A Comprehensive Review of Cluster-Based Energy Efficient Routing Protocols For Wireless Sensor Networks”, International journal of Application or innovation in Engineering & management (IJAIEM), Vol.3, Jan. 2014, pp.441-453.

    [18] P.M.khilar, A.Mahapatro "Mobility Adaptive Unequal Cluster-based Routing Protocol in Wireless sensor Networks", International journal of sensor networks, Vol.14, Sep. 2013, pp.65–81. C. S. Raghavendra, "PEGASIS: Power-Efficient Gathering in Sensor Information System", Proceedings IEEE Aerospace Conference, Vol.3, Mar. 2002, pp.1125.1130. [21] S. Lindsey, C.S. Raghavendra, "Dynamic Multisource Multipath for Intrusion Tolerance and Lifetime Maximization of Autonomous Wireless sensor Networks", IEEEautonomous decentralized System (ISADS), Mar.2013, pp.1-7.

    [22] S.Taruna, S.Shringi, "A Cluster Based Routing Protocol For Prolonging Network Lifetime In Heterogeneous Wireless Sensor Networks", International Journal of Advanced Research in Computer Science and Software Engineering, Vol.3, Apr. 2013, pp.658-665.

    [23]W.R.Heinzelman, A.Chandrkasan, H.Balakrishnan, "An Application Specific Protocol Architecture for wirelessmicrosensor Networks", IEEE Computer society proceeding conference, Vol.14, Oct.2002, pp.660-670.

    [24] K. Sohrabi, J. Pottie, "Protocols for self-organizations of Wireless Sensor Networks", IEEE Personal Communications, Vol. 7, 2000, pp.16-27.

     

    [25] Al.Karaki, J.N “Routing techniques in wireless sensor networks: a survey”, Wireless communication, Vol. 11, Dec.2004, pp.6-28.

    [26] T.He, et al "APEED: A stateless protocol for real time communication in wireless sensor networks", in The Proceedings of International Conference on Distributed Computing Systems, Vol. 9, May.2003.

    [27]W.R.Heinzelman, A.Chandrkasan, H.Balakrishnan, "Energy Efficient Communication Protocol for microsensor Networks", IEEE Computer society proceeding conference, Vol.8, Jan.2000, pp.20-80.

    [28]Y.Wei, J.Heidman, D.Estrin "An Energy Efficient MAC Protocol for Wireless Sensor Networks", IEEE Computer and Communications, Vol.3, Jan.2002, pp.1567-1576.

    [29] Kennedy, J.; Eberhart, R. "Particle Swarm Optimization". Proceedings of IEEE International Conference on Neural Networks IV, 1995, pp. 1942–1948. [30] Shi, Y.; Eberhart, R.C. "A modified particle swarm optimizer". Proceedings of IEEE

    International Conference on Evolutionary Computation, 1998.pp. 69–73

     

    [31] J. Vesterstrom, R.

Presenting a routing method for wireless sensor networks with the aim of increasing the lifetime of the network