Complex Network Node Covering Method Based on Snowdrift Game Evolution

A complex network and snowdrift game technology, applied in the field of node coverage of complex networks, can solve problems such as the inability to obtain the minimum coverage result, achieve strong adaptability and reduce risks

Active Publication Date: 2018-07-06
XIDIAN UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Due to the connectivity characteristics of the network, the deviation of the local results will cause a chain reaction, causing the overall solution to fall into a local optimum, and the update process of the MBR algorithm is unable to avoid this bad situation, so the minimum coverage result is often not obtained in the end.

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
  • Complex Network Node Covering Method Based on Snowdrift Game Evolution
  • Complex Network Node Covering Method Based on Snowdrift Game Evolution
  • Complex Network Node Covering Method Based on Snowdrift Game Evolution

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The complex network used in the present invention is a PS network, which is usually used to evaluate the algorithm performance of the minimum node coverage problem. A standard PS network has a total number of nodes of 3k+4, including two rows of k+2 nodes and a third row of k nodes. Each node in the first row is connected to each node in the second row on the same column. The nodes in the second and third rows are connected to each other. Therefore, there are two types of coverage states: the second row is covered, which is covered for a minimum node; or the first and third rows are covered, and a non-minimal node is covered. In this example, a PS network with 1000 nodes is processed, that is, k=332.

[0030] refer to figure 2 , the implementation steps of the present invention are as follows:

[0031] Step 1, parameter setting and initialization

[0032] According to the scale of the complex network to be processed, set the evolutionary population size S=100 and th...

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 discloses a snowdrift game evolution based complex network node covering method, which mainly solves a problem that complex network minimum node coverage cannot be accurately calculated in the prior art. The implementation comprises the steps of (1) setting the population size S and an algebra G, and randomly generating S individuals to form a parent population; (2) randomly selecting two individuals from the parent population to carry out crossover and mutation so as to acquire four quasi-offspring individuals, respectively carrying out memoryless snowdrift gaming on the four quasi-offspring individuals, and selecting two quasi-offspring individuals with a small evaluation function value from the four quasi-offspring individuals to act as new individuals; (3) repeating the step (2) until S new individuals are generated so as to act as a new parent population, thereby completing one time of population regeneration; and (4) repeating the steps (2)-(3) on the basis of the new parent population so as to complete G times of population regeneration, and using the individual with the minimum evaluation function value in a final population to act as a minimum node coverage result. The method disclosed by the invention can solve the minimum node coverage result of a complex network, and can be applied to distribution planning and network optimization.

Description

technical field [0001] The invention belongs to the field of network technology, and in particular relates to a node coverage method of a complex network, which can be used for distribution planning and network optimization, such as the selection of the optimal installation position of monitoring equipment in the urban road network, and the selection of key points according to the interpersonal relationship network when placing advertisements object. Background technique [0002] Complex network is a form of abstraction of complex systems in the real world. There are many such complex networks in the real world, such as friend relationship networks in social networks, power grids, the World Wide Web, neural networks in biological networks, and metabolic networks, etc. . The independent individuals in the real world system are abstracted into nodes in the network, and a relationship between individuals in the system that is naturally formed or artificially constructed accord...

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): H04W16/18H04W16/22
CPCH04W16/18H04W16/22
Inventor 吴建设焦李成皎魁马晶晶项鹏熊涛刘红英
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products