CN110011890A - A kind of building method of distribution ring tree both scatternets - Google Patents
A kind of building method of distribution ring tree both scatternets Download PDFInfo
- Publication number
- CN110011890A CN110011890A CN201910202347.7A CN201910202347A CN110011890A CN 110011890 A CN110011890 A CN 110011890A CN 201910202347 A CN201910202347 A CN 201910202347A CN 110011890 A CN110011890 A CN 110011890A
- Authority
- CN
- China
- Prior art keywords
- node
- root
- tree
- root node
- ring
- 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.)
- Pending
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/42—Loop networks
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of building method of distributed ring tree both scatternets, including presets root node to sense aggregation node, adjacent node is connected to new root node, to construct the backbone subnet based on ring；Each root node is started to create its subsequent subnet based on tree, obtains required distributed ring tree both scatternets.Implement the present invention, there is distributed ring-tree (Distributed Ring-Tree of some predefined parameters because starting, DRT) algorithm, it does not need to know region-wide or partial region network connection information in advance, and calculated in advance entire area or the desired network architecture in partial region are not had to, to reduce topological structure complexity, calculating and the communication overhead of network are improved.
Description
Technical field
The present invention relates to technical field of the computer network more particularly to a kind of construction sides of distributed ring tree both scatternets
Method.
Background technique
As shown in Figure 1, ring tree both scatternets are to be expanded to using a ring structure as vertebra subnet by tree structure
The network in other sparse regions includes the scatternet of multiple tree structures of looped network and its connection.Although ring structure
Design can be connected simply, and be suitable for reactiver outing, but it creates shorter path length for packet communication, especially
It is when the size expansion of looped network.Therefore, it is necessary to which the routing on larger looped network is arranged, it is desirable that consider routed path length
Design problem is to mitigate packetization delay.
Traditional ring tree both scatternets, which are formed, to be calculated mostly with centralization to distribute based on network, needs to know the whole district in advance
The network connection information in domain or partial region, so that the looped network as vertebra subnet need to collect whole topology information by each node
Carry out distributed network, causes sizable calculating and communication overhead to form preferred scatternet.
Summary of the invention
The technical problem to be solved by the embodiment of the invention is that providing a kind of construction side of distributed ring tree both scatternets
Method improves calculating and the communication overhead of network by reducing topological structure complexity.
In order to solve the above-mentioned technical problem, the embodiment of the invention provides a kind of construction sides of distributed ring tree both scatternets
Method the described method comprises the following steps:
Step S1, root node is preset to sense aggregation node, adjacent node is connected to new root node, to construct base
In the backbone subnet of ring；
Step S1.1, specified aggregation node is simultaneously detected, and further inquire specified aggregation node one jump it is adjacent
Slave node obtains k neighbor information of specified aggregation node, specifically,
Using specified aggregation node as main equipment and by the equipment during specified aggregation node inquiry scan be from
Equipment is detected by starting a piconet between each master-slave equipment, obtains k of specified aggregation node
Neighbor information；Wherein, k is positive integer；
Step S1.2, according to k neighbor information of gained, come with the link information of specified aggregation node processing single hop case
Ring net is formed, specifically,
Step S1.2.1, start a counter on specified aggregation node to transmit root ID, and obtain pre-defined
Ring net interior joint quantity c, obtain degree of transitivity be c；Wherein, c is the positive integer greater than 1；
Step S1.2.2, the root ID of default specified aggregation node is 1, and is set as specified aggregation node to work as front transfer
Root node；
Step S1.2.3, it obtains current degree of transitivity and judges whether it is 1；If it is not, thening follow the steps S1.2.4；If so,
Then go to step S1.2.5；
Step S1.2.4, the root node and its corresponding ID for working as front transfer are obtained, and will be when the root node of front transfer
Connection neighbours are set as the root node of next transmitting, and by accessed when the root ID of the root node of front transfer adds 1 conduct next
The root ID of the root node of transmitting, to reset to the root node of next transmitting when the root node of front transfer and work as acquired
After front transfer number subtracts 1, return step S1.2.3；
Step S1.2.5, terminate transmitting, and the root node that root ID is c is attached with specified aggregation node, obtain
The ring net of head and the tail connection；
Step S2, each root node is started to create its subsequent subnet based on tree, obtains required distributed ring tree
Both scatternets；
Step S2.1, each root node is searched each as the controller in the ring net based on head and the tail connection
The subsequent neighbor node of node, and tree is based on using the subsequent neighbor node of each root node searched as each root node
Subnet main equipment, and further can start the inquiry of piconet in the main equipment of subnet of each root node based on tree
The neighbor node of the link information for having single hop case is scanned as corresponding from equipment；
Step S2.2, the slave equipment for going out institute's inquiry scan restarts respectively single as the main equipment scanned next time
It is respective from equipment that only piconet inquiry scan, which provides the neighbor node of the link information of standby single hop case, until each
Until all node scans finish on node, subnet of each root node based on tree is obtained, that is, realizes required distributed ring tree
The construction of both scatternets.
Wherein, the number of nodes of the subnet of each root node based on tree should all be less than or equal to 7.
The implementation of the embodiments of the present invention has the following beneficial effects:
Present invention starting has distributed ring-tree DRT algorithm of some predefined parameters, which proposes one
Leader's root node forms ring network to select new root node, and each new root node cooperates with other people to generate
Its attached tree-like subnet because not needing to know region-wide or partial region network connection information in advance, and does not have to prior
Calculating the region-wide or desired network architecture in partial region improves the calculating of network to reduce topological structure complexity
And communication overhead.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention, for those of ordinary skill in the art, without any creative labor, according to
These attached drawings obtain other attached drawings and still fall within scope of the invention.
Fig. 1 is a kind of flow chart of the building method of distributed ring tree both scatternets provided in an embodiment of the present invention；
Fig. 2 is a kind of application scenario diagram of the building method of distributed ring tree both scatternets provided in an embodiment of the present invention.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made into one below in conjunction with attached drawing
Step ground detailed description.
As shown in Figure 1, in the embodiment of the present invention, a kind of building method of distributed ring tree both scatternets of proposition, institute
State method the following steps are included:
Step S1, root node is preset to sense aggregation node, adjacent node is connected to new root node, to construct base
In the backbone subnet of ring；
Step S1.1, specified aggregation node is simultaneously detected, and further inquire specified aggregation node one jump it is adjacent
Slave node obtains k neighbor information of specified aggregation node, specifically,
Using specified aggregation node as main equipment and by the equipment during specified aggregation node inquiry scan be from
Equipment is detected by starting a piconet between each master-slave equipment, obtains k of specified aggregation node
Neighbor information；Wherein, k is positive integer；
Detailed process is, aggregation node initially detect and inquire one jump adjacent slave node (Seo et al.,
2018；Jeon et al.,2017).Each occasion of other links near aggregation node detects, it can all start one
A short-term piconet (piconet).Root then plays the part of the role of main equipment, and the equipment during inquiry scan will become from equipment
(slave).Therefore, aggregation node can collect the data of k neighbours over time, become.
It should be noted that piconet is transient state connection, not to be stably connected with.The same piconet only exists a master
Equipment, other is all from equipment.Piconet is numbered in net from equipment using three bits, and each device numbering is not
Together, each piconet at most connects 7 from equipment.In addition, can only be communicated from equipment with main equipment in piconet, from
It cannot be communicated between equipment.
Step S1.2, according to k neighbor information of gained, come with the link information of specified aggregation node processing single hop case
Ring net is formed, specifically,
Step S1.2.1, start a counter on specified aggregation node to transmit root ID, and obtain pre-defined
Ring net interior joint quantity c, obtain degree of transitivity be c；Wherein, c is the positive integer greater than 1；
It should be noted that degree of transitivity is c, c-1 suitable nodes is as selected to connect into cyclic annular node；Its
In, appropriate node can be served as node neighbours itself are more, electricity is more or weight is larger.
Step S1.2.2, the root ID of default specified aggregation node is 1, and is set as specified aggregation node to work as front transfer
Root node；
Step S1.2.3, it obtains current degree of transitivity and judges whether it is 1；If it is not, thening follow the steps S1.2.4；If so,
Then go to step S1.2.5；
Step S1.2.4, the root node and its corresponding ID for working as front transfer are obtained, and will be when the root node of front transfer
Connection neighbours are set as the root node of next transmitting, and by accessed when the root ID of the root node of front transfer adds 1 conduct next
The root ID of the root node of transmitting, to reset to the root node of next transmitting when the root node of front transfer and work as acquired
After front transfer number subtracts 1, return step S1.2.3；
Step S1.2.5, terminate transmitting, and the root node that root ID is c is attached with specified aggregation node, obtain
The ring net of head and the tail connection；
Detailed process is that aggregation node can calculate and specify the information of each node in ring net, including in ring net
Next node connects.In addition, a counter r1 is specified in aggregation node, so as to ring interior nodes and its subsequent downstream root chain
It connects.Aggregation node is that itself setting root ID is r1=1, and distributes root ID by counter r1 for its neighbour.System parameter c is determined
Justice is the maximum quantity of inner ring interior joint.Node with root ID transmits in interior ring net as first layer ring.
For various network applications, aggregation node sets initial value r1=1 and ID=1, and can be adjusted by operator
The initial value of parameter c carrys out maximum attachable interstitial content in limitation ring.In order to develop ring net, aggregation node is for configuring
With the ring Connecting quantity c and r1 that propagate first layer root, it acts as be used to set root node ID by r1.In first layer ring, convergence
Node is the first root node (r1=1), and connection neighbours become new root node, meanwhile, transmitting r1=r1+1 give new root node,
As soon as every connection new root node, r1 adds 1 automatically, as r1=c, resets r1=1, meanwhile, the value of r1 is designated as each
The ID of node.Later, each root node outside root ID=r1+1 link adjacent thereto in circular layer, and the root node of ID=c
It is responsible for the aggregation node ID=1 that is linked back.In first layer ring net, structure is connected to eventually by its adjacent inside root and completes ring
Net joins end to end.It therefore, is single-hop scenario building ring net, and each starts its sub-network basis based on tree.In addition,
All root nodes in ring net are still M/S (master/slave) node.
Step S2, each root node is started to create its subsequent subnet based on tree, obtains required distributed ring tree
Both scatternets；
Step S2.1, each root node is searched each as the controller in the ring net based on head and the tail connection
The subsequent neighbor node of node, and tree is based on using the subsequent neighbor node of each root node searched as each root node
Subnet main equipment, and further can start the inquiry of piconet in the main equipment of subnet of each root node based on tree
The neighbor node of the link information for having single hop case is scanned as corresponding from equipment；Wherein, each root node base
It should all be less than or equal to 7 in the number of nodes of the subnet of tree；
Step S2.2, the slave equipment for going out institute's inquiry scan restarts respectively single as the main equipment scanned next time
It is respective from equipment that only piconet inquiry scan, which provides the neighbor node of the link information of standby single hop case, until each
Until all node scans finish on node, subnet of each root node based on tree is obtained, that is, realizes required distributed ring tree
The construction of both scatternets.
Detailed process is that spanning tree subnet is formed, and each individually root node makees the control in the subnet based on ring
Device searches subsequent neighbor node, and at most contacts seven adjacent slave nodes (slave node), and is associated with to develop
The piconet of their own.After this, the slave of paging switches to host node (master node), is main equipment conduct
M/S node.Each M/S repeats to find adjacent from node, and is associated with the subordinate (slave) of its connection also to create it individually
Piconet.This process constantly executes, the leaf node until reaching tree net.Although leaf node cannot be with any adjacent segments
Point connection, but each leaf node can remain slave node or leaf node host node.
As shown in Fig. 2, to a kind of application of the building method of distributed ring tree both scatternets provided in an embodiment of the present invention
Scene is described further:
From Fig. 2 (a) as can be seen that aggregation node R1 detects other five from node in single-hop scene, wherein c=6 and
R1=1.Root R1 is associated with the root node of all connections in first layer ring, as soon as every connection new root node, r1 adds 1, and even
Its link information is propagated from R2 to R6 in continuous ground.While collecting neighbor information, R1 is handled and to be connected adjacent node
The next node connect distributes to each root node in first layer looped network subnet.Later, R2 connects R3, and R3 connects R4, until R6's
R1=c resets r1=1, then is connected with R1, as shown in Fig. 2 (b).
Later, each new root is used as the controller in tree topology, and slave equipment that at most can be adjacent with seven
Connection is established to form the piconet of oneself, each root node is from connection one from node (slave node), such as Fig. 2 (c)
It is shown.Then, it is each switching to new master/slave (M/S) from node, and starts and is closed downstream from node (slave node)
Connection, all leaf nodes until reaching tree, as shown in Fig. 2 (d).
The implementation of the embodiments of the present invention has the following beneficial effects:
Present invention starting has distributed ring-tree DRT algorithm of some predefined parameters, which proposes one
Leader's root node forms ring network to select new root node, and each new root node cooperates with other people to generate
Its attached tree-like subnet because not needing to know region-wide or partial region network connection information in advance, and does not have to prior
Calculating the region-wide or desired network architecture in partial region improves the calculating of network to reduce topological structure complexity
And communication overhead.
Those of ordinary skill in the art will appreciate that implement the method for the above embodiments be can be with
Relevant hardware is instructed to complete by program, the program can be stored in a computer readable storage medium,
The storage medium, such as ROM/RAM, disk, CD.
Above disclosed is only a preferred embodiment of the present invention, cannot limit the power of the present invention with this certainly
Sharp range, therefore equivalent changes made in accordance with the claims of the present invention, are still within the scope of the present invention.
Claims (2)
1. a kind of building method of distribution ring tree both scatternets, which is characterized in that the described method comprises the following steps:
Step S1, root node is preset to sense aggregation node, adjacent node is connected to new root node, ring is based on building
Backbone subnet；
Step S1.1, specified aggregation node is simultaneously detected, and is further inquired specified aggregation node one and jumped adjacent subordinate
Node obtains k neighbor information of specified aggregation node, specifically,
Using specified aggregation node as main equipment and by the equipment during specified aggregation node inquiry scan be from equipment,
It is detected by starting a piconet between each master-slave equipment, obtains k neighbours of specified aggregation node
Information；Wherein, k is positive integer；
Step S1.2, according to k neighbor information of gained, the link information of single hop case is handled with specified aggregation node to be formed
Ring net, specifically,
Step S1.2.1, start a counter on specified aggregation node to transmit root ID, and obtain ring predetermined
Subnet interior joint quantity c, obtaining degree of transitivity is c；Wherein, c is the positive integer greater than 1；
Step S1.2.2, the root ID of default specified aggregation node is 1, and specified aggregation node is set as the root when front transfer
Node；
Step S1.2.3, it obtains current degree of transitivity and judges whether it is 1；If it is not, thening follow the steps S1.2.4；If so, jumping
Go to step S1.2.5；
Step S1.2.4, the root node and its corresponding ID for working as front transfer are obtained, and will be when the connection of the root node of front transfer
Neighbours are set as the root node of next transmitting, and by accessed when the root ID of the root node of front transfer adds 1 to be used as next transmitting
Root node root ID, to which the root node of next transmitting is reset to when the root node of front transfer and acquired is worked as forward pass
After successive number subtracts 1, return step S1.2.3；
Step S1.2.5, terminate transmitting, and the root node that root ID is c is attached with specified aggregation node, obtain head and the tail
The ring net of connection；
Step S2, each root node is started to create its subsequent subnet based on tree, obtains required distributed ring tree scattering
Network；
Step S2.1, each root node is searched into each root node as the controller in the ring net based on head and the tail connection
Subsequent neighbor node, and the son using the subsequent neighbor node of each root node searched as each root node based on tree
The main equipment of net, and further can start a piconet inquiry scan in the main equipment of subnet of each root node based on tree
The neighbor node of the link information of standby single hop case is provided as corresponding from equipment；
Step S2.2, for the slave equipment for going out institute's inquiry scan as the main equipment scanned next time, restarting is respectively individual
It is respective from equipment that piconet inquiry scan, which provides the neighbor node of the link information of standby single hop case, until each root node
Until upper all node scans finish, subnet of each root node based on tree is obtained, that is, realizes required distributed ring tree scattering
The construction of network.
2. a kind of building method of distributed ring tree both scatternets as described in claim 1, which is characterized in that described each
The number of nodes of subnet of the node based on tree should all be less than or equal to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910202347.7A CN110011890A (en) | 2019-03-18 | 2019-03-18 | A kind of building method of distribution ring tree both scatternets |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910202347.7A CN110011890A (en) | 2019-03-18 | 2019-03-18 | A kind of building method of distribution ring tree both scatternets |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110011890A true CN110011890A (en) | 2019-07-12 |
Family
ID=67167489
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910202347.7A Pending CN110011890A (en) | 2019-03-18 | 2019-03-18 | A kind of building method of distribution ring tree both scatternets |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110011890A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111464338A (en) * | 2020-03-16 | 2020-07-28 | 哈尔滨安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
-
2019
- 2019-03-18 CN CN201910202347.7A patent/CN110011890A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111464338A (en) * | 2020-03-16 | 2020-07-28 | 哈尔滨安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
| CN111464338B (en) * | 2020-03-16 | 2022-10-18 | 安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
| CN111695223B (en) * | 2020-06-11 | 2023-03-03 | Ut斯达康通讯有限公司 | Network topology layout method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103415054B (en) | Hierarchical routing method based on distributed wireless aggregation networks | |
| CN104936168B (en) | A kind of efficient wireless mesh network-building method | |
| CN102111912B (en) | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network | |
| TW200412081A (en) | Bluetooth network structure and method of processing the same | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN108366406A (en) | A kind of method of the interior switching root node of mesh networks | |
| CN110011890A (en) | A kind of building method of distribution ring tree both scatternets | |
| KR101033665B1 (en) | A head node election method for clustering in wireless sensor network and thereof wireless sensor network | |
| EP2582182B1 (en) | Bluetooth scatternet tree formation for wireless sensor networks | |
| CN104735745B (en) | The method for building up of virtual backbone network and device in a kind of heterogeneous ad hoc network | |
| CN108366438B (en) | Generating cluster networking method and generating cluster network for large-scale self-organizing wireless communication | |
| CN106330536A (en) | Method for acquiring network state information of wmSDN | |
| CN115190559B (en) | Networking and control method of multi-scene-oriented Internet of things equipment | |
| CN103533597A (en) | Unstructured mobile peer-to-peer coverage network and construction and maintenance methods thereof | |
| Sakai et al. | Multi-initiator connected dominating set construction for mobile ad hoc networks | |
| Wang et al. | On the construction of stable virtual backbones in mobile ad-hoc networks | |
| CN114040471B (en) | Distributed topology control method and terminal based on Bluetooth network | |
| Huang et al. | A backbone-aware topology formation (BATF) scheme for ZigBee wireless sensor networks | |
| CN1738270A (en) | Method for building self-organized network skeleton structure | |
| CN104244230B (en) | The cast communication implementation method of next generation wireless network | |
| CN110933684B (en) | Small world wireless sensor network construction method based on mixed mode | |
| CN105959141B (en) | A kind of virtual network topology construction method and device | |
| CN106413023B (en) | A kind of method for routing in mobile ad-hoc network | |
| CN106603408B (en) | A kind of Synergistic method that SDN multi-controller is expansible | |
| CN101616465B (en) | Ad hoc network hierarchical routing method |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190712 |