Wireless self-networking system and routing method thereof

A wireless ad hoc network and routing technology, applied in wireless communication, network topology, electrical components, etc., can solve the problems of small routing overhead, short service establishment delay, and prolongation of service establishment, so as to reduce routing overhead and route establishment The effect of shortening the time

Inactive Publication Date: 2016-04-20
BEIJING XINWEI TELECOM TECH
View PDF2 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Common routing technologies include AODV (AdhocOnDemandDistanceVector), DSR (DynamicSourceRouting), DSDV (DestinationSequencedDistanceVector), OLSR (OptimizedLinkStateRouting), etc. AODV and DSR are on-demand routing. When there is a data sending request and there is no route in the query routing table, it will initiate For routing requests, the routing overhead is small, but the service establishment delay is long; DSDV and OLSR are active routes, nodes need to broadcast routing messages periodically, so that each node can maintain its own routing table, and can directly Query the routing table for sending, which has a short service establishment delay, but the routing ov...

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
  • Wireless self-networking system and routing method thereof
  • Wireless self-networking system and routing method thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] Embodiment 1: Adjacent node information broadcast and local routing table establishment

[0047] It is set that each node in the network broadcasts its neighbor node information to each other, then each node can know its one-hop neighbor and two neighbors by receiving the broadcast message of the neighbor node, so as to establish a local routing table, the routing table contains one-hop node and two-hop node information. In this way, addressing for routes within two hops can be done by looking up the local routing table, without requiring higher layers to initiate routing requests, thereby shortening the time for link establishment within two hops and avoiding routing overhead.

[0048] In order to reduce the signaling overhead caused by routing search, the transit nodes of routing messages are defined in the network. After receiving routing messages, such nodes will forward them if they judge that the number of hops propagated by routing messages does not exceed the ma...

Embodiment 2

[0050] Example 2: Selection of transit nodes

[0051] Assume that the set of one-hop neighbors of node x is S1, the set of two-hop neighbors is S2, where S2 does not contain node x itself, and does not contain all the elements in S1; the set of transit nodes is S3. Define D(s), s∈S1, is the degree of connectivity of node s, which means the number of symmetric nodes other than S1 of node s. Symmetric nodes mean that the link between two nodes is bidirectional. Define C(s), s∈S1, as the link metric value (LinkMetric) of node s, which represents the link metric value of the link between node x and node s, and the link metric value is used as the weight to evaluate each link , which can represent the link attainable rate or link quality, etc.

[0052] Please refer to the attached figure 1 , the selection method of the transit node of node x is as follows:

[0053] Step 1: Calculate D(s) of each node in S1;

[0054] Step 2: Find the node in S1 that provides the only reachable l...

Embodiment 3

[0060] Embodiment 3: Route lookup within two hops

[0061] The steps to find a route within two hops are as follows:

[0062] Step 1: Add each symmetric neighbor as a 1-hop neighbor to the routing table by receiving broadcast messages from neighbor nodes;

[0063] Step 2: Add the non-1-hop symmetric node as a 2-hop neighbor to the routing table through the received neighbor list message broadcast by the neighbor node;

[0064] The one-hop and two-hop neighbors of each node can be determined by the above two steps, and the routing table is updated by receiving broadcast messages continuously. When a node needs to communicate with neighbors within two hops, it can directly query the stored routing table and send it.

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 wireless self-networking system. All nodes of the system mutually broadcast information of adjacent nodes and local routing tables are maintained according to the received broadcast information of the adjacent nodes. Each of the local routing tables comprises a one-jumping node and a two-jumping node of the corresponding node. Each of the nodes selects and maintains own transferring node according to received broadcast information and informs the transferring node. Route information is transmitted by the transferring nodes. If each node communicates with the corresponding two-jumping node or the corresponding one-jumping node, routing is directly carried out according to the local routing tables. If each node communicates with a more-than-two-jumping node, on-demand routing searching is carried out. According to the invention, route setup can be reduced and route cost is reduced.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a wireless ad hoc network system and a routing method thereof. Background technique [0002] Routing technology is a very critical technology in the Ad Hoc network, which is very important to the efficiency of data forwarding, delay and the performance of the entire system. Common routing technologies include AODV (AdhocOnDemandDistanceVector), DSR (DynamicSourceRouting), DSDV (DestinationSequencedDistanceVector), OLSR (OptimizedLinkStateRouting), etc. AODV and DSR are on-demand routing. When there is a data sending request and there is no route in the query routing table, it will initiate For routing requests, the routing overhead is small, but the service establishment delay is long; DSDV and OLSR are active routes, nodes need to broadcast routing messages periodically, so that each node can maintain its own routing table, and can directly Querying the routing table for s...

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/26H04W84/18
Inventor 董付现孙鹏施钱宝
Owner BEIJING XINWEI TELECOM TECH
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