An Empirical Analysis Study On The Efficacy Of A Routing Algorithm For Saving Energy In Wireless Sensor Networks

Wireless Sensor Networks (WSNs) is a smart technology which is composed of amassive deployment of nodes. The increasing study on Sensor Network (SN) has broughtnumerous and diversified applications. In its early days, sensor nodes were used forpositioned into the battle field. It was also used in environmental utilization: forest fire,Natural Calamity; Disaster, Earthquake, Volcano, flood and so on. The necessity for usingsensor nodes for environmental purpose is for the survival of people. And today it is used inHuman Daily life. For instance, Smart Learning, Traffic Road control, Water qualitymonitoring, Pipeline monitoring and so on. Moreover, it has a good reputation in Heath(monitoring a patient at home from hospital, micro-surgery), agriculture, surveillance ofproperty (Building, car and so on) and in the industrial sectors just to list but a fewexamples. These diverse applications imply that WSNs is an integral part of themodernization of Human life condition.The functioning of the node heavily relies on the energy resource which is accumulatedinto the physical battery. The energy resource in the node is limited and it has to be utilizedin optimal manner based on an efficient routing algorithm. In our research work we assumethe fact that once the sensor node turns its component on to achieve any basiccommunications with a low efficient routing protocol, this will affect negatively thetransmission process of the data information. And it will make the node to quickly run outof energy and die prematurely. As a result, certain nodes could stop the communicationactivity due to lack of energy power. This might lead to a situation of having twodistinguishing type of fields: the first zone where there are some nodes with some residualenergy to be counted as living node, the second case is the field of dead nodes, whichIn other words, the energy levels are below the threshold value. This second situation looksso bad for any applications in WSNs particularly for military purposes and also civilianutilization. Apart from energy issue, there are other matters which are classified in the second rangingof problem in WSNs, namely; security issue-safety of the data transmission, small amountof memory storage to backup the retrieved data, the update issue of the operating systemwhich is installed on the node, the topology issue, Programming issue and so on. Among allthe cited problems, the energy notion remains incontestably the highest challenging conceptin WSNs, and also it has always been the most attracting study area for many researcherscompared to others issues just mentioned above. The reason is, since the start of the studyof WSNs, not enough progress has been recorded in energy evolution and its graphicalrepresentation has remained stagnant. In this study we addressed energy issue andproposed a routing algorithm called Inter-Clustering Square unit multi-hop Routingalgorithm which aims at mitigating the obstruction, so that the communication costfunction between any nodes in application can be minimized.This study of energy utilization matter remains really important in node designing,because in most cases the battery replacement is impossible. Hence this has made theenergy problem to be so tricky. It means that the lifespan of a sensor node has to dependgreatly on the life of the battery. In WSNs, the transmission process is much more energyconsuming. This is the reason why the current research has focused primarily on the way toease the energy consumption on the cost function by proposing different routing algorithmapproaches, which performs well to lower the energy consumption. To address this issue,nodes from their general concept are usually set up in hostile environment from where thephysical presence of humans cannot be sought as mentioned earlier. In this particular regard,each node has to be designed with a notion of self-organizing concept in mind. Theoverview of node component shows that it is equipped with a transducer, microcomputer,transceiver and power source, each entity of its component has different roles to play sothat the node can operate normally without any side effects. Before the node starts copingwith communication activities in the network, it must know the value of the cost functionof each single connected route between its neighboring node and itself. The matter ofchoosing the best destination route using cost function of energy in the nodes represents thecornerstone of our proposed solution, the suitable destination node is chosen by the sourcenode based on the minimum cost function. In the recent time research works in WSNs have given more attention to the cost functionwhich is related to energy consumption of the node. To prevent the node from consuming alot of power resource, many algorithms have been proposed as a solution to reduce theenergy wastage factors.In our research work, we aim to use the cost function to establish the convenient pathso that the sensing node can propagate the retrieved data to the appropriate destination node.This value of cost function can be computed by taken into account the sum of theintermediate cost function from an ordinary nodes up to the last destination node. In orderto achieve this goal of effective cost function, it must be more preferable and imperative tobuild an efficient routing algorithm which selects the best cost function for thecommunication process. It means, by not choosing a costly path, so that a node can save thepower resource. As regard to this cost function aspect, enormous prior proposed solutionshave been provided to alleviate the energy utilization approach in the design of the sensornode. Our research work is somehow related to some of them. We have taken theinsufficiency of some routing algorithms to serve as an inspiration element and also a keypoint for our research work. We start first by looking at the Low Energy AdaptiveClustering Hierarchy (LEACH) routing protocol. LEACH, first energy-efficienthierarchical routing protocol, is proposed for WSNs using homogenous stationary nodes. InLEACH, Sensors nodes choose their leader based on some parameters such as the strongestsignal received from a Cluster Head (CH). After a certain interval, new nodes are selectedas CH. LEACH reduces energy consumption by utilizing randomized rotation of CHs toevenly distribute the energy load in the network and turning off ordinary nodes when notrequired. Power-Efficient Gathering in Sensor Information Systems (PEGASIS),PEGASIS is an extension of LEACH protocol. PEGASIS forms chains from sensors nodes.Sensors nodes transmit or receive data from a neighbor, in this way PEGASIS avoidscluster formation and uses only one node in a chain to transmit to the base-station. Thisincreases the network lifetime, Hybrid Energy-Efficient Distributed Clustering (HEED).HEED is an improvement of LEACH. HEED clustering randomly selects CHs andimproves the lifetime of the network over LEACH clustering. Energy-EfficientHomogeneous Clustering Algorithm (EEHCA) for Wireless Sensor Networks in EEHCA,a new CH is selected based on the residual energy of existing CH, nearest hop distance of the node and holdback value. The uniform distribution of the cluster members extended thenetwork lifetime. Although many routing algorithms have been proposed, the performanceof these algorithms is promising in terms of energy efficacy; most of them come with noguarantee of quality of service (QoS).Among them, LEACH remains the most known. In WSNs, it could not meet therequirements of energy safety particularly for an inter-cluster single-hop communicationdue to its low performance. In this research work, we have taken the weakness of LEACHin inter-Cluster as the starting point of our work. Thus we propose a routing algorithmcalled: Inter-Cluster Concentric Square Unit on Multi-hop Routing Algorithm(ICSUMRA). In our research work the main aim of our routing protocol is to reduce theenergy consumption so that nodes in the network can live longer. ICSUMRA algorithm isbased on optimizing the lifespan of the network and also fundamentally relies on dividingthe whole monitoring area into a large number of concentric square units, into which thenodes are uniformly distributed in a set of groups called clusters with the base stationlocated at the center of the application field.In this research work we admit that the nodes are distributed uniformly with a densityfunction (u, v), considering the size of the network as C, with Corepresenting the valueof the initial square unit just after the base station. Hostands for the jump value from onesquare unit to another which is its direct successor. Based on our routing algorithm design,once an ordinary node has data from its sensing range, it must propagate the retrieved datato its master node which in turn will send the data to the base station. Once the master nodeis not fulfilling properly its role in the cluster, it must be replaced immediately by anotherordinary node which has the highest value in term of energy consideration in its cluster tofinally take the new lead of master node. Our proposed solution performs well in contrast toLEACH. The field of the network is divided into a lot of square units. For some reasons ofsimplicity, we first give a priority for calculating the possible number of clusters inside thenetwork, secondly we assume that all nodes come with the same initial lifetime energy andare distributed uniformly into the application area. Through experimental results, theperformance of our ICSUMRA algorithm is better in terms of reducing latency and energycontrol. Our ICSUMRA algorithm also takes into consideration the timing of the entire network which has to synchronize, so that collision problem can be avoided between anyneighboring squares units.In our study, we then proposed an energy model which aims at strengthening thelifespan of the node so that the network performance is maximized. The algorithm uses thenode communication energy consumption model which comes from the network optimalcluster number per round under multi-hop communication; by analyzing the network totalenergy consumption determines the cost of choosing the next jump nodes and establishes aminimum energy path tree to the base station between master modes. The simulation resultsshow that our proposed algorithm can carry out the single-hop communication that lacks inthe LEACH algorithm, and reduce the energy consumption which prolongs the networklifetime. For the implementation of our idea, we used MATLAB as the simulator engine. Inthe application field,16nodes were set as Master nodes which were obtained by calculationof cluster, which represent the8%of the total number of deployed node, and184ordinarynodes set inside the100*100square meter in area. The comparison of our algorithmICSUMRA algorithm with LEACH shows that our algorithm performs112%better thanthe LEACH algorithm. We thus, conclude that our algorithm performs better than that ofLEACH. The algorithm developed in this research work is mainly based on minimizingenergy utilization in WSNs. Our objective is to extend the network lifespan with nodeinitial energy resources value. However, implementing such an idea relies on the targetpartition which requires an appropriate data transmission topology. This research work hasraised an interesting question; is it possible to achieve time synchronization of the wholenetwork within a short period of time. This question remains important for datatransmission improvement particularly for the quality of network service (QoS) and datafreshness. Thus our future work will largely depend on or involve to a larger extent takinginto account the concept of time synchronization of the entire network in a short period oftime rather than focusing again in the field of energy efficiency which is generally knownto be the most hot research area in WSNs.