Sleep wake-up scheduling method for linear wireless sensor network

By tracking the energy and depth of nodes in a linear wireless sensor network in real time, and adjusting the sleep wake-up time and transmission method using adaptive algorithms, the problems of load imbalance and low data transmission efficiency are solved, and energy consumption equalization and life cycle extension are achieved.

CN118972918AActive Publication Date: 2024-11-15SHENYANG UNIVERSITY OF TECHNOLOGY
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202410982965.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-22
Publication Date
2024-11-15
Estimated Expiration
2044-07-22

AI Technical Summary

Technical Problem

In a linear wireless sensor network, some load overload nodes are the first to die due to distance, resulting in early failure of the routing link. The existing technology has failed to effectively solve the problems of energy consumption balance and data transmission efficiency.

Method used

Through the linear wireless sensor network, each node tracks the energy state and depth values ​​in real time, uses adaptive algorithms to calculate comprehensive parameters, and dynamically adjusts the sleep wake-up time and transmission method to ensure energy consumption balance and data transmission efficiency.

Benefits of technology

It achieves balanced node energy consumption, extends the network life cycle, improves sensor data transmission efficiency, and significantly improves the overall performance of linear wireless sensor networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118972918A_ABST
    Figure CN118972918A_ABST
Patent Text Reader

Abstract

The invention provides a sleep wake-up scheduling method for a linear wireless sensor network, and relates to the field of wireless sensors. The method comprises the following steps of: firstly, flexibly adjusting the duty ratio of a node by analyzing the initial position of the node, the distance relative to a base station and the current residual energy when the linear wireless sensor network runs; the depth of the node is determined through the initial position of the node, energy information of the node is embedded into a data packet for exchange when the linear wireless sensor network runs, and global planning and dormancy scheduling of the corresponding depth are carried out in real time. According to the dormancy wake-up scheduling method for the linear wireless sensor network, a brand new scheduling method based on node energy and depth is adopted instead of a traditional MAC layer protocol, and the duty ratio of global nodes is more accurately and flexibly controlled by introducing consideration of energy and depth.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of wireless sensors, and in particular relates to a sleep and wake-up scheduling method for a linear wireless sensor network. Background Art

[0002] In the current field of wireless sensor applications, many sensors are deployed in detection areas with linear characteristics, such as railway tracks, tunnel detection, and mine excavation. When deploying sensor nodes in these linear areas, they often face problems such as uneven energy consumption and inefficient data transmission due to their depth extension. Traditional wireless sensor network routing protocols are not designed for the characteristics of linear areas. Therefore, in application areas with long communication distances, problems such as node energy consumption balance, data transmission quality assurance, and network life cycle extension have not been effectively solved.

[0003] In a linear sensor network, data packets are exchanged and forwarded between nodes through single hop, multi-hop, and group multi-hop. Since the nodes are distributed linearly, the nodes close to the base station cannot share high-load tasks through multiple nodes like the mesh topology, resulting in high energy consumption. On the contrary, the nodes far away from the base station have a large amount of residual energy due to the low load. At present, domestic and foreign research mainly focuses on traditional topology structures, aiming to ensure the efficiency of data transmission and extend the network life cycle, focusing on reducing power consumption and balancing loads, and usually solving these application requirements through routing methods and clustering algorithms.

[0004] Existing methods can indeed play their role in some common application areas, achieving energy saving and extending the network life cycle. However, these methods are not designed for linear sensor networks. Since the linear region has a considerable depth, it increases the communication distance and routing difficulty. Traditional routing algorithms cannot fully exert their greatest advantages when applied to linear sensor networks.

[0005] In addition, existing research often ignores the incidental energy consumption caused by node state transitions. Energy-saving design from the perspective of routing and clustering has certain limitations. In practical applications, flexible control of node sleep and wake-up time and data transmission and reception duration can more effectively solve the energy consumption balance problem. Therefore, the applicability of existing solutions in linear sensor networks is limited, and it is difficult to meet the requirements of such networks for energy consumption management and efficient data transmission. Summary of the invention

[0006] The technical problem to be solved by the present invention is to provide a sleep wake-up scheduling method for a linear wireless sensor network in view of the deficiencies of the above-mentioned prior art, which solves the technical problem that in a linear wireless sensor network, some nodes with excessive load die first due to distance, causing premature failure of routing links.

[0007] In order to solve the above technical problems, the technical solution adopted by the present invention is: a sleep wake-up scheduling method for a linear wireless sensor network, comprising the following steps:

[0008] Step 1: In the initialization phase of the linear wireless sensor network, each node sends an initial data for recording the number of hops according to its initial position and transmits it to the base station. The initial data is the sensor data generated by the node. Then the base station obtains the initial information of the relevant node. The initial information of the node includes the node ID, the number of hops, and the source address. The number of hops is the depth. The calculation steps are as follows:

[0009] Step 1.1: Model the linear wireless sensor network topology as a directed graph G:

[0010] G=(V,E)

[0011] Where G represents a directed graph, V represents a set of nodes, and E represents a set of edges; i and v i+1 There is a directed edge (v i ,v i+1 );

[0012] Step 1.2: Each node calculates the local depth value based on its distance to the adjacent nodes; node v i The depth d i The calculation formula is as follows:

[0013] d i =min(d i -1+1,d i+1 +1)

[0014] Among them, d i-1 and d i+1 Respectively represent the node v i-1 and v i+1 The depth value, v i The depth value of is the minimum value of the depth value of the adjacent node plus 1;

[0015] Step 1.3: Since the depth values ​​calculated locally by each node are inconsistent, it is necessary to coordinate the depth values ​​between nodes through global information transmission. Therefore, after the local depth value is calculated, the global depth value of the entire linear wireless sensor network is adjusted, including the following steps:

[0016] Step 1.3.1: Exchange and compare the depth value of each node with the depth value of the adjacent node, and update them to the minimum value between the two;

[0017] Step 1.3.2: Through multiple iterations, ensure that each node in the linear wireless sensor network can obtain the depth value corresponding to the shortest path length of the base station node;

[0018] Step 1.4: Upload the depth value of each node relative to the base station node to the base station as the node initialization information;

[0019] Step 2: During the operation of the linear wireless sensor network, each node obtains its own residual energy in real time and uploads the residual energy of each node to the base station; when sending or forwarding sensor data, the node detects its own residual energy and energy consumption rate in real time and embeds the detected information into the data packet;

[0020] Set node v i The energy consumption rate at time t is R i (t), the energy consumed by the node in the time interval Δt is ΔE i =R i (t)×Δt, node v i The remaining energy E at time t i (t) can be expressed as the initial energy minus the accumulated energy consumption from the initial time to the current time, using the formula:

[0021]

[0022] Among them, E i0 is node v i The initial energy, τ represents the integral variable;

[0023] Step 3: After the base station collects the depth value and residual energy value of the node, it calculates the comprehensive parameters of each node at a certain depth value; designs an adaptive algorithm to comprehensively consider the depth and energy to balance the energy consumption of the node, and dynamically adjusts the weight parameters in the comprehensive parameters according to the working status of the node, including the following steps:

[0024] Step 3.1: For the depth value d i , a linear function is used for normalization, the formula is as follows:

[0025]

[0026] Among them, Depth_Norm i It is a parameter related to depth information in the comprehensive parameters. max(d) and min(d) represent the maximum and minimum depth values ​​of all nodes respectively.

[0027] Step 3.2: For the energy value E i, because energy consumption is usually exponential, a logarithmic function is used for normalization, and the formula is as follows:

[0028]

[0029] in, is a parameter related to energy information in the comprehensive parameters. represents the initial energy of node i, and min(E) represents the minimum value of the remaining energy of all nodes;

[0030] Step 3.3: Integrate node depth and energy to define a comprehensive parameter P i , the depth parameter and the energy parameter are weighted averaged to represent the comprehensive index of depth and energy of node i. The formula is as follows:

[0031] P i =α×Depth_Norm i +(1-α)×Energy_Norm i

[0032] Among them, α is the depth weight parameter, which is used to balance the relative importance of depth and energy;

[0033] Step 4: The base station formulates the sleep-wake-up time ratio of nodes at different depths according to the calculated comprehensive parameters; divides the nodes into several energy consumption stages according to the comprehensive parameters, and allocates a corresponding sleep-wake-up time ratio to each energy consumption stage;

[0034] Step 5: The node selects a single-hop, multi-hop or group multi-hop transmission mode according to the scheduling signaling issued by the base station;

[0035] Step 6: During the operation of the linear wireless sensor network, the base station monitors the state of the linear wireless sensor network in real time, and dynamically adjusts the sleep-wake-up time ratio and the transmission mode selection method according to the depth and energy status of the nodes.

[0036] The beneficial effects of adopting the above technical solution are: a sleep wake-up scheduling method for a linear wireless sensor network provided by the present invention, through real-time tracking and analysis of node energy in the linear wireless sensor network, and unified calculation planning combined with the depth of each node in the linear wireless sensor network, has the following advantages:

[0037] 1. Balanced energy consumption:

[0038] 1.1: Technical means: The present invention tracks and analyzes the energy state of each node in real time, and plans the nodes in the linear wireless sensor network in combination with their depth, and divides the optimal sleep-wake-up time ratio of nodes of different depths in the operation of the linear wireless sensor network according to priority;

[0039] 1.2: Advantages: By flexibly adjusting the ratio of the effective signal time of the node to the total cycle, i.e., the duty cycle, each node can dynamically adjust the sleep time according to the current remaining energy and the depth determined by the initial position when the linear wireless sensor network is running, thereby maximizing energy conservation, so that the global node can achieve the maximum balance of energy efficiency while ensuring the task of transmitting the detected sensor data at the energy consumption level;

[0040] 2. Sensor data transmission efficiency:

[0041] 2.1: Technical means: At the routing algorithm level, by considering the energy state and depth of the node, the duty cycle of the node is flexibly adjusted to solve the problem of inefficient sensor data transmission caused by the fixed sleep wake-up scheduling;

[0042] 2.2: Advantages: Compared with the existing method of simply adjusting the sleep and wake-up time at the MAC layer, the present invention more accurately controls the duty cycle of the global node by introducing a comprehensive consideration of energy and depth, thereby improving the efficiency of sensor data transmission;

[0043] 3. Extend network lifecycle:

[0044] 3.1: Technical means: A dynamic adjustment mechanism combining node energy and depth is adopted to adjust the working status of each node in real time, so as to avoid some nodes running out of energy in advance due to high load, and also prevent other nodes from wasting energy due to low load;

[0045] 3.2: Advantages: By optimizing the energy usage of each node, the entire linear wireless sensor network can achieve a balance in energy consumption, thereby significantly extending the overall life cycle of the linear wireless sensor network. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 A flowchart of a sleep wakeup scheduling method for a linear wireless sensor network provided by an embodiment of the present invention;

[0047] Figure 2 Schematic diagram of single-hop, multi-hop, and group multi-hop routing transmission modes provided in an embodiment of the present invention, wherein (a) is single-hop routing, (b) is multi-hop routing, and (c) is group multi-hop routing. DETAILED DESCRIPTION

[0048] The specific implementation of the present invention is further described in detail below in conjunction with the accompanying drawings and examples. The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.

[0049] In this embodiment, a sleep wake-up scheduling method for a linear wireless sensor network is provided. Figure 1 As shown, the following steps are included:

[0050] Step 1: In the initialization phase of the linear wireless sensor network, each node sends an initial data for recording the number of hops according to its initial position and transmits it to the base station. The initial data is the sensor data generated by the node. Then the base station obtains the initial information of the relevant node. The initial information of the node includes the node ID, the number of hops, and the source address. The number of hops is the depth. The calculation steps are as follows:

[0051] Step 1.1: Model the linear wireless sensor network topology as a directed graph G:

[0052] G=(V,E)

[0053] Where G represents a directed graph, V represents a set of nodes, and E represents a set of edges; i and v i+1 There is a directed edge (v i ,v i+1 );

[0054] This graph modeling method can accurately reflect the physical structure of linear wireless sensor networks and the connection relationship between nodes;

[0055] Step 1.2: Each node calculates the local depth value based on its distance to the adjacent nodes; node v i The depth d i The calculation formula is as follows:

[0056] d i =min(d i-1 +1,d i+1 +1)

[0057] Among them, d i-1 and d i+1 Respectively represent the node v i-1 and v i+1 The depth value, v i The depth value of is the minimum value of the depth value of the adjacent node plus 1;

[0058] Step 1.3: Since the depth values ​​calculated locally by each node are inconsistent, it is necessary to coordinate the depth values ​​between nodes through global information transmission. Therefore, after the local depth value is calculated, the global depth value of the entire linear wireless sensor network is adjusted, including the following steps:

[0059] Step 1.3.1: Exchange and compare the depth value of each node with the depth value of the adjacent node, and update them to the minimum value between the two;

[0060] Step 1.3.2: Through multiple iterations, ensure that each node in the linear wireless sensor network can obtain the depth value corresponding to the shortest path length of the base station node;

[0061] Step 1.4: Upload the depth value of each node relative to the base station node to the base station as the node initialization information;

[0062] The algorithm pseudo code in this embodiment is:

[0063]

[0064]

[0065] Step 2: During the operation of the linear wireless sensor network, each node obtains its own residual energy in real time and uploads the residual energy of each node to the base station; when sending or forwarding sensor data, the node detects its own residual energy and energy consumption rate in real time and embeds the detected information into the data packet;

[0066] Set node v i The energy consumption rate at time t is R i (t), the energy consumed by the node in the time interval Δt is ΔE i =R i (t)×Δt, node v i The remaining energy E at time t i (t) can be expressed as the initial energy minus the accumulated energy consumption from the initial time to the current time, using the formula:

[0067]

[0068] Among them, E i0 is node v i Initial energy, τ represents the integral variable;

[0069] In order to upload the dynamically updated self-energy consumption rate information to the base station, the node can periodically send the current self-energy consumption rate to the base station; in this way, the base station can understand the current self-energy consumption rate of each node in real time to more accurately evaluate the node's self-energy consumption status;

[0070] Step 3: After the base station collects the depth value and residual energy value of the node, it calculates the comprehensive parameters of each node at a certain depth value; designs an adaptive algorithm to comprehensively consider the depth and energy to balance the energy consumption of the node, and dynamically adjusts the weight parameters in the comprehensive parameters according to the working status of the node, including the following steps:

[0071] Step 3.1: For the depth value d i, a linear function is used for normalization, the formula is as follows:

[0072]

[0073] Among them, Depth_Norm i It is a parameter related to depth information in the comprehensive parameters. max(d) and min(d) represent the maximum and minimum depth values ​​of all nodes respectively.

[0074] Step 3.2: For the energy value E i , because energy consumption is usually exponential, a logarithmic function is used for normalization, and the formula is as follows:

[0075]

[0076] in, is a parameter related to energy information in the comprehensive parameters. represents the initial energy of node i, and min(E) represents the minimum value of the remaining energy of all nodes;

[0077] Step 3.3: Integrate node depth and energy to define a comprehensive parameter P i , the depth parameter and the energy parameter are weighted averaged to represent the comprehensive index of depth and energy of node i. The formula is as follows:

[0078] P i =α×Depth_Norm i +(1-α)×Energy_Norm i

[0079] Among them, α is the depth weight parameter, which is used to balance the relative importance of depth and energy;

[0080] Step 4: The base station formulates the sleep-wake-up time ratio of nodes with different depths according to the calculated comprehensive parameters; for nodes with depth values ​​greater than the average value or residual energy greater than the energy setting threshold, more wake-up time is planned; for nodes with depth values ​​less than the average value or residual energy less than the energy setting threshold, more sleep time is planned; the nodes are divided into several energy consumption stages according to the comprehensive parameters, and the corresponding sleep-wake-up time ratio is allocated to each energy consumption stage;

[0081] In this embodiment, multiple thresholds are set to divide the comprehensive parameters into multiple levels, and then a corresponding sleep-wake-up time ratio is formulated according to each level. The pseudo code of the algorithm mechanism is as follows:

[0082] Set multiple thresholds, divide the comprehensive parameters into multiple levels, and then formulate the corresponding sleep-wake-up time ratio according to each level. The pseudo code of the algorithm mechanism is as follows:

[0083]

[0084]

[0085] Through interpolation calculation, continuous adjustment is provided, so that the adjustment of the sleep-wake-up time ratio is transitional; the applicable sleep-wake-up time ratio is dynamically calculated, making the adjustment more flexible and better adapting to the node requirements under different energy consumption states. At the same time, it can make the estimation more accurate, thereby improving the energy efficiency performance of the linear wireless sensor network;

[0086] Step 5: The node selects a single-hop, multi-hop or packetized multi-hop transmission mode according to the scheduling signaling issued by the base station; for nodes that require faster transmission and have sufficient energy, the single-hop or packetized multi-hop mode is used to transmit the detected sensor data; for nodes with lower energy, the multi-hop mode is used to transmit the detected sensor data, and the neighboring nodes help share the load to reduce their energy consumption pressure;

[0087] This embodiment uses different transmission modes to flexibly switch to achieve energy consumption balance, single-hop, multi-hop, and group multi-hop routing transmission modes such as Figure 2 As shown; after analysis, it can be known that multi-hop routing can use the minimum communication range to send data packets, but in a linear topology, the closer the node is to the base station, the more forwarding tasks it will undertake, and high load will bring high power consumption; packet multi-hop can adjust the transmission frequency according to application requirements and energy consumption status to send data in packets, and then the next hop will forward the packets. Compared with multi-hop routing, it has greater flexibility and fault tolerance; single-hop routing is the most traditional sending method, that is, the source node and the target node perform point-to-point transmission to maximize the quality of data transmission, but the relatively high frequency of transmitting data will lead to a lot of energy consumption, and there may also be a situation where the transmission distance exceeds the communication distance;

[0088] This embodiment introduces a time mechanism in the operation phase of the linear wireless sensor network. When a node transmits a sensor data packet, in order to reduce message collisions between neighboring nodes, before sending the sensor data packet, the node randomly introduces a variable V to the sensor data to be sent in the memory queue. r The value is a random real number between [0.7, 1];

[0089] Step 6: During the operation of the linear wireless sensor network, the base station monitors the state of the linear wireless sensor network in real time, and dynamically adjusts the sleep-wake-up time ratio and the transmission mode selection method according to the depth and energy status of the nodes;

[0090] When the energy consumption of the node reaches a certain threshold or the load of the linear wireless sensor network changes, the transmission method is adjusted in time to maintain the balance and stability of the linear wireless sensor network;

[0091] The pseudo code of the mechanism for selecting the transmission mode according to the comprehensive parameters is as follows:

[0092]

[0093] After analysis, it can be seen that packet multi-hop is a flexible transmission mode that can dynamically adjust the packet size according to application requirements, as an optimal choice to replace single-hop transmission and multi-hop transmission. For example, nodes closer to the base station should choose multi-hop to ensure data transmission quality when energy is high, and choose packet multi-hop when energy is low, and sleep as long as possible, so that neighboring nodes can relieve high loads and extend their life cycle; nodes farther from the base station can choose single-hop or large-packet multi-hop when energy is sufficient, but can also choose small-packet multi-hop or multi-hop when energy is low;

[0094] The comprehensive parameter calculated by combining the energy parameter and the depth parameter is a dynamic reference value. Since it introduces both load and location information, it has a strong reference role in the selection of sleep and wake-up scheduling and data transmission methods.

[0095] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some or all of the technical features therein. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope defined by the claims of the present invention.

Claims

1. A sleep-wakeup scheduling method for linear wireless sensor networks, It is characterized in that The following steps are involved: Step 1: In the initialization phase of the linear wireless sensor network, each node sends an initial data for recording the number of hops according to its initial position and transmits it to the base station. The initial data is the sensor data generated by the node, and then the base station obtains the initial information of the relevant node. The initial information of the node includes the node ID, the number of hops, and the source address. The number of hops is the depth. Step 2: During the operation of the linear wireless sensor network, each node obtains its own residual energy in real time and uploads the residual energy of each node to the base station; when sending or forwarding sensor data, the node detects its own residual energy and energy consumption rate in real time and embeds the detected information into the data packet; Step 3: After the base station collects the depth value and residual energy value of the node, it calculates the comprehensive parameters of each node at a certain depth value; designs an adaptive algorithm to comprehensively consider the depth and energy to balance the energy consumption of the node, and dynamically adjusts the weight parameters in the comprehensive parameters according to the working status of the node; Step 4: The base station formulates the sleep-wake-up time ratio of nodes at different depths according to the calculated comprehensive parameters; divides the nodes into several energy consumption stages according to the comprehensive parameters, and allocates a corresponding sleep-wake-up time ratio to each energy consumption stage; Step 5: The node selects a single-hop, multi-hop or group multi-hop transmission mode according to the scheduling signaling issued by the base station; Step 6: During the operation of the linear wireless sensor network, the base station monitors the state of the linear wireless sensor network in real time, and dynamically adjusts the sleep-wake-up time ratio and the transmission mode selection method according to the depth and energy status of the nodes.

2. A sleep wakeup scheduling method for a linear wireless sensor network according to claim 1, Features: The step 1 comprises the following steps: Step 1.1: Model the linear wireless sensor network topology as a directed graph G: G=(V,E) Where G represents a directed graph, V represents a set of nodes, and E represents a set of edges; i and v i+1 There is a directed edge (v i , v i+1 ); Step 1.2: Each node calculates the local depth value based on its distance to the adjacent nodes; node v i The depth d i The calculation formula is as follows: the i =min(d i-1 +1,d i+1 +1) Among them, d i-1 and d i+1 Respectively represent the node v i-1 and v i+1 The depth value, v i The depth value of is the minimum value of the depth value of the adjacent node plus 1; Step 1.3: Since the depth values ​​calculated locally by each node are inconsistent, it is necessary to coordinate the depth values ​​between nodes through global information transmission. Therefore, after the local depth value is calculated, the global depth value of the entire linear wireless sensor network is adjusted; Step 1.4: Upload the depth value of each node relative to the base station node to the base station as the initialization information of the node.

3. A sleep wakeup scheduling method for a linear wireless sensor network according to claim 2, Features: The step 1.3 comprises the following steps: Step 1.3.1: Exchange and compare the depth value of each node with the depth value of the adjacent node, and update them to the minimum value between the two; Step 1.3.2: Through multiple iterations, ensure that each node in the linear wireless sensor network can obtain the depth value corresponding to the shortest path length of the base station node.

4. The sleep-wake-up scheduling method for a linear wireless sensor network according to claim 3, Features: Step 2 sets the node v i The energy consumption rate at time t is R i (t), the energy consumed by the node in the time interval Δt is ΔE i =R i (t)×Δt, node v i The remaining energy E at time t i (t) can be expressed as the initial energy minus the accumulated energy consumption from the initial time to the current time, using the formula: in, is node v i is the initial energy of , and τ represents the integral variable.

5. A sleep-wakeup scheduling method for a linear wireless sensor network according to claim 4, Features: The step 3 comprises the following steps: Step 3.1: For the depth value d i , a linear function is used for normalization, the formula is as follows: Among them, Depth_Norm i It is a parameter related to depth information in the comprehensive parameters. max(d) and min(d) represent the maximum and minimum depth values ​​of all nodes respectively. Step 3.2: For the energy value E i , because energy consumption is usually exponential, a logarithmic function is used for normalization, and the formula is as follows: in, is a parameter related to energy information in the comprehensive parameters. represents the initial energy of node i, and min(E) represents the minimum value of the remaining energy of all nodes; Step 3.3: Integrate node depth and energy to define a comprehensive parameter P i , the depth parameter and the energy parameter are weighted averaged to represent the comprehensive index of depth and energy of node i. The formula is as follows: P i =α×Depth_Norm i +(1-a)×Energy_Norm i Here, α is a depth weight parameter that is used to balance the relative importance of depth and energy.

Citation Information

Patent Citations

  • Method for reducing end-to-end delay in delay-sensitive wireless sensor network

    CN114666880A

  • Self-adaptive sleep wake-up scheduling method for underwater acoustic sensor network

    CN115396991A

  • Methodology for efficient transmission in wireless sensor network using cluster restructuring and compressive data gathering.

    IN201821038406A