CN107070764B - Rapid networking method based on central node control - Google Patents
Rapid networking method based on central node control Download PDFInfo
- Publication number
- CN107070764B CN107070764B CN201710278454.9A CN201710278454A CN107070764B CN 107070764 B CN107070764 B CN 107070764B CN 201710278454 A CN201710278454 A CN 201710278454A CN 107070764 B CN107070764 B CN 107070764B
- Authority
- CN
- China
- Prior art keywords
- node
- network access
- period
- networking
- access node
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
Abstract
The invention discloses a kind of rapid networking method based on central node control, mainly solve the problems, such as larger using existing network-building method collision probability under special scenes.Its implementation is: 1) central node is formed with to network access node to network access node set H；2) channel is divided into beacon period by central node, and sends the beacon frame comprising node identification in start time beacon period；3) request that networks is sent after the node identification in network access node matching beacon frame；4) central node updates after receiving networking request to network access node set H；5) terminating quickly networking when entering does not have node in net collective H.The present invention can avoid the collision probability to network access node under special scenes, improve networking efficiency, can be applied to the various local area networks and access net for carrying out networking using CSMA mechanism and belong to star topology.
Description
Technical field
The invention belongs to fields of communication technology, are related to a kind of rapid networking method, can be applied to various using CSMA mechanism
It carries out networking and belongs to local area network and the access net field of star topology.
Background technique
In Star Network, a network is constituted by a central node and multiple slave nodes.In the control of central node
Under system, multiple slave nodes require to network, and central node generally designates an access period comprising several time slots, for subordinate section
Point random competition accesses and transmits into net request message.In existing networking plan, slave node generallys use binary system and refers to
The mode that number is kept out of the way competes networking.
In binary exponential backoff mode, slave node participate in every time competition when, from keep out of the way in window [0, CW-1] with
Machine selects a value as backoff period number, sends networking request message to central node when keeping out of the way completion.Wherein CW according to
Number K, the minimum index avoidance K to have collidedminWith maximum index avoidance KmaxValue, as K≤KminWhen,Work as Kmin< K < KmaxWhen, CW=2K；As K >=KmaxWhen,When K is greater than maximum
When collision decomposition times N A, which abandons competition and networks, NA > Kmax.Wherein Kmin、KmaxFixed value is used with NA, with current ginseng
It is unrelated with the number of nodes of contention access.
In above-mentioned binary exponential backoff mode, due to KminValue is fixed and K under normal conditionsminValue is smaller,
In the case that slave node number is more, especially when multiple slave nodes simultaneously power on or occurs power off etc. failures after again on
When electric, a large amount of slave nodes participate in keeping out of the way window [0, CW when competition for the first timemin- 1] one value of random selection is as when keeping out of the way in
Gap number, at this time can be due to CWminValue is smaller and causes the backoff period number of multiple nodes identical, thus cause a large amount of conflicts and
It retransmits, until CW starts to increase, could reduce the probability clashed, it is a large amount of at this time to conflict and re-transmission may cause entire net
The networking efficiency of network is very low or even networking fails.
Summary of the invention
It is a kind of based on the quick of central node control it is an object of the invention in view of the above shortcomings of the prior art, propose
Network-building method generates conflict to avoid slave node, to improve the networking efficiency of whole network during networking.
To achieve the above object, technical solution of the present invention includes the following steps:
(1) central node is set to 0 to non-response times corresponding to network access node for N number of, and with N number of to network access node group
At to network access node set H, i.e. in H to network access node number X=N；
(2) channel is divided into continuous nonoverlapping beacon period by central node, and each beacon period includes three periods:
Beacon periods send beacon frame for central node；
The period is accessed, is made of several access slots, transmits into network packet for central node and to network access node；
Data period, the data for other purposes are transmitted；
(3) central node selects M node composition network access node set G in start time beacon period from H, and specifies
The M access slot numbers needed to wait for before transmission networking request message within the access period to network access node are respectively as follows: P in G1,
P2,…,Pi,…,PM, wherein i=1,2 ..., M, P1≠P2≠…≠Pi≠…≠PM, P1, P2,…,Pi,…,PM>=0,0 < M≤
X；
(4) central node beacon periods with the form broadcasted by beacon frame information in H to network access node, wherein believing
Mark frame contains the M node identifications and its corresponding access slot number needed to wait for network access node in G；
(5) after network access node receives beacon frame, by own node mark with beacon frame in specify M node identification into
Row matching:
If there is identical node identification, set central node for the backoff counter of the node is this within a beacon frame
The specified access slot number needed to wait for of node, executes step (6)；
If abandoning sending message within this beacon period, and wait next beacon frame without identical node identification；
(6) size of backoff counter is judged to network access node:
If backoff counter is 0, sent out at the beginning of first access slot to central node in accessing the period
It is sent into net request message；
If backoff counter is not 0, channel status is listened at the beginning of each access slot in accessing the period:
If channel status be it is busy, stopping keep out of the way, abandon sending message within this beacon period, and wait next beacon
Frame；
If channel status is the free time, backoff counter is subtracted 1, when backoff counter is kept to 0, in next access
Networking request message is sent to central node at the beginning of gap；
(7) central node waits the networking request message in G to network access node in the access period:
If receiving networking request message in the access period, it is labeled as networking to network access node by corresponding；
If not receiving networking request message in the access period, the non-response times in G to network access node are updated, and wait
To the end of beacon period；
(8) central node is in finish time beacon period, is more than the node of maximum value and labeled by response times non-in G
Removed from H for the node of networking, at the same update in network access node set H to network access node number X；
(9) central node judges whether need network access node in H: if so, then repeating step (3) arrives step (8)；If not yet
Have, then terminates quickly networking.
The present invention has the following advantages compared with prior art:
1, the parameters such as networking node size, networking list that the present invention makes full use of central node to be grasped, by centromere
It on point specified opportunity and sequence to network access node access channel, avoids networking and clashes in the process, to improve networking effect
Rate.
2, the present invention dynamically adjusts the access slot number needed to wait for network access node to network access node number according in network,
Keep group network process more flexible controllable.
Detailed description of the invention
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the first embodiment schematic diagram that interior joint of the present invention networks；
The second embodiment schematic diagram that interior joint of the present invention networks when Fig. 3.
Specific embodiment
The parameters such as networking node size, the networking list node that the present invention is grasped using central node, by central node
Networking plan and group network parameters are issued in networking, control or specify opportunity and the sequence of each slave node access channel, guidance
It is orderly accessed.In fact, central node can grasp networking node size, networking list node when carrying out the network planning
Etc. parameters, after power-off restarting, central node also the mesh information such as number of nodes, node hardware address usually before in store power-off
Or information, these information such as node logical mark can be used in networking or networking again, to be greatly improved networking effect
Rate.
Embodiment one,
Referring to Fig.1, steps are as follows for the realization of this example:
Step 1, central node composition is to network access node set H.
Central node is set to 0 to non-response times corresponding to network access node for 10, and with 10 to network access node group
At to network access node set H, i.e. in H to network access node number X=10.
Step 2, central node plans channel.
Channel is divided into continuous nonoverlapping beacon period by central node, each beacon period include beacon, access and
Three periods of data, in which:
Beacon periods send beacon frame for central node；
The period is accessed, is made of several access slots, transmits into network packet for central node and to network access node；
Data period, the data for other purposes are transmitted.
Step 3, central node is according to form network access node set G to network access node number X in network access node set H.
Central node start time beacon period judge in H to network access node number X:
If X >=4,4 nodes is selected to form network access node set G from H, and in specified G 4 connect to network access node
Enter the access slot number for sending in the period and needing to wait for before networking request message and is respectively as follows: 0,1,2,3；
If X=3,3 nodes in H are formed into network access node set G, and in specified G 3 accessed to network access node
The access slot number needed to wait for before networking request message is sent in period is respectively as follows: 0,1,2；
If X=2,2 nodes in H are formed into network access node set G, and in specified G 2 accessed to network access node
The access slot number needed to wait for before networking request message is sent in period is respectively as follows: 0,1；
If X=1,1 node in H is formed into network access node set G, and in specified G 1 accessed to network access node
It is 0 that the access slot number needed to wait for before networking request message is sent in period.
Step 4, central node sends beacon frame in beacon periods.
Central node beacon periods with the form broadcasted by beacon frame information in H to network access node, wherein beacon
Frame contains in G to the node identification of network access node and its corresponding access slot number needed to wait for.
Step 5, it is identified to network access node matched node.
After network access node receives beacon frame, by own node mark and node identification progress specified in beacon frame
Match:
If there is identical node identification, set central node for the backoff counter of the node is this within a beacon frame
The specified access slot number needed to wait for of node, executes step 6；
If abandoning sending message within this beacon period, and wait next beacon frame without identical node identification.
It step 6, whether is 0 transmission networking request message according to backoff counter to network access node.
Referring to Fig. 2, this step is implemented as follows:
The size of backoff counter is judged to network access node:
If backoff counter is 0, sent out at the beginning of first access slot to central node in accessing the period
It is sent into net request message；
If backoff counter is not 0, channel status is listened at the beginning of each access slot in accessing the period:
If channel status be it is busy, stopping keep out of the way, abandon sending message within this beacon period, and wait next beacon
Frame；
If channel status is the free time, backoff counter is subtracted 1, when backoff counter is kept to 0, in next access
Networking request message is sent to central node at the beginning of gap.
Step 7, central node sends the request response message that networks according to whether receiving networking request message.
Central node waits receiving to the networking request message of network access node in network access node set G in the access period:
If receiving networking request message in the access period, it is labeled as networking to network access node by corresponding；
If not receiving networking request message in the access period, the non-response times of node each in G are added 1, and wait
To the end of beacon period.
Step 8, central node is updated to network access node set H.
Response times non-in G were more than the node of maximum value and are marked as in finish time beacon period by central node
The node of networking is removed from H, at the same update in network access node set H to network access node number X.
Step 9, central node is made whether to terminate the judgement of quickly networking.
Whether central node judges in network access node set H be 0 to network access node number X: if not 0, then it repeats to walk
Rapid 3 arrive step 8；If 0, then terminate quickly networking.
Embodiment two
Referring to Fig.1, steps are as follows for the realization of this example:
Step 1, central node are formed to network access node set H.
Central node is set to 0 to non-response times corresponding to network access node for 8, and is formed with 8 to network access node
To network access node set H, i.e. in H to network access node number X=8.
Step 2, central node plan channel.
Channel is divided into continuous nonoverlapping beacon period by central node, each beacon period include beacon, access and
Three periods of data, in which:
Beacon periods send beacon frame for central node；
The period is accessed, is made of several access slots, transmits into network packet for central node and to network access node；
Data period, the data for other purposes are transmitted.
Step 3, central node form network access node set G.
Central node selects 1 node composition network access node set G in beacon period from H, and in specified G 1 wait enter
It is 0 that net node sends the access slot number needed to wait for before networking request message within the access period.
Step 4, central node send beacon frame in beacon periods.
Central node beacon periods with the form broadcasted by beacon frame information in H to network access node, wherein beacon
Frame contains in G to the node identification of network access node and its corresponding access slot number needed to wait for.
Step 5 is identified to network access node matched node.
Referring to Fig. 3, this step is implemented as follows:
After network access node receives beacon frame, by own node mark and node identification progress specified in beacon frame
Match:
If node identification is identical, setting central node within a beacon frame for the backoff counter of the node is the node
The specified access slot number needed to wait for, i.e. setting backoff counter be 0, and first access slot is opened in the access period
Moment beginning sends networking request message to central node；
If node identification is not identical, abandon sending message within this beacon period, and wait next beacon frame.
Step 6, central node send the request response message that networks according to whether receiving networking request message.
Central node waits receiving to the networking request message of network access node in network access node set G in the access period:
If receiving networking request message in the access period, it is labeled as networking to network access node by corresponding；
If not receiving networking request message in the access period, the non-response times in G to network access node are added 1, and
Beacon period is waited to terminate.
Step 7, central node are updated to network access node set H.
Response times non-in G were more than the node of maximum value and are marked as in finish time beacon period by central node
The node of networking is removed from H, at the same update in network access node set H to network access node number X.
Step 8, central node are made whether to terminate the judgement of quickly networking.
Whether central node judges in network access node set H be 0 to network access node number X: if not 0, then it repeats to walk
Rapid three arrive step 7；If 0, then terminate quickly networking.
Claims (2)
1. a kind of rapid networking method based on central node control, comprising:
(1) central node is set to 0 to non-response times corresponding to network access node for N number of, and with it is N number of to network access node composition to
In network access node set H, i.e. H to network access node number X=N；
(2) channel is divided into continuous nonoverlapping beacon period by central node, and each beacon period includes three periods:
Beacon periods send beacon frame for central node；
The period is accessed, is made of several access slots, transmits into network packet for central node and to network access node；
Data period, the data for other purposes are transmitted；
(3) central node selects M node composition network access node set G, and M in specified G in start time beacon period from H
A access slot number needed to wait for before transmission networking request message within the access period to network access node is respectively as follows: P1, P2,…,
Pi,…,PM, wherein i=1,2 ..., M, P1≠P2≠…≠Pi≠…≠PM, P1, P2,…,Pi,…,PM>=0,0 < M≤X；
(4) central node beacon periods with the form broadcasted by beacon frame information in H to network access node, wherein beacon frame
Contain the M node identifications and its corresponding access slot number needed to wait for network access node in G；
(5) after network access node receives beacon frame, by own node mark and M node identification progress specified in beacon frame
Match:
If there is identical node identification, setting central node within a beacon frame for the backoff counter of the node is the node
The specified access slot number needed to wait for executes step (6)；
If abandoning sending message within this beacon period, and wait next beacon frame without identical node identification；
(6) size of backoff counter is judged to network access node:
If backoff counter is 0, transmitted at the beginning of first access slot to central node in accessing the period
Net request message；
If backoff counter is not 0, channel status is listened at the beginning of each access slot in accessing the period:
If channel status be it is busy, stopping keep out of the way, abandon sending message within this beacon period, and wait next beacon frame；
If channel status is the free time, backoff counter is subtracted 1, when backoff counter is kept to 0, in next access slot
Start time sends networking request message to central node；
(7) central node waits the networking request message in G to network access node in the access period:
If receiving networking request message in the access period, it is labeled as networking to network access node by corresponding；
If not receiving networking request message in the access period, the non-response times in G to network access node are updated, and wait letter
Mark end cycle；
(8) central node is in finish time beacon period, by response times non-in G be more than the node of maximum value and be marked as into
The node of net is removed from H, at the same update in network access node set H to network access node number X；
(9) central node judges whether need network access node in H: if so, then repeating step (3) arrives step (8)；If no,
Then terminate quickly networking.
2. according to the method described in claim 1, wherein update the non-response times of each node in G in step (7), refer to
The non-response times of node each in G are added 1 when the access period not receiving networking request message by heart node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710278454.9A CN107070764B (en) | 2017-04-25 | 2017-04-25 | Rapid networking method based on central node control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710278454.9A CN107070764B (en) | 2017-04-25 | 2017-04-25 | Rapid networking method based on central node control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107070764A CN107070764A (en) | 2017-08-18 |
| CN107070764B true CN107070764B (en) | 2019-06-21 |
Family
ID=59604019
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710278454.9A Active CN107070764B (en) | 2017-04-25 | 2017-04-25 | Rapid networking method based on central node control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107070764B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108551684B (en) * | 2018-03-20 | 2021-01-01 | 深圳友讯达科技股份有限公司 | Node network access method and device |
| CN109510658B (en) * | 2018-12-29 | 2021-06-15 | 湖北航天技术研究院总体设计所 | Networking access method, system and platform applied to multi-floating platform scene |
| CN111371691B (en) * | 2020-03-10 | 2022-04-05 | 西安电子科技大学 | Multicast frame transmission method under multi-channel binding condition |
| CN113098717B (en) * | 2020-03-30 | 2023-04-18 | 深圳友讯达科技股份有限公司 | Method for realizing equipment plug and play of newly added network access node |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101754271B (en) * | 2008-12-09 | 2014-04-30 | 华为终端有限公司 | Method and device for negotiation of master node |
| CN101741724A (en) * | 2009-12-03 | 2010-06-16 | 成都华立达电力信息系统有限公司 | Automatic relay networking method in electric line carrier communication |
| CN102546484B (en) * | 2010-12-17 | 2014-09-10 | 上海明波通信技术有限公司 | Signal channel training method and signal channel training receiver device based on beacon frame |
-
2017
- 2017-04-25 CN CN201710278454.9A patent/CN107070764B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107070764A (en) | 2017-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107070764B (en) | Rapid networking method based on central node control | |
| US7756102B2 (en) | Distributed determination of dynamic frame sizes in a network | |
| Fang et al. | Decentralised learning MACs for collision-free access in WLANs | |
| CN101321127B (en) | Determined communication scheduling method of industrial wireless network | |
| US8130731B2 (en) | Method, network nodes and system for broadcast transmission of data | |
| CN109561513B (en) | Distributed conflict-free ad hoc network multiple access protocol | |
| CN106658735A (en) | TDMA based long propagation delay wireless link time slot distribution method | |
| CN104244257B (en) | Adaptive reservation and dynamic time slot allocating method and device | |
| CN103929824A (en) | Wireless network node neutral access dynamic configuration method | |
| Moraes et al. | VTP-CSMA: A virtual token passing approach for real-time communication in IEEE 802.11 wireless networks | |
| EP2485436A1 (en) | Communication method in a profinet communication system | |
| JP2000253017A (en) | Radio packet control station | |
| EP2428085B1 (en) | Beacon for a star network, sensor nodes in a star network and method for operating a star network | |
| CN106060957A (en) | CSMA/TDMA hybrid access control method | |
| CN111601398B (en) | Ad hoc network medium access control method based on reinforcement learning | |
| Yin et al. | Statistically optimized minislot allocation for initial and collision resolution in hybrid fiber coaxial networks | |
| CN110248320A (en) | Wireless self-organization network management method based on time synchronization and Frequency Synchronization | |
| Soares et al. | Throughput analytical modeling of IEEE 802.11 ah wireless networks | |
| CN108134986A (en) | Message transmitting method and device | |
| US20050175026A1 (en) | Shared-schedule communication network access protocol | |
| DE60318003T2 (en) | Apparatus and method for providing a QOS-aware query list | |
| Cirimelli-Low et al. | Key-Activation Multiple Access (KAMA) | |
| US20110051751A1 (en) | Network system of time band reservation, frame transfer method, and network device | |
| JP6696351B2 (en) | Data transmission method, device and node | |
| CN114448546B (en) | Scheduling method of time-triggered network message based on timer |
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 |