CN109412921B - Network access and network exit design method for multi-cluster star network nodes - Google Patents

Network access and network exit design method for multi-cluster star network nodes Download PDF

Info

Publication number
CN109412921B
CN109412921B CN201811333239.5A CN201811333239A CN109412921B CN 109412921 B CN109412921 B CN 109412921B CN 201811333239 A CN201811333239 A CN 201811333239A CN 109412921 B CN109412921 B CN 109412921B
Authority
CN
China
Prior art keywords
network
node
slave
distance
time slot
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
CN201811333239.5A
Other languages
Chinese (zh)
Other versions
CN109412921A (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.)
Shanghai Radio Equipment Research Institute
Original Assignee
Shanghai Radio Equipment Research Institute
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 Shanghai Radio Equipment Research Institute filed Critical Shanghai Radio Equipment Research Institute
Priority to CN201811333239.5A priority Critical patent/CN109412921B/en
Publication of CN109412921A publication Critical patent/CN109412921A/en
Application granted granted Critical
Publication of CN109412921B publication Critical patent/CN109412921B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/16Discovering, processing access restriction or access information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44Star or tree networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

In the network access and network quit design method of the multi-cluster star network node, a main node periodically broadcasts network access information, and after a node in a single machine state is detected to become a prepared slave and is roughly synchronized with the main node, a serial number is requested to be allocated to the main node in a service time slot to access the network; acquiring a numbered prepared slave computer, judging that the distance between the prepared slave computer and the main node does not exceed a distance threshold, and waiting for entering a fine synchronization time slot; when the distance between the master node and the slave node is confirmed within the distance threshold again in the fine synchronization time slot, the master node and the slave node are successfully added into the network to become slave nodes, fine synchronization request information is sent in the fine synchronization time slot of each instruction period, the fine synchronization function with the master node is realized, and the network time synchronization with the master node is kept; and after the distance between the master node and the slave node measured by the fine synchronization time slot is not within the distance threshold, the fine synchronization time slot is separated from the current network, and a 'forbidden use channel' is set and the monitoring is continued. The invention has good topology adaptability and strong network recombination capability, and simultaneously improves the networking performance of the multi-cluster star network nodes.

Description

Network access and network exit design method for multi-cluster star network nodes
Technical Field
The invention relates to the technical field of wireless communication. And more particularly, to a design method for network entry and exit of a multi-cluster star network node.
Background
In the ad hoc network technology under the wireless environment, the star network is an ad hoc network which has a simple network structure and is easy to realize. After the network is established, the network topology is changed rapidly due to the need of actual tasks, which often causes the problem that the nodes are rapidly accessed to and withdrawn from the network. If the nodes cannot be guaranteed to have the efficient and high-success-rate network access and network quit capabilities, the performance of the whole star network is greatly influenced. At present, few researches are made to solve the problem of low success rate of node network access and network exit caused by dynamic network change, and some conventional methods are briefly introduced below.
In document 1 (liu qiang, haunche, directional antenna-based mobile ad hoc network access control protocol [ J ]. university of transportation, beijing, 2017, 41 (02): 72-78.), a mobile ad hoc network access control protocol based on a directional antenna is proposed. Document 2 (sinovie, zhangwei, jiazhongning, dynamic TDMA media access control protocol [ J ] suitable for Ad Hoc, computer engineering and design, 2012, 28 (10): 2341-.
Patent 1 (a new node networking method of wireless multi-hop collaboration network, 201610564921.X, lissaka, Chou song qing, vermilion, zhangqing.2016), proposes a networking method of establishing a physical neighbor list and selecting a sponsoring node to interactively sponsor information based on a new node, but the method occupies more resources and has low networking efficiency. Patent 2 (a startup network deployment method and apparatus for a star ad hoc network, 201710807080.5, huangyu.2017) proposes a startup network deployment method for a star ad hoc network, in which a node designed in the method has a function of autonomously switching to a central node or an access node, but the application range is lower than the range that can be achieved by the present invention, and the network topology adaptability and expandability of the present invention are more excellent. Patent 3 (changing method of central nodes of star-type ad hoc network, 201711115206.9, huangyu, mayudong, gao-little swallow, 2017) proposes a changing method of central nodes of star-type ad hoc network based on the number of network nodes and the topology change frequency, but the method has low efficiency of network entry and network exit and the network reorganization capability is weaker than that of the present invention.
In the above many studies, no strategy has been seen on how to enter and exit the network of the nodes in the star network in the multi-cluster case.
Disclosure of Invention
The invention aims to provide a network access and quit design method of multi-cluster star network nodes, which aims to solve the problem of low success rate of network access and quit of the nodes caused by network dynamic transformation in the existing multi-cluster star network, increase the network access and quit efficiency of the nodes, have the characteristics of good topology adaptability and strong network recombination capability, and improve the networking performance of the multi-cluster star network nodes.
The invention discloses a network access and network quit design method of a multi-cluster star network node, which comprises the following steps:
step 1, periodically broadcasting network access information at a network main node;
step 2, node interception: if the new node is not added into the network and is in a single machine state, the new node enters an interception stage, and the interception time is t. And if the broadcast message is not intercepted within the time t, executing the main node process. If the broadcast network access message of the main node is intercepted, the channel is selected to be set as a 'forbidden use channel' through the judgment of the network access message, and the monitoring is continued or coarse synchronization is executed and the entering of the service time slot is waited.
Step 3, the node requests to access the network: after the new node becomes a prepared slave and is roughly synchronized with the main node, a serial number is requested to be allocated to the main node in the service time slot to access the network;
step 4, judging the distance threshold of the master node and the slave node: after the master node reply is obtained and the serial number is obtained, the prepared slave computer judges whether the distance between the prepared slave computer and the master node exceeds a distance threshold. If the distance threshold is exceeded, the channel is set as a 'forbidden channel' and step 2 is executed. And if the distance threshold is not exceeded, waiting to enter a fine synchronization time slot.
Step 5, adding a network: and judging whether the distance between the node and the main node is within the threshold again in the fine synchronization time slot, and if the distance is determined to be within the threshold, the node is successfully added into the network to become a slave node.
Step 6, network maintenance: after the slave node successfully joins the network, the slave node needs to send fine synchronization request information in the fine synchronization time slot of each instruction cycle, so that the fine timing function with the master node is realized, the network time synchronization with the master node is kept, and the distance measurement with the master node is completed.
And 7, exiting the network: and (3) judging whether the distance is within the distance threshold of the master node or not according to the measured distance of the master node and the slave node in the fine synchronization time slot, if not, separating from the current network, setting the channel as a 'forbidden use channel' and executing the step (2).
Compared with the prior art, the network access and network quit design method for the multi-cluster star network nodes has the advantages that the probability of network access and network quit failure of the nodes caused by network dynamic transformation is reduced, the network access and network quit efficiency of the nodes is increased, the method has the characteristics of good topology adaptability and strong network recombination capability, and the networking performance of the multi-cluster star network nodes is improved.
Drawings
FIG. 1 is a schematic diagram of a multi-cluster star network according to the present invention
FIG. 2 is a time slot structure division diagram of the present invention;
FIG. 3 is a flow chart of the node network access of the present invention;
FIG. 4 is a flow chart of the node logout of the present invention.
Detailed Description
In order to more clearly illustrate the present invention, the present invention will be described in further detail below with reference to the following detailed description and accompanying drawings.
Based on the analysis of the prior art in the background art, the prior multi-cluster star network mainly has the problem of high failure rate of node network access and network exit caused by the dynamic change of the network. The invention provides a network access and quit design method of multi-cluster star network nodes, which can solve the problem of high network access and quit failure probability of the nodes due to dynamic change of a network, increase the network access and quit efficiency of the nodes, and has the characteristics of good topology adaptability and strong network recombination capability.
Specifically, the network access and network exit design method for the multi-cluster star network nodes comprises the following steps:
step 1, periodically broadcasting network access information at a network main node.
Step 2, node interception: if the node which has not joined the network is in the single machine state, the node enters the interception stage, and the interception time is t. And if the broadcast message is not intercepted within the time t, executing the main node process. If the broadcast network access message of the main node is intercepted, the channel is selected to be set as a 'forbidden use channel' through the judgment of the network access message, and the monitoring is continued or coarse synchronization is executed and the entering of the service time slot is waited.
Step 3, the node requests to access the network: after the nodes become the prepared slave machines and are roughly synchronized with the main node, the nodes request the main node to distribute numbers to access the network in the service time slot.
Step 4, judging the distance threshold of the master node and the slave node: after the master node reply is obtained and the serial number is obtained, the prepared slave computer judges whether the distance between the prepared slave computer and the master node exceeds a distance threshold. If the distance threshold is exceeded, the channel is set as a 'forbidden channel' and step 2 is executed. And if the distance threshold is not exceeded, waiting to enter a fine synchronization time slot.
Step 5, adding a network: and judging whether the distance between the node and the main node is within the threshold again in the fine synchronization time slot, and if the distance is determined to be within the threshold, the node is successfully added into the network to become a slave node.
Step 6, network maintenance: after the slave node successfully joins the network, the slave node needs to send fine synchronization request information in the fine synchronization time slot of each instruction cycle, so that the fine timing function with the master node is realized, the network time synchronization with the master node is kept, and the distance measurement with the master node is completed.
And 7, exiting the network: and (3) judging whether the distance is within the distance threshold of the master node or not according to the measured distance of the master node and the slave node in the fine synchronization time slot, if not, separating from the current network, setting the channel as a 'forbidden use channel' and executing the step (2).
The invention considers a multi-cluster star network schematic diagram as shown in fig. 1, wherein only 3 clusters are drawn as a representative, the multi-cluster star network schematic diagram can support expansion to L clusters, and at most M slave nodes can be supported in each cluster. The number mark is 0 is the main node in the cluster, the large circle represents the coverage area of the network in the cluster, the nodes with the number marks of 1-M represent slave nodes, and the nodes without the number marks represent stand-alone nodes (which can be new nodes to be networked or network quitting nodes in the original network). The nodes in the network have the same functions and positions and can be switched autonomously according to different environments and states.
The node time slot structure division of the invention is as shown in fig. 2, and is divided into four time slot types of broadcast time slot, service time slot, fine synchronization time slot and service time slot.
In step 1, only the master nodes in each cluster can occupy the broadcast time slot, and the master nodes periodically broadcast the network access message in the broadcast time slot, which indicates that the master nodes exist in the network and provides the coarse synchronization time information for the single machine to be accessed to the network.
In step 2, the nodes which are not added into the network are in a stand-alone state, which includes two situations, one is a new node to be accessed into the network, and the other is a node after exiting from a certain cluster network. The node enters an interception phase, and the interception time is t at most. If the node does not detect any broadcast message within the time t, the node becomes a master node, and executes a master node process to enter an instruction cycle shown in fig. 2. If the broadcast network access message of the main node is intercepted, the broadcast message of the working channel is analyzed, and whether the node in the network is full is judged. If it is full, the network is abandoned and the channel is set as 'forbidden channel', after which the node will forbid the network access request to the network within 30s and continue to listen to other networks. If the system is not full, the system sets the system as a standby slave machine, roughly synchronizes the local time with the main node, and waits for entering the service time slot.
In step 3, after the node becomes a prepared slave and is roughly synchronized with the master node, the node requests the master node to distribute a serial number to access the network in the service time slot.
Fig. 3 shows a network access flow diagram of a node:
in step 4, each cluster of networks has its coverage, such as the circle shown in fig. 1, which is a circle centered on the master node, and the distance threshold is the radius of the circle. In the service time slot, after the prepared slave computer obtains the master node recovery and obtains the serial number, whether the distance between the prepared slave computer and the master node exceeds the distance threshold or not is judged by transmitting a ranging message. If the distance threshold is exceeded, the channel is set as a 'forbidden channel', and then the node listening in step 2 is executed. And if the distance threshold is not exceeded, waiting to enter a fine synchronization time slot.
In the step 5, in the fine synchronization time slot, the prepared slave machine judges whether the distance between the prepared slave machine and the main node is within the threshold again by transmitting a fine synchronization message, and if the distance between the prepared slave machine and the main node is confirmed to be smaller than the distance threshold, the prepared slave machine node is successfully added into the cluster network to become a slave node in the network.
In step 6, the specific process of network maintenance is that after a single machine state node successfully joins the network to become a slave node, the slave node in the network needs to send a fine synchronization request message in the fine synchronization time slot of each following instruction period to realize the fine timing function with the master node, so as to keep the accurate synchronization of the network time of the slave node and the master node in the network and simultaneously complete the distance measurement between the slave node and the master node in the network.
In step 7, the specific process of exiting the network is that, as shown in fig. 4, a slave node in the network sends a "fine synchronization message" to the host in a fine synchronization time slot of each instruction cycle, calculates the distance between the master node and the slave node, determines that the distance between the master node and the slave node is greater than a distance threshold, executes the detachment from the current network, sets the network channel as a "no use channel", then executes step 2, enters an interception stage, and rejoins another cluster of networks or establishes a network by taking the slave node as a master node; and if the distance between the master node and the slave node is judged to be smaller than the distance threshold, the slave state is continuously maintained, and the service time slot is entered.
While the present invention has been described in detail with reference to the preferred embodiments, it should be understood that the above description should not be taken as limiting the invention. Various modifications and alterations to this invention will become apparent to those skilled in the art upon reading the foregoing description. Accordingly, the scope of the invention should be determined from the following claims.

Claims (6)

1. A network access and network exit design method for multi-cluster star network nodes is characterized by comprising the following steps:
step 1, periodically broadcasting network access information at a network main node;
step 2, node interception: if the node which is not added into the network is in a single machine state, entering an interception stage, and intercepting for t; if the broadcast message is not intercepted within the time t, executing a main node process; if the broadcast network access message of the main node is intercepted, judging through the network access message: selecting to set the channel as a 'forbidden channel' and continue monitoring, or selecting to execute coarse synchronization and wait for entering a service time slot;
step 3, the node requests to access the network: after the node becomes a prepared slave and is roughly synchronized with the master node, a serial number is requested to be allocated to the master node in the service time slot to access the network;
step 4, judging the distance threshold of the master node and the slave node: after the master node reply is obtained and the serial number is obtained, the prepared slave computer judges whether the distance between the prepared slave computer and the master node exceeds a distance threshold; if the distance threshold is exceeded, setting the channel as a 'forbidden use channel' and executing the step 2; if the distance does not exceed the distance threshold, waiting for entering a fine synchronization time slot;
step 5, adding a network: judging whether the distance between the node and the main node is within the threshold again in the fine synchronization time slot, if the distance is confirmed to be within the threshold, the node is successfully added into the network and becomes a slave node;
step 6, network maintenance: after the slave node successfully joins the network, the slave node needs to send fine synchronization request information in the fine synchronization time slot of each instruction period to realize the fine timing function with the master node, so as to keep the network time synchronization with the master node and complete the distance measurement with the master node;
and 7, exiting the network: and (3) judging whether the distance is within the distance threshold of the master node or not according to the measured distance of the master node and the slave node in the fine synchronization time slot, if not, separating from the current network, setting the channel as a 'forbidden use channel' and executing the step (2).
2. The method of claim 1, wherein the design of network entry and exit of the multi-cluster star network node,
in step 1, the main nodes in each cluster occupy the broadcast time slot, periodically broadcast the network access information in the broadcast time slot, indicate that the main nodes exist in the network, and simultaneously provide coarse synchronization time information for the single machine to be accessed to the network.
3. The method of claim 1, wherein the design of network entry and exit of the multi-cluster star network node,
in step 2, the nodes which are not added into the network comprise a new node to be accessed into the network and a node which exits from the cluster network;
if the broadcast message is not intercepted, and the main node process is executed, an instruction cycle is entered;
if the broadcast network access message of the main node is intercepted, analyzing the broadcast message of the working channel, and judging whether the node in the network is full:
if the network is full, abandoning the network and setting the channel as a 'forbidden channel' so that the node forbids sending a network access request to the network within a specified time later and continues to listen to other networks;
if the node is not full, the node is set as a standby slave, the local time and the main node are roughly synchronized, and the service time slot is waited to enter.
4. The method of claim 1, wherein the design of network entry and exit of the multi-cluster star network node,
in the step 4, in the service time slot, after the prepared slave obtains the master node reply and obtains the number, whether the distance between the prepared slave and the master exceeds the distance threshold is judged by transmitting a distance measurement message: if the distance threshold is exceeded, setting the channel as a forbidden channel, and then executing the step 2 to continue monitoring; and if the distance threshold is not exceeded, waiting to enter a fine synchronization time slot.
5. The method of claim 1, wherein the design of network entry and exit of the multi-cluster star network node,
in step 5, in the fine synchronization time slot, the prepared slave machine judges whether the distance between the prepared slave machine and the master node exceeds the threshold distance again by transmitting a fine synchronization message: if the distance between the nodes is smaller than the threshold distance, the prepared slave node is successfully added into the cluster network to become a slave node in the network; if the distance threshold is exceeded, the channel is set as a 'forbidden channel', and then step 2 is executed to continue the listening.
6. The method of claim 1, wherein the design of network entry and exit of the multi-cluster star network node,
step 7, the slave nodes in the network send 'fine synchronization messages' to the host computer in the fine synchronization time slot of each instruction cycle, and calculate the distance between the master node and the slave node; when the distance between the master node and the slave node is judged to be larger than the distance threshold, the master node and the slave node are separated from the current network, the network channel is set as a 'forbidden use channel', then the step 2 is executed, the monitoring stage is entered, and another cluster of network is added again or the master node is used as the network; and when the distance between the master node and the slave node is judged to be smaller than the distance threshold, the slave state is continuously kept, and the service time slot is entered.
CN201811333239.5A 2018-11-09 2018-11-09 Network access and network exit design method for multi-cluster star network nodes Active CN109412921B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811333239.5A CN109412921B (en) 2018-11-09 2018-11-09 Network access and network exit design method for multi-cluster star network nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811333239.5A CN109412921B (en) 2018-11-09 2018-11-09 Network access and network exit design method for multi-cluster star network nodes

Publications (2)

Publication Number Publication Date
CN109412921A CN109412921A (en) 2019-03-01
CN109412921B true CN109412921B (en) 2021-01-19

Family

ID=65472461

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811333239.5A Active CN109412921B (en) 2018-11-09 2018-11-09 Network access and network exit design method for multi-cluster star network nodes

Country Status (1)

Country Link
CN (1) CN109412921B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110493893B (en) * 2019-09-02 2022-10-18 上海无线电设备研究所 Self-adaptive dynamic networking method
CN110428630B (en) * 2019-09-10 2021-12-21 西安电子科技大学 Road pedestrian detection system and networking method thereof
CN111510933A (en) * 2020-04-16 2020-08-07 上海无线电设备研究所 Ad hoc network clustering method of multi-directional antenna
CN112312537B (en) * 2020-10-14 2022-04-08 珠海格力电器股份有限公司 Clock synchronization method and device, storage medium and electronic device
CN114585032B (en) * 2022-03-21 2023-12-12 沈阳中科奥维科技股份有限公司 WIA-PA node network roaming method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105072563A (en) * 2015-07-28 2015-11-18 北京博信视通科技有限公司 Method and apparatus for device-to-device communication
CN106559103A (en) * 2016-12-08 2017-04-05 西安烽火电子科技有限责任公司 A kind of extensive hopped-frequency pulses system based on Big Dipper time service

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070104332A1 (en) * 2005-10-18 2007-05-10 Clemens Robert P System and method for automatic plug detection
KR102110824B1 (en) * 2013-07-17 2020-05-14 삼성전자주식회사 Method and apparatus for network communication in wireless power transfer system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105072563A (en) * 2015-07-28 2015-11-18 北京博信视通科技有限公司 Method and apparatus for device-to-device communication
CN106559103A (en) * 2016-12-08 2017-04-05 西安烽火电子科技有限责任公司 A kind of extensive hopped-frequency pulses system based on Big Dipper time service

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
分层自组网中混合多址接入协议研究;刘丹;《中国优秀硕士学位论文全文数据库》;20170315;全文 *

Also Published As

Publication number Publication date
CN109412921A (en) 2019-03-01

Similar Documents

Publication Publication Date Title
CN109412921B (en) Network access and network exit design method for multi-cluster star network nodes
US7920887B2 (en) System and method for setting up P2P communication group in cellular system, and P2P communication system and method using P2P communication group
US8599823B2 (en) Communications methods and apparatus related to synchronization with respect to a peer to peer timing structure
US8385316B2 (en) Methods and apparatus related to peer to peer communications timing structure
KR101120216B1 (en) Methods and apparatus related to peer discovery and/or paging in peer to peer wireless communications
US7898983B2 (en) Methods and apparatus supporting traffic signaling in peer to peer communications
EP2165483B1 (en) Paging a peer in a peer-to-peer communication network
JP5269898B2 (en) Paging execution in wireless peer-to-peer networks
US8385317B2 (en) Methods and apparatus supporting multiple timing synchronizations corresponding to different communications peers
US20080112334A1 (en) Wireless device discovery in a wireless peer-to-peer network
TW201440559A (en) Power saving in wireless network entities
WO2009014278A1 (en) System and method for setting up p2p communication group in cellular system, and p2p communication system and method using p2p communication group
CN109450511B (en) Multi-antenna autonomous switching method of star self-organizing network
CN111954165A (en) Wireless synchronous data transmission method and device
WO2023197170A1 (en) Transmission synchronization method and apparatus, and storage medium
RU2595546C2 (en) System and communication method, computer program and corresponding data storage device
Biri et al. Demos: Robust Orchestration for Autonomous Networking
JP2023031138A (en) Wireless communication device, wireless network management device, control method, and program
CN114845287A (en) Low-voltage acquisition system based on Bluetooth mesh and clustering ad hoc network method
WO2024056152A1 (en) Device-characteristic-based synchronization management for d2d devices
CN117202305A (en) Rapid networking method based on efficient searching mode

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