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

Method for finding optimal path for Adhoc network based on improved genetic-ant colony algorithm

An ant colony algorithm and optimal path technology, applied in network topology, advanced technology, electrical components, etc., can solve the problem that the local optimal solution cannot reach the global optimal

Inactive Publication Date: 2015-05-13
CHONGQING UNIV OF POSTS & TELECOMM
View PDF2 Cites 48 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] In the process of finding the optimal path, the basic ant colony algorithm is easy to fall into the local optimal solution and cannot achieve the global optimal effect.

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
  • Method for finding optimal path for Adhoc network based on improved genetic-ant colony algorithm
  • Method for finding optimal path for Adhoc network based on improved genetic-ant colony algorithm
  • Method for finding optimal path for Adhoc network based on improved genetic-ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] A non-limiting embodiment is given below in conjunction with the accompanying drawings to further illustrate the present invention. It should be understood, however, that these descriptions are exemplary only, and are not intended to limit the scope of the invention. Also, in the following description, descriptions of well-known structures and techniques are omitted to avoid unnecessarily obscuring the concept of the present invention.

[0040] The AODV routing process based on the improved genetic-ant colony algorithm provided by the present invention comprises the following algorithm steps:

[0041] Step 1: Encoding the chromosomes in the genetic algorithm, population initialization, fitness function, and genetic operations to obtain the distribution of the initial pheromone in the ant colony algorithm;

[0042] Step 2: Select an appropriate judgment function, make appropriate judgments on the timing conversion of the two algorithms, and avoid the algorithm from fall...

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 method for finding an optimal path for an AODV (ad hoc on-demand distance vector) protocol in an Adhoc (self-organized) network based on an improved genetic-ant colony algorithm. Due to continuous changes of an Adhoc network topological structure, the performances of an existing routing protocol are very difficult to meet the needs of the network. In order to overcome the defects of being low in convergence rate, long in searching time, easy to get in locally optimal solution and incapable of reaching global optimum of a normal routing algorithm, the invention provides a method for finding an optimal path for an AODV protocol by taking the improved genetic-ant colony algorithm (IGAACA) as a core. The method comprises the following steps: firstly, finding a relatively optimal solution by utilizing global searching ability of a genetic algorithm; then, converting the relatively optimal solution into an initial information element of the colony algorithm; finally, adopting the advantage of quick converge of the colony algorithm, finding the routing global optimal solution. The algorithm can be adopted to quickly and effectively find the optical path, so that the network performances are improved.

Description

technical field [0001] The invention relates to the field of routing protocols in Adhoc networks, in particular to a method for finding an optimal path based on an improved genetic-ant colony algorithm AODV (ad hoc network on-demand distance vector routing) routing protocol. Background technique [0002] There is no fixed infrastructure in the Adhoc network. Due to the dynamic changes of the network topology, finding a routing protocol that can effectively and quickly find the optimal path between nodes becomes the key to the design of the Adhoc network routing protocol. In addition, the Adhoc network can quickly form a network, and it can well complete the communication task in the wild or in an environment that is not suitable for establishing a fixed infrastructure. It has attracted more and more attention in the civilian field and has a very broad application prospect. [0003] In the process of finding the optimal path, the basic ant colony algorithm is easy to fall int...

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 Applications(China)
IPC IPC(8): H04W40/04H04W84/18
CPCH04W40/04H04W84/18Y02D30/70
Inventor 唐宏郭彦芳薛真真王惠珠舒红
Owner CHONGQING UNIV OF POSTS & TELECOMM
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