Distributed self-organising dynamic route method based on ant algorithm

An ant algorithm, distributed technology, applied in the direction of data exchange, electrical components, transmission systems, etc. through path configuration, can solve problems such as congestion, shortcut problems, and convergence speed problems

Inactive Publication Date: 2005-07-20
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF0 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to provide a kind of distributed ad hoc network dynamic routing method based on ant algorithm, adopt the method of the present invention to improve the convergence speed problem of the routing method based on ant algorithm in ad hoc network, reduce the

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 self-organising dynamic route method based on ant algorithm
  • Distributed self-organising dynamic route method based on ant algorithm
  • Distributed self-organising dynamic route method based on ant algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0059] A specific implementation method of this patent in a wireless ad hoc network is given below.

[0060] The routing table of each node in the wireless ad hoc network adopts a pheromone table, and each item in the pheromone is a pheromone probability value. There is an entry in the pheromone table of each node corresponding to each possible destination node. In a wireless ad hoc network with 30 nodes, the pheromone table of each node has 29 entries, and the number of elements in each entry is equal to the number of neighbor nodes of the node. If a node has 4 neighbor nodes, each of the 29 pheromone entries of this node has 4 elements. According to the method of the present invention, the value of each element in the pheromone entry is refreshed, and the routing is discovered and maintained. The steps in the method of the present invention can be realized by programming. The transmission of data in the network selects the corresponding route from the source node to the de...

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 an ant algorithm-based distributed self-network dynamic-routing method, comprises the courses of route finding and route maintaining. The route finding course is completed by both forward ant packet and backward ant packet, where the forward ant packet takes charge of establishing a path back to the source node and the backward ant packet takes charge of establishing a path to the destination node; each middle node implements distributed treatment of jamming problem, chain breaking problem and shortcut problem in the data transmitting course in the route maintaining stage. The method can reduce added expenses and makes network loads trend to balance and reduces end-end delay time for packet transmission.

Description

technical field [0001] The present invention belongs to the field of ad hoc network technology, such as wireless ad hoc network, sensor network, wireless local area network, wireless access, etc., and especially relates to the routing technology of wireless ad hoc Internet. Background technique [0002] Ad hoc network is a combination of mobile communication and computer network. The terminal nodes in the network can move freely in the network, and the network topology changes frequently. Portable mobile nodes usually rely on batteries to provide energy, and the transmission power is limited. Sometimes multi-hop forwarding is required to realize communication. Each user node has both router and terminal functions. Nodes need to run various user-oriented applications and corresponding routing protocols, and complete data packet forwarding and routing maintenance according to routing policies and routing tables, so nodes are required to adopt appropriate routing protocols. Th...

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): H04L12/28H04L45/17H04L45/24
Inventor 郑相全郭伟毛玉明余敬东苏俭
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
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