A cluster-based data acquisition and load balancing method
A technology of data collection and load balancing, which is applied to services based on specific environments, data exchange networks, digital transmission systems, etc., can solve problems such as unbalanced energy loss, and achieve unbalanced energy loss, good load balancing performance, The effect of reducing energy loss
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0036] Specific implementation mode one: the specific process of a cluster-based data collection and load balancing method in this implementation mode is as follows:
[0037] The present invention proposes a cluster-based balanced energy consumption method (CBEL). Organize the CHs in the CBEL into multiple parallel links, such as Figure 4 shown. Concentrate energy balance consumption globally rather than locally, thereby prolonging the life of the network.
[0038] Step 1. Link formation in the one-dimensional network;
[0039] Step 2. Based on the formation of links in the one-dimensional network, data collection in the one-dimensional network is performed;
[0040] Step 3, based on the data collection in the one-dimensional network, determine the optimal number of links in the one-dimensional network.
specific Embodiment approach 2
[0041] Specific embodiment two: the difference between this embodiment and specific embodiment one is that the link in the one-dimensional network in the step one is formed; the specific process is:
[0042] In the one-dimensional network model, the sensing area is a straight line with length L, such as Figure 5 As shown, FC is at the left end of the sensing area, and n cluster head nodes CH1, CH2, CH3, ..., CHk, ..., CHn are arranged in sequence from left to right on this line; n cluster head nodes CH1, CH2, CH3, ..., CHk, ..., CHn are all static nodes; FC is a base station;
[0043] The distance between any two adjacent cluster head nodes CH is L / n, and the distance between FC and CH1 is D; therefore, the distance between FC and CHn is D+(n-1)L / n;
[0044] Form m links, each link i is composed of CHi, m+i, 2m+i,..., 1≤i≤m.
[0045] Such as Figure 5 As shown, the single chain is composed of CH1,2,3,...,n-1,n;
[0046] Such as Figure 6 As shown, the two links are respe...
specific Embodiment approach 3
[0049] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is that, in the step 2, based on the formation of links in the one-dimensional network, the data collection in the one-dimensional network is carried out; the specific process is:
[0050] A link with n cluster head nodes will transmit n data packets to FC; if a direct connection scheme is adopted, CHn farthest from FC will consume the most energy. If the shortest path tree method is adopted, CH1 closest to the FC will become a hotspot. Next, the intra-chain scheduling method is explained with a single-chain scheme, as shown in Method 1.
[0051] n data packets are divided into n cycles for transmission: r∈{1,...,n};
[0052] For any r-th cycle, if r
[0053] If r=n, then the data packet is transmitted through a single chain (FC←1←2...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More