Credible security route of wireless sensor network on basis of quantum ant colony algorithm

A wireless sensor and ant colony algorithm technology, applied in the field of network security, can solve the problems of local optimal solution and slow convergence speed, and achieve the effect of reducing design complexity and energy consumption

Inactive Publication Date: 2013-02-06
SHANGHAI UNIV
View PDF3 Cites 32 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013](1) Since the traditional ant colony algorithm has problems such as easy to fall into local optimal solution and slow convergence speed, the global optimization and fast convergence characteristics of quantum computing can b

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
  • Credible security route of wireless sensor network on basis of quantum ant colony algorithm
  • Credible security route of wireless sensor network on basis of quantum ant colony algorithm
  • Credible security route of wireless sensor network on basis of quantum ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] The wireless sensor network trusted security routing based on the quantum ant colony algorithm is characterized in that the specific operation steps for determining the routing are as follows:

[0052] 1) Set the initial pheromone: set the number of ants as , the sensor network space size is , the sink node is ; Initialize pheromone , the initial number of iterations , is the maximum number of iterations set; the initial shortest path ; Determine the size of the area according to the number of ants and the size of the space, and place each ant in each search area;

[0053] 2) Determining the visibility function: calculating the arrival at the sink node path of distance , visibility function, pheromone level, and transition probability;

[0054] 3) Path selection: No. Ants choose to reach the sink node according to the size of the credibility and record the path, and release pheromone at the same time, the shorter the path, the greater the possibil...

Embodiment 2

[0060] This embodiment is basically the same as Embodiment 1, and the special features are:

[0061] The method for initializing the pheromone in the described step 1) is: in the establishment of the ant colony ants, each ant carries Qubits, all possible ways from the source node to the destination node in the wireless sensor network are defined as paths in the quantum ant colony algorithm. exist destination node the path of ; Let the ant colony No. generation contains The population of individuals is , where the first initial pheromone for:

[0062] (6)

[0063] In the formula, the initial number of iterations , is the number of qubits, are the two probability amplitudes of the qubit, at the beginning average .

[0064] The method of calculating the visibility function in the step 2) is: the visibility function is mainly determined according to the credibility of the nodes, and according to the three basic indicator...

Embodiment 3

[0080] see Figure 1~Figure 3 , the present invention is based on the quantum ant colony algorithm to determine the trusted security routing of the wireless sensor network, the specific operation steps are as follows:

[0081] 1) Initialize pheromone

[0082] Let there be a total of ants, each ant carries qubits; all possible ways from the source node to the destination node in the wireless sensor network are defined as paths in the quantum ant colony algorithm, there is destination node the path of ; Let the ant colony No. generation contains The population of individuals is , where the first initial pheromone for:

[0083] (11)

[0084] In the formula, the initial number of iterations , is the number of qubits, are the two probability amplitudes of the qubit, at the beginning average .

[0085] 2) Visibility function

[0086] The relevant parameters about the idea of ​​trusted network include the following calculations: ...

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 credible security route of a wireless sensor network on the basis of a quantum ant colony algorithm. A method for determining the route specifically includes steps of 1), setting initial information elements; 2), determining a credibility function; 3), selecting paths; 4), recording and updating the optimal solution; 5), updating the information elements; 6), jumping to the step 3) to repeatedly implement the steps until iteration is terminated; and 7), outputting the optimal solution. As shown by analysis, the method for determining the route is superior to the traditional ant colony algorithm in the aspects of convergence rate and global optimization, energy consumption of network nodes can be globally balanced, the network is prevented from being divided into a plurality of islands due to premature death of certain critical nodes, and the credible security route can effectively resist energy black hole attack such as Wormholes attack which is typical for the wireless sensor network, and is beneficial to building a credible network environment.

Description

technical field [0001] The invention relates to a trusted secure routing of a wireless sensor network based on a quantum ant colony algorithm, which can improve the convergence speed and global optimization capability of the wireless sensor network, and can effectively resist energy black hole attacks, belonging to the field of network security. Background technique [0002] The wireless sensor network adopts multi-hop wireless communication technology, each node is a potential routing node, and the node is limited by resources, and each node sends the collected data to the aggregation node by means of multi-hop relay, which will inevitably lead to the inner layer The amount of data sent by the node is heavy, and the energy consumption is too fast, which eventually leads to a decrease in the effective coverage area of ​​the network. Therefore, the selection of wireless sensor network routing should be combined with the energy information of nodes, so that the energy consumpt...

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
IPC IPC(8): H04W40/10
CPCY02B60/42Y02B60/50Y02D30/00Y02D30/70
Inventor 王潮姜丽莹贾徽徽刘瑞
Owner SHANGHAI 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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap