The present disclosure relates to a method for data transmission in a wireless sensor network (WSN) BACKGROUND [0002] Background description includes information that may be useful in understanding the present invention. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed invention, or that any publication specifically or implicitly referenced is prior art. [0003] Recently, wireless sensor networks (WSNs) have been deployed in various fields such as monitoring of earthquake, environmental pollution, forest fire, water quality, activity information collection for health management, mechanical processing, construction safety, military surveillance and reconnaissance, Has been widely applied, and as a result, wireless sensor networks continue to grow as one of the most remarkable fields in recent engineering field (see Reference 1). [0004] Here, wireless sensor networks (WSNs) generally have very high computational capacity and energy consumption characteristics, but existing networks are not able to directly apply such sensor networks due to limited power, low bandwidth and small memory size. In order to improve the overall performance of the network, there is an increasing demand for a new network construction algorithm that can increase the total life time (TLT) of the network. Clustering is one of the most useful techniques for data aggregation and filtering for sensor networks (WSNs). [0005] Conventional cluster WSN consists of a group of sensor nodes, each cluster having a dedicated node called a cluster head (CH) and connected to each other. Here, the cluster head (CH) serves for cluster management, such as scheduling of medium access, dissemination of control messages, and most importantly, data aggregation,) Is defined as the hop distance from the CH to the farthest node of the cluster. For example, in a three-hop cluster, the distance of the node farthest from the CH is three hops, i.e., there are four nodes in the path including the end point, The indicated network has a one-hop distance between the CH and the member sensor nodes. That is, clustering is a process of grouping nodes in a network that share a common characteristic within a certain hop distance or a common characteristic, and electing a CH for each cluster. This selection is permanent (static clustering (static clustering)) or repeated at a specific time interval (dynamic clustering). [0006] Clustering also reduces the traffic load on the nodes through the data aggregation process in the wireless sensor network, extends the total lifetime, balances the data traffic of the network, and finally enables deployment of hundreds of thousands of nodes It is widely used to increase scalability. [0007] In existing clustering methods, cluster head (CH) node loses energy between transmissions to the base station (BS) while confirming that it is the CH node of the respective cluster. There is therefore a need in the art for a robust CH node determination protocol that can assist in picking CH nodes based on the node's region and its residual energy. SUMMARY [0008] The present disclosure relates to a method of selecting cluster heads, wherein the target of the cluster head is based on node distance and node energy. In an aspect, cluster head selection method of the present disclosure aims at minimising energy utilisation and enhancing lifetime of networking by introducing shortest path relay node technique. When few sub-cluster nodes are heavily loaded, the proposed method prevents faster energy consumption, and helps achieve normal energy depletion by launching the selected trajectory cluster. Distances among the clusters decide and play an important part in energy consumption. As a result, the shortest path selection relay method leads to nominal depletion of the energy of each node present in the array so as to create a transmission with nearest nodes in the shortest path between the heads of the source cluster. [0009] In an exemplary aspect of the present disclosure, the system lifetime, or, in other words, energy staying in the Sensor Nodes (SNs), is the primary consideration to be viewed when planning Wireless Sensor Networks (WSNs). For energy-proficient Wireless Sensor Network (WSN), numerous WSN models and grouping computations have been proposed in the past among which randomly cluster head (CH) selection is an important consideration. Power drain makes utilisation of the probabilistic model for circulating energy utilisation of the CHs between the nodes inefficient, and therefore the proposed method overcomes this issue and makes data transfer (DT) possible after the cluster region changes. [0010] In an aspect of the present disclosure, during experimentation, cluster nodes were compared, and it was found that efficiency of shortest path selection for relay node (SPSRN) is 42% better than the mutual exclusive distributive clustering (MEDC). The proposed method of the present invention also produces a better lifetime of the sensors due to low energy consumption. The proposed method makes CH selection more manageable, and the energy consumption is also less compared with the MEDC method. By introducing the mechanism to select cluster paths, it is estimated that clusters' selection would become more effective. Distance from one cluster to another cluster becomes an integral part of energy consumption. [0011] The present disclosure relates to a method for data transmission in a wireless sensor network (WSN), said method comprising the steps of: for each cluster, determining a cluster head (CH) node from a plurality of sensor nodes (SNs) that form part of the WSN based on residual energy of one or more of said plurality of SNs; identifying, using the determined CH, relay node (RN) for each said cluster based on selection of minimum distance between the clusters, along with deciding shortest relay route between said clusters to base station (BS), said shortest relay route being decided based on distance between a first cluster and its neighbouring cluster so as to establish direction of transmission link with closer nodes such that only nominal energy depletion of each sensor node in the network is enabled through shortest path between sub-cluster head (SCH) nodes; calculating shortest distance between one or more pairs of SCH nodes and child nodes (CNs) such that, for a given pair of SCH and CN and for a defined number of iterations, if the calculated distance is less than a distance threshold, data transmission is initiated between the determined CH for the respective cluster and the base station (BS) through the shortest relay route based on information collected from the pair of SCH and CN. [0012] In an aspect, such cluster sensor nodes that form part of the decided shortest relay route are configured in active mode, and remaining cluster sensor nodes are configured in passive mode. [0013] In another aspect, when a first sensor node node receives a message from the determined CH for a relay node duty, the first sensor node transmits a message to the relay node (RN) with a message of acknowledgement, said relay node being configured to forward at least a part of the received message to next relay node on the shortest relay route to the BS. [0014] In another aspect, Major Cluster Head (MCH) and the BS can be located in a field where the sensor nodes are localized. The Mobile Sink Nodes (MSN) can be implemented to collect information from the SCH node and pass it to the MCH node. [0015] In an aspect, for the step of calculating, the SCH nodes transmit a first set of packets to any child node in the local region, and the child node sends back the acknowledgement, based on which the SCH starts initiates a second set of data packets, and a counter value (CV) is declared as (N/SCH)-1 to all SCH nodes. In another aspect, the distance between the SCH and CN is calculated and compared with a threshold distance such that if the distance of SCH and CN is found less than the threshold distance, the CV is decremented, but if both SCH and CN distances are not less than the threshold distance, the CV remains the same. [0016] In another aspect,_when the CV is decremented, the method is configured to check the value of the CV first such that if it is found equal to 0, the comparison is stopped, else if the CV value is not equal to 0, the SCH sensor value is measured again, said method being conducted iteratively until the value of the CV becomes 0 such that once the SCH reaches its capacity limit, it starts transmitting rejection information and requests are sent to neighbouring SCH nodes by the rejected CN. [0017] In another aspect, in the data transmission step, the CH node transmits the information to the BS by acting as intermediate between the clusters to the BS, and moving from one place to another for collecting the SCH's information and transmitting that to the CH. In yet another aspect, each CH can include transferring the information according to the selected root such that energy utilization happens by the selected root cluster only, and the remaining clusters remain in passive mode. BRIEF DESCRIPTION OF THE DRAWINGS [0018] The accompanying drawings are included to provide a further understanding of the present disclosure, and are incorporated in and constitute a part of this specification. The drawings illustrate exemplary embodiments of the present disclosure and, together with the description, serve to explain the principles of the present disclosure. The diagrams are for illustration only, which thus is not a limitation of the present disclosure. [0019] FIG. 1 illustrates an exemplary architecture of the proposed network. [0020] FIG. 2 illustrates an exemplary flow diagram of the proposed method. [0021] Persons skilled in the art will appreciate that elements in the figures are illustrated for simplicity and clarity and may have not been drawn to scale. For example, the dimensions of some of the elements in the figure may be exaggerated relative to other elements to help to improve understanding of various exemplary embodiments of the present disclosure. Throughout the drawings, it should be noted that like reference numbers are used to depict the same or similar elements, features, and structures. DETAIL DESCRIPTION [0022] In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. It will be apparent to one skilled in the art that embodiments of the present invention may be practiced without some of these specific details. [0023] If the specification states a component or feature "may", "can", "could", or "might" be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic. [0024] As used in the description herein and throughout the claims that follow, the meaning of "a," "an," and "the" includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein, the meaning of "in" includes "in" and "on" unless the context clearly dictates otherwise. [0025] The recitation of ranges of values herein is merely intended to serve as a shorthand method of referring individually to each separate value falling within the range. Unless otherwise indicated herein, each individual value is incorporated into the specification as if it were individually recited herein. All methods described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g. "such as") provided with respect to certain embodiments herein is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention otherwise claimed. No language in the specification should be construed as indicating any non-claimed element essential to the practice of the invention. [0026] Groupings of alternative elements or embodiments of the invention disclosed herein are not to be construed as limitations. Each group member can be referred to and claimed individually or in any combination with other members of the group or other elements found herein. One or more members of a group can be included in, or deleted from, a group for reasons of convenience and/or patentability. When any such inclusion or deletion occurs, the specification is herein deemed to contain the group as modified thus fulfilling the written description of all groups used in the appended claims. [0027] Exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this disclosure will be thorough and complete and will fully convey the scope of the invention to those of ordinary skill in the art. Moreover, all statements herein reciting embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure). [0028] The subject matter of the shared disclosure relates to a networks. More particularly, it relates to a system and method for selecting cluster head through a relay approach for Wireless Sensor Networks (WSNs). [0029] The proposed system and method for Wireless Sensor Networks (WSNs), wherein cluster head selection method minimize energy utilization and enhance lifetime of the networking by introducing the shortest path relay node method. The shortest path selection relay approach leads to the nominal depletion of the energy of each node present in the array to create a transmission with nearest nodes in the shortest path between the heads of the source cluster. The prosed disclosure disclosing various algorithm: Algorithm for CH selection based on highest Residual Energy Input: Number of nodes moving randomly Output: Selection of CH Selection_ ClusterHead (WSN N number of sensor node p = 1.. .n) { Per unit sensornodelDnumberi, transmit the leftover energy Eleftover; in the communication range adjacent cluster Per unit sensor node IDnumberi; i=0 Per unit sensor node IDnumberi; advance Q_i for relay acquired Per unit sensor node IDnumberi; j in Q_i. Per unit j ->Q_i do a. check condition whetherE_leftover_i<= Eleftoverj acknowledge with an okay prompt to IDnumberJ. set i= 1. b. if not, do not build output from series for this transmit Per unit sensor node IDnumberiif variable i = 0 transmit CH acknowledgement to the adjacent cluster. } [0030] The SN will do the criteria for selecting a hand-off node for the specific group having the second-most extreme leftover energy. By selecting the minimum distance between clusters, CHs (Cluster heads) specifies the relay node for their cluster, and also decide the shortest relay route between clusters to BS (Base Station). A node receives a message from CH for a relay node duty, the node sends a message to the relay node with a message of acknowledgement. The relay node aims to forward the data obtained from the CHs to the next relay node on the BS path. Algorithm for SPSRN Approach Input: 100 nodes randomly moving through which CH will be selected Output: 42% better performance than the MEDC via throughput equation 3 Shortest_path_selection_for RN i.e. Relay Node // (WSN N: sensor node i=l...n) { For every sensor node IDnumberi if p = 0 then //p is counter variable computeNodeJ in Qnumberi for adjacent cluster do [j=RN]. //Duty Relay Node=> RN Node Jpopsmessageup for declaration to Relay Node For (1=0 to BS) If(Q_number_iQ_i, it is checked whether the Eleftover i <= EleftoverJ, which if correct is acknowledged with an okay prompt to IDnumberJ and i is set to 1. If the above condition is not satisfied, output from the series is not built for this transmit. Based on the above, for each unit sensouSy'xr nodelDnumberi, if variable i=0 transmit CH acknowledgment to the adjacent cluster. The above-method is further placed below for better clarity. Input: Number of nodes moving randomly Output: Selection of CH Selection_ ClusterHead (WSN N number of sensor node p = 1.. .n) { 1. Per unit sensornodelDnumberi, transmit the leftover energy Eleftover; in the communication range adjacent cluster. 2. Per unit sensor node IDnumberi; i=0. 3. Per unit sensor node IDnumberi; advance Q_i for relay acquired. 4. Per unit sensor node IDnumberi; j in Q_i. 5. Per unit j ->Q_i do a. check condition whetherE_leftover_i<= Eleftoverj i. acknowledge with an okay prompt to IDnumberJ. ii. seti= 1. b. if not, do not build output from series for this transmit 6. Per unit sensor node ID_number_iif_ variable i = 0 transmit CH acknowledgement to the adjacent cluster. } [0037] In an exemplary aspect, method of the present disclosure can be configured to select a hand-off sensor node for the specific group having the second-most extreme leftover energy. By selecting the minimum distance between the clusters, CHs will specify the relay node (RN) for their cluster, and also decide the shortest relay route between clusters to BS. It will reduce the energy utilisation to satisfy the cluster region. Without the shortest path selection approach, energy utilisation is more because sometimes the path is too long. In the proposed method, only the selected path clusters can be in an active mode, while the remaining cluster nodes will be in passive mode. Due to this, the network lifetime of sensors gets enhanced. Therefore, sensors will work for a more extended period. When a node receives a message from CH for a relay node duty, the node sends a message to the relay node with a message of acknowledgement. The relay node aims to forward the data obtained from the CHs to the next relay node on the BS path. The below proposed method includes the steps for SPSRN Approach: Input: 100 nodes randomly moving through which CH will be selected Output: 42% better performance than the MEDC via throughput equation 3 Shortest_path_selection_for RN i.e. Relay Node // (WSN N: sensor node i=l...n) { For every sensor node IDnumberi if p = 0 then //p is counter variable computeNodeJ in Qnumberi for adjacent cluster do [j=RN]. //Duty Relay Node=> RN Node Jpopsmessageup for declaration to Relay Node. For (1=0 to BS) If(Q_number_i