CN116566887A - Method and system for realizing Ad hoc network link protocol based on block chain - Google Patents

Method and system for realizing Ad hoc network link protocol based on block chain Download PDF

Info

Publication number
CN116566887A
CN116566887A CN202310554738.1A CN202310554738A CN116566887A CN 116566887 A CN116566887 A CN 116566887A CN 202310554738 A CN202310554738 A CN 202310554738A CN 116566887 A CN116566887 A CN 116566887A
Authority
CN
China
Prior art keywords
routing
node
routing table
blockchain
hoc network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310554738.1A
Other languages
Chinese (zh)
Inventor
李朝春
刘扬
刘少伟
陈慧琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
716th Research Institute of CSIC
Original Assignee
716th Research Institute of CSIC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 716th Research Institute of CSIC filed Critical 716th Research Institute of CSIC
Priority to CN202310554738.1A priority Critical patent/CN116566887A/en
Publication of CN116566887A publication Critical patent/CN116566887A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46—Secure multiparty computation, e.g. millionaire problem
    • H04L2209/463—Electronic voting
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a method and a system for realizing an ad hoc network link protocol based on a block chain, wherein the method comprises the following steps: adding all routing nodes in the ad hoc network into a blockchain and forming on-chain nodes; when a certain routing node hopes the network topology structure to be transformed, the routing node sends a request to a master node or triggers an intelligent contract; the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1; each routing node adjusts the position of the routing node according to the consensus result, and operates a non-block chain part in the routing protocol to obtain a routing table 2; each routing node updates the local routing table according to routing table 2. The routing protocol of the invention realizes the switching of network topology based on the blockchain technology, and still has better link quality stability under the scene of high dynamic topology structure change, thereby obviously improving the network efficiency.

Description

Method and system for realizing Ad hoc network link protocol based on block chain
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a method and a system for realizing an ad hoc network link protocol based on a block chain.
Background
In unmanned clustered ad hoc networks, links between nodes of a mobile ad hoc network may frequently change due to their special properties, resulting in unstable link quality. In this case, the existing routing protocol may have problems such as routing jitter or routing loops, which may cause degradation of network performance. In order to improve the stability of a route discovery path, the prior art proposes a method for evaluating the life cycle of the path by taking the link remaining time and the route remaining time as standards in the route discovery process. However, the method is mainly applicable to the on-demand planar distance vector routing protocol of the wireless ad hoc network, and has limited improvement on network stability. The blockchain technology has the characteristics of decentralization, data tamper resistance, unmanned autonomy and the like, and therefore, has been widely used. The block chain technology is integrated into the link layer of the ad hoc network, and an accurate link table can be obtained in real time, so that the stability of the link quality is further improved, the network efficiency is improved, and certain autonomous capability is given to the network.
Disclosure of Invention
The invention aims to provide an ad hoc network link protocol method and system based on a block chain, which effectively improve the stability of link quality and improve the network transmission efficiency.
The technical solution for realizing the purpose of the invention is as follows: in one aspect, a method for implementing an ad hoc network link protocol based on a blockchain is provided, the method comprising the steps of:
adding all routing nodes in the ad hoc network into a blockchain and forming on-chain nodes;
when a certain routing node hopes the network topology structure to be transformed, the routing node sends a request to a master node or triggers an intelligent contract;
the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1;
each routing node adjusts the position of the routing node according to the consensus result, and operates a non-block chain part in the routing protocol to obtain a routing table 2;
each routing node updates the local routing table according to routing table 2.
Further, when the network topology is changed, the message transmission is performed simultaneously according to the routing tables before and after switching.
Further, the master node is: and scoring the routing nodes according to the reliability index, and taking the routing node with the highest score as a main node.
Further, the reliability index comprises three parts of hardware configuration, role level and security level.
Further, the method further comprises:
the routing node compares the routing table 1 with the routing table 2, judges whether the routing table 1 and the routing table 2 have differences, and records the routing node with the differences.
Further, the method further comprises:
if the routing table 1 and the routing table 2 are different, continuing to perform the routing detection for n times;
after n times of detection, if the routing table 2 is consistent with the routing table 1, ending; otherwise, eliminating the routing nodes forming the difference of the two tables until the two tables are consistent;
and recording the influence times of the routing nodes with the differences, and taking the influence times as influence factors of the scores of the subsequent routing nodes.
In another aspect, a system for implementing a blockchain-based ad hoc network link protocol is provided, the system comprising:
the block chain building module is used for realizing: adding all routing nodes in the ad hoc network into a blockchain and forming on-chain nodes;
a network topology switching initiation module, configured to implement: when a certain routing node hopes the network topology structure to be transformed, sending a request or triggering an intelligent contract to a main node;
the blockchain is obtained by a module in table 1 for realizing: the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1;
a routing table 2 obtaining module, configured to implement: each routing node adjusts the position of the routing node according to the consensus result, and operates a non-block chain part in the routing protocol to obtain a routing table 2;
the local routing table updating module is used for realizing: the routing node updates the local routing table according to routing table 2.
Further, the system further comprises:
the routing table comparison module is used for realizing: the routing node compares the routing table 1 with the routing table 2, judges whether the routing table 1 and the routing table 2 have differences, and records the routing node with the differences.
Further, the system further comprises:
the routing table correction module is used for realizing: if the routing table 1 and the routing table 2 have the difference, continuing to route detection for n times; after n times of detection, if the routing table 2 is consistent with the routing table 1, ending; otherwise, eliminating the routing nodes forming the difference of the two tables until the two tables are consistent.
Compared with the prior art, the invention has the remarkable advantages that: the routing protocol of the invention realizes dynamic adjustment of network topology based on the blockchain technology, and can keep better link quality stability under the highly dynamic topology structure change scene, thereby improving network efficiency. Conventional routing protocols may not be adaptable in this case because they require constant updating of static routing tables to determine paths, which can lead to network delays and wasted bandwidth. The routing protocol of the invention can dynamically adjust network topology and ensure stability of link quality by utilizing a blockchain technology to record all nodes in a network and connection relations among the nodes and calculate an optimal path. This will help to improve network efficiency and reduce network delay and bandwidth wastage.
The invention is described in further detail below with reference to the accompanying drawings.
Drawings
FIG. 1 is a flow diagram of a method of implementing a blockchain-based ad hoc network link protocol in one embodiment.
FIG. 2 is a schematic diagram of an ad hoc network system in one embodiment.
Fig. 3 is a schematic diagram of an ad hoc network packet in one embodiment.
FIG. 4 is a diagram of a REQUEST message in one embodiment.
Fig. 5 is a schematic diagram of a pre_prepare message in one embodiment.
Fig. 6 is a schematic diagram of a PREPARE message in one embodiment.
FIG. 7 is a schematic diagram of a COMMIT message in one embodiment.
Fig. 8 is a schematic diagram of a REPLY message in one embodiment.
Fig. 9 is a diagram of network topology switching in one embodiment.
FIG. 10 is a block chain structure diagram of one embodiment.
FIG. 11 is a reliability scoring representation intent in one embodiment.
Fig. 12 is a diagram of a network topology and routing table representation intent in one embodiment.
FIG. 13 is a schematic diagram of routing table generation in one embodiment.
FIG. 14 is a diagram of an implementation system architecture of a blockchain-based ad hoc network link protocol in one embodiment.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In one embodiment, in conjunction with fig. 1, there is provided a method for implementing a blockchain-based ad hoc network link protocol, including the following steps (a) to (e):
step (a): all routing nodes in the ad hoc network join the blockchain and become on-chain nodes.
As shown in fig. 2, 10 raspberry derivatives form an ad hoc network, and the network topology is a star architecture. The link protocol running locally is the blockchain ad hoc network routing protocol (Blockchain Based Ad Hoc Network Routing Protocol, BAHR).In this embodiment, the routing protocol is modified based on an optimized link state routing protocol (Optimized Link State Routing Protocol, OLSR). BAHR has 9 MESSAGE types in total, wherein 4 MESSAGE types (HELLO_MESSAGE, TC_MESSAGE, MID_MESSAGE and HNA_MESSAGE) related to routing inherit OLSR, and 5 MESSAGE types related to blockchain are newly added, namely REQUEST REQUEST, PRE_PREPARE preparation, PREPARE preparation, COMMIT submission and REPLY REPLY, so that transmission of consensus MESSAGEs is realized. As shown in fig. 3, the REQUEST message<<REQUEST,o,t,c>Φ c >Mainly comprises an operation o, a time stamp t, a request node c and a request node signature phi c These 4 parts of content; as shown in fig. 4, the pre_prepare message<<PRE_PREPARE,v,n,d>,m,Φ p >Mainly comprises a view number v, a sequence number n, a message digest d, original message data m and a master node signature phi p These 5 parts of content; as shown in fig. 5, PREPARE message<<PREPARE,v,n,d,i>Φ i >Mainly comprises a view number v, a sequence number n, a message digest d, the identity of the current node i and a node i signature phi i These 5 parts of content; as shown in FIG. 6, a COMMIT message<<COMMIT,v,n,d,i>Φ i >Mainly comprises a view number v, a sequence number n, a message digest d, the identity of the current node i and a node i signature phi i These 5 parts of content; as shown in fig. 7, REPLY information<<REPLY,v,t,c,i,r>Φ p >Mainly comprises a view number v, a time stamp t, an initiator c and a master node signature phi p The identity of the current node i and the reply 6 part of content of the node i; ANSN, reserved is a parameter inherent in the routing message.
The Packet transmitted between routes, as shown in fig. 8, includes 3 parts of a Packet Header (Packet Header), a Message Header (Message Header), and a Message content (Message). Wherein, the data Packet header uses the data Packet header of the OLSR, defining the message Length (Packet Length) and the message sequence number (Packet Sequence Number); the Message header uses the Message header of the OLSR, and defines a Message Type (Message Type), a valid Time (Vtime) of the Message after the node receives the Message, a byte length (Message Size) of the Message, an address (Originator Address) of the node generating the Message, a maximum Hop Count (Time To Live), a current Hop Count (Hop Count) and a sequence number (Message Sequence Number) of the Message, wherein the Message Type is newly added with 5 Message types related To the blockchain; the message content is newly added with 5 kinds of message content related to blockchain on the basis of OLSR. These 5 messages related to the blockchain are broadcast and retransmitted by means of multiple relay dependency nodes (Multipoint Relays Selector Set, MPRs), and the messaging is in accordance with the default transmission protocol (defaultforward algorithm) of section 3.4 in OLSR protocol.
As shown in fig. 9, the 10 (3f+1, f=3) raspberry groups will also deploy blockchains, which are the coalition chains of the super ledger fabric. In the initialization process, the first transaction on the chain is generated, namely, the current network architecture is a star network architecture (SET top= "star"), the transaction is packed into a block to form a generation block (generation), and the block is uplink; the corresponding transaction results are recorded in the ledger, i.e. the network architecture is a star-like architecture (key=top, value= "star").
In this example, the ad hoc network topology composed of raspberry groups is initialized to a star architecture. Network topology in addition to star architecture, the system may also be defined as a ring architecture, mesh architecture, etc. to accommodate varying network topologies.
Step (b): when a routing node wishes to change the network topology, it sends a request to the master node or triggers a smart contract.
As shown in fig. 10, the node B considers that the current network topology is not suitable for the current network condition, and needs to switch to the mesh network topology. Node B initiates a consensus REQUEST message to node a (the master node, typically served by the node with the highest reliability value in the network, or designated by the system).
The reliability scoring of the nodes in the network is performed according to fig. 11, and the reliability index mainly comprises three parts of hardware configuration, role level and security level, and is 100 points full. The hardware configuration comprises a signal transmitting frequency band, a battery capacity, a communication time delay and a GPS position 4 part; the security level comprises a key level and an error number 2 part; wherein the error times are reduced terms.
Step (c): the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1.
Node a, upon receiving a request from node B, sends a pre_prepare message to the other nodes to initiate consensus on the network.
After receiving the PRE_PREPARE message, the node i sends a PREPARE message to other nodes if the PRE_PREPARE message agrees with the request; when node i receives the correct 2f (f=3) PREPARE message (including itself), it broadcasts the COMMIT message outwards; when node i receives 2f (f=3) COMMIT messages from other consensus nodes, and verifies that the v, n and d data of the COMMIT messages are consistent with v, n and d data of the own COMMIT messages, determining that most nodes are ready to execute a request, executing the request, packaging data of a 'network TOPOLOGY switch' transaction (SET TOPOLOGY= 'mesh') into blocks, uploading the blocks, and updating the latest routing TOPOLOGY (key=TOPOLOGY, value= 'mesh') in a world state; according to the route topology, the lookup table obtains a block chain based route table 1. As shown in fig. 12, the routing table design continues the OLSR routing table format, and each row includes a destination node address (r_dest_addr), a scare-hop interface address (r_next_addr), a hop count (r_dist) from the local node to the destination node, and a local interface address (r_iface_addr) value. After the look-up table is completed, the node returns REPLY information to the initiator c (node B). If the initiator is to obtain f+1 (f=3) reply messages, then the request response execution is considered successful.
Step (d): and each routing node adjusts the position of the routing node according to the consensus result and operates a non-block chain part in the routing protocol to acquire the routing table 2.
If the consensus agrees with the network topology handover request by the node B, the current location is adjusted according to the new network topology (mesh network topology). As shown in the figure, the relative positions of the node A, the node B, the node D, the node F and the node H are unchanged, and the other nodes are correspondingly adjusted according to the change of the diagram. If the consensus result does not agree with the node B request, the current network topology remains unchanged and the relative positions of all nodes remain unchanged without performing the following steps.
After the time set by the system, the relative position of each node is switched from the position in the original star topology to the current mesh topology position. Each node will perform network topology detection and send hello_message, tc_message, and mid_message to obtain the current real routing table 2, as shown in fig. 13.
Step (e): each routing node updates the local routing table according to routing table 2.
The local routing table is based on the routing table 2 obtained by the route probing. If there is a difference between the routing table 1 and the routing table 2 formed by the blockchain consensus, the route probing is continued 3 times. After 3 times of detection, if the routing table 2 is consistent with the routing table 1, ending; otherwise, eliminating the abnormal node forming the difference of the two tables until the two tables are consistent. And recording nodes causing the difference of the routing tables and the influence times of the nodes, and applying the nodes to the reliability scoring of the later nodes.
When the ad hoc network is switched to the ad hoc network topology, namely, in the steps b to e, message transmission is carried out simultaneously according to a local routing table before switching and a routing table 1 which is commonly known by a block chain after switching.
Referring to fig. 14, fig. 14 is a schematic structural diagram of a system of a block chain-based ad hoc network routing protocol according to an embodiment of the present invention. The embodiment of the invention also provides a block chain-based ad hoc network routing protocol system, which comprises:
a blockchain construction module 10, configured to add each routing node in the ad hoc network to a blockchain;
a network topology switching initiation module 20, configured to initiate a request for a network topology to be transformed;
the blockchain routing table 1 obtaining module 30 is configured to obtain a final consensus result and a routing table 1;
a routing table 2 obtaining module 40, configured to obtain routing table 2;
the local routing table updating module 50 is configured to update a local routing table.
The routing table comparison module is used for obtaining the routing nodes with the differences.
For specific limitations regarding the blockchain-based ad hoc link protocol implementation system, reference may be made to the above limitation regarding the blockchain-based ad hoc link protocol implementation method, and the detailed description thereof will be omitted herein. The modules in the block chain based ad hoc network link protocol implementation system may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
Compared with the existing routing protocol, the invention is beneficial to realizing accurate switching of network topology by using the blockchain technology; before and after network topology switching, a clear routing table can be used in the network; in network topology switching, a relatively suitable routing table can be used for reference in a network; and finally, the stability of the link quality is improved, and the transmission efficiency and the autonomous motility of the network are improved.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims (9)

1. The method for realizing the Ad hoc network link protocol based on the blockchain is characterized by comprising the following steps:
adding all routing nodes in the ad hoc network into a blockchain and forming on-chain nodes;
when a certain routing node hopes the network topology structure to be transformed, the routing node sends a request to a master node or triggers an intelligent contract;
the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1;
each routing node adjusts the position of the routing node according to the consensus result, and operates a non-block chain part in the routing protocol to obtain a routing table 2;
each routing node updates the local routing table according to routing table 2.
2. The method for implementing a blockchain-based ad hoc network link protocol according to claim 1, wherein when the network topology is transformed, the message passing is performed simultaneously according to the routing tables before and after the switching.
3. The method for implementing a blockchain-based ad hoc network link protocol according to claim 1, wherein the master node is: and scoring the routing nodes according to the reliability index, and taking the routing node with the highest score as a main node.
4. The method for implementing a blockchain-based ad hoc network link protocol of claim 3, wherein the reliability index includes three parts of a hardware configuration, a role level, and a security level.
5. The method for implementing a blockchain-based ad hoc network link protocol of claim 1, further comprising:
the routing node compares the routing table 1 with the routing table 2, judges whether the routing table 1 and the routing table 2 have differences, and records the routing node with the differences.
6. The method for implementing a blockchain-based ad hoc network link protocol of claim 5, further comprising:
if the routing table 1 and the routing table 2 are different, continuing to perform the routing detection for n times;
after n times of detection, if the routing table 2 is consistent with the routing table 1, ending; otherwise, eliminating the routing nodes forming the difference of the two tables until the two tables are consistent;
and recording the influence times of the routing nodes with the differences, and taking the influence times as influence factors of the scores of the subsequent routing nodes.
7. A blockchain-based ad hoc network link protocol implementation system based on the method of any of claims 1 to 6, characterized in that the system comprises:
the block chain building module is used for realizing: adding all routing nodes in the ad hoc network into a blockchain and forming on-chain nodes;
a network topology switching initiation module, configured to implement: when a certain routing node hopes the network topology structure to be transformed, sending a request or triggering an intelligent contract to a main node;
the blockchain is obtained by a module in table 1 for realizing: the master node or the intelligent node initiates node consensus on the network, and each routing node performs consensus voting and acquires a final consensus result and a routing table 1;
a routing table 2 obtaining module, configured to implement: each routing node adjusts the position of the routing node according to the consensus result, and operates a non-block chain part in the routing protocol to obtain a routing table 2;
the local routing table updating module is used for realizing: the routing node updates the local routing table according to routing table 2.
8. The blockchain-based ad hoc network link protocol implementation system of claim 7, further comprising:
the routing table comparison module is used for realizing: the routing node compares the routing table 1 with the routing table 2, judges whether the routing table 1 and the routing table 2 have differences, and records the routing node with the differences.
9. The blockchain-based ad hoc network link protocol implementation system of claim 8, further comprising:
the routing table correction module is used for realizing: if the routing table 1 and the routing table 2 have the difference, continuing to route detection for n times; after n times of detection, if the routing table 2 is consistent with the routing table 1, ending; otherwise, eliminating the routing nodes forming the difference of the two tables until the two tables are consistent.
CN202310554738.1A 2023-05-17 2023-05-17 Method and system for realizing Ad hoc network link protocol based on block chain Pending CN116566887A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310554738.1A CN116566887A (en) 2023-05-17 2023-05-17 Method and system for realizing Ad hoc network link protocol based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310554738.1A CN116566887A (en) 2023-05-17 2023-05-17 Method and system for realizing Ad hoc network link protocol based on block chain

Publications (1)

Publication Number Publication Date
CN116566887A true CN116566887A (en) 2023-08-08

Family

ID=87494311

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310554738.1A Pending CN116566887A (en) 2023-05-17 2023-05-17 Method and system for realizing Ad hoc network link protocol based on block chain

Country Status (1)

Country Link
CN (1) CN116566887A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866899A (en) * 2023-09-04 2023-10-10 北京理工大学 Multi-node wireless ad hoc network communication method and device, electronic equipment and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866899A (en) * 2023-09-04 2023-10-10 北京理工大学 Multi-node wireless ad hoc network communication method and device, electronic equipment and storage medium
CN116866899B (en) * 2023-09-04 2023-11-28 北京理工大学 Multi-node wireless ad hoc network communication method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
CN111543080B (en) System and method for network topology management
US10075892B2 (en) Mobile device for use in a dynamic and stochastic asynchronously updated wireless ad-hoc network
US9871723B2 (en) Method and device for handling multi path connections
US20170005913A1 (en) Management of network routing domains in communication networks
US20060010249A1 (en) Restricted dissemination of topology information in a communication network
US10680939B2 (en) Hybrid flood-relaying and routing mesh networks
JPWO2003061220A1 (en) Routing method in mobile ad hoc network
CN102984781B (en) Neighbor node judgment method for wireless ad hoc network route
JP2947351B1 (en) Learning type wireless packet transfer method and wireless base station using the method
CN116566887A (en) Method and system for realizing Ad hoc network link protocol based on block chain
CN112637059A (en) Service routing method for cross-border service network
CN110809305A (en) Multi-node low-overhead wireless routing method
CN113645301A (en) Communication method and device
CN108075981B (en) Transmission method of link state data packet and routing node
CN103037436A (en) Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP)
WO2022012287A1 (en) Route optimization method, physical network device and computer-readable storage medium
CN110430088B (en) Method for discovering neighbor nodes and automatically establishing connection in NDN (named data networking)
Bergström et al. Routing designs for tactical heterogeneous cooperative broadcast networks
CN110995582A (en) BGP route reflector redundant network convergence realization method
JP2020031424A (en) Synchronizing unicast traffic
Pramod et al. Characterization of wireless mesh network performance in an experimental test bed
Ziane et al. Inductive routing based on dynamic end-to-end delay for mobile networks
US9451420B2 (en) Data processing method, in an ad hoc radio communication network, radio communication stations and corresponding computer programs
WO2023150974A1 (en) Iab donor device and transfer migration management method
Toh et al. The Cambridge Ad-Hoc Mobile Routing Protocol

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination