CN109618382B - Blind relay dynamic routing mode - Google Patents
Blind relay dynamic routing mode Download PDFInfo
- Publication number
- CN109618382B CN109618382B CN201910004612.0A CN201910004612A CN109618382B CN 109618382 B CN109618382 B CN 109618382B CN 201910004612 A CN201910004612 A CN 201910004612A CN 109618382 B CN109618382 B CN 109618382B
- Authority
- CN
- China
- Prior art keywords
- forwarding
- node
- state
- nodes
- relay
- 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
- 238000000034 method Methods 0.000 claims abstract description 13
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims abstract description 5
- 230000005540 biological transmission Effects 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 5
- 238000012790 confirmation Methods 0.000 claims description 3
- 230000003111 delayed effect Effects 0.000 claims description 3
- 239000012530 fluid Substances 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 8
- 230000008859 change Effects 0.000 abstract description 3
- 230000010355 oscillation Effects 0.000 abstract description 2
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a blind relay dynamic routing mode, wherein a source node sends a request, A, B, C groups of nodes can all receive the request and all enter a state to be forwarded, the forwarding time T is calculated according to a P-CSMA random algorithm, different sending priorities are generated according to the strength of a signal received by the nodes, the forwarding is controlled to be carried out on a network layer, CSMA/CA forwarding is carried out on an MAC layer, in order to avoid network oscillation, a life cycle is introduced, a signal frame carries the life cycle, 1 is subtracted once every forwarding, and when the life cycle is 0, the forwarding is not carried out. The method does not need communication path management, does not memorize a relay path, and dynamically selects according to the current state of the network, thereby being better suitable for the characteristic of dynamic change of a power line channel.
Description
Technical Field
The invention relates to the electric power communication technology, in particular to a blind relay dynamic routing mode.
Background
The existing power communication needs communication path management, occupies a lot of resources, and the blind relay means that no relay node is appointed in a signal frame, and any node receives the signal frame and then forwards the signal frame as long as the signal frame meets the forwarding condition. Since multiple nodes may receive the signal frame at the same time, it may happen that multiple nodes are all forwarding. To avoid collisions, a channel contention mechanism, such as CSMA/CA, must be introduced. Meanwhile, in order to avoid network oscillation, a life cycle is introduced, the signal frame carries the life cycle, 1 is subtracted once every time the signal frame is forwarded, and the signal frame is not forwarded any more when the life cycle is 0. Blind relaying does not need communication path management, does not remember the relaying path, but according to the dynamic selection of the state at that time of the network, can better adapt to the characteristic of the dynamic change of the power line channel.
Disclosure of Invention
The invention provides a blind relay dynamic routing mode, which solves the problems that the existing power communication needs communication path management and occupies more resources.
A blind relay dynamic routing mode comprising: the source node sends out a request, all the groups of nodes A, B, C can receive the request and all the nodes enter a state to be forwarded, the forwarding time T is calculated according to a P-CSMA random algorithm, different sending priorities are generated according to the received signal intensity of the nodes, the forwarding control is carried out on a network layer, the CSMA/CA forwarding is carried out on an MAC layer, and the blind relay forwarding process is as follows:
at the network layer, the network layer is,
receiving a data frame from the MAC layer, and discarding if the data frame is a repeated frame; if the APS is the target node, sending a command of stopping forwarding, and transmitting data to the APS; otherwise, carrying out relay processing;
if the life cycle is 0, the forwarding is not carried out; if the signal strength threshold is not satisfied, forwarding is not carried out, under the blind relay route, the low threshold is set to be 0, and the high threshold is set to define a near node; otherwise, requesting the MAC layer to forward and entering a relay forwarding state;
if the state is in the relay forwarding state and the notice of stopping forwarding is received from the MAC, the relay forwarding state is stopped;
if a data frame forwarded by a next layer node or a repeated data frame of a previous layer node is received, discarding;
if the data frame forwarded by the same-layer node is received, if the data frame is a near node, stopping the relay forwarding state and informing the MAC layer; otherwise, adjusting the priority, informing the MAC layer to stop the current forwarding, and submitting a forwarding request to the MAC layer again;
if the timing is overtime, stopping forwarding and informing the MAC layer;
at the MAC layer, it is the MAC layer,
receiving a data frame from a physical layer, checking network identification, and setting a target address of an MAC layer to be xffff; if not, discarding;
if the current state is not in the waiting forwarding state, submitting the data frame to a network layer;
if the frame is in a waiting forwarding state and in a CFP (computational fluid dynamics), stopping forwarding and notifying a network layer if the frame is an acknowledgement frame;
if the data frame is in the waiting forwarding state and the SCP, stopping the forwarding state and submitting the data frame to a network layer;
if the terminal is in a waiting forwarding state, is in an SCP (service control point) and is delayed to be back-off, sending is carried out, the forwarding state is stopped, and a network layer is informed;
if receiving the command of stopping forwarding from the network layer, the target node receives confirmation, and if the target node is in forwarding waiting, the target node stops; immediately sending a command of stopping forwarding without competition;
if receiving the blind relay sending request from the network layer, generating the back-off time according to the priority level and the network scale, entering a waiting sending state, starting CFP time delay, and starting the back-off time delay after reaching the time. Further, according to the received signal strength of the node, different sending priorities are generated, namely, the Q value of the received signal is divided into three gears, the gear value is QB, the Q value is 0 in the range of (2-7), and the node is a near node; q value is in the range of (8-12), QB is 1, and the intermediate node is obtained; q value is in the range of (13-15), QB is 2, and is a far node.
Further, the nodes in the forwarding state compete for forwarding in the competition period, the nodes determine the sending time of the nodes in the competition period according to the priorities of the nodes, and in order to reduce the collision probability, the total length T of the competition period adopts a zero crossing point as a unit, and the total length T of the competition period is determined by combining the number of the nodes participating in the competition.
Further, the total length T of the contention period is determined in conjunction with the network size: t is M × f, M is the total number of nodes on the network scale, f is a coefficient, and f is 1/2.
Further, the nodes participating in the contention forwarding determine their own transmission time within the contention period according to their own priorities, the contention period T is equally divided into T1 and T2, T2 is then equally divided into T21 and T22, T1 is used for the most prioritized node QB ═ 0, T21 is used for the node QB ═ 1, and T22 is used for the node QB ═ 2.
Further, in each sub-period, the node determines the sending time by adopting a random function: in each sub-period, the node determines the sending time by adopting a random function:
T-Random (0, L), L is T1, the length of T21 or T22, i.e. the number of zero crossings, T1: 32, 64, 128, 256, T21, T22: 16, 32, 64, 128, and determining the random number to be 4, 5, 6, 7, 8 bits respectively.
Further, the main path is determined on the basis of a criterion and/or a reliability as high as possible at the time of data transmission and/or an energy efficiency at the time of data transmission at a data error rate as low as possible.
Further, the data transmission is based on the wireless HART standard or IEEE 802.15.4 or ISA 100.11 a.
According to the technical scheme, the blind relay dynamic routing mode does not need communication path management, does not memorize a relay path, is dynamically selected according to the current state of the network, and can better adapt to the characteristic of dynamic change of a power line channel.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a flow chart of the method of the present invention;
FIG. 2 is a schematic diagram of a 3-bit linear feedback shift register used for random number generation in accordance with the present invention;
FIG. 3 is a state flow diagram for random number generation according to the present invention
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings, and it is to be understood that the described embodiments are only a part of the embodiments of the present invention, and not all of them. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiments of the present application are shown in the attached drawings 1-3
The source node sends out a request, and all the groups of the nodes A, B, C can receive the request and all enter a to-be-forwarded state, and respectively calculate the forwarding time T according to a P-CSMA random algorithm, as shown in fig. 1, the currently adopted P-CSMA random algorithm generates different sending priorities according to the received signal strength of the nodes, i.e. dividing the received signal Q into three gears, and setting the gear value QB.
Q-value is in the range of (2-7) QB ═ 0; (near node)
Q value is in the range of (8-12) QB-1; (intermediate node)
Q value is in the range of (13-15) QB ═ 2; (remote node)
The signal frame is followed by a non-contention period CFP (3 zero-crossings or more in length) and then by a contention period (SCP). The purpose of CFP is to leave the target node to send "stop forwarding" signals without contention. That is, after the signal frame reaches the target node, the target node sends a "stop forwarding" signal frame in the CFP to notify other nodes in the forwarding state to stop forwarding. Therefore, all nodes in the forwarding state need to wait for the CFP to finish contention forwarding. If the 'stop forwarding' signal is detected in the CFP, the forwarding state is ended and the forwarding is stopped.
The nodes in the forwarding state compete for forwarding in the contention period. And the node determines the sending time of the node in the competition period according to the priority of the node. To reduce the collision probability, the total length T (unit: zero crossing point) of the contention period should be related to the number of nodes participating in contention, i.e., the network size: t is M × f, M is the network size (total number of nodes), f is the coefficient, and f is 1/2.
The nodes participating in the contention forwarding need to determine their transmission time within the contention period according to their priorities. For this reason, the contention period T is equally divided into T1 and T2, and T2 is further equally divided into T21 and T22. T1 is used for the most advanced node (QB ═ 0), T21 is used for QB ═ 1, and T22 is used for QB ═ 2 nodes. In each sub-period, the node determines the sending time by adopting a random function:
T-Random (0, L), L is the length (number of zero crossings) of T1, T21 or T22 (T1: 32, 64, 128, 256, T21, T22: 16, 32, 64, 128, so that the Random numbers are 4, 5, 6, 7, 8 bits, respectively)
And in the blind relay process, forwarding control is carried out in a network layer, and CSMA/CA forwarding is carried out in an MAC layer. The blind relay forwarding process is as follows:
at the network layer, the network layer is,
receiving a data frame from the MAC layer, and discarding if the data frame is a repeated frame; if the APS is the target node, sending a command of stopping forwarding, and transmitting data to the APS; otherwise, carrying out relay processing;
if the life cycle is 0, the forwarding is not carried out; if the signal strength threshold is not satisfied, forwarding is not carried out, under the blind relay route, the low threshold is set to be 0, and the high threshold is set to define a near node; otherwise, requesting the MAC layer to forward and entering a relay forwarding state;
if the state is in the relay forwarding state and the notice of stopping forwarding is received from the MAC, the relay forwarding state is stopped;
if a data frame forwarded by a next layer node or a repeated data frame of a previous layer node is received, discarding;
if the data frame forwarded by the same-layer node is received, if the data frame is a near node, stopping the relay forwarding state and informing the MAC layer; otherwise, adjusting the priority, informing the MAC layer to stop the current forwarding, and submitting a forwarding request to the MAC layer again;
if the timing is overtime, stopping forwarding and informing the MAC layer;
at the MAC layer, it is the MAC layer,
receiving a data frame from a physical layer, checking network identification, and setting a target address of an MAC layer to be xffff; if not, discarding;
if the current state is not in the waiting forwarding state, submitting the data frame to a network layer;
if the frame is in a waiting forwarding state and in a CFP (computational fluid dynamics), stopping forwarding and notifying a network layer if the frame is an acknowledgement frame;
if the data frame is in the waiting forwarding state and the SCP, stopping the forwarding state and submitting the data frame to a network layer;
if the terminal is in a waiting forwarding state, is in an SCP (service control point) and is delayed to be back-off, sending is carried out, the forwarding state is stopped, and a network layer is informed;
if receiving the command of stopping forwarding from the network layer, the target node receives confirmation, and if the target node is in forwarding waiting, the target node stops; immediately sending a command of stopping forwarding without competition;
if receiving the blind relay sending request from the network layer, generating the back-off time according to the priority level and the network scale, entering a waiting sending state, starting CFP time delay, and starting the back-off time delay after reaching the time.
Random number generation
To ensure reliable generation of 4, 5, 6, 7 bit random numbers. The random algorithm adopts a method combining big random and small random at present. The principle of combining the big random with the small random is that the big random is different, the forwarding order of the big random is not influenced no matter how the small random changes, and when the big random is the same, the small random plays a role. Only under the condition that the large random is the same and the small random is the same, the collision can not be avoided.
Detailed description of the invention
Large random time T ═ (random number 1mode 2)macbe-2)*30
Small random time T-random number 2mode 30
A large random number generation algorithm. Our random function is implemented using a shift register with feedback.
Illustrate by way of example
Adopts a 3-bit linear feedback shift register, and the primitive polynomial of the shift register is x3+ x +1, initial state 100, state flow as follows: 100010001110011111101, as long as the initial value is not 0, the random number generation period is 7, and as long as the initial value is not 0, the random numbers are distributed between 1-7, and the probability of being each value is 1/7, so the key to the initial value is not 0.
We can extend more bits the key to the problem must find the primitive polynomial of n bits.
The following are the primitive polynomials for the various BITs
Random numbers of arbitrary bits can be generated using the primitive polynomial. The seeds are different, the generated random numbers are different, and are in the range of 1-2n1 random and uniform equiprobable distribution.
The key to generating random numbers is seed randomness, or seed consistent random shift. For the carrier system, the table end has a unique table number, and the table number can be used as a seed. However, the table number is 48 bits of data, so that to convert 48 bits of data into n-Bit data, the same seed may be converted during the conversion process, and the generated random number is not random. Therefore, the conversion of 48 bits into n-Bit data is critical.
The specific conversion algorithm is as follows:
t is the number of cycles of n-Bit data
T＝48/n
If n cannot be evenly divided by 48, T ═ T + 1;
the 48Bit data is then summed every nbit, then arithmetically averaged, and the resulting value is then summed with the system Tick, and the resulting value is used as a seed. But this is still possible to repeat. But the repetition probability should be low.
The number of random bits n depends on the network size, n being 8 if the network size is within 255, n being 9 if the network size is within 512, n being 10 if the network size is within 1024, and n being 11 if the network size is within 2048.
The small random number generation algorithm uses the rand () function in the standard C library.
In the aspect of parameter setting, 1) the network scale M, 2) the scale coefficient MACBE, 3) the signal strength threshold, and 4) the life cycle (forwarding times).
The foregoing is considered as illustrative of the preferred embodiments of the invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (5)
1. A blind relay dynamic routing method is characterized in that: the source node sends out a request, all the groups of nodes A, B, C can receive the request and all enter a state to be forwarded, the forwarding time T is calculated according to a P-CSMA random algorithm, different sending priorities are generated according to the received signal intensity of the nodes, the forwarding control is carried out at a network layer, the CSMA/CA forwarding is carried out at an MAC layer, and the blind relay forwarding process is as follows:
at the network layer, a) receiving a data frame from the MAC layer, and discarding if the data frame is a repeating frame; if the APS node is the target node, sending a command of stopping forwarding, and transmitting data to the APS module; otherwise, carrying out relay processing; b) if the life cycle is 0, the forwarding is not carried out; if the signal strength threshold is not satisfied, forwarding is not carried out, under the blind relay route, the low threshold is set to be 0, and the high threshold is set to define a near node; otherwise, requesting the MAC layer to forward and entering a relay forwarding state; c) if the state is in the relay forwarding state and the notice of stopping forwarding is received from the MAC, the relay forwarding state is stopped; d) if a data frame forwarded by a next layer node or a repeated data frame of a previous layer node is received, discarding; e) if the data frame forwarded by the same-layer node is received, if the data frame is a near node, stopping the relay forwarding state and informing the MAC layer; otherwise, adjusting the priority, informing the MAC layer to stop the current forwarding, and submitting a forwarding request to the MAC layer again; f) if the timing is overtime, stopping forwarding and informing the MAC layer;
at the MAC layer, a) a data frame is received from the physical layer, the network identification is checked, and the MAC layer destination address is xffff; if not, discarding; b) if the current state is not in the waiting forwarding state, submitting the data frame to a network layer; c) if the frame is in a waiting forwarding state and in a CFP (computational fluid dynamics), stopping forwarding and notifying a network layer if the frame is an acknowledgement frame; d) if the data frame is in the waiting forwarding state and the SCP, stopping the forwarding state and submitting the data frame to a network layer; e) if the terminal is in a waiting forwarding state, is in an SCP (service control point) and is delayed to be back-off, sending is carried out, the forwarding state is stopped, and a network layer is informed; f) if receiving the command of stopping forwarding from the network layer, the target node receives confirmation, and if the target node is in forwarding waiting, the target node stops; immediately sending a command of stopping forwarding without competition; g) if receiving the blind relay sending request from the network layer, generating the back-off time according to the priority level and the network scale, entering a waiting sending state, starting CFP time delay, and starting the back-off time delay after reaching the time;
the node participating in the contention forwarding determines the sending time of the node itself in the contention period according to the priority of the node itself, the contention period T is equally divided into T1 and T2, T2 is then equally divided into T21 and T22, T1 is used for the node with the highest priority, QB is 0, T21 is used for the node with QB being 1, and T22 is used for the node with QB being 2;
in each sub-period, the node determines the sending time by adopting a random function: in each sub-period, the node determines the sending time by adopting a random function: t is Random (0, L), L is T1, and the length of T21 or T22 is the number of zero-crossing points;
generating different sending priorities according to the strength of the received signals of the nodes, namely dividing the Q value of the received signals into three gears, setting the gear value as QB, setting the QB value as 0 in the range of (2-7), and setting the Q value as a near node; q value is in the range of (8-12), QB is 1, and the intermediate node is obtained; q value is in the range of (13-15), QB is 2, and is a far node.
2. The blind relay dynamic routing method of claim 1, wherein: the nodes in the forwarding state compete for forwarding in the competition period, the nodes determine the sending time of the nodes in the competition period according to the priorities of the nodes, and in order to reduce the collision probability, the total length T of the competition period adopts a zero crossing point as a unit, and the total length T of the competition period is determined by combining the number of the nodes participating in the competition.
3. The blind relay dynamic routing method of claim 2, wherein: the total length of the contention period T is determined in conjunction with the network size: t is M × f, M is the total number of nodes on the network scale, f is a coefficient, and f is 1/2.
4. The blind relay dynamic routing method of claim 3, wherein: t1: 32, 64, 128, 256, T21, T22: 16, 32, 64, 128, and determining the random number to be 4, 5, 6, 7, 8 bits respectively.
5. The blind relay dynamic routing method of claim 4, wherein: based on the wireless HART standard or the data transmission of IEEE 802.15.4 or ISA 100.11 a.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910004612.0A CN109618382B (en) | 2019-01-03 | 2019-01-03 | Blind relay dynamic routing mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910004612.0A CN109618382B (en) | 2019-01-03 | 2019-01-03 | Blind relay dynamic routing mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109618382A CN109618382A (en) | 2019-04-12 |
| CN109618382B true CN109618382B (en) | 2022-04-19 |
Family
ID=66016122
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910004612.0A Active CN109618382B (en) | 2019-01-03 | 2019-01-03 | Blind relay dynamic routing mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109618382B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110995316B (en) * | 2019-11-27 | 2022-02-11 | 深圳市力合微电子股份有限公司 | Routing method for high-speed power line carrier network communication |
| CN111464435B (en) * | 2020-03-18 | 2021-12-03 | 深圳市力合微电子股份有限公司 | Power line carrier communication method oriented to Internet of things |
| CN111585614B (en) * | 2020-03-26 | 2021-12-31 | 深圳市力合微电子股份有限公司 | Routing method of adaptive blind relay |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102076052A (en) * | 2010-12-31 | 2011-05-25 | 深圳市北川电子有限公司 | Automatic relay route method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7136361B2 (en) * | 2001-07-05 | 2006-11-14 | At&T Corp. | Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation |
| AU2002352922A1 (en) * | 2001-11-28 | 2003-06-10 | Millennial Net | Etwork protocol for an ad hoc wireless network |
| US10686914B2 (en) * | 2014-11-04 | 2020-06-16 | Texas Instruments Incorporated | Automatic selection of MAC protocol to support multiple prime PLC standards |
-
2019
- 2019-01-03 CN CN201910004612.0A patent/CN109618382B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102076052A (en) * | 2010-12-31 | 2011-05-25 | 深圳市北川电子有限公司 | Automatic relay route method |
Non-Patent Citations (1)
| Title |
|---|
| 基于LME2210盲中继算法改进;tljw_jym013;《https://wenku.baidu.com/view/bb9c00aef61fb7360b4c65b3.html》;20140825;第1-3部分，附图 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109618382A (en) | 2019-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109618382B (en) | Blind relay dynamic routing mode | |
| CN105554887B (en) | A kind of Wireless MESH network distributed resource allocation method based on TDMA | |
| CN112764407B (en) | Distributed control non-periodic communication method | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN108307439B (en) | Self-adaptive back-off method under large number of multi-hop wireless nodes | |
| JP6165304B2 (en) | Method for determining an operating channel in a communication network, energy limited device and proxy device thereof | |
| CN105340229A (en) | Dynamically adjusting frame MTU to support low-latency communication | |
| CN103873387A (en) | Industrial Ethernet-oriented deterministic communication scheduling method | |
| CN105072663B (en) | A kind of ad hoc network method based on low rate wireless network | |
| WO2021025921A1 (en) | Heterogeneous networks using two channel hopping protocols | |
| Aby et al. | SLACK-MAC: Adaptive MAC protocol for low duty-cycle wireless sensor networks | |
| Zhu et al. | UPMAC: A localized load-adaptive MAC protocol for underwater acoustic networks | |
| CN109068402A (en) | Wireless ad hoc network construction method and wireless ad hoc network data transmission method | |
| Monica et al. | A wave-based request-response protocol for latency minimization in WSNs | |
| Ahmad et al. | A polynomial scheduling algorithm for IEEE 802.15. 4/ZigBee cluster tree WSN with one collision domain and period crossing constraint | |
| JP2016500502A (en) | Improvements to active signaling in cognitive wireless communication networks | |
| KR101467310B1 (en) | Method for media access control of vehicular ad hoc network using variable length frame and road side unit using the same | |
| JP2010178314A (en) | Network system | |
| US11546874B1 (en) | Systems and methods for reducing network traffic | |
| Pande et al. | Various ways to implement energy efficient WiseMAC protocol for wireless sensor network | |
| WO2005057830A2 (en) | System and method for dynamically determining rservation parmeters in a wireless network | |
| JP2017041882A (en) | Data transmission method, device and node | |
| Xiong et al. | ACK Broadcast Scheme to Improve Performance for Wake-Up Radio Enabled WSNs | |
| CN117478501A (en) | Method, control device and storage medium for configuration of EPA network | |
| KR102198508B1 (en) | LoRa Communication System and Method thereof for enabling reception of a message requesting an update of information |
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 | ||
| CP03 | Change of name, title or address |
Address after: Room 1-101C415, Building 1, Science and Technology Entrepreneurship Building, No. 19 Yangshan Road, Xuzhou Economic and Technological Development Zone, Xuzhou City, Jiangsu Province, 221000 Patentee after: Jiangsu Golden Pointer Electronic Technology Co.,Ltd. Address before: 710077 room 2006, unit 1, building 2, cappuccino residence, No. 1, Minjie Road, Yanta District, Xi'an City, Shaanxi Province Patentee before: XI'AN JINZHIZHEN ELECTRONIC TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |