CN110784910A - LoRa network new service node access method - Google Patents
LoRa network new service node access method Download PDFInfo
- Publication number
- CN110784910A CN110784910A CN201911049679.2A CN201911049679A CN110784910A CN 110784910 A CN110784910 A CN 110784910A CN 201911049679 A CN201911049679 A CN 201911049679A CN 110784910 A CN110784910 A CN 110784910A
- Authority
- CN
- China
- Prior art keywords
- channel
- service node
- new service
- service
- new
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 title claims abstract description 49
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000001960 triggered effect Effects 0.000 claims abstract description 7
- 238000013461 design Methods 0.000 claims abstract description 5
- 238000004891 communication Methods 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 6
- 239000000779 smoke Substances 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 108010003272 Hyaluronate lyase Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
- H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/18—Selecting a network or a communication service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a new service node access method of a LoRa network, belonging to the field of wide area network wireless technology. The method comprises the following steps: a new service node applies for access; the LoRa network informs all available service channel information of the new service node, and the new service node constructs an available channel list; the new service node monitors each service channel in turn according to the sequence in the available channel list to obtain the message frequency of each service channel; the new service node calculates the weighted probability that all service channels have enough idle time in unit time, and reorders the available channel list according to the calculation result; and searching the available channel table when the new service node is triggered to report the message, and selecting the most appropriate service channel from the available channel table for access. The method is applied to a communication network consisting of LoRa equipment, and can be compatible with new service nodes outside the design in the LoRa network, thereby improving the utilization rate of LoRa network channel resources.
Description
Technical Field
The invention belongs to the technical field of LoRa wireless communication, particularly relates to the problem of compatibility of different services during the work of a LoRa network, and provides a method for accessing a new service node of the LoRa network, which mainly solves the problem that the new service node is triggered when the LoRa network works and how to select a proper service channel to access the new service node, thereby improving the utilization rate of the channel resources of the LoRa network.
Background
In recent years, the internet of things industry is rapidly developing, and the LoRa technology is increasingly applied as a new internet of things communication technology by taking advantages of long transmission distance, low power consumption and high sensitivity.
When an LoRa network is deployed, different services need to use channel resources, the number of devices in different services is different, the generated data volume is different, and when the data volume of a single service is large, a set of LoRa network needs to be established physically for the service; when the data volume of a single service is small, the service can be mounted on channels of other services in design to complete information reporting; while the service messages are between high data volume and low data volume, the LoRa network has difficulty in considering such service nodes during normal operation. In the conventional method for processing such service nodes, after the node device reports the information of the application channel to the server, the server uniformly allocates the channel for the new service, and such a design mode mainly completes the calculation by the server, which increases the complexity of the system and delays the response of the real-time requirement of the new service node in actual operation.
The method of the invention provides a new service node access method of the LoRa network, which carries out channel interception self-adaptive selection of a proper service channel through the new service node, thereby realizing the compatibility of the new service node into the LoRa network of other services.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: and when the LoRa network is working, the new service node selects a proper channel to access.
The solution of the invention is as follows: a new service node access method of LoRa network is characterized in that the method mainly comprises the following steps:
firstly, all service channels of an LoRa network are occupied by services in the working LoRa network, a new service node wants to upload messages by using the LoRa network at the moment, the new service node needs to report messages applying for using channels through the broadcast channels of gateways, each gateway has one broadcast channel and a plurality of service channels, and the broadcast channel parameters of all the gateways are the same.
After the new service node reports the information for applying access, one or more gateways may receive the information in the area, each gateway sends the gateway number of the gateway, the number of service channels owned by the gateway, the basic parameters of each service channel and the number of the service channel in the gateway to the new service node through the broadcast channel after receiving the information of the new service node, and after receiving the information sent by all the gateways, the new service node sorts all the available service channels according to the sequence of the gateway numbers from small to large and the service channel numbers in the gateways from small to large, and establishes an available channel table.
And then, the new service node selects a service channel according to the sequence in the available channel list to monitor, monitors a unit time, and sets the length of the unit time in the new service node in advance. After the interception of the new service node is finished, the number x of idle time periods owned by the service channel in unit time and the length T of each idle time period are obtained
iAnd calculating the average time T of the idle time period in unit time, wherein the new service node has the basic parameters of the service channel and the data length of the transmitted information, so that the time T that the new service node needs to occupy the service channel can be calculated.
And then, solving the weighted probability that the new service node has enough time in unit time, wherein the enough time refers to whether an idle time period exists in the unit time, and the length of the idle time period is greater than the time T required by the new service node for reporting the message. Firstly, the probability P that a new service node has enough time in unit time is solved
1，P
1The Poisson distribution is satisfied, and the calculation formula is as follows:
the length of a plurality of idle time periods in unit time is possibly greater than the time T required by the new service node to report the message, so P is required
1Performing a weighted calculationThe calculation formula is as follows:
thus, the weighted probability P of enough idle time of the channel in unit time of the new service node can be obtained
2。
Obtaining the weighted probability P of the traffic channel
2Then, the new service node cycles the above steps to traverse all the service channels in the available channel list to obtain the weighted probability P of the new service node having enough time in unit time on all the service channels
2Then, the order of the available channel list is modified so that the available channel list is based on the weighted probability P
2Arranged in order from big to small. After traversing all the available channels, the above steps are circulated again, and the weighted probability P of all the traffic channels is obtained in turn from the first traffic channel in the available channel list
2And modifying the sequence of the available channel list again to rearrange the available channel list according to the sequence of the two average weighted probabilities from large to small. The new service node repeats the above steps and continuously modifies the order of the service channels in the available channel list.
When a new service node is triggered to need to use a service channel, the new service node searches an available channel table, selects a first service channel for monitoring, uses the service channel if the service channel is idle, and selects a next service channel in the available channel table for monitoring if the service channel is busy until the new service node is successfully accessed.
The new service node is exemplified in the method as follows: the LoRa network deployed in the area is designed for parking service, and as the parking service belongs to service with large data volume, the parking service occupies all service channels in the area, at this time, smoke sensing service needs to be accessed, the smoke sensing service has small data volume and channels are not independently divided for the smoke sensing service in the design, so that smoke sensing nodes are required to autonomously monitor all available service channels and select the service channel which is most suitable for the smoke sensing nodes to be accessed, and in this example, the new service nodes are smoke sensing nodes.
Compared with the prior art, the invention has the following beneficial effects:
compared with the prior method for distributing the unified channel by the server, the method for accessing the new service node of the LoRa network provided by the invention has the advantages that the process of selecting the service channel is completed by the new service node, the new service node autonomously monitors all available service channels, the probability that each service channel has enough idle time is calculated, and finally the most appropriate service channel is selected to be accessed in a self-adaptive manner, so that the system complexity is reduced, and the utilization rate of the LoRa network is improved.
Drawings
The invention will be described in further detail with reference to the following drawings and specific embodiments:
fig. 1 is a step diagram of a new service node access method of an LoRa network according to the present invention;
fig. 2 is a structural diagram of an LoRa network system according to the present invention;
fig. 3 is a schematic diagram of a new service node covered by two LoRa gateways in the present invention;
FIG. 4 is a diagram illustrating the operation of a traffic channel according to the present invention;
Detailed Description
The invention relates to a method for accessing a new service node of an LoRa network, which comprises the steps of the method shown in figure 1, wherein the method is applied to the LoRa network, and is a system structure diagram of the LoRa network shown in figure 2; the gateway is mainly used for forwarding messages, the gateway is provided with a plurality of LoRa modules which can be used for communicating with nodes, the gateway is provided with a plurality of transmission channels which are divided into a broadcast channel and a plurality of service channels, and the gateway stores gateway numbers and basic parameters of all LoRa devices; the nodes are loaded with sensors and LoRa equipment of different services, and report messages through the LoRa modules.
The idea of the invention is as follows: when the LoRa network works, the service occupies the traffic channel, and the service occupies all the traffic channels. When a new service node needs to use a service channel, the new service node establishes an available channel list and monitors all service channels, calculates the probability that each service channel has enough idle time, reorders all the service channels according to the probability, continuously and circularly monitors all the service channels, continuously corrects the sequence of the available channel list, and selects the most appropriate service channel to access according to the sequence of the available channel list when the new service node is triggered.
Taking two gateways and a new service node in the area of fig. 3 as an example, an embodiment of a method for applying for a channel by a new service node of an LoRa network according to the present invention is specifically described with reference to fig. 1:
in fig. 3, a total of two gateways M1 and M2 are deployed, each gateway has 4 channels, the remaining 3 of the gateways are traffic channels, one is a broadcast channel, and the broadcast channel parameters of the gateways M1 and M2 are the same. The new service node A sends the application access information through the broadcast channels of the gateways M1 and M2 in the LoRa network, after the gateways M1 and M2 receive the application access information, the gateway M1 and M2 inform the new service node A of all the service channel information through the broadcast channels, and the service channel information comprises the gateway number X of the gateways M1 and M2
1And X
2The number of the traffic channel in the gateway and the basic parameters of the traffic channel, wherein the basic parameters of the traffic channel comprise the frequency, the bandwidth, the spreading factor, the length of the synchronization word and other parameters of the LoRa module. After receiving the replies from the gateways M1 and M2, the new service node a sorts all the service channels according to the sequence of the gateway numbers from small to large and the service channel numbers from small to large, and establishes an available channel table, wherein the schematic diagram of the available channel table is as shown in table 1:
TABLE 1 available channel List
| Serial number | Gateway numbering | Numbering of channels in a gateway |
| p 1 | X 1 | 1 |
| p 2 | X 1 | 2 |
| p 3 | X 1 | 3 |
| p 4 | X 2 | 1 |
| p 5 | X 2 | 2 |
| p 6 | X 2 | 3 |
The new service node selects the traffic channel p in the order in table 1
1The interception is performed, the working condition of the traffic channel is as shown in fig. 4, each traffic channel has idle time periods with different lengths when working, and a new service node needs to monitor the traffic channel p
1Number x of idle periods per unit time and length T of each idle period
iThe average time t of the idle period is calculated, wherein the unit time is set to a fixed value in the new service node, here we set the unit time to 120 seconds.
The new service node is obtaining the service channel p
1Information of idle time periodAnd after that, calculating the time T that the new service node needs to occupy the service channel according to the basic parameters of the LoRa equipment of the service channel and the data length of the sent information. And then, solving the weighted probability that the new service node A has enough time within 120 seconds, wherein the enough time refers to whether an idle time period exists within 120 seconds, and the length of the idle time period is greater than the time T required by the new service node to report the message. Firstly, the probability P that a new service node has enough time within 120 seconds is sought
1，P
1The Poisson distribution is satisfied, and the calculation formula is as follows:
as shown in fig. 4, a traffic channel may have a plurality of idle periods within 120 seconds to satisfy greater than T, so we need to pair P according to the number x of idle periods occurring within 120 seconds
1And performing weighting calculation according to the following calculation formula:
thus, the new service node can obtain the 120 second internal service channel p
1Weighted probability P of having sufficient idle time
2。
The new service node then loops through the above steps, looping through all the traffic channels p in table one
1To p
6To obtain a traffic channel p
1To p
6Each having a weighted probability P of sufficient idle time within 120 seconds
2Then, the order of the available channel list is modified so that the available channel list is based on the weighted probability P
2Arranged in order from big to small. After all the service channels are traversed, the above steps are circulated again, and the weighted probability P of all the service channels is obtained in sequence from the first service channel in the available channel list
2Then, the probability P of weighting twice is calculated
2According to the order of the average values from large to small, the order in the available channel list is modified. The new service node continuously repeats the above steps and continuously revises the order of the service channels in the available channel listThe resulting list of available channels is shown in table 2:
TABLE 2 modified available channel List
| Serial number | Gateway numbering | Numbering of channels in a gateway |
| p 1 | X 1 | 2 |
| p 2 | X 2 | 1 |
| p 3 | X 1 | 3 |
| p 4 | X 2 | 3 |
| p 5 | X 2 | 2 |
| p 6 | X 1 | 1 |
When a new service node A is triggered and needs to report the message, the table 2 is searched, and the serial number is selected to be p
1Of a new service node A, monitors p
1If p is
1Using the traffic channel p when idle
1Reporting the message; if p is
1If occupied, selecting the serial number as p
2Until the new service node is successfully accessed.
When a new service node is accessed in a working LoRa network, a plurality of processing modes can be provided, and when the data volume is large, a service channel can be divided for the new service node again; when the data volume is small, the channel resource is wasted by dividing the special service channel for the new service node, the invention can lead the new service node to autonomously monitor all available service channels and select a proper service channel for access, and can effectively improve the utilization rate of the LoRa network.
Claims (7)
1. A new service node access method of an LoRa network is characterized by mainly comprising the following steps:
A. in the LoRa network, a new service node applies for using a channel;
the LoRa gateway informs all available service channel information of the new service node, and the new service node constructs an available channel list;
C. the new service node selects a service channel from the available channel list to monitor, and idle time period information owned by the service channel is obtained;
D. the new service node calculates the weighted probability that the service channel has enough idle time according to the data in the step C and the time needed by the new service node;
E. step C and step D are circulated until all the service channels are traversed, and the new service node updates the available channel list according to the sequence of the weighted probability from large to small; circularly updating the available channel list from the step C to the step E;
F. when a new service node is triggered, a suitable service channel is selected from the available channel list for access.
2. The method as claimed in claim 1, wherein in step a, the method of the present invention is applied to an ongoing LoRa network, where a new service node applies for access for a service requirement outside the design of the LoRa network, and needs the new service node to report information of applying for access to gateways, each gateway in the LoRa network sets a broadcast channel and a plurality of service channels, all the gateways in the broadcast channel are the same, and the new service node reports information of applying for access through the broadcast channel.
3. The method as claimed in claim 1, wherein in step B, all gateways that have received the report from the new service node and applied for using the channel information send all service channel information of the gateway to the new service node through the broadcast channel, and the new service node constructs an available channel table from small to large according to the gateway number and the number sequence of the service channel in the gateway, wherein the service channel information includes the gateway number, the number of the service channel in the gateway, and the basic parameters of the service channel.
4. The method as claimed in claim 1, wherein in step C, the new service node selects the first traffic channel to listen according to the sequence in the available channel list, and the new service node obtains the number x of idle periods per unit time and the length T of each idle period
iThe average time t of all idle periods is calculated, wherein the unit time is set to a fixed value in the new service node.
5. The method of claim 1, wherein step D comprises the steps of:
D1) the new service node calculates the time T of the service channel to be occupied according to the service channel parameter and the data length of the message reported by the new service node;
D2) probability P that new service node has enough time per unit time
1The Poisson distribution is satisfied, and the calculation formula is as follows:
D3) new service node computation P
1Weighted probability P
2The calculation formula is as follows:
this gives the weighted probability P of the new service node having sufficient time per unit time for the traffic channel
2。
6. The method as claimed in claim 1, wherein in step E, the new service node sequentially traverses all the traffic channels in the order of the available channel list, and obtains P of all the traffic channels according to the method in step D
2When all traffic channels are traversed, according to P
2And D, modifying the sequence of the available channel list from large to small, and repeating the steps C to E.
7. The method of claim 1, wherein in step F, when a new service node is triggered to need to use a service channel, the new service node searches the available channel table obtained in step E, monitors a first service channel, uses the service channel if the service channel is idle, and uses a next service channel in the available channel table if the service channel is busy until the new service node is successfully accessed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911049679.2A CN110784910B (en) | 2019-10-31 | 2019-10-31 | LoRa network new service node access method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911049679.2A CN110784910B (en) | 2019-10-31 | 2019-10-31 | LoRa network new service node access method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110784910A true CN110784910A (en) | 2020-02-11 |
| CN110784910B CN110784910B (en) | 2021-10-01 |
Family
ID=69388118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911049679.2A Active CN110784910B (en) | 2019-10-31 | 2019-10-31 | LoRa network new service node access method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110784910B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115334627A (en) * | 2022-10-11 | 2022-11-11 | 深圳大学 | Communication method of LoRa network based on BTMA |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083588A (en) * | 2007-06-22 | 2007-12-05 | 清华大学 | Reinforced distribution channel accessing accommodation controlling means based on channel temporal classification |
| CN101815302A (en) * | 2010-01-07 | 2010-08-25 | 北京邮电大学 | Frequency spectrum access method using idle channel in cognitive radio network |
| CN108307515A (en) * | 2018-03-16 | 2018-07-20 | 天津中科智城网络科技有限公司 | A kind of LoRa communication means based on type of message |
| CN108811001A (en) * | 2018-04-28 | 2018-11-13 | 中国科学院上海微系统与信息技术研究所 | The discretized channel cut-in method reserved with TDMA based on CSMA competitions |
-
2019
- 2019-10-31 CN CN201911049679.2A patent/CN110784910B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083588A (en) * | 2007-06-22 | 2007-12-05 | 清华大学 | Reinforced distribution channel accessing accommodation controlling means based on channel temporal classification |
| CN101815302A (en) * | 2010-01-07 | 2010-08-25 | 北京邮电大学 | Frequency spectrum access method using idle channel in cognitive radio network |
| CN108307515A (en) * | 2018-03-16 | 2018-07-20 | 天津中科智城网络科技有限公司 | A kind of LoRa communication means based on type of message |
| CN108811001A (en) * | 2018-04-28 | 2018-11-13 | 中国科学院上海微系统与信息技术研究所 | The discretized channel cut-in method reserved with TDMA based on CSMA competitions |
Non-Patent Citations (2)
| Title |
|---|
| SHUYAN WANG: "《A Method for Test Cases Reduction in Web Application Testing Based on User Session》", 《2018 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS》 * |
| 王宏刚: "《认知ad hoc 网络中的多信道路由安全威胁及其对策研究》", 《通 信 学 报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115334627A (en) * | 2022-10-11 | 2022-11-11 | 深圳大学 | Communication method of LoRa network based on BTMA |
| CN115334627B (en) * | 2022-10-11 | 2022-12-20 | 深圳大学 | Communication method of LoRa network based on BTMA |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110784910B (en) | 2021-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110493893B (en) | Self-adaptive dynamic networking method | |
| CN108347346B (en) | Method for upgrading equipment in mesh network | |
| CN102281640B (en) | Channel resource allocation method based on time division multiplexing | |
| US20220321301A1 (en) | Channel sounding method and apparatus | |
| CN111654348B (en) | Internet of things data transmission method and device, computer equipment and storage medium | |
| CN109548156B (en) | Single-channel Time Division Multiple Access (TDMA) satellite cluster ad hoc network time slot resource allocation method | |
| CN113260047A (en) | Dual-mode system, station and central coordinator combining HPLC and wireless communication | |
| CN112019239B (en) | Method, node and storage medium for transmitting data | |
| CN106302230B (en) | A kind of data transmission method and device | |
| CN110784910B (en) | LoRa network new service node access method | |
| CN110602798B (en) | Distributed determination method for optimal parameters of LTE network machine communication random access | |
| CN108848482A (en) | Resource allocation methods based on mMTC layer-specific access frame | |
| CN114143741A (en) | Wireless gateway system based on LoRa wireless communication technology | |
| CN104053122A (en) | Method for MTC devices to have access to cellular network at random | |
| CN107484255A (en) | Preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet | |
| CN107784009A (en) | Data query, data query processing method and processing device | |
| Qiao et al. | Optimal channel selection based on online decision and offline learning in multichannel wireless sensor networks | |
| CN109005065B (en) | Hidden node-perceptible clustering algorithm for large-scale D2D network | |
| Moussaoui et al. | A novel clustering algorithm for efficient energy saving in wireless sensor networks | |
| CN106358302B (en) | Wireless sensor network multi-transceiver multi-channel allocation algorithm | |
| Morshed et al. | Traffic-adaptive duty cycle adaptation in TR-MAC protocol for Wireless Sensor Networks | |
| CN113810870A (en) | Centralized meter reading communication method for LoRa ad hoc network | |
| CN108513332B (en) | Clustering routing method and system | |
| TW202044025A (en) | Terminal address configuration method and device | |
| CN110535612B (en) | Layered self-adaptive processing method based on heartbeat feedback data period |
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 |