CN110691379A - Active routing communication method suitable for wireless ad hoc network - Google Patents
Active routing communication method suitable for wireless ad hoc network Download PDFInfo
- Publication number
- CN110691379A CN110691379A CN201910969814.9A CN201910969814A CN110691379A CN 110691379 A CN110691379 A CN 110691379A CN 201910969814 A CN201910969814 A CN 201910969814A CN 110691379 A CN110691379 A CN 110691379A
- Authority
- CN
- China
- Prior art keywords
- message
- routing protocol
- routing
- aggregation
- sent
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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 an active routing communication method suitable for a wireless ad hoc network, which comprises the following steps: each node in the ad hoc network periodically sends a routing protocol message; before sending the routing message, combining the topology data to the tail part of the routing protocol message, and adding the message to a routing protocol message buffer queue to wait for sending; after receiving the routing protocol message, for the routing protocol message needing to be forwarded, if a message to be sent exists, aggregating the routing protocol message needing to be forwarded into the message to be sent; the nodes split the message and then respectively process the split message, establish or update a local routing table, and newly add or update corresponding topology data. The invention combines the protocol message of the active routing protocol with the topological data; meanwhile, a plurality of routing protocol messages are sent in a polymerization mode, the sending times of the wireless ad hoc network broadcast packet are effectively reduced, the expenses of routing protocols and topology data transmission are reduced, and the utilization rate of a wireless channel is improved.
Description
Technical Field
The invention relates to the field of routing protocol communication, in particular to an active routing communication method suitable for a wireless ad hoc network.
Background
The wireless Ad Hoc network (Ad Hoc network) is a distributed network composed of a plurality of wireless communication devices, has the characteristics of no center, dynamic topology change, self organization, multi-hop routing and the like, and is flexible and convenient to construct and strong in survivability.
Wireless ad hoc networks typically use wireless transmission technology as a means of communication, and the physical characteristics of wireless channels make the network bandwidth of wireless ad hoc networks generally small.
The routing protocols of the existing wireless ad hoc network device are mainly divided into an active routing protocol and an on-demand routing protocol, wherein if the routing of a destination node is not achieved when a node sends data, the on-demand routing protocol needs to temporarily initiate a route discovery process, and the data can be sent out only after the route discovery is completed, which causes a certain delay, and the real-time performance cannot meet a certain requirement; all nodes of the active routing protocol periodically broadcast and send protocol messages so as to maintain routing information to all destination nodes.
The routing protocol messages and the topology data messages which are sent periodically are both small packets, and frequent sending of the small packets in the wireless ad hoc network can cause waste of channel resources, so that the overhead of the routing protocol and the topology demonstration system is high.
Disclosure of Invention
The invention aims to provide an active routing communication method suitable for a wireless ad hoc network, which is optimized in the aspects of sending and forwarding a routing protocol message and a topology data message aiming at the active routing, reduces the sending times of the routing protocol message and the topology data message, reduces the expenses of a routing protocol and a topology demonstration system, and improves the utilization rate of a wireless channel.
The object of the invention is achieved by the following steps:
s1, each node in the ad hoc network periodically sends a routing protocol message;
s2, before the node sends the routing message, initializing the routing message, obtaining the topology data of the node, combining the topology data to the tail of the routing protocol message, and then adding the combined routing protocol message to a routing protocol message buffer queue to wait for sending;
s3, after the node receives the routing protocol message of the neighbor node, for the routing protocol message to be forwarded, if the message to be sent exists in the routing protocol message buffer queue, the routing protocol message to be forwarded is aggregated into the message to be sent;
s4, after receiving the routing protocol message, the node splits the message and processes the message respectively, and establishes or updates a local routing table;
s5, obtaining the topology data at the tail of the routing protocol message, and adding or updating the topology data corresponding to the message source node in the global topology data.
Specifically, the routing protocol message includes the MAC address of the node, the effective lifetime TTL, the message serial number seqno, and the routing path transmission quality TQ; the topology data comprises MAC addresses from the node to all neighbor nodes, link quality and signal-to-noise ratio.
Specifically, in S4, after the node receives the routing protocol packet, if the routing protocol packet is formed by aggregating more than two routing protocol packets, the aggregated packet is split and then processed separately; otherwise, directly processing the routing protocol message; newly adding or updating the routing information of the node reaching the source node according to the received routing protocol message; in S5, according to the received routing protocol packet, obtaining topology data at the tail of the routing protocol packet, and adding the topology data to local global topology data; and respectively judging whether one or more split routing protocol messages need to be forwarded or not, and if so, performing aggregation transmission on the one or more split routing protocol messages and the messages to be sent in the routing protocol cache queue.
Specifically, a length field of topology data is added on the basis of an original routing protocol message format, each node in the wireless ad hoc network periodically sends the routing protocol message, after a cycle is completed, a routing protocol message to be sent in the next cycle is generated, when the routing protocol message is generated, according to a local one-hop neighbor table, information such as MAC addresses, link quality and signal-to-noise ratio of all nodes in the one-hop neighbor table is obtained and combined into a defined topology data format, a length value of the combined topology data is calculated, the length value is filled into the length field of the topology data, the topology data is added to the tail of the length field of the topology data, then the routing protocol message is added into a new aggregation message, and the sending time of the new aggregation message is set as: and the current time plus the routing protocol message sending PERIOD ROUTE _ PERIOD is cached in a routing protocol cache queue and waits to be sent.
Further, for the received routing protocol packet of the neighbor node, whether the routing protocol packet needs to be forwarded is determined according to the packet sequence number seqno and the lifetime field TTL, and if the routing protocol packet needs to be forwarded, whether an aggregation packet to be sent exists in a routing protocol cache queue of the node is searched:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
if yes, judging whether to aggregate the routing protocol message needing to be forwarded into an aggregate message to be sent according to the following steps:
the node acquires the sending time sendTime of the aggregation message to be sent, and judges whether currTime meets the conditions: currTime + maxAggrTime > sendTime:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the new aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
if yes, further acquiring the size aggreSize of the aggregation message to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the conditions: currSize + aggrSize < maxAggrSize:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the new aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
and if so, aggregating the message needing to be forwarded into the aggregated message to be sent.
Wherein the maximum aggregation time maxAggrTime: that is, for the received routing protocol message to be forwarded, the maximum time for delaying the sending after the aggregation is allowed; maximum aggregate size maxAggrSize: i.e. the maximum number of bytes of any aggregated message.
Further, for the received routing protocol aggregation packet, the aggregation packet is split into single routing protocol packets, and the single routing protocol packets are respectively processed:
if the routing table does not have routing information reaching the routing protocol message source node, a new route needs to be established;
if the routing information of the routing protocol message source node already exists in the routing table, updating the routing information;
further, a length field of topology data in the routing protocol message is obtained, topology data in the routing protocol message is obtained according to the length field, and a source address of the routing protocol message and the obtained topology data are added to the full-network topology information.
Compared with the prior art, the invention has the following technical effects: combining a protocol message of an active routing protocol with topology data; meanwhile, the combined routing protocol message and the routing protocol message to be forwarded are subjected to aggregation sending, so that the sending times of the wireless ad hoc network broadcast packet are effectively reduced, the expenses of routing protocol and topology data transmission are reduced, and the utilization rate of a wireless channel is improved.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a diagram illustrating a format of a routing protocol packet according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a topology data format according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a format of an aggregation packet of a routing protocol according to an embodiment of the present invention;
FIG. 5 is a flow chart of a routing protocol message aggregation performed in an embodiment of the present invention;
fig. 6 is a schematic diagram of a routing information table format in the embodiment of the present invention.
Detailed Description
The invention is further illustrated by the following figures and examples, which are not intended to limit the invention in any way, and any variations or modifications which are based on the teachings of the invention are intended to be within the scope of the invention.
Fig. 1 is a flow chart of the proactive routing communication method according to the present invention, and although each operation in the flow chart is described as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously.
The invention provides an active routing communication method suitable for a wireless ad hoc network, which comprises the following steps:
s1, each node in the ad hoc network periodically sends a routing protocol message; as shown in fig. 2, the format of the routing protocol packet includes a packet type, a lifetime, a packet sequence number, a source node MAC address, a path transmission quality, a topology data length, and topology data information.
Wherein, the message type is designated as a routing protocol message; the message survival time represents the maximum hop count of the message which can be forwarded in the network; the message serial number is a protocol message serial number maintained by the node, and the number is increased by 1 when a routing protocol message is sent; the source node MAC address is an MAC address distributed by the node, has uniqueness, and can uniquely identify each routing protocol message with a message serial number; the path transmission quality represents the path transmission quality of the arriving source node; the length of the topology data represents the length of the topology data carried by the message; the topology data is specific topology data and represents a local topology structure of the node represented by the source node MAC address.
The routing protocol message is used for informing other nodes in the network of existence of the routing protocol message, and the other nodes in the network construct routing information to the message source node according to the received routing protocol message, acquire local topology information of the message source node and the like.
S2, when generating a routing protocol message, acquiring MAC addresses, link quality and signal-to-noise ratio information of all neighbor nodes in a local one-hop neighbor table, combining the MAC addresses, the link quality and the signal-to-noise ratio information into a defined topology data format, calculating a length value of the combined topology data, wherein the topology data format is shown in figure 3, then filling the calculated length value of the topology data into a topology data length field of the routing protocol message shown in figure 2, and filling the combined topology data into the tail part of the topology data length field.
And sending out the message reaching the sending time in the routing protocol message buffer queue.
S3: for the received routing protocol message, acquiring a message sequence number field and a message survival time field in the message, and if the message is corresponding to the routing protocol message source node, only receiving the message which is older than the message sequence number before, and the message survival time field is more than 1, forwarding the routing protocol message.
The aggregated packet is called a routing protocol aggregated packet, and the format of the routing protocol aggregated packet is shown in fig. 4, and includes an aggregated frame buffer pointer, a total buffer length, an aggregated packet number, and a sending time.
Wherein the aggregation frame buffer pointer points to the first address of the aggregation frame buffer to be sent; the total buffer length represents the total length of data contained in the buffer after polymerization; the number of aggregation packets represents the number of packets contained in an aggregation frame; the transmission time indicates that the aggregation frame buffer is to be transmitted to the bottom layer at this time.
After a new routing protocol aggregation message is created, adding the generated routing protocol message into a buffer pointed by an aggregation frame buffer pointer of the aggregation message; setting the total buffer length as the length of the routing protocol message; setting the number of aggregation packets to 1; and setting the 'sending time' of the aggregated message as: the current time currTime + routing protocol message sending PERIOD ROUTE _ PERIOD is cached in the routing protocol cache queue for waiting to be sent.
Two parameters are first defined:
parameter 1: maximum aggregation time maxAggrTime: the maximum time of delaying sending after aggregation is allowed for the received routing protocol messages needing to be forwarded, and the value limits the time of local caching of the routing protocol messages needing to be forwarded, so that the maximum time of spreading the routing protocol messages to the whole network is limited, and the method has important significance for timely establishing or updating a routing table.
Parameter 2: maximum aggregate size maxAggrSize: i.e. the maximum value of the total buffer length of any aggregation message.
Traversing a local routing protocol cache queue, and searching whether an aggregate message to be sent exists:
if the message does not exist, generating a new routing protocol aggregation message, and filling the message to be forwarded into a buffer pointed by an aggregation frame buffer pointer of the aggregation message; setting the total buffer length as the length of the routing protocol message to be forwarded; setting the number of aggregation packets to 1; and setting the 'sending time' of the aggregated message as: the current time currTime + the maximum aggregation time maxAggrTime is then cached in the routing protocol cache queue waiting to be sent.
If yes, referring to fig. 5, judging whether to aggregate the routing protocol message to be forwarded into an aggregation message to be sent according to the following steps:
the node acquires ' sending time ' sendTime ' of the aggregation message to be sent, and judges whether the current time currTime meets the conditions: currTime + maxAggrTime > sendTime:
if not, generating a new routing protocol aggregation message, and filling the message to be forwarded into a buffer pointed by an aggregation frame buffer pointer of the aggregation message; setting the total buffer length as the length of the routing protocol message to be forwarded; setting the number of aggregation packets to 1; and setting the 'sending time' of the aggregated message as: the current time currTime + the maximum aggregation time maxAggrTime is cached in a routing protocol cache queue waiting to be sent;
if yes, further acquiring the aggregate message 'total buffer length' agrSize to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the conditions: currSize + aggrSize < maxAggrSize:
if not, generating a new routing protocol aggregation message, and filling the message to be forwarded into a buffer pointed by an aggregation frame buffer pointer of the aggregation message; setting the total buffer length as the length of the routing protocol message to be forwarded; setting the number of aggregation packets to 1; and setting the 'sending time' of the aggregated message as: the current time currTime + the maximum aggregation time maxAggrTime is cached in a routing protocol cache queue waiting to be sent;
and if so, aggregating the message needing to be forwarded into the aggregated message to be sent. Filling the message to be forwarded to the tail of the buffer pointed by the aggregation frame buffer pointer of the aggregation message; setting the total buffer length as aggrSize + currSize; adding 1 to the value of the number of the aggregation packets; the "transmission time" value remains unchanged.
S4: for the received routing protocol aggregation message, splitting the aggregation message into single routing protocol messages, and respectively processing the messages:
using the "source node MAC address" in the routing protocol message as an index to look up whether there is routing information to the address already in the local routing table, where the routing information is shown in fig. 6.
If no routing information to the "source node MAC address" exists in the routing table, a new route needs to be established.
If the routing information to the "source node MAC address" already exists in the routing table, the routing information is updated.
S5: acquiring a field of 'topology data length' in a routing protocol message, acquiring the topology data after the field is taken as a basis, and then searching whether topology information of the address exists in local full-network topology information by using a 'source node MAC address' in the routing protocol message:
if the local full-network topology information does not exist, adding topology information corresponding to the source node MAC address into the local full-network topology information;
and if the local full-network topology information exists, updating the topology information corresponding to the source node MAC address in the local full-network topology information.
The working principle and the working process of the invention are as follows:
the invention combines the protocol message of the active route and the topology data of the topology demonstration system, and carries out polymerization sending on the routing protocol message to be forwarded and the routing protocol message sent by the node, so that the sending of the routing protocol message and the topology data message is reduced, the communication overhead of the active routing protocol and the topology demonstration system is reduced, and the utilization rate of a wireless channel is improved.
Claims (7)
1. An active routing communication method suitable for a wireless ad hoc network, comprising the steps of:
s1, each node in the ad hoc network periodically sends a routing protocol message;
s2, before the node sends the routing message, initializing the routing message, obtaining the topology data of the node, combining the topology data to the tail of the routing protocol message, and then adding the combined routing protocol message to a routing protocol message buffer queue to wait for sending;
s3, after the node receives the routing protocol message of the neighbor node, for the routing protocol message to be forwarded, if the message to be sent exists in the routing protocol message buffer queue, the routing protocol message to be forwarded is aggregated into the message to be sent;
s4, after receiving the routing protocol message, the node splits the message and processes the message respectively, and establishes or updates a local routing table;
s5, obtaining the topology data at the tail of the routing protocol message, and adding or updating the topology data corresponding to the message source node in the global topology data.
2. The active routing communication method of claim 1, wherein the routing protocol packet includes a MAC address of the node, a validity lifetime TTL, a packet serial number seqno, and a routing path transmission quality TQ; the topology data comprises MAC addresses from the node to all neighbor nodes, link quality and signal-to-noise ratio.
3. The active routing communication method according to claim 1, wherein in S4, after the node receives the routing protocol packet, if the routing protocol packet is formed by aggregating more than two routing protocol packets, the aggregated packet is split and then processed separately; otherwise, directly processing the routing protocol message; newly adding or updating the routing information of the node reaching the source node according to the received routing protocol message; in S3, it is determined whether one or more split routing protocol messages need to be forwarded, and if so, the one or more split routing protocol messages and the message to be sent in the routing protocol cache queue are sent in an aggregated manner; in S5, according to the received routing protocol packet, topology data at the tail of the routing protocol packet is obtained, and the topology data is added to the local global topology data.
4. The active routing communication method according to claim 1, wherein each node in the wireless ad hoc network periodically sends a routing protocol packet, after a cycle is completed, a routing protocol packet to be sent in a next cycle is generated, when a routing protocol packet is generated, MAC addresses, link qualities, and signal-to-noise ratio information of all nodes in a one-hop neighbor table are obtained and combined into a defined topology data format according to a local one-hop neighbor table, a length value of the combined topology data is calculated, the length value is filled in a topology data length field, the topology data is added to a tail portion of the topology data length field, then the routing protocol packet is added to a new aggregation packet, and a sending time of the new aggregation packet is set as: and the current time plus the routing protocol message sending PERIOD ROUTE _ PERIOD is cached in a routing protocol cache queue and waits to be sent.
5. The active routing communication method according to claim 1 or 3, wherein for a received routing protocol packet of a neighbor node, whether the routing protocol packet needs to be forwarded is determined according to a packet sequence number seqno and a lifetime field TTL, and if the routing protocol packet needs to be forwarded, whether an aggregate packet to be sent exists in a routing protocol cache queue of the node is searched:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
if yes, judging whether to aggregate the routing protocol message needing to be forwarded into an aggregate message to be sent according to the following steps:
the node acquires the sending time sendTime of the aggregation message to be sent, and judges whether currTime meets the conditions: currTime + maxAggrTime > sendTime:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the new aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
if yes, further acquiring the size aggreSize of the aggregation message to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the conditions: currSize + aggrSize < maxAggrSize:
if not, generating a new routing protocol aggregation message, filling the message to be forwarded into the new aggregation message, and setting the sending time of the new aggregation message as: the current time currTime + the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue for waiting to be sent;
if yes, the message needing to be forwarded is aggregated into the aggregated message to be sent;
wherein the maximum aggregation time maxAggrTime: that is, for the received routing protocol message to be forwarded, the maximum time for delaying the sending after the aggregation is allowed; maximum aggregate size maxAggrSize: i.e. the maximum number of bytes of any aggregated message.
6. The proactive routing communication method according to claim 5, wherein for a received routing protocol aggregate packet, the aggregate packet is split into individual routing protocol packets, and the individual routing protocol packets are processed respectively:
if the routing table does not have routing information reaching the routing protocol message source node, a new route needs to be established;
if the routing information to the routing protocol message source node already exists in the routing table, the routing information is updated.
7. The proactive routing communication method according to claim 1 or 6, wherein in S5, a field of "topology data length" in the routing protocol message is obtained, the subsequent topology data is obtained based on the field, and then the "source node MAC address" in the routing protocol message is used to find out whether topology information of the address already exists in the local full-network topology information:
if the local full-network topology information does not exist, adding topology information corresponding to the source node MAC address into the local full-network topology information;
and if the local full-network topology information exists, updating the topology information corresponding to the source node MAC address in the local full-network topology information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910969814.9A CN110691379B (en) | 2019-10-12 | 2019-10-12 | Active route communication method suitable for wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910969814.9A CN110691379B (en) | 2019-10-12 | 2019-10-12 | Active route communication method suitable for wireless ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110691379A true CN110691379A (en) | 2020-01-14 |
| CN110691379B CN110691379B (en) | 2023-05-02 |
Family
ID=69112300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910969814.9A Active CN110691379B (en) | 2019-10-12 | 2019-10-12 | Active route communication method suitable for wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110691379B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112867091A (en) * | 2021-01-14 | 2021-05-28 | 湖南智领通信科技有限公司 | Mesh gateway selection method and device based on active routing protocol |
| CN112996055A (en) * | 2021-03-16 | 2021-06-18 | 中国电子科技集团公司第七研究所 | Small data message merging method for wireless ad hoc network data synchronization |
| CN113179215A (en) * | 2021-06-29 | 2021-07-27 | 广州慧睿思通科技股份有限公司 | Networking communication method, system, node device, storage medium and electronic device |
| CN114520783A (en) * | 2022-01-06 | 2022-05-20 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN116634521A (en) * | 2023-07-20 | 2023-08-22 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080186907A1 (en) * | 2004-11-30 | 2008-08-07 | Nec Corporation | Method For Controlling Communication Route of Wireless Multi-Hop Network System and Communication Terminal |
| US20080198865A1 (en) * | 2007-02-20 | 2008-08-21 | Harris Corporation | System and method for communicating over mesh networks using waveform-enhanced, link-state routing |
| CN101951659A (en) * | 2010-08-13 | 2011-01-19 | 华南理工大学 | Self-organization method of sensor network and mobile terminal system based on same |
| CN105163354A (en) * | 2015-07-30 | 2015-12-16 | 南京大学 | Data flow delay guarantee strategy based on chance of pairwise inter-flow network coding |
| CN110087195A (en) * | 2019-04-22 | 2019-08-02 | 希诺麦田技术（深圳）有限公司 | The transmission method, device and storage medium of data in wireless self-networking |
| CN110167099A (en) * | 2019-05-22 | 2019-08-23 | 南京大学 | A kind of Ad Hoc suitable for narrowband condition is by method and system |
-
2019
- 2019-10-12 CN CN201910969814.9A patent/CN110691379B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080186907A1 (en) * | 2004-11-30 | 2008-08-07 | Nec Corporation | Method For Controlling Communication Route of Wireless Multi-Hop Network System and Communication Terminal |
| US20080198865A1 (en) * | 2007-02-20 | 2008-08-21 | Harris Corporation | System and method for communicating over mesh networks using waveform-enhanced, link-state routing |
| CN101951659A (en) * | 2010-08-13 | 2011-01-19 | 华南理工大学 | Self-organization method of sensor network and mobile terminal system based on same |
| CN105163354A (en) * | 2015-07-30 | 2015-12-16 | 南京大学 | Data flow delay guarantee strategy based on chance of pairwise inter-flow network coding |
| CN110087195A (en) * | 2019-04-22 | 2019-08-02 | 希诺麦田技术（深圳）有限公司 | The transmission method, device and storage medium of data in wireless self-networking |
| CN110167099A (en) * | 2019-05-22 | 2019-08-23 | 南京大学 | A kind of Ad Hoc suitable for narrowband condition is by method and system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112867091A (en) * | 2021-01-14 | 2021-05-28 | 湖南智领通信科技有限公司 | Mesh gateway selection method and device based on active routing protocol |
| CN112996055A (en) * | 2021-03-16 | 2021-06-18 | 中国电子科技集团公司第七研究所 | Small data message merging method for wireless ad hoc network data synchronization |
| CN113179215A (en) * | 2021-06-29 | 2021-07-27 | 广州慧睿思通科技股份有限公司 | Networking communication method, system, node device, storage medium and electronic device |
| CN113179215B (en) * | 2021-06-29 | 2021-09-07 | 广州慧睿思通科技股份有限公司 | Networking communication method, system, node device, storage medium and electronic device |
| CN114520783A (en) * | 2022-01-06 | 2022-05-20 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN114520783B (en) * | 2022-01-06 | 2023-07-11 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN116634521A (en) * | 2023-07-20 | 2023-08-22 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
| CN116634521B (en) * | 2023-07-20 | 2023-11-10 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110691379B (en) | 2023-05-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110691379B (en) | Active route communication method suitable for wireless ad hoc network | |
| RU2682930C2 (en) | Route selection in wireless networks | |
| CN110139319B (en) | Routing method for minimizing transmission delay of high dynamic delay network | |
| Tran et al. | Congestion adaptive routing in mobile ad hoc networks | |
| CN112165725B (en) | Message processing method and device | |
| CN109218111B (en) | Method for processing message and repeater | |
| CN112969210B (en) | Aircraft cooperative networking network layer routing protocol processing device and implementation method | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN107949000B (en) | Low-delay opportunistic network implementation method | |
| CN113518037A (en) | Congestion information synchronization method and related device | |
| WO2022042386A1 (en) | Method for controlling message sending, network device and system | |
| Hui et al. | Analysis and research on OLSR protocol for multi-channel assignment of wireless mesh network | |
| US11190979B2 (en) | Methods and apparatus for forwarding packets between child nodes and parent nodes | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| JP4951695B2 (en) | Route selection in wireless networks | |
| CN106685836B (en) | HWMP on-demand routing broadcast packet suppression method | |
| JP4939579B2 (en) | Route selection in wireless networks | |
| CN102905340B (en) | A kind of addressing method and device being applied to aeronautical communications network | |
| CN111585898B (en) | Routing information increment transmission method facing wireless self-organizing network | |
| RU2405282C2 (en) | Route selection in wireless networks | |
| JP7389250B2 (en) | Wireless communication device, wireless communication method and program | |
| CN115174690B (en) | System and method for accelerating high-flow service under weak network or broken network condition | |
| CA2817659C (en) | Route selection in wireless networks |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |