Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Distributed load balancing method based on quantitative unbiased broadcast gossip algorithm

A load balancing and distributed technology, applied in wireless communication, network traffic/resource management, electrical components, etc., can solve the problem of no wireless channel broadcast characteristics

Active Publication Date: 2017-11-14
HARBIN INST OF TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These two types of algorithms can only be used for two-way links because only the selected nodes exchange data at each update, although they can make the consensus converge to the mean value, and they do not make good use of the broadcast characteristics of the wireless channel.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Distributed load balancing method based on quantitative unbiased broadcast gossip algorithm
  • Distributed load balancing method based on quantitative unbiased broadcast gossip algorithm
  • Distributed load balancing method based on quantitative unbiased broadcast gossip algorithm

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0021] Specific embodiment one: the distributed load balancing method based on the quantitative unbiased broadcast Gossip algorithm of this embodiment includes the following steps:

[0022] 1. Initialize the node state value and set the synchronization clock and the maximum number of iterations of the wireless sensor network;

[0023] 2. The iteration and quantization process of the unbiased broadcast Gossip algorithm;

[0024] 3. When the number of iterations reaches the preset maximum number of iterations, the iteration ends; at this time, the loads of all nodes in the wireless sensor network are balanced, that is, the distributed load balancing method based on the quantized unbiased broadcast Gossip algorithm is completed.

specific Embodiment approach 2

[0025] Specific implementation mode two: the difference between this implementation mode and specific implementation mode one is that the step one is specifically:

[0026] (1) The wireless sensor network is regarded as a random geometric graph model G(N, R), N represents the number of sensor nodes, R is the connection radius, and N sensor nodes are evenly distributed in the network; the N sensor nodes The topology is represented by an N×N adjacent matrix A. If the Euclidean distance between two nodes i and j is less than the transmission radius R, the two nodes are considered to be adjacent to each other and can communicate directly. Let A ij = 1; otherwise, the two nodes are not adjacent and cannot communicate directly, then let A ij =0; when i=j, i and j represent the same node, then let A ij = 0; let N i ={j∈{1,2,…,N}:A ij ≠0} means all adjacent nodes of node i;

[0027] (2) Each node i in the wireless sensor network saves two variables, one is the estimated value x of...

specific Embodiment approach 3

[0030] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is: the iterative and quantization process of the unbiased broadcast Gossip algorithm in the step two is specifically:

[0031] 1) Start the timer and start timing: when the current round of iteration starts, judge whether the current iteration number has reached the maximum value, if not, enter the current round of iteration process; if it has reached the maximum value, then exit the iteration process;

[0032] 2) During the current round of iteration, judge whether the timer count value of the node is full: if the timing of node k expires at time t, the node will be awakened randomly, otherwise the node will not be awakened and enter the waiting state; The awakened node k broadcasts its current quantized state value to the whole network and quantized accompanying variable values At the same time, node k updates its final state value at time t+1

[0033] 3) Determ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a distributed load balancing method, in particular to a distributed load balancing method based on a quantified unbiased broadcast Gossip algorithm. The quantified unbiased broadcast Gossip algorithm is provided in order to solve the problem of a distributed consensus, and particularly the problem of distributed load balancing. The distributed load balancing method comprises the steps that 1 initialization is conducted on state values of nodes and a synchronous clock and the largest number of iterations of a wireless sensor network are set; 2 the iteration and quantification processes of the unbiased broadcast Gossip algorithm are implemented; 3 when the number of iterations reaches the preset largest number of iterations, iteration is stopped. At the moment, all node loads in the wireless sensor network are balanced, namely, the distributed load balancing method based on the quantified unbiased broadcast Gossip algorithm is completed. The distributed load balancing method is applied to the field of communications.

Description

technical field [0001] The invention relates to a distributed load balancing method. Background technique [0002] The Gossip algorithm was first proposed by Tsitsiklis et al. in 1984. This algorithm only uses the local information of network nodes and the information of its neighbor nodes for data exchange, and solves the average consensus problem under distributed conditions. In actual digital communication links, it is necessary to quantify node information due to the limitation of measurement accuracy and communication channel capacity, as well as limited node storage capacity. [0003] With the development of wireless technology, wireless sensor network emerges at the historic moment. A wireless sensor network is a simple sensor network organized by a large number of sensor nodes with functions of wireless communication, data collection and processing, and cooperation. It is a multi-hop self-organizing network system formed through wireless communication. Its role is ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W28/08
Inventor 吴少川牛丽娟潘斯琦马康健
Owner HARBIN INST OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com