CN103475524B - Based on the layering network-building method of master-slave node communication network - Google Patents
Based on the layering network-building method of master-slave node communication network Download PDFInfo
- Publication number
- CN103475524B CN103475524B CN201310414926.0A CN201310414926A CN103475524B CN 103475524 B CN103475524 B CN 103475524B CN 201310414926 A CN201310414926 A CN 201310414926A CN 103475524 B CN103475524 B CN 103475524B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- networking
- neighbor
- communication network
- 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
- 230000006854 communication Effects 0.000 title claims abstract description 117
- 238000004891 communication Methods 0.000 title claims abstract description 108
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000006855 networking Effects 0.000 claims abstract description 88
- 238000012790 confirmation Methods 0.000 claims abstract description 28
- 238000004321 preservation Methods 0.000 claims abstract description 5
- 230000004044 response Effects 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 3
- 239000003999 initiator Substances 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of layering network-building method based on master-slave node communication network, the method comprises the steps: that host node sends the broadcasting command of calling certain grade from node networking, and initiatively delay time wait networks from node application; All receive this network order and do not network carry Self address from node Stochastic choice time and initiatively send request to communication network the order that networks; After wait terminates, host node successively to applying for that within this period its neighbor node networked carries out point-to-point networking and confirms, and gives this from peer distribution rank; Host node with to have networked carry out point-to-point communication from node, obtain respectively its record the information of neighbor nodes of preservation; If its neighbor node does not network, then host node carries out networking confirmation to this neighbor node, and distributes rank to this neighbor node; Repeat above-mentioned steps until respectively all network from the neighbor node of node.The present invention reduces manual intervention, improve the intellectuality of communication network and the success rate that communicates.
Description
Technical field
The present invention relates to a kind of layering network-building method based on master-slave node communication network.
Background technology
One comprises single host node, multiple communication network from node and communication media is called as master-slave node communication network, and its communication mode conventional is at present as follows:
1, record gathers deployment in a communication network all from node communication address;
2, by the input of the mailing address from node host nodes all in communication network;
3, host node initiatively initiates point-to-point communication to from node, and communicate successfully then record communication path, otherwise increases relaying continuation trial communication.
The deficiency of above-mentioned communication mode is: 1, correctly must record all mailing addresses from node, if mailing address misregistration or error of omission, then cause communication failure; 2, communication network itself does not possess more New function, initiatively can not find that the communication newly adding or change is from node, does not possess intelligence; 3, communication path is formed time-consuming, must travel through eachly could form unique communication path after node; If 4 communication paths lost efficacy, then need to rediscover path, communication efficiency was poor.
Summary of the invention
The object of this invention is to provide a kind of reliable and be easy to the layering network-building method based on master-slave node communication network that realizes.
This layering network-building method based on master-slave node communication network provided by the invention, host node all can monitor the message communication network from node with each, send other networking and ask from node, and be recorded as the neighbor node of oneself around analyzing; The method comprises the steps:
Step 1, host node sends calling i level and to network broadcasting command from node, and initiatively delay time D
iwait for and networking from node application; Wherein i to be initial value be 0 nonnegative integer;
Step 2, all receive calling i level from node networking broadcasting command from node, stand-by period T first separately
di, as stand-by period T
diafter end, networked from node at ensuing stand-by period T
diinterior automated randomized selection time point forwards described broadcasting command; Do not network from node then at ensuing networking application time t
iin, automated randomized selection network entry time point carries Self address and initiatively sends request to communication network the order that networks;
Step 3, host node delay time D
iafter wait terminates, host node successively with in described delay time, host node can listen to and sent apply for networking carry out point-to-point networking from node and confirm, and to being 0 grade of node from peer distribution, what receiving the confirmation that networks carries out confirmation response from node;
Step 4, host node carries out point-to-point communication with the i-1 level to have networked from node, obtain respectively its record the information of neighbor nodes of preservation; If its neighbor node does not network, then host node carries out networking confirmation to this neighbor node, and is assigned as i level node to this neighbor node, and what receiving the confirmation that networks carries out confirmation response from node;
Step 5, host node carries out point-to-point communication with the i level to have networked from node, obtain respectively its record the information of neighbor nodes of preservation; If its neighbor node does not network, then host node carries out networking confirmation to this neighbor node, and is assigned as i level node to this neighbor node, and what receiving the confirmation that networks carries out confirmation response from node;
Step 6, repeats step 1 to step 5, finds i+1 level node, until all neighbor nodes from node all network successfully, show that networking completes by i level node.
Described stand-by period T
diwith described networking application time t
ican set or revise before networking; Described networking application time t
iat described stand-by period T
dijust timing is started after end.
Described host node sends the described delay time D that described broadcasting command is waited at every turn
ibe not less than stand-by period T described in current this broadcasting command of i rank
di(i+1) doubly and described networking application time t
isum; Described delay time D
iwith described stand-by period T
dichange and change.
Described neighbor node is in communication process, if the transmission information of A node can by B nodes listen to, then A node is called the neighbor node of B node.
Described host node is initiator and the end side of a communication process, possesses the function obtained from the information of neighbor nodes of node; Based on information of neighbor nodes, host node can be restrained, optimize communicate path, automatically forms many active communication paths.
Described is the responder of a communication process from node; Control from node by described host node.
Described i level from node be communicate with host node need i via node from node; Wherein i to be initial value be 0 nonnegative integer.
Described calling i level comprises sequence number, stand-by period T from node networking broadcasting command
di, network application time t
i, hop count; Wherein i to be initial value be 0 nonnegative integer.
Described in this of described host node transmission, the sequence number of broadcasting command is different from the sequence number of its last described broadcasting command sent.
Described calling i level is equal with i from the initial value of the hop count of node networking broadcasting command; Described broadcasting command often forwards once, and described hop count subtracts 1, stops forwarding when its value is kept to 0.
After the described networking receiving host node from node confirms order, unless inbound information is lost, otherwise no longer initiatively send the request of networking.
What networked in described step 2 is less than the rank of calling out networking broadcasting command described in this from the rank of node itself, then automatically forward described broadcasting command; Otherwise do not carry out the forwarding of described broadcasting command.
Describedly receive identical calling i level from node and to network broadcasting command from node, then abandon this order and disregard.
Described identical calling i level is the described broadcasting command that sequence number is identical from node networking broadcasting command.
Described information of neighbor nodes comprises the address information of neighbor node.
Compared with prior art, the present invention has following advantage:
1, during communications network deployment, do not need record from node communication address, by host node with cooperatively interact from node and initiatively complete networking, in guarantee network, mailing address accurately and reliably.After networking completes, host node can the feedback communication network information at any time, ensures the accurate and effective, reliable of communication network information.
2, newly-increased communication node or replacing communication node in communication network, the present invention all can initiatively find, does not need manual intervention, significantly improves the intellectuality of communication network.
3, in layering networking process, because node has monitor function, can form the node of a large amount of neighbours each other, in other words, define a large amount of alternate communication paths, therefore one or several communication path interrupts final communication efficiency impact less.
4, host node obtains a large amount of information of neighbor nodes, and this information contributes to the network optimization, is beneficial to the convergence of communication network, reduces communication repeating progression, improves communication efficiency; In addition, this information contributes to forming backbone communication network (the extraordinary network of communication reliability); During communication, backbone network is selected to be conducive to promoting communication success rate.
Accompanying drawing explanation
Fig. 1 is communication network schematic diagram of the present invention.
Fig. 2 is the networking sequential chart of a kind of three-level network of the present invention.
Fig. 3 is a kind of network topological diagram that the present invention specifically implements.
Embodiment
One comprises single host node, multiple communication network from node and communication media is called as master-slave node communication network.
As shown in Figure 1, from macroscopically, according in communication process the need of relaying and the quantity needing via node, master-slave node communication network can be divided into multilayer, classify as certain grade of node by what need same quantity via node in communication process from node, by all peers from node division be one deck.Such as 0 grade of node be can with host node direct communication from node, it needs the quantity of via node to be 0, is the 0th layer by all 0 grade of node division; 1 grade of node be communicate with host node must by another node carry out that relaying just can complete from node, its via node quantity needed is 1, is the 1st layer by all 1 grade of node division; , by that analogy.Realize the layering of communication network thus.
And in theory, during communication, only having vicinity two above-mentioned network layers of this node place layer can receive information, remainder layer cannot receive information.
Present invention utilizes this characteristic, adopt host node " step by step by layer " to call the mode surveyed and network from node together, finally complete the establishment of whole communication network.
The present invention is that communication success rate at the scene proposes when can not reach customer demand, in order that reduce manual intervention network, promotes communication network intelligence degree, improves communication success rate, accelerates engineering and advances progress.
Below in conjunction with accompanying drawing 2, Fig. 3 and specific embodiment, the present invention is further illustrated.
The present invention preferably applies in the master-slave node communication network in carrier communication field.
Embodiment: host node carries out networking to unknown number from node.Each all networking from the neighbor node of node confirms to show completing of networking.
If existing single host node and some from node, these nodes all can monitor the message in communication network, all can analyze and record other information from node sending networking around oneself and ask; Host node also possesses the function obtained from the information of neighbor nodes of node.
Step 1, it is 0 that host node BB transmits Sequence Number, the stand-by period is T
d0, the networking application time is t
0, hop count is 0, calling 0 grade networks from node broadcasting command, and initiatively time delay D
0time wait networks from node application.
Step 2, from node C1, all receives this networking broadcasting command from node C2 with from node C3, find sequence number and the sequence number of last time inconsistent, then three from node respectively renewal sequence number be 0, then wait for T separately
d0time.Because these three all do not receive the networking confirmation of host node, therefore at ensuing t from node
0in time period, carry Self address from node C1 Stochastic choice time point and send request to communication network the order that networks, carry Self address from node C2 Stochastic choice time point and send request to communication network the order that networks, carry Self address from node C3 Stochastic choice time point and send request to communication network the order that networks.
Step 3, at D
0in time, host node BB listens to the networking application sent from node C2, and host node BB listens to the networking application sent from node C1, and host node BB listens to the networking application sent from node C3.
Step 4, host node BB is at stand-by period D
0after end, host node BB confirms to sending from node C2 to network, and is assigned as 0 grade of node from node C2, carries out confirmation response from node C2; Host node BB confirms to sending from node C1 to network again, and is assigned as 0 grade of node from node C1, carries out confirmation response from node C1; Then host node BB confirms to sending from node C3 to network again, and is assigned as 0 grade of node from node C3, carries out confirmation response from node C3.
Step 5, host node BB and the neighbor node obtained from node C2 point-to-point communication from node C2, be from node C1 with from node C3 from the neighbor node of node C2, do not network from node; Host node BB and the neighbor node obtained from node C1 point-to-point communication from node C1, be from node C2 from the neighbor node of node C1, do not network from node; Host node BB and the neighbor node obtained from node C3 point-to-point communication from node C3, be from node C2 from the neighbor node of node C3, do not network from node.
Step 6, it is 1 that host node BB transmits Sequence Number, the stand-by period is T
d1, the networking application time is t
1, hop count is 1, calling 1 grade networks from node broadcasting command, and initiatively time delay D
1time wait networks from node application.
Step 7, from node C1, all receives this networking broadcasting command from node C2 with from node C3, find sequence number and last time inconsistent, then renewal sequence number is 1 respectively, then waits for T separately
d1time.Because these three have received the networking confirmation of host node all from node, and this calling networks larger than self rank from the rank of node, therefore at ensuing T
d1in time period, forward after broadcast networking transferring order number of times is subtracted 1 by node C1 Stochastic choice time point, forward after broadcast networking transferring order number of times is subtracted 1 by node C2 Stochastic choice time point, forward after broadcast networking transferring order number of times is subtracted 1 by node C3 Stochastic choice time point.
If what networked is less than the rank of calling out networking broadcasting command described in this from the rank of node itself, then automatically forward described broadcasting command; Otherwise do not carry out the forwarding of described broadcasting command.Such as from node this as 2 grades of nodes, but current broadcasting command is calling 1 grade networks from node, so these 2 grades of nodes are the forwardings not carrying out this broadcasting command.
Step 8, from node C4, receives networking broadcasting command respectively from node C5, find sequence number and last time inconsistent, then renewal sequence number is 1 respectively, then waits for T separately
d1time.Because these two all do not receive the networking confirmation of host node, therefore at ensuing t from node
1in time period, carry Self address from node C4 Stochastic choice time point and send request to communication network the order that networks, carry Self address from node C5 Stochastic choice time point and send request to communication network the order that networks.
Step 9, host node BB and the neighbor node obtained from node C2 point-to-point communication from node C2, be from node C1 from the neighbor node of node C2, from node C3, from node C4, from node C5, do not network from node C4 with from node C5.Host node BB then with from node C2 for relaying respectively to from node C4 and from node C5 carry out networking confirm, and give be assigned as 1 grade from node C4 with from node C5, from node C4 and from node C5 carry out respectively confirmations reply.Host node BB and the neighbor node obtained from node C1 point-to-point communication from node C1, be from node C2 with from node C4 from the neighbor node of node C1, do not network from node.Host node BB and the neighbor node obtained from node C3 point-to-point communication from node C3, be from node C2 with from node C5 from the neighbor node of node C3, do not network from node.
Step 10, host node BB, to obtain the neighbor node from node C4 from node C2 for relaying and from node C4 point-to-point communication, is from node C1 with from node C2 from the neighbor node of node C4, does not network from node; Host node BB, to obtain the neighbor node from node C5 from node C2 for relaying and from node C5 point-to-point communication, is from node C2 with from node C3 from the neighbor node of node C5, does not network from node.
Step 11, it is 2 that host node BB transmits Sequence Number, the stand-by period is T
d2, the networking application time is t
2, hop count is 2, calling 2 grades networks from node broadcasting commands, and initiatively time delay D
2time wait networks from node application.
Step 12, from node C1, all receives this networking broadcasting command from node C2 with from node C3, find sequence number and last time inconsistent, then renewal sequence number is 2 respectively, then waits for T separately
d2time.Because these three have received the networking confirmation of host node all from node, and this calling networks larger than self rank from the rank of node, therefore at ensuing T
d2in time period, forward after broadcast networking transferring order number of times is subtracted 1 by node C1 Stochastic choice time point, forward after broadcast networking transferring order number of times is subtracted 1 by node C2 Stochastic choice time point, forward after broadcast networking transferring order number of times is subtracted 1 by node C3 Stochastic choice time point.
Step 13, from node C4, from node C5 receive respectively from node C1, from node C2, from node C3 forward networking broadcasting command, find sequence number and last time inconsistent, then renewal sequence number is 2 respectively, then waits for T separately
d2time.Because these two have received the networking confirmation of host node all from node, and this calling networks larger than self rank from the rank of node, therefore at ensuing T
d2in time period, forward after broadcast networking transferring order number of times is subtracted 1 by node C4 Stochastic choice time point, forward after broadcast networking transferring order number of times is subtracted 1 by node C5 Stochastic choice time point.
Step 14, from node C1, from node C2, from node C3 receive respectively from node C4, from node C5 forward networking broadcasting command, find sequence number consistent with last time, then dropping packets is disregarded.
Step 15, from node C6 receive from node C5 forward networking broadcasting command, find sequence number and last time inconsistent, then renewal sequence number is 2, then waits for T
d2time.Because the networking not receiving host node from node C6 confirms, therefore at ensuing t
2in time period, carry Self address from node C6 Stochastic choice time point and send request to communication network the order that networks.
Step 16, host node BB, to obtain the neighbor node from node C4 from node C2 for relaying and from node C4 point-to-point communication, is from node C1 with from node C2 from the neighbor node of node C4, does not network from node; Host node BB, to obtain the neighbor node from node C5 from node C2 for relaying and from node C5 point-to-point communication, is from node C2 from the neighbor node of node C5, from node C3 with from node C6, does not network from node C6.Host node BB then with from node C2, from node C5 for relaying to carry out from node C6 networking confirm, and give be assigned as 2 grades from node C6, from node C6 carry out confirmations reply.
Step 17, host node BB, with from node C2, obtains neighbor node from node C6 for relaying with from node C6 point-to-point communication from node C5, is from node C5 from the neighbor node of node C6, less than non-network access node.
So far, 3 grades of network organizings as shown in Figure 3 complete.
All nodes all only monitor the information in network, hear, save as the neighbor node of oneself, do not forward the information heard.
When carrying out networking and confirming, host node can be carried out level allocation from node, such as is assigned as 0 grade of node (can record the rank belonging to oneself from node).Such as, broadcasting command, when calling 1 grade of node networks, is in fact sent to communication network by host node, and all 0 grade of nodal test networked to being that calling 1 grade of node networks, then having networked from node and automatically forwarded.If therefore there is no the class information belonging to oneself from node, just this broadcasting command should cannot be forwarded from node.Host node finds 1 grade of node by 0 grade of node in this way, finds 2 grades of nodes, by that analogy by 0 grade of node and 1 grade of node.In this way, host node rapidly and efficiently complete networking, realize the convergence to network and optimization.
According to sequential as shown in Figure 2, the present invention adopts following formula can calculate networking deadline ideally.
（1）
（2）
In formula,
t i represent the
ilayer network networking completes the required time,
t di represent in message the stand-by period (the of specifying
i-1the all node of layer forwards networking message required time),
t i represent the
ithe time span section that layer network application networks.
t s for completing the time required for the whole process of networking,
nfor the macroscopic view topology number of plies of whole network,
tbe a communication cycle time used,
c i represent network the
ilayer from number of nodes.
The present invention is at a kind of ideal situation and under the prerequisite set up of some hypothesis, adopts formula (1) and formula (2) calculating networking deadline, embody networking efficiency of the present invention.
Several hypothesis that the present invention adopts are as follows:
1, each only receiving from node networks confirmation once, and only obtains its neighbor node of secondary from this from node.
2, no matter how many communication data is, and its communication process time is fixed value.
3, the situation of Communications failure is not had.
For the network of 4 grades, under supposing current state, can with host node direct communication from number of nodes be 512, what need 1 via node could communicate with host node has 256 from node, what need 2 via nodes could communicate with host node has 128 from node, what need 3 via nodes could communicate with host node has 64 from node, then have
c 0=512,
c 1=256,
c 2=128,
c 3=64;
n=4-1=3.If
t di be 5 minutes,
t i be 5 minutes,
tbe 1 second (supposing that a communication cycle is 1 second), then
（1）
；
；
；
；
（2）
Show that the present invention is about 149 minutes at the networking deadline to above-mentioned network thus.
Claims (15)
1. based on a layering network-building method for master-slave node communication network, it is characterized in that, host node all can monitor the message communication network from node with each, sends other networking and ask from node, and be recorded as the neighbor node of oneself around analyzing; The method comprises the steps:
Step 1, host node sends calling i level and to network broadcasting command from node, and initiatively delay time D
iwait for and networking from node application; Wherein i to be initial value be 0 nonnegative integer;
Step 2, all receive calling i level from node networking broadcasting command from node, stand-by period T first separately
di, as stand-by period T
diafter end, networked from node at ensuing stand-by period T
diinterior automated randomized selection time point forwards described broadcasting command; Do not network from node then at ensuing networking application time t
iin, automated randomized selection network entry time point carries Self address and initiatively sends request to communication network the order that networks;
Step 3, host node delay time D
iafter wait terminates, host node successively with in described delay time, host node can listen to and sent apply for networking carry out point-to-point networking from node and confirm, and to being 0 grade of node from peer distribution, what receiving the confirmation that networks carries out confirmation response from node;
Step 4, host node carries out point-to-point communication with the i-1 level to have networked from node, obtain respectively its record the information of neighbor nodes of preservation; If its neighbor node does not network, then host node carries out networking confirmation to this neighbor node, and is assigned as i level node to this neighbor node, and what receiving the confirmation that networks carries out confirmation response from node;
Step 5, host node carries out point-to-point communication with the i level to have networked from node, obtain respectively its record the information of neighbor nodes of preservation; If its neighbor node does not network, then host node carries out networking confirmation to this neighbor node, and is assigned as i level node to this neighbor node, and what receiving the confirmation that networks carries out confirmation response from node;
Step 6, repeats step 1 to step 5, finds i+1 level node, until all neighbor nodes from node all network successfully, show that networking completes by i level node.
2. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described stand-by period T
diwith described networking application time t
ican set or revise before networking; Described networking application time t
iat described stand-by period T
dijust timing is started after end.
3. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described host node sends the described delay time D that described broadcasting command is waited at every turn
ibe not less than stand-by period T described in current this broadcasting command of i rank
di(i+1) doubly and described networking application time t
isum; Described delay time D
iwith described stand-by period T
dichange and change.
4. the layering network-building method based on master-slave node communication network according to claim 1, it is characterized in that, described neighbor node is in communication process, if the transmission information of A node can by B nodes listen to, then A node is called the neighbor node of B node.
5. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described host node is initiator and the end side of a communication process, possesses the function obtained from the information of neighbor nodes of node; Based on information of neighbor nodes, host node can be restrained, optimize communicate path, automatically forms many active communication paths.
6. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described is the responder of a communication process from node; Control from node by described host node.
7. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described i level from node be communicate with host node need i via node from node; Wherein i to be initial value be 0 nonnegative integer.
8. the layering network-building method based on master-slave node communication network according to claim 1, is characterized in that, described calling i level comprises sequence number, stand-by period T from node networking broadcasting command
di, network application time t
i, hop count; Wherein i to be initial value be 0 nonnegative integer.
9. the layering network-building method based on master-slave node communication network according to claim 8, is characterized in that, described in this of described host node transmission, the sequence number of broadcasting command is different from the sequence number of its last described broadcasting command sent.
10. the layering network-building method based on master-slave node communication network according to claim 8, is characterized in that, described calling i level is equal with i from the initial value of the hop count of node networking broadcasting command; Described broadcasting command often forwards once, and described hop count subtracts 1, stops forwarding when its value is kept to 0.
The 11. layering network-building methods based on master-slave node communication network according to claim 1, is characterized in that, after the described networking receiving host node from node confirms order, unless inbound information is lost, otherwise no longer initiatively send the request of networking.
The 12. layering network-building methods based on master-slave node communication network according to claim 1, it is characterized in that, what networked in described step 2 is less than the rank of calling out networking broadcasting command described in this from the rank of node itself, then automatically forward described broadcasting command; Otherwise do not carry out the forwarding of described broadcasting command.
The 13. layering network-building methods based on master-slave node communication network according to claim 1, is characterized in that, describedly receive identical calling i level from node and to network broadcasting command from node, then abandon this order and disregard.
The 14. layering network-building methods based on master-slave node communication network according to claim 13, is characterized in that, described identical calling i level is the described broadcasting command that sequence number is identical from node networking broadcasting command.
The 15. layering network-building methods based on master-slave node communication network according to claim 1, it is characterized in that, described information of neighbor nodes comprises the address information of neighbor node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310414926.0A CN103475524B (en) | 2013-09-13 | 2013-09-13 | Based on the layering network-building method of master-slave node communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310414926.0A CN103475524B (en) | 2013-09-13 | 2013-09-13 | Based on the layering network-building method of master-slave node communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103475524A CN103475524A (en) | 2013-12-25 |
| CN103475524B true CN103475524B (en) | 2016-02-10 |
Family
ID=49800234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310414926.0A Active CN103475524B (en) | 2013-09-13 | 2013-09-13 | Based on the layering network-building method of master-slave node communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103475524B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394132A (en) * | 2014-11-14 | 2015-03-04 | 苏州方位通讯科技有限公司 | Method for actively finding and managing VOIP (Voice Over Internet Protocol) terminal device through automatic deployment system |
| CN105491646A (en) * | 2015-11-20 | 2016-04-13 | 上海斐讯数据通信技术有限公司 | Self-networking method and system for wireless sensor network and wireless sensor network |
| CN105721018B (en) * | 2016-01-27 | 2018-02-02 | 厦门中天微电子科技有限公司 | A kind of method for improving power line carrier centralized meter-reading system collection and copying efficiency |
| DE102016011153A1 (en) * | 2016-09-14 | 2018-03-15 | Kathrein-Werke Kg | control system |
| CN107425992A (en) * | 2017-09-22 | 2017-12-01 | 雷晋源 | Information display method, electronic display board and information transmission system |
| CN111343697B (en) * | 2018-12-18 | 2022-07-12 | 南京新联电能云服务有限公司 | Communication networking method and communication system |
| CN109547569A (en) * | 2018-12-29 | 2019-03-29 | 深圳市力合微电子股份有限公司 | A kind of constructing communication network algorithm based on water heater application |
| CN110213359B (en) * | 2019-05-24 | 2021-09-03 | 南京邮电大学 | Internet of vehicles networking data pushing system and method based on D2D |
| CN112437484B (en) * | 2020-10-16 | 2021-10-29 | 山东大学 | A wireless seismograph networking method and wireless seismograph for underground engineering geological survey |
| CN112767669B (en) * | 2020-12-30 | 2023-04-07 | 国网北京市电力公司 | Data transmission method and device |
| CN112367411B (en) * | 2021-01-14 | 2021-05-11 | 杭州微策生物技术股份有限公司 | Intelligent POCT detection equipment and management method thereof |
| CN113133127B (en) * | 2021-04-16 | 2023-12-12 | 成都易明半导体有限公司 | Wireless ad hoc network link quick network access method based on random sniffing |
| CN114615674B (en) * | 2022-03-30 | 2023-08-29 | 西安宇飞电子技术有限公司 | Wireless Mesh Ad Hoc Network Method and System |
| CN116260758B (en) * | 2023-03-13 | 2024-07-09 | 内蒙古电力(集团)有限责任公司包头供电分公司 | Neighbor table optimization method, neighbor table optimization device, computer equipment and medium |
| CN118555636B (en) * | 2024-07-30 | 2024-11-29 | 北京智芯半导体科技有限公司 | Communication method, device and system of dual-mode communication repeater |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859436A (en) * | 2005-08-04 | 2006-11-08 | 上海华为技术有限公司 | Method for distributing address in cascade group net |
| CN101815287A (en) * | 2010-03-11 | 2010-08-25 | 北京交通大学 | Wireless sensor network routing method and system based on tree network |
| CN102202425A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module |
| CN102545961A (en) * | 2010-12-31 | 2012-07-04 | 弥亚微电子（上海）有限公司 | Active reporting and automatic networking method and system for non-networked node |
| CN103281105A (en) * | 2013-06-17 | 2013-09-04 | 北京科技大学 | Carrier table Ad-Hoc network method based on low voltage power line |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8605623B2 (en) * | 2002-05-31 | 2013-12-10 | Koninklijke Philips N.V. | Determining and configuring a communication path in a network |
-
2013
- 2013-09-13 CN CN201310414926.0A patent/CN103475524B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859436A (en) * | 2005-08-04 | 2006-11-08 | 上海华为技术有限公司 | Method for distributing address in cascade group net |
| CN101815287A (en) * | 2010-03-11 | 2010-08-25 | 北京交通大学 | Wireless sensor network routing method and system based on tree network |
| CN102545961A (en) * | 2010-12-31 | 2012-07-04 | 弥亚微电子（上海）有限公司 | Active reporting and automatic networking method and system for non-networked node |
| CN102202425A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module |
| CN103281105A (en) * | 2013-06-17 | 2013-09-04 | 北京科技大学 | Carrier table Ad-Hoc network method based on low voltage power line |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103475524A (en) | 2013-12-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103475524B (en) | Based on the layering network-building method of master-slave node communication network | |
| CN102231689B (en) | Method for determining connection topology of home network | |
| CN102647355B (en) | LACP (Link Aggregation Control Protocol) consultation processing method, relay node and system | |
| CN102364970B (en) | A Method for Realizing Automatic Address Configuration of Mobile Ad Hoc Networks | |
| CN110429708B (en) | Method and system for realizing plug and play of power distribution equipment | |
| WO2019196455A1 (en) | Air-conditioning communication system and method, storage medium and electronic apparatus | |
| CN103874291A (en) | Power line carrier-based intelligent networking control system and method | |
| CN111541689B (en) | Network transmission method suitable for PBFT (basic packet transport function) type consensus protocol | |
| CN110249634A (en) | Ammeter including power line interface He at least one radio frequency interface | |
| JP5875696B2 (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| CN101262448A (en) | IP data packet transmission method and system | |
| CN103001836A (en) | Serial communication method and serial communication system free of address allocation | |
| CN113098777B (en) | Data forwarding method, device, terminal equipment and storage medium | |
| US8451847B2 (en) | Intermediate node device, method of controlling intermediate node device, and network system | |
| CN104579424A (en) | Power carrier communication method | |
| CN109391545A (en) | The discovery system and discovery method of domain-to-domain link | |
| CN106100995A (en) | A kind of method for routing being applicable to power line carrier communication network network | |
| CN1330147C (en) | Automatic discovering method of resilient packet ring (RPR) equipment | |
| CN103457812A (en) | Silent automatic networking method based on communication network of master node and slave nodes | |
| CN102035894B (en) | Distance-based state synchronization method | |
| ParandehGheibi et al. | Optimal reverse carpooling over wireless networks-a distributed optimization approach | |
| Liton et al. | Proficient Networking Protocol for BPLC Network Built on Adaptive Multicast, PNP-BPLC | |
| CN102026417A (en) | Method for selecting network node to join in network and communication equipment | |
| CN114205768B (en) | Radio frequency chain networking communication method and system for high voltage overhead transmission line sensors | |
| WO2017170010A1 (en) | Information sharing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 413500 Yiyang Province Economic Development Zone, Anhua Province Tea Village Tea Plant Road Patentee after: WILLFAR INFORMATION TECHNOLOGY Co.,Ltd. Address before: 413500 Yiyang Province Economic Development Zone, Anhua Province Tea Village Tea Plant Road Patentee before: HUNAN WEISHENG INFORMATION TECHNOLOGY CO.,LTD. |
|
| CP03 | Change of name, title or address |
Address after: 413500 Yiyang Province Economic Development Zone, Anhua Province Tea Village Tea Plant Road Patentee after: HUNAN WEISHENG INFORMATION TECHNOLOGY CO.,LTD. Address before: 410205 No. 468 west slope, Changsha hi tech Industrial Development Zone, Changsha, Hunan, Yuelu District, Tongzi Patentee before: CHANGSHA WASION INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP02 | Change in the address of a patent holder |
Address after: 410205 Changsha Hi-tech Industrial Development Zone, Changsha, Hunan Province, Tongzi Poe Road No. 468 Patentee after: WILLFAR INFORMATION TECHNOLOGY Co.,Ltd. Address before: 413500 Yiyang Province Economic Development Zone, Anhua Province Tea Village Tea Plant Road Patentee before: WILLFAR INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |