CN111541508B - LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load - Google Patents

LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load Download PDF

Info

Publication number
CN111541508B
CN111541508B CN202010316807.1A CN202010316807A CN111541508B CN 111541508 B CN111541508 B CN 111541508B CN 202010316807 A CN202010316807 A CN 202010316807A CN 111541508 B CN111541508 B CN 111541508B
Authority
CN
China
Prior art keywords
spreading factor
node
optimized
short
lora
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
Application number
CN202010316807.1A
Other languages
Chinese (zh)
Other versions
CN111541508A (en
Inventor
谭洪舟
朱碧青
陈荣军
谢舜道
陆许明
徐永键
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Yat Sen University
Original Assignee
Sun Yat Sen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sun Yat Sen University filed Critical Sun Yat Sen University
Priority to CN202010316807.1A priority Critical patent/CN111541508B/en
Publication of CN111541508A publication Critical patent/CN111541508A/en
Application granted granted Critical
Publication of CN111541508B publication Critical patent/CN111541508B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation
    • H04J13/18—Allocation of orthogonal codes
    • H04J13/20—Allocation of orthogonal codes having an orthogonal variable spreading factor [OVSF]

Abstract

The invention discloses a LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load, which initializes the spread spectrum factor of a node according to the distance between the node and a gateway and the lowest receiving sensitivity; then, according to the short-term sending success rate after a certain amount of data transmission, judging the channel condition of each node, and then adjusting the spread spectrum factor of each node according to the channel condition and the sending success rate of the nodes distributed in Poisson; and finally, according to the service radius of the spreading factor of each node, restraining the load in the service radius of each node within the optimal load range, and limiting the number of nodes with the same spreading factor in the service radius of the node. The method of the invention comprehensively allocates the spread spectrum factors and can effectively reduce the collision of the LoRaWAN network. Simulation experiments show that the method can improve the data receiving rate of the LoRaWAN network by 3% -10%, and effectively improves the reliability of the LoRaWAN network.

Description

LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load
Technical Field
The invention relates to the technical field of low-power-consumption wide area network wireless, in particular to a LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load.
Background
LoRaWAN is a set of communication protocol and system architecture designed for LoRa remote communication network, is a Media Access Control (MAC) protocol, and mainly provides a standard support for global LoRa application persons, and provides large-scale and low-power-consumption service for the Internet of things. For a large-scale and high-density application scenario of the LoRaWAN network, data among the same spreading factors can still collide, and the collision is severe due to the high density and the severe path loss, so that the stability of the LoRaWAN network in the large-scale and high-density scenario is greatly influenced, and the node power consumption caused by repeated retransmission of nodes is increased.
Disclosure of Invention
The invention provides a LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load, aiming at solving the problems of low network stability and node power consumption increase caused by serious collision among spread spectrum factors in the high-density LoRaWAN.
In order to achieve the above purpose, the technical means adopted is as follows:
the LoRaWAN spreading factor distribution method based on short-term DER and optimal load comprises the following steps:
s1, for a LoRaWAN network, setting an initial spreading factor of a LoRa node according to the distance between the LoRa node and a gateway and the lowest receiving sensitivity of the LoRa node;
s2, LoRa data transmission is carried out based on the initial spreading factor, and the distribution of the spreading factor is dynamically adjusted according to the channel characteristics and short-term DER (data transmission success rate), so that the optimized spreading factor after preliminary optimization is obtained;
and S3, according to the optimized spreading factor after the preliminary optimization, judging the optimal load and adjusting the spreading factor distribution again to obtain the final spreading factor distribution result so as to maintain the optimal load in the service radius and reduce the packet collision among the same spreading factors in high density.
In the above scheme, the spreading factor of the LoRa node is initialized according to the lowest receiving sensitivity and the path loss characteristic of the LoRa node, the transmission characteristic of the loran network is analyzed on the basis, the SF of the LoRa node is dynamically adjusted according to the DER (data transmission success rate) of short-term data packet transmission, the optimal load is judged, and the optimal load within the service radius of each SF is limited. And finally, optimal SF distribution is obtained, so that the data transmission success rate can be improved to a greater extent, particularly in a high-density network, and the reliability and the capacity of the network are improved.
Preferably, the step S1 specifically includes:
in LoRa data transmission, the received signal strength rssi of each packet must be greater than the lowest receiving sensitivity sensi [ SF ], and the receiver side can receive the signal and correctly unpack the signal;
wherein sensi is the lowest receive sensitivity of an array containing each spreading factor SF;
wherein rssi ═ prx＝ptx-GL-Lpl，GLFor antenna gain, ptxFor data transmission power, LplRepresents the lognormal shadow path loss, Lpl＝Lpld0+10γlog(d/d0)+Xσγ is the path loss exponent, XσIs normal with zero meanDistribution, σ is variance, Lpld0To be at a reference distance d0D is the transmit-receive distance, d0Is a reference distance;
and initializing the spreading factors of each node based on the constraints to obtain each initial spreading factor SF and updating the number nrsf [ SF ] of each initial spreading factor SF.
Preferably, the short-term DER is a DER of each node calculated in a time period in which the LoRa node transmits 20 packets in the LoRa data transmission. In the preferred scheme, the short-term DER can represent the short-term channel condition of the node, and the spreading factor is adjusted according to the short-term DER, so that node collision under intensive deployment is reduced, and the data transmission success rate of the node is improved.
Preferably, the step S2 of dynamically adjusting spreading factor allocation according to the channel characteristics and the short-term DER specifically includes:
if the short-term DER is below MTS and the initial spreading factor SF is less than 12, then SF ═ SF + 1; nrsf [ SF-1] if short term DER is greater than PRI]Less than sqi [ SF-1]]And SF is greater than 7, then SF-1; obtaining optimized spreading factor SF distribution adjusted and optimized according to actual channel dynamic condition, and updating optimized spreading factor SF quantity nrsf [ SF](ii) a The method comprises the following steps that A, a data flow rate is obtained, wherein DER is R/T, T is the total number of packets sent by an LoRa node, and R is the number of packets received by a gateway by the LoRa node; MTS represents the minimum tolerance threshold; PRI represents a desired improvement threshold; sqi is a standard quantity threshold that is,
Figure GDA0003054431290000021
Figure GDA0003054431290000022
sqi[SF]representing the standard number of spreading factors SF, NtotalIs the total number of LoRa nodes.
Preferably, the step S3 specifically includes:
s31, for the optimized spreading factor, respectively calculating the service radius and the optimal load of the optimized spreading factor:
radius of service ds＝sqrt((0.5*(Dnet^2)*nbChannels)/(Ntotal*λi*Ttx)+ds-1^2)
Wherein d issFor the optimized service radius of the optimized spreading factor SF, the optimized spreading factor SF refers to the number of chips converted into each symbol, the optimized spreading factor SF is a natural number, and when SF is 7, d7-Is 0, NtotalTotal number of LoRa nodes, nbChannelsIs the number of channels, DnetIs the distance, λ, of the gateway from the farthest nodeiTo optimize the number of packets transmitted by a node per unit time, T, for a node with a spreading factor SFtxTo transmit time, ds-1The service radius of the optimized spreading factor SF-1 is obtained;
optimum load Goptimal＝0.5*nbChannels＝Ttx*N*λi，nbChannelsIs the number of channels, λiOptimizing the number of packets sent by a node with a spreading factor of SF in unit time; t istxFor sending time, N represents the number of SF nodes of all optimized spreading factors in the service radius of each optimized spreading factor SF; t istxIs the sending time;
s32, if the load in the service radius of the optimized spreading factor SF exceeds the optimal load, limiting the distribution of the optimized spreading factor SF:
number of nodes opt with spreading factor SF optimized under optimum load]＝(0.5*nbChannels)/(Ttx*λi)＝N＝- Goptimal/(Ttx*λi)，nbChannelsIs the number of channels, TtxIs the sending time;
judging whether the quantity nrsf (SF) of the optimized spreading factors SF is larger than opt (SF), if not, outputting the current optimized spreading factors SF, namely the final spreading factor distribution result; if yes, judging whether the received signal strength rssi of the node is greater than the lowest receiving sensitivity sensi [ SF-1] of the spreading factor SF-1, and if so, judging that the received signal strength rssi of the node is equal to SF-1; otherwise SF + 1.
In the preferred embodiment, according to the result of the tuned and optimized SF obtained in step S2, the optimal load determination is performed to limit the use of the SF within the service radius of a certain SF, so that the collision of the same spreading factor within a certain range can be effectively reduced, and the data transmission success rate of the node is improved.
Preferably, L in step S1pld0Set to 127.41dB, γ to 2.08, and σ to 0.
Preferably, the MTS value is set to 40%; the PRI value was set to 80%.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that:
the LoRaWAN spread spectrum factor distribution method based on the short-term DER and the optimal load initializes the spread spectrum factor of the node according to the distance between the node and the gateway and the lowest receiving sensitivity; then, according to the short-term sending success rate after a certain amount of data transmission, judging the channel condition of each node, and then adjusting the spread spectrum factor of each node according to the channel condition and the sending success rate of the nodes distributed in Poisson; and finally, according to the service radius of the spreading factor of each node, restraining the load in the service radius of each node within the optimal load range, and limiting the number of nodes with the same spreading factor in the service radius of the node. The method of the invention comprehensively allocates the spread spectrum factors and can effectively reduce the collision of the LoRaWAN network. Simulation experiments show that the method can improve the data receiving rate of the LoRaWAN network by 3% -10%, and effectively improves the reliability of the LoRaWAN network.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 is a protocol layer illustration of a LoRaWAN network.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
for the purpose of better illustrating the embodiments, certain features of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product;
it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
As shown in fig. 1, a method for allocating a LoRaWAN spreading factor based on a short-term DER and an optimal load includes:
s1, for a LoRaWAN network, setting an initial spreading factor of a LoRa node according to the distance between the LoRa node and a gateway and a minimum receiving sensitivity threshold table 1;
Figure GDA0003054431290000041
TABLE 1
In LoRa data transmission, the received signal strength rssi of each packet must be greater than the lowest receiving sensitivity sensi [ SF ], and the receiver side can receive the signal and correctly unpack the signal;
wherein sensi is the lowest receive sensitivity of an array containing each spreading factor SF;
wherein rssi ═ prx＝ptx-GL-Lpl，GLFor antenna gain, ptxFor data transmission power, LplRepresents the lognormal shadow path loss, Lpl＝Lpld0+10γlog(d/d0)+Xσγ is the path loss exponent, XσIs a zero mean normal distribution, σ is a variance, Lpld0To be at a reference distance d0D is the transmit-receive distance, d0Is a reference distance; in this embodiment, Lpld0Set to 127.41dB, γ to 2.08, and σ to 0.
And initializing the spreading factors of each node based on the constraints to obtain each initial spreading factor SF and updating the number nrsf [ SF ] of each initial spreading factor SF.
And S2, carrying out LoRa data transmission based on the initial spreading factor, and calculating the short-term DER of each node in the period after the LoRa node sends 20 packets, wherein the short-term DER can represent the short-term channel condition of the node. Then, the distribution of the spreading factors is dynamically adjusted according to the channel characteristics and the short-term DER, so that node conflict under intensive deployment is reduced, and the data transmission success rate of the nodes is improved; the strategy for dynamically adjusting the spreading factor is as follows:
if the short-term DER is below MTS and the initial spreading factor SF is less than 12, then SF ═ SF + 1; nrsf [ SF-1] if short term DER is greater than PRI]Less than sqi [ SF-1]]And SF is greater than 7, then SF-1; get the channel dynamics according to realityOptimized spreading factor SF allocation with adjusted condition and updating optimized spreading factor SF number nrsf](ii) a The method comprises the following steps that A, a data flow rate is obtained, wherein DER is R/T, T is the total number of packets sent by an LoRa node, and R is the number of packets received by a gateway by the LoRa node; MTS represents the minimum tolerance threshold, and the value is 40%; PRI represents the desired improvement threshold, which is 80%; sqi is a standard quantity threshold that is,
Figure GDA0003054431290000051
Figure GDA0003054431290000052
sqi[SF]representing the standard number of spreading factors SF, NtotalIs the total number of LoRa nodes.
And obtaining the optimized spreading factor after preliminary optimization after adjustment by the strategies.
S3, according to the optimized spreading factors after the preliminary optimization, carrying out optimal load judgment and readjusting spreading factor distribution to limit that the nodes with the same spreading factors in the service radius of each optimized spreading factor are too dense to cause serious data collision among the nodes with the same spreading factors, and specifically comprising the following steps:
s31, for the optimized spreading factor, respectively calculating the service radius and the optimal load of the optimized spreading factor:
radius of service ds＝sqrt((0.5*(Dnet^2)*nbChannels)/(Ntotal*λi*Ttx)+ds-1^2)
Wherein d issFor the optimized service radius of the optimized spreading factor SF, the optimized spreading factor SF refers to the number of chips converted into each symbol, the optimized spreading factor SF is a natural number, and when SF is 7, d7-Is 0, NtotalTotal number of LoRa nodes, nbChannelsIs the number of channels, DnetIs the distance, λ, of the gateway from the farthest nodeiTo optimize the number of packets transmitted by a node per unit time, T, for a node with a spreading factor SFtxTo transmit time, ds-1The service radius of the optimized spreading factor SF-1 is obtained;
optimum load Goptimal＝0.5*nbChannels＝Ttx*N*λi，nbChannelsIs the number of channels, λiOptimizing the number of packets sent by a node with a spreading factor of SF in unit time; t istxFor sending time, N represents the number of SF nodes of all optimized spreading factors in the service radius of each optimized spreading factor SF; t istxIs the sending time;
s32, if the load in the service radius of the optimized spreading factor SF exceeds the optimal load, limiting the distribution of the optimized spreading factor SF:
number of nodes opt with spreading factor SF optimized under optimum load]＝(0.5*nbChannels)/(Ttx*λi)＝N＝- Goptimal/(Ttx*λi)，nbChannelsIs the number of channels, TtxIs the sending time;
judging whether the quantity nrsf (SF) of the optimized spreading factors SF is larger than opt (SF), if not, outputting the current optimized spreading factors SF, namely the final spreading factor distribution result; if yes, judging whether the received signal strength rssi of the node is greater than the lowest receiving sensitivity sensi [ SF-1] of the spreading factor SF-1, and if so, judging that the received signal strength rssi of the node is equal to SF-1; otherwise SF + 1.
The final spreading factor allocation result is obtained through the above step S3 to maintain the optimal load within the service radius and reduce the packet collisions among the same spreading factors in high density. Simulation experiments show that the data receiving rate of the LoRaWAN network can be improved by 3% -10%, and the reliability of the LoRaWAN network is effectively improved.
Fig. 2 is a diagram illustrating protocol layers of the LoRaWAN network according to this embodiment.
The terms describing positional relationships in the drawings are for illustrative purposes only and are not to be construed as limiting the patent;
it should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (6)

1. The LoRaWAN spreading factor distribution method based on short-term DER and optimal load is characterized by comprising the following steps:
s1, for a LoRaWAN network, setting an initial spreading factor of a LoRa node according to the distance between the LoRa node and a gateway and the lowest receiving sensitivity of the LoRa node;
s2, LoRa data transmission is carried out based on the initial spreading factor, and distribution of the spreading factor is dynamically adjusted according to channel characteristics and short-term DER, so that the optimized spreading factor after preliminary optimization is obtained;
s3, according to the optimized spreading factors after the preliminary optimization, judging the optimal load and adjusting the spreading factor distribution again to obtain the final spreading factor distribution result so as to maintain the optimal load in the service radius and reduce the packet collision among the same spreading factors in high density; the step S3 specifically includes:
s31, for the optimized spreading factor, respectively calculating the service radius and the optimal load of the optimized spreading factor:
radius of service ds＝sqrt((0.5*(Dnet^2)*nbChannels)/(Ntotal*λi*Ttx)+ds-1^2)
Wherein d issFor the optimized service radius of the optimized spreading factor SF, the optimized spreading factor SF refers to the number of chips converted into each symbol, the optimized spreading factor SF is a natural number, and when SF is 7, d7Is 0, NtotalTotal number of LoRa nodes, nbChannelsIs the number of channels, DnetIs the distance, λ, of the gateway from the farthest nodeiTo optimize the number of packets transmitted by a node per unit time, T, for a node with a spreading factor SFtxTo transmit time, ds-1The service radius of the optimized spreading factor SF-1 is obtained;
optimum load Goptimal＝0.5*nbChannels＝Ttx*N*λi，nbChannelsN represents the number of SF nodes in the service radius of each optimized spreading factor SF; t istxFor transmission time, λiOptimizing the number of packets sent by one node in unit time by the node with the spreading factor SF;
s32, if the load in the service radius of the optimized spreading factor SF exceeds the optimal load, limiting the distribution of the optimized spreading factor SF:
number of nodes opt with spreading factor SF optimized under optimum load]＝(0.5*nbChannels)/(Ttx*λi)＝N＝-Goptimal/(Ttx*λi)，nbChannelsIs the number of channels, TtxIs the sending time;
judging whether the quantity nrsf (SF) of the optimized spreading factors SF is larger than opt (SF), if not, outputting the current optimized spreading factors SF, namely the final spreading factor distribution result; if yes, judging whether the received signal strength rssi of the node is greater than the lowest receiving sensitivity sensi [ SF-1] of the spreading factor SF-1, and if so, judging that the received signal strength rssi of the node is equal to SF-1; otherwise SF + 1.
2. The method of claim 1, wherein the step S1 specifically includes:
in LoRa data transmission, the received signal strength rssi of each packet must be greater than the lowest receiving sensitivity sensi [ SF ], and the receiver side can receive the signal and correctly unpack the signal;
wherein sensi is the lowest receive sensitivity of an array containing each spreading factor SF;
wherein rssi ═ prx＝ptx-GL-Lpl，GLFor antenna gain, ptxFor data transmission power, LplRepresents the lognormal shadow path loss, Lpl＝Lpld0+10γlog(d/d0)+Xσγ is the path loss exponent, XσIs a zero mean normal distribution, σ is a variance, Lpld0To be at a reference distance d0D is the transmit-receive distance, d0Is a reference distance;
and initializing the spreading factors of each node based on the constraints to obtain each initial spreading factor SF and updating the number nrsf [ SF ] of each initial spreading factor SF.
3. The LoRaWAN spreading factor allocation method based on short-term DER and optimal load as claimed in claim 2, wherein the short-term DER is DER of each node calculated in a period of 20 packets sent by LoRa node in LoRa data transmission.
4. The LoRaWAN spreading factor allocation method according to claim 3, wherein the step S2 of dynamically adjusting the spreading factor allocation according to the channel characteristics and the short-term DER is specifically as follows:
if the short-term DER is below MTS and the initial spreading factor SF is less than 12, then SF ═ SF + 1; nrsf [ SF-1] if short term DER is greater than PRI]Less than sqi [ SF-1]]And SF is greater than 7, then SF-1; obtaining optimized spreading factor SF distribution adjusted and optimized according to actual channel dynamic condition, and updating optimized spreading factor SF quantity nrsf [ SF](ii) a The method comprises the following steps that A, a data flow rate is obtained, wherein DER is R/T, T is the total number of packets sent by an LoRa node, and R is the number of packets received by a gateway by the LoRa node; MTS represents the minimum tolerance threshold; PRI represents a desired improvement threshold; sqi is a standard quantity threshold that is,
Figure FDA0003054431280000021
Figure FDA0003054431280000022
sqi[SF]representing the standard number of spreading factors SF, NtotalIs the total number of LoRa nodes.
5. The method of claim 2, wherein the L in step S1 is L-pld0Set to 127.41dB, γ to 2.08, and σ to 0.
6. The method of claim 4, wherein the MTS value is set to 40%; the PRI value was set to 80%.
CN202010316807.1A 2020-04-21 2020-04-21 LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load Active CN111541508B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010316807.1A CN111541508B (en) 2020-04-21 2020-04-21 LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010316807.1A CN111541508B (en) 2020-04-21 2020-04-21 LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load

Publications (2)

Publication Number Publication Date
CN111541508A CN111541508A (en) 2020-08-14
CN111541508B true CN111541508B (en) 2021-07-27

Family

ID=71980122

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010316807.1A Active CN111541508B (en) 2020-04-21 2020-04-21 LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load

Country Status (1)

Country Link
CN (1) CN111541508B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112020105B (en) * 2020-08-26 2022-08-12 贵州电网有限责任公司 LoRa transmission-based rate self-adaption method for power grid
CN114584424B (en) * 2020-12-01 2024-01-02 深圳绿米联创科技有限公司 Communication method, communication device, electronic apparatus, and computer-readable storage medium
CN113644933B (en) * 2021-09-29 2022-05-10 中南大学 Adaptive direct sequence spread spectrum communication method, system and medium
CN114173421B (en) * 2021-11-25 2022-11-29 中山大学 LoRa logic channel based on deep reinforcement learning and power distribution method
CN114828161B (en) * 2022-03-23 2023-04-25 江苏南能电气有限公司 Lora equipment ad hoc network method and upgrading system
CN114760709B (en) * 2022-03-24 2023-02-03 中山大学 LoRa node distribution model construction method, node distribution method and device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN207321256U (en) * 2017-08-08 2018-05-04 北方节能股份有限公司 A kind of repeater of scene LoRa radio spread spectrum communications

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN207321256U (en) * 2017-08-08 2018-05-04 北方节能股份有限公司 A kind of repeater of scene LoRa radio spread spectrum communications

Also Published As

Publication number Publication date
CN111541508A (en) 2020-08-14

Similar Documents

Publication Publication Date Title
CN111541508B (en) LoRaWAN spread spectrum factor distribution method based on short-term DER and optimal load
US7570627B2 (en) Method for sharing bandwidth using reduced duty cycle signals and media access control
US8463308B2 (en) Terminal transmit power control with link adaptation
EP1848127B1 (en) Transport format combination selecting method, wireless communication system, and mobile station
CN113038541B (en) Adaptive LoRaWAN network rate adjusting method based on conflict perception
CN108449763A (en) A kind of LoRaWAN self-adapted adjustment method for network speed based on channel status identification
CN101277271B (en) Access control method for distributed CDMA network medium with controllable power
CN110138757B (en) Space division multiple access SDMA-SPMA multiple access system
CN113794984B (en) Multi-station multi-machine space downlink time slot space division multiplexing distribution system
CN105072676A (en) Time division multiple address (TDMA) protocol based aeronautical Ad Hoc network power control method
Kim et al. Rate-adaptive MAC protocol in high-rate personal area networks
CN110662233B (en) Statistical priority multiple access method based on directional antenna receiving and transmitting
JP2002043996A (en) Method and apparatus for controlling transmission power threshold in satellite communication system
CN1310557C (en) Method and apparatus for transmission rate modification of communication channels
CN115884343B (en) High-mobility ad hoc network dynamic power distribution method based on directional multi-beam antenna
EP1195920B1 (en) Method of initial transmission power determination
Somarriba et al. Transmission control for spatial TDMA in wireless radio networks
CN115988618A (en) Low-power consumption narrow-band wireless communication data link control method
CN112073392B (en) LoRaWAN-based efficient wireless seismic data transmission protocol design method
CN101800567A (en) Method for distributing forwarding time slot and selecting relay node in cooperative ultra-wide band
US6907018B1 (en) Method and system for initial power management for data bursts in CDMA systems
CN102158967A (en) Space multiplexing method, device and system for allocating transmission time slots for communication links
So et al. A Simple and Practical Scheme Using Multiple Channels for Improving System Spectral Efficiency of Highly Dense Wireless LANs
Jin et al. LoRa network planning based on improved ISODATA algorithm
CN107426767B (en) Dynamic network access method suitable for business imbalance

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