CN110691379B - Active route communication method suitable for wireless ad hoc network - Google Patents
Active route communication method suitable for wireless ad hoc network Download PDFInfo
- Publication number
- CN110691379B CN110691379B CN201910969814.9A CN201910969814A CN110691379B CN 110691379 B CN110691379 B CN 110691379B CN 201910969814 A CN201910969814 A CN 201910969814A CN 110691379 B CN110691379 B CN 110691379B
- Authority
- CN
- China
- Prior art keywords
- message
- routing protocol
- routing
- node
- topology data
- 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.)
- Active
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 route communication method suitable for wireless ad hoc networks, which comprises the following steps: each node in the ad hoc network periodically transmits a routing protocol message; before sending the routing message, combining 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, if the routing protocol message to be forwarded exists, aggregating the routing protocol message to be forwarded into the message to be forwarded; the node processes the split messages respectively, establishes or updates a local routing table, and newly increases or updates corresponding topology data. The invention combines the protocol message of the active routing protocol with the topology data; meanwhile, a plurality of routing protocol messages are aggregated and sent, so that the sending times of wireless ad hoc network broadcast packets are effectively reduced, the cost of routing protocol and topology data transfer is reduced, and the wireless channel utilization rate 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 in networking and strong in survivability.
Wireless ad hoc networks typically use wireless transmission techniques as a means of communication, and the physical characteristics of the wireless channels make the network bandwidth of the wireless ad hoc network generally small.
The routing protocols of the existing wireless ad hoc network equipment are mainly divided into an active routing protocol and an on-demand routing protocol, wherein if the on-demand routing protocol does not reach the route of a target node when the node sends data, a route discovery process is required to be initiated temporarily, the data can be sent out after the route discovery is completed, a certain delay is caused, and the real-time performance cannot reach a certain requirement; all nodes of the active routing protocol periodically broadcast and send protocol messages to maintain routing information to all destination nodes.
The routing protocol messages and the topology data messages which are sent periodically are small packets, and the small packets which are frequently sent in the wireless ad hoc network can cause the waste of channel resources, so that the cost 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 wireless ad hoc networks, which optimizes the transmission and forwarding of routing protocol messages and topology data messages aiming at active routing, reduces the transmission times of the routing protocol messages and the topology data messages, reduces the expenditure of a routing protocol and a topology demonstration system and improves the utilization rate of wireless channels.
The object of the invention is achieved in that it comprises the following steps:
s1, each node in the ad hoc network periodically transmits a routing protocol message;
s2, before a node sends a routing protocol message, initializing the routing protocol message, obtaining topology data of the node, combining the topology data to the tail part 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 receiving the routing protocol message of the neighbor node, the node aggregates the routing protocol message to be forwarded into the message to be sent if the message to be sent exists in the routing protocol message buffer queue;
s4, after receiving the routing protocol message, the node splits the message and then processes the message respectively to establish or update a local routing table;
s5, obtaining topology data of the tail of the routing protocol message, and newly adding or updating 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 sequence 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 respectively; otherwise, directly processing the routing protocol message; according to the received routing protocol message, newly adding or updating the routing information of the node reaching the source node; in S5, according to the received routing protocol message, obtaining the topology data at the tail of the routing protocol message, and adding the topology data into the local global topology data; and respectively judging whether forwarding is needed for one or more split routing protocol messages, and if forwarding is needed, aggregating and transmitting the split routing protocol messages and the messages to be transmitted in the routing protocol cache queue.
Specifically, a topology data length field is added on the basis of the original routing protocol message format, each node in the wireless ad hoc network periodically transmits the routing protocol message, after one period is completed, the routing protocol message needing to be transmitted in the next period is generated, when the routing protocol message is generated, the information such as the MAC address, the link quality, the signal to noise ratio and the like of all nodes in the one-hop neighbor table is acquired according to the local one-hop neighbor table and combined into a defined topology data format, the length value of the combined topology data is calculated, the value is filled into the topology data length field, the topology data is added to the tail of the topology data length field, then the routing protocol message is added into a new aggregation message, and the transmission time of the new aggregation message is set as follows: the current time+route protocol message sending PERIOD route_period, and the buffer is cached in a ROUTE protocol buffer queue to wait for sending.
Further, for the received routing protocol message of the neighbor node, judging whether the routing protocol message needs to be forwarded according to the message sequence number seqno and the lifetime field TTL, if so, searching whether an aggregate message to be sent exists in a routing protocol buffer queue of the node:
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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if yes, judging whether to aggregate the routing protocol message 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 the currTime meets the condition: currtime+maxaggtime > 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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if so, further, acquiring the size aggrSize of the aggregate message to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the conditions: currsize+aggrsize < maxaggsize:
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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if yes, the message to be forwarded is aggregated into the aggregation message to be sent.
Wherein, maximum aggregate time maxaggetime: namely, for the received routing protocol message needing to be forwarded, the maximum time for delaying transmission after aggregation is allowed; maximum aggregate size maxaggsize: i.e. the maximum number of bytes of any aggregate message.
Further, for the received routing protocol aggregation message, splitting the aggregation message into single routing protocol messages, and respectively processing:
if the routing information reaching the source node of the routing protocol message does not exist in the routing table, a new route needs to be established;
if the route information to the route protocol message source node already exists in the route table, updating the route information;
further, a topology data length field in the routing protocol message is obtained, topology data in the routing protocol message is obtained according to the field, and a source address of the routing protocol message and the obtained topology data are added into the whole network topology information.
Compared with the prior art, the invention has the following technical effects: combining protocol messages of an active routing protocol with topology data; and meanwhile, the combined routing protocol message and the routing protocol message to be forwarded are subjected to aggregation transmission, so that the transmission times of the wireless self-organizing network broadcasting packet are effectively reduced, the cost of routing protocol and topology data transmission is reduced, and the wireless channel utilization rate is improved.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention;
FIG. 2 is a diagram illustrating a routing protocol message format according to an embodiment of the present invention;
FIG. 3 is a diagram of a topology data format in an embodiment of the present invention;
FIG. 4 is a schematic diagram of a routing protocol aggregation message format according to an embodiment of the present invention;
FIG. 5 is a flow chart of aggregation of routing protocol messages in an embodiment of the present invention;
fig. 6 is a schematic diagram of a routing information table in an embodiment of the present invention.
Detailed Description
The invention is further illustrated in the following figures and examples, which are not intended to be limiting in any way, and any alterations or modifications based on the teachings of the invention are within the scope of the invention.
Fig. 1 is a flow chart of an active routing method according to the present invention, wherein each operation in the flow chart is described as a sequential process, but many operations can be performed in parallel, concurrently or simultaneously.
The invention provides an active route communication method suitable for wireless ad hoc networks, which comprises the following steps:
s1, each node in the ad hoc network periodically transmits a routing protocol message; as shown in fig. 2, the routing protocol message format includes a message type, a lifetime, a message sequence number, a source node MAC address, a path transmission quality, a topology data length, and topology data information.
The message type is designated as a routing protocol message; message survival time represents the maximum hop count of the message which can be forwarded in the network; the message sequence number is a protocol message sequence number maintained by the node itself, and each time a routing protocol message is sent, the increment is 1; the source node MAC address is the MAC address allocated by the node itself, has uniqueness, and can uniquely identify each routing protocol message with the message serial number; the path transmission quality represents the path transmission quality to the source node; the topology data length represents the length of the topology data carried by the message; the topology data is specific topology data and represents the 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 other nodes, and the other nodes in the network construct routing information to the message source node according to the received routing protocol message to acquire local topology information of the message source node and the like.
S2, when generating the routing protocol message, obtaining MAC addresses, link quality and signal-to-noise ratio information of all neighbor nodes in a local one-hop neighbor table, combining the information into a defined topology data format, calculating the length value of the combined topology data, wherein the topology data format is shown in figure 3, 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: and for the received routing protocol message, acquiring a message sequence number and a survival time field in the message, and forwarding the routing protocol message if the message which is older than the message sequence number and the survival time field is larger than 1 is received before corresponding to the source node of the routing protocol message.
The aggregated message is called a routing protocol aggregated message, and the format of the routing protocol aggregated message is shown in fig. 4, and includes an aggregated frame buffer pointer, a buffer total length, an aggregated packet number and a sending time.
Wherein the aggregate frame buffer pointer points to the head address of the aggregate frame buffer to be sent; the total length of the buffer indicates the total length of data contained in the aggregated buffer; the aggregation packet number indicates the number of small packets contained in the aggregation frame; the transmit time indicates that the aggregate frame buffer is to be transmitted to the bottom layer at this time.
After a new routing protocol aggregation message is created, the generated routing protocol message is added into a buffer pointed by an aggregation frame buffer pointer of the aggregation message; setting the total length of the buffer as the length of the routing protocol message; setting the number of aggregation packets to be 1; and sets the "sending time" of the aggregate message as: the current time currTime+routing protocol message sending PERIOD ROUTE_PERIOD is then buffered in a routing protocol buffer queue to wait for sending.
Two parameters are first defined:
parameter 1: maximum aggregation time maxaggime: the maximum time for delay sending after aggregation is allowed for the received routing protocol message needing to be forwarded, and the value limits the time for local buffering of the routing protocol message needing to be forwarded, so that the maximum time for the routing protocol message to be diffused to the whole network is limited, and the method has important significance for timely building or updating the routing table.
Parameter 2: maximum aggregate size maxaggsize: i.e. the maximum value of the total buffer length of any aggregate message.
Traversing a local routing protocol cache queue to find out whether an aggregate message to be sent exists or not:
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 length of buffer as the length of the message needing to be forwarded by the routing protocol; setting the number of aggregation packets to be 1; and sets the "sending time" of the aggregate message as: the current time currtime+the maximum aggregation time maxaggmtime is then buffered in the routing protocol buffer queue to wait for transmission.
If yes, referring to fig. 5, determining whether to aggregate the routing protocol message 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 the current time currTime meets the condition: currtime+maxaggtime > 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 length of buffer as the length of the message needing to be forwarded by the routing protocol; setting the number of aggregation packets to be 1; and sets the "sending time" of the aggregate message as: the current time currTime+the maximum aggregation time maxAggrTime is cached in a routing protocol cache queue to wait for transmission;
if so, further, acquiring the aggregate size of the buffer total length of the aggregate message to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the condition: currsize+aggrsize < maxaggsize:
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 length of buffer as the length of the message needing to be forwarded by the routing protocol; setting the number of aggregation packets to be 1; and sets the "sending time" of the aggregate message as: the current time currTime+the maximum aggregation time maxAggrTime is cached in a routing protocol cache queue to wait for transmission;
if yes, the message to be forwarded is aggregated into the aggregation message to be sent. Filling the message to be forwarded to the tail of a buffer pointed by an aggregate frame buffer pointer of the aggregate message; setting the total length of the buffer as aggrSize+currSize; adding 1 to the value of the aggregation packet number; the "transmit 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 single routing protocol messages:
the "source node MAC address" in the routing protocol packet is used as an index to find out whether there is already routing information to the address in the local routing table, and the routing information is shown in fig. 6.
If no route information exists in the routing table to the "source node MAC address", 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, taking the field as a basis to acquire the acquired topology data, and then searching whether topology information of a source node MAC address exists in the local whole network topology information or not by using the 'source node MAC address' in the routing protocol message:
if not, adding topology information corresponding to the source node MAC address into the local whole network topology information;
if the topology information exists, the topology information corresponding to the source node MAC address in the local whole network topology information is updated.
The working principle and the working process of the invention are as follows:
according to the communication overhead optimization method of the active routing and topology demonstration system suitable for the wireless self-organizing network, the overhead of the active routing protocol and the topology demonstration system in the wireless self-organizing network can be reduced to a certain extent, and the service throughput performance in the operation process of the wireless self-organizing network can be guaranteed to be improved to a certain extent.
Claims (7)
1. An active routing communication method suitable for wireless ad hoc networks, comprising the following steps:
s1, each node in the ad hoc network periodically transmits a routing protocol message;
s2, before a node sends a routing protocol message, initializing the routing protocol message, obtaining topology data of the node, combining the topology data to the tail part 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 receiving the routing protocol message of the neighbor node, the node aggregates the routing protocol message to be forwarded into the message to be sent if the message to be sent exists in the routing protocol message buffer queue;
s4, after receiving the routing protocol message, the node splits the message and then processes the message respectively to establish or update a local routing table;
s5, obtaining topology data of the tail of the routing protocol message, and newly adding or updating topology data corresponding to the message source node in the global topology data.
2. The method of claim 1, wherein the routing protocol message includes a MAC address of the node, an effective lifetime TTL, a message sequence 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 message, if the routing protocol message is formed by aggregating two or more routing protocol messages, the aggregated messages are split and then processed respectively; otherwise, directly processing the routing protocol message; according to the received routing protocol message, newly adding or updating the routing information of the node reaching the source node; in S3, judging whether forwarding is needed for one or more split routing protocol messages respectively, and if forwarding is needed, aggregating and transmitting the split routing protocol messages with the messages to be transmitted in the routing protocol cache queue; in S5, according to the received routing protocol message, the topology data of the tail part of the routing protocol message is obtained, and the topology data is added into 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 transmits a routing protocol message, after one period is completed, generates a routing protocol message to be transmitted in the next period, acquires MAC addresses of all nodes in the one-hop neighbor table according to the local one-hop neighbor table when generating the routing protocol message, link quality, signal-to-noise ratio information, and combines the information into a defined topology data format, calculates a length value of combined topology data, fills the value into a topology data length field, adds the topology data into a tail of the topology data length field, then adds the routing protocol message into a new aggregate message, and sets a transmission time of the new aggregate message as follows: the current time+route protocol message sending PERIOD route_period, and the buffer is cached in a ROUTE protocol buffer queue to wait for sending.
5. The active routing communication method according to claim 1 or 3, wherein for a received routing protocol message of a neighboring node, whether the routing protocol message needs to be forwarded is determined according to a message sequence number seqno and a lifetime field TTL, and if so, whether an aggregate message to be sent exists in a routing protocol buffer 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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if yes, judging whether to aggregate the routing protocol message 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 the currTime meets the condition: currtime+maxaggtime > 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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if so, further, acquiring the size aggrSize of the aggregate message to be sent and the size currSize of the message to be forwarded, and judging whether the currSize meets the conditions: currsize+aggrsize < maxaggsize:
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 follows: the current time currTime+the maximum aggregation time maxAggrTime, and then caching the message in a routing protocol cache queue to wait for sending;
if yes, aggregating the message to be forwarded into the aggregation message to be sent;
wherein, maximum aggregate time maxaggetime: namely, for the received routing protocol message needing to be forwarded, the maximum time for delaying transmission after aggregation is allowed; maximum aggregate size maxaggsize: i.e. the maximum number of bytes of any aggregate message.
6. The active routing communication method according to claim 5, wherein for the received routing protocol aggregate message, splitting the aggregate message into individual routing protocol messages, processing is performed separately:
if the routing information reaching the source node of the routing protocol message does not exist in the routing table, a new route needs to be established;
if the route information to the route protocol message source node already exists in the route table, the route information is updated.
7. The active routing communication method according to claim 1 or 6, wherein in S5, a field of "topology data length" in the routing protocol packet is acquired, the topology data after the acquisition is based on the field, and then whether topology information of the address already exists is searched in the local whole network topology information by using "source node MAC address" in the routing protocol packet:
if not, adding topology information corresponding to the source node MAC address into the local whole network topology information;
if the topology information exists, the topology information corresponding to the source node MAC address in the local whole network topology information is updated.
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 CN110691379A (en) | 2020-01-14 |
| CN110691379B true 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) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112867091B (en) * | 2021-01-14 | 2022-11-08 | 湖南智领通信科技有限公司 | Mesh gateway selection method and device based on active routing protocol |
| CN112996055B (en) * | 2021-03-16 | 2022-08-16 | 中国电子科技集团公司第七研究所 | Small data message merging method for wireless ad hoc network data synchronization |
| CN113179215B (en) * | 2021-06-29 | 2021-09-07 | 广州慧睿思通科技股份有限公司 | Networking communication method, system, node device, storage medium and electronic device |
| CN114520783B (en) * | 2022-01-06 | 2023-07-11 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN116094998A (en) * | 2022-12-29 | 2023-05-09 | 天翼云科技有限公司 | Method and device for forwarding VXLAN message of neighbor table entry based on OVS |
| CN116634521B (en) * | 2023-07-20 | 2023-11-10 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005168020A (en) * | 2004-11-30 | 2005-06-23 | Nec Corp | Communication path control method and communication terminal for radio multi-hop network |
| US8213409B2 (en) * | 2007-02-20 | 2012-07-03 | Harris Corporation | System and method for communicating over mesh networks using waveform-enhanced, link-state routing |
-
2019
- 2019-10-12 CN CN201910969814.9A patent/CN110691379B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110691379A (en) | 2020-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110691379B (en) | Active route communication method suitable for wireless ad hoc network | |
| CN108600942B (en) | Routing method of unmanned aerial vehicle ad hoc network | |
| CN110139319B (en) | Routing method for minimizing transmission delay of high dynamic delay network | |
| Tran et al. | Congestion adaptive routing in mobile ad hoc networks | |
| CN107517488B (en) | Message processing method and device | |
| CA3107919A1 (en) | Vinetm: zero-control routing using data packet inspection for wireless mesh networks | |
| US11750411B2 (en) | Method of and devices for supporting selective forwarding of messages in a network of communicatively coupled communication devices | |
| CN101827417B (en) | Routing method based on differentiated services of internet of things | |
| KR20090015080A (en) | Improved 802.11 mesh architecture | |
| CN107846706B (en) | Congestion-avoiding code-aware wireless mesh network multi-path routing method | |
| CN110891294A (en) | Wireless ad hoc network routing method and system based on service type | |
| CN108513330B (en) | Routing protocol distributed self-adaptive switching method based on network context awareness | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| CN113596894B (en) | Unmanned aerial vehicle Ad hoc network cooperation time division channel access method based on dynamic relay selection | |
| CN111148178B (en) | DSR routing protocol implementation method based on unmanned aerial vehicle ad hoc network | |
| CN106658605B (en) | Routing method based on distributed network load perception | |
| CN110087195B (en) | Method and device for transmitting data in wireless ad hoc network and storage medium | |
| CN107949000B (en) | Low-delay opportunistic network implementation method | |
| US11190979B2 (en) | Methods and apparatus for forwarding packets between child nodes and parent nodes | |
| US9226219B2 (en) | System and method for route learning and auto-configuration | |
| CN112867084B (en) | Energy-efficient opportunistic routing protocol of data-dependent sensing wireless sensor network | |
| 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 |
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 |