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

Routing selection method and system

A system and routing selection technology, applied in the field of wireless networks, can solve the problems of considering node energy and prolonging the network survival time, and achieve the effect of optimal node energy balance, prolonging survival time and optimal path

Active Publication Date: 2018-06-12
CHINA UNITED NETWORK COMM GRP CO LTD
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The currently commonly used routing method based on ant colony algorithm cannot satisfy node energy balance and path optimization at the same time, or cannot consider node energy when pheromone is updated, that is, it cannot maximize the survival time of the network

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
  • Routing selection method and system
  • Routing selection method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0039] figure 1 A schematic flowchart of a routing selection method provided in Embodiment 1, as shown in figure 1 As shown, the method includes the following steps:

[0040] Step 101, the ants arrive at the intermediate node along the forward path.

[0041] Step 102, the ant judges whether it has been to the intermediate node according to the routing table corresponding to the forward path, if not, execute step 103; if yes, the process ends.

[0042] Step 103 , calculating the transition probability according to the pre-acquired pheromones between node links and node centrality heuristic values.

[0043] Step 104, the ant selects a next-hop node according to the transition probability.

[0044] In the routing selection method provided in this embodiment, the ants arrive at the intermediate node along the forward path and judge whether they have come to the intermediate node according to the routing table corresponding to the forward path. If it is judged that they will pas...

Embodiment 2

[0046] figure 2 A schematic flowchart of a routing selection method provided in Embodiment 2, such as figure 2 As shown, the method includes:

[0047] Step 201, generate an initialization network, the initialization network includes a source node, a destination node and a plurality of intermediate nodes between the source node and the destination node, the source node is provided with a plurality of ants, and the plurality of ants have Same initial pheromone and energy initial value.

[0048] Preferably, each step in this embodiment is executed by a routing system.

[0049] There are multiple intermediate nodes between the source node and the destination node of the initialization network, and multiple ants are placed at the source node, and the ants can reach the destination node from the source node through the intermediate node along various paths. In order to ensure the comparability of multiple paths formed by multiple ants from the source node to the destination nod...

Embodiment 3

[0079] Not shown in the figure, this embodiment provides a routing system, which includes: a plurality of ants 1 and a computing module 2 .

[0080] Ant 1 is used to reach the intermediate node along the forward path, judge whether it has been to the intermediate node according to the routing table corresponding to the forward path, and select the next-hop node according to the transition probability.

[0081] The calculation module 2 is used to calculate the transition probability according to the pre-acquired pheromone between node links and the heuristic value of node centrality if the ant judges that it will pass the intermediate node in the future.

[0082] Further, it also includes: a generation module 3 .

[0083] Generating module 3 is used for generating initialization network, and described initialization network comprises source node, destination node and a plurality of intermediate nodes that are arranged between source node and destination node, and described sour...

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 routing selection method and system. The method comprises the steps that ant reach an intermediate node along a forward path and judge whether or not ever been to the intermediate node according to a routing table corresponding to the forward path; if the ants judge that the ants do not ever been to the intermediate node, the transition probability is calculated accordingto a pre-acquired information element and node centrality heuristic value of a link between nodes; and the ants select a next-hop node according to the transition probability. According to the routing selection method and system, node energy balancing and path optimization during routing selection can be met simultaneously, and the life time of a network is prolonged maximally.

Description

technical field [0001] The invention relates to the technical field of wireless networks, in particular to a routing selection method and system. Background technique [0002] In a wireless network, the main goal of routing protocol design is to avoid network congestion and provide QoS (Quality of Service, Quality of Service) for the network. In wireless sensor networks, due to the limitation of node energy, its routing protocol design needs to start from the perspective of energy saving. On the one hand, it can reduce the energy consumption of the network as much as possible, and on the other hand, it can balance the energy of the whole network, thereby prolonging the survival of the network. time. [0003] Network routing has the characteristics of distributed computing, random dynamics, and asynchronous network status updates. These features match those of the ant colony algorithm, so the ant colony algorithm can be used to solve the routing problem of wireless sensor ne...

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/10H04W40/24
CPCH04W40/10H04W40/248
Inventor 程刚王源野
Owner CHINA UNITED NETWORK COMM GRP CO LTD
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