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

Forwarding history-based asynchronous rooting algorithm

A routing and algorithmic technology, applied in digital transmission systems, electrical components, transmission systems, etc.

Inactive Publication Date: 2010-03-17
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF0 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] These methods consider the asynchronous routing problem in wireless ad hoc network from different angles, but these methods all have certain problems in some aspects

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
  • Forwarding history-based asynchronous rooting algorithm
  • Forwarding history-based asynchronous rooting algorithm
  • Forwarding history-based asynchronous rooting algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0032] Intermittently disconnected networks are usually modeled as a series of mobility nodes. Each node can search for other nodes within the communication range and establish connections. Nodes have certain message buffering capabilities and limited bandwidth. When two nodes come within communication range of each other, a connection is established and group messages are sent to each other. In transmission, the sender does not delete its own packet copy after sending a packet to the receiver. Nodes can send packets to destination nodes directly or through other intermediate nodes. Assuming the destination node has enough space to store received messages, only packets in transit are limited by the limited storage space. Intermittent disconnection The communication between nodes in the network will last for a much shorter time than the disconnection b...

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 provides a forwarding history-based asynchronous rooting algorithm, which belongs to technical field of wireless networks and routing. The routing algorithm comprises the following threeparts: (1) a relay selection algorithm; (2) a packet transmission algorithm; and (3) a routing information updating algorithm. The relay selection algorithm is executed when a node is ready for sending packets or serves as a relay node which receives messages, and the relay selection algorithm selects a better next hop relay for the packets. The packet transmission algorithm is executed when twonodes obtain a communication opportunity, and is used for transmitting the packets. The routing information updating algorithm is executed after the node receives feedback information and is used forupdating a routing information list. The asynchronous rooting algorithm completely solves the routing problems in a wireless self-organization network from an asynchronous point, makes a routing decision intelligently by using history information forwarded in packets, uses part of better nodes as relay nodes carrying the packets, improves the reliability and the validity of the information transfer in a limited network, and greatly reduces the information loss rate and unnecessary information retransmissions.

Description

technical field [0001] The invention relates to the field of wireless network and routing technology, in particular to an asynchronous routing algorithm, which is suitable for information transmission in intermittently connected wireless networks. Background technique [0002] Wireless ad-hoc network (MANET, Mobile Ad-hoc Network) is a typical distributed network model, which poses many challenges to the mutual communication between nodes. A large number of algorithms have been proposed for the routing problem of wireless ad hoc networks. In order to simplify the research problem, most scholars' research is based on the assumption that only the communication between nodes in the same cloud graph that is connected to each other is meaningful, that is, the communication is all synchronous. However, this assumption is increasingly broken in practical applications. In practice, it may be necessary to communicate in different connection cloud graphs, or due to some reasons in a ...

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/56H04W40/02H04W40/24
Inventor 樊秀梅陈辉
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
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