CN103457812A - Silent automatic networking method based on communication network of master node and slave nodes - Google Patents
Silent automatic networking method based on communication network of master node and slave nodes Download PDFInfo
- Publication number
- CN103457812A CN103457812A CN201310414893XA CN201310414893A CN103457812A CN 103457812 A CN103457812 A CN 103457812A CN 201310414893X A CN201310414893X A CN 201310414893XA CN 201310414893 A CN201310414893 A CN 201310414893A CN 103457812 A CN103457812 A CN 103457812A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- communication
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a silent automatic networking method based on a communication network of a mater node and slave nodes. The master node and the slave nodes can monitor information in the communication network, analyze and record other surrounding slave nodes sending network access requests and record the nodes as neighbor nodes. When one slave node which does not have access to the network detects that a surrounding communication network receives no information for a period of time and then judges that the surrounding communication network is under a silent state, the node selects a time point randomly to carry an address of the node itself to request to have access to the network, the main node sequentially confirms network access in a point-to-point mode with the slave nodes which can be monitored by the main node and request to have access to the network, the main node sequentially communicates with the slave nodes which have access to the network in a point-to-point mode to obtain the neighbor node which is record and stored by the main node, if the neighbor node does not have access to the network, then the main node tries to communicate with the neighbor node to carry out network access confirmation, and the preceding procedures are repeated until network access confirmation of all the neighbor nodes of the nodes is completed. Communication addresses of the slave nodes do not need to be recorded, automatic networking can be achieved, and the method is efficient and easy to achieve.
Description
Technical field
The present invention relates to a kind of automatic network-building method of mourning in silence based on the main and subordinate node communication network.
Background technology
One comprise single host node, a plurality of communication network from node and communication media is called as the main and subordinate node communication network, at present communication mode commonly used is as follows for it:
1, record gathers and is deployed in all from the node communication address in communication network;
2, by all input of the mailing address from node host nodes in communication network;
3, host node is initiatively to from node, initiating point-to-point communication, and the record communication path of communicating by letter successfully, continue to attempt communication otherwise increase relaying.
From top communication mode, can find out: 1, must correctly record all mailing addresses from node, if mailing address misregistration or error of omission cause communication failure; 2, communication network itself does not possess the renewal function, can not initiatively find newly to add or the communication changed from node, do not possess intelligence; 3, communication path forms time-consumingly, must travel through each and could form unique communication path from node.If 4 communication paths lost efficacy, need to rediscover path, communication efficiency is poor.
Summary of the invention
The purpose of this invention is to provide a kind of high efficiency smart and be easy to the automatic network-building method of mourning in silence based on the main and subordinate node communication network of realizing.
This automatic network-building method of mourning in silence based on the main and subordinate node communication network provided by the invention, host node all can be monitored the message communication network with each from node, around analyzing and recording, other of the request of send networking are from node, and are recorded as the neighbor node of oneself; The method comprises the steps:
Step 1, the communication network detected around it from node do not networked does not have message in a period of time, thinks that now communication network around it is in silent status, and then this node is random selects a time point to carry self Address requests to network;
Step 3, host node carries out point-to-point communication from node with networking successively, obtains the neighbor node that its record is preserved; If its neighbor node does not network, attempt communicating by letter with this neighbor node the confirmation that networks;
Step 4, repeating step 1 is to step 3, until the networking of the neighbor node of all nodes confirmed, this networking completes.
Carry self address from node in described step 1 and send request to communication network the order that networks.Described host node is initiator and the end side of a communication process, possesses the function of obtaining from the information of neighbor nodes of node; Based on information of neighbor nodes, host node can be restrained, the optimize communicate path, automatically forms many active communication paths.Described neighbor node is in communication process, if the information that the A node sends can be listened to by the B node, the A node is called the neighbor node of B node.Described is the responder of a communication process from node; From node, controlled by described host node; From node receives that order is confirmed in the networking of host node, unless networking information dropout, otherwise no longer initiatively send the request of networking.
With the prior art scheme, compare, the present invention has following advantage:
1, during communications network deployment, do not need record from the node communication address, by host node with from node, cooperatively interact and initiatively complete networking, in the assurance network, mailing address accurately and reliably.After networking completes, the host node feedback communication network information at any time.The present invention can carry out localized network self refresh and the network optimization at any time.
2, of the present invention possess around judgement the whether ability in silent status of communication network from node, the automatic network-building of not only can initiatively being mourned in silence, and in communication process, reason due to communication distance, the network part also may, in silent status, therefore be conducive to localized network self refresh and the network optimization.
3, newly-increased communication node or replacing communication node in communication network, the present invention can find automatically, does not need manual intervention.
4, the present invention carries out in the networking process, due to the node monitor function, can form a large amount of neighbours' each other node, in other words, can form a large amount of alternate communication paths, so one or several communication path interrupts final communication efficiency impact less.
5, host node has obtained a large amount of information of neighbor nodes, and this information contributes to the network optimization, and communication network is restrained, and reduces communication repeating progression, improves communication efficiency; In addition, this information also contributes to form trunk communication network (the extraordinary network of communication reliability).During communication, select backbone network to be conducive to promote the communication success rate.
The accompanying drawing explanation
Fig. 1 is communication network reduced graph of the present invention.
Fig. 2 is a kind of networking sequential chart in specific embodiment of the invention.
Fig. 3 is a kind of networking topological diagram in specific embodiment of the invention.
Embodiment
One comprise single host node, a plurality of communication network from node and communication media is called as the main and subordinate node communication network.
As shown in Figure 1, from macroscopic view, according to whether needing relaying in communication process and needing the quantity of via node, the main and subordinate node communication network can be divided into multilayer, and what will in communication process, need same quantity via node is one deck from node division.In addition, by above-mentioned, from node, classify as certain grade of node, for example 0 grade of node be can with the host node direct communication from node, its quantity that needs via node is 0; 1 grade of node must be undertaken that relaying just can complete by another node for communicating by letter with host node from node, its via node quantity needed is 1; , by that analogy.And in theory, during communication, only having two above-mentioned network layers of vicinity of this node place layer can receive information, remainder layer can't receive information, therefore in network, has idle state.
Efficient parallel networking of the present invention has utilized this characteristic, and it realizes that principle is as follows:
Do not network from node when network being detected in silent status, initiatively send the application that networks; According to the above-mentioned principle of stratification, although belong to the heterogeneous networks layer from node, in still can whole network all detect network in silent status from the node application that networks simultaneously, like this, reduced greatly the networking time.In addition, because the neighbor node for oneself from node that sends the application that networks all can be monitored and record to all nodes (comprising host node), when host node needs, each reports the neighbor node of self preserving from node, for the host node analysis.These information of neighbor nodes are also host nodes and definite foundation from the node communication route.
Below in conjunction with accompanying drawing 2, accompanying drawing 3 and specific embodiment, the present invention will be further described.
The present invention preferably applies in the main and subordinate node communication network in carrier communication field.
Embodiment: host node carries out networking to unknown number from node.Each neighbor node from node all networks and has confirmed to show completing of networking.
Step 1, host node BB is the time delay D time initiatively, makes whole communication network in silent status.
The present invention claims time period T
bfor the application time section that networks.
Step 3, at the D of time delay in the time, host node listens to respectively from node C2, from node C1, the networking application that sends from node C3.
Step 4, host node is after the D time of waiting for time delay finishes, and host node is confirmed to sending from node C2 to network, is confirmed to reply from node C2; Host node is confirmed to sending from node C1 to network, is confirmed to reply from node C1; Then host node is confirmed to sending from node C3 to network again, from node C3, confirms to reply.
Step 5, host node with from node C2 point-to-point communication, obtain from the neighbor node of node C2, from the neighbor node of node C2, be from node C1, from node C3, from node C4, from node C5, do not network from node C4 with from node C5.Host node be take from node C2 as relaying respectively to from node C4 with from the node C5 confirmation that networks, and from node C4 with from node C5, confirms respectively to reply.Host node with from node C1 point-to-point communication, obtain from the neighbor node of node C1, from the neighbor node of node C1, be from node C2 with from node C4, do not network from node; Host node with from node C3 point-to-point communication, obtain from the neighbor node of node C3, from the neighbor node of node C3, be from node C2 with from node C5, do not network from node.
Step 7, host node be take from node C2, is obtained from the neighbor node of node C6 from node C5 as relaying Yu from node C6 point-to-point communication, from the neighbor node of node C6, is from node C5, there is no not network access node.
So far, networking completes.The network topology structure of this networking as shown in Figure 3, is the networking topological diagram of 3 grades of networks.
According to Fig. 2, can learn, when network during in silent status, no matter whether it needs the quantity of via node identical with host node signal post, no matter the i.e. network node in which layer, all do not network start parallel automatic network-building from node simultaneously, therefore the networking time of the present invention has nothing to do with the number of plies.Can obtain thus the computing formula of networking deadline as shown in (1):
In formula,
t s for completing the needed time of the whole process of networking,
t a for the network silence period,
t b for from the free networking of the node time,
nfor the communication network macroscopic view topological network number of plies,
tfor confirming a node and reading this node neighbor node time used,
c i mean network
ithe layer from number of nodes.
This formula is a kind of ideal situation, and based on following hypothesis:
1, each is only received to network from node and confirms once, and only from this from node, obtains once its neighbor node.
2, no matter how many communication data is, and its communication process time is fixed value.
3, the situation that there is no Communications failure.
For the network of 4 grades as shown in Figure 1,
n=3.Suppose under current state, can with the host node direct communication from number of nodes, be 512, what 1 via node of needs could be communicated by letter with host node has 256 from node, what 2 via nodes of needs could be communicated by letter with host node has 128 from node, what 3 via nodes of needs could be communicated by letter with host node has 64 from node, has
c 0=512,
c 1=256,
c 2=128,
c 3=64.If
t a be 10 minutes,
t b be 10 minutes,
tbe 2 seconds (suppose that a communication cycle is 1 second, comprising and network confirmation and read two communication cycles of neighbor node),
Hence one can see that, adopts the present invention to carry out networking, and the networking deadline is only 76 minutes.When the present invention implements in design, decrease software complexity, be conducive to software development and maintenance.
Claims (5)
1. the automatic network-building method of mourning in silence based on the main and subordinate node communication network, it is characterized in that, host node and each all can be monitored the message communication network from node, and other that send around analyzing and record that networking asks are from node, and are recorded as the neighbor node of oneself; The method comprises the steps:
Step 1, the communication network detected around it from node do not networked does not have message in a period of time, thinks that now communication network around it is in silent status, and then this node is random selects a time point to carry self Address requests to network;
Step 2, what application that host node can listen to it successively networked carries out point-to-point networking confirmation from node;
Step 3, host node carries out point-to-point communication from node with networking successively, obtains the neighbor node that its record is preserved; If its neighbor node does not network, attempt communicating by letter with this neighbor node the confirmation that networks;
Step 4, repeating step 1 is to step 3, until the networking of the neighbor node of all nodes confirmed, this networking completes.
2. the automatic network-building method of mourning in silence based on the main and subordinate node communication network according to claim 1, is characterized in that, carries self address from node in described step 1 and send request to communication network the order that networks.
3. the automatic network-building method of mourning in silence based on the main and subordinate 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 of obtaining from the information of neighbor nodes of node; Based on information of neighbor nodes, host node can be restrained, the optimize communicate path, automatically forms many active communication paths.
4. the automatic network-building method of mourning in silence based on the main and subordinate node communication network according to claim 1, is characterized in that, described neighbor node is in communication process, if the information that the A node sends can be listened to by the B node, the A node is called the neighbor node of B node.
5. the automatic network-building method of mourning in silence based on the main and subordinate node communication network according to claim 1, is characterized in that, described is the responder of a communication process from node; From node, controlled by described host node; From node receives that order is confirmed in the networking of host node, unless networking information dropout, otherwise no longer initiatively send the request of networking.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310414893XA CN103457812A (en) | 2013-09-13 | 2013-09-13 | Silent automatic networking method based on communication network of master node and slave nodes |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310414893XA CN103457812A (en) | 2013-09-13 | 2013-09-13 | Silent automatic networking method based on communication network of master node and slave nodes |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103457812A true CN103457812A (en) | 2013-12-18 |
Family
ID=49739794
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310414893XA Pending CN103457812A (en) | 2013-09-13 | 2013-09-13 | Silent automatic networking method based on communication network of master node and slave nodes |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103457812A (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107959959A (en) * | 2017-11-29 | 2018-04-24 | 长沙师范学院 | A kind of multilevel network method of ammeter data acquisition |
CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
CN116938691A (en) * | 2023-09-19 | 2023-10-24 | 钛玛科(北京)工业科技有限公司 | Host computer construction method and system in equipment system network |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1671112A (en) * | 2004-03-15 | 2005-09-21 | 华为技术有限公司 | Method of node addressing in cascade networking system |
CN102545961A (en) * | 2010-12-31 | 2012-07-04 | 弥亚微电子(上海)有限公司 | Active reporting and automatic networking method and system for non-networked node |
CN102548038A (en) * | 2012-02-07 | 2012-07-04 | 江苏麦希通讯技术有限公司 | Micro-power wireless networking method |
CN102904609A (en) * | 2012-06-14 | 2013-01-30 | 中国科学技术大学 | Networking method for integrated power line carrier communication network and topology network |
CN102916876A (en) * | 2012-10-24 | 2013-02-06 | 浙江大学 | Routing method for one-way link environment of principal and subordinative construction network |
-
2013
- 2013-09-13 CN CN201310414893XA patent/CN103457812A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1671112A (en) * | 2004-03-15 | 2005-09-21 | 华为技术有限公司 | Method of node addressing in cascade networking system |
CN102545961A (en) * | 2010-12-31 | 2012-07-04 | 弥亚微电子(上海)有限公司 | Active reporting and automatic networking method and system for non-networked node |
CN102548038A (en) * | 2012-02-07 | 2012-07-04 | 江苏麦希通讯技术有限公司 | Micro-power wireless networking method |
CN102904609A (en) * | 2012-06-14 | 2013-01-30 | 中国科学技术大学 | Networking method for integrated power line carrier communication network and topology network |
CN102916876A (en) * | 2012-10-24 | 2013-02-06 | 浙江大学 | Routing method for one-way link environment of principal and subordinative construction network |
Non-Patent Citations (1)
Title |
---|
田加敏: "机群自组织网络MAC层时隙分配算法及跨层路由研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》, 15 August 2012 (2012-08-15), pages 136 - 369 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107959959A (en) * | 2017-11-29 | 2018-04-24 | 长沙师范学院 | A kind of multilevel network method of ammeter data acquisition |
CN107959959B (en) * | 2017-11-29 | 2020-09-29 | 长沙师范学院 | Multi-stage networking method for wireless data acquisition of electric meter |
CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
CN111093249B (en) * | 2019-12-05 | 2022-06-21 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
CN116938691A (en) * | 2023-09-19 | 2023-10-24 | 钛玛科(北京)工业科技有限公司 | Host computer construction method and system in equipment system network |
CN116938691B (en) * | 2023-09-19 | 2023-12-26 | 钛玛科(北京)工业科技有限公司 | Host computer construction method and system in equipment system network |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104244170B (en) | The autonomous network-building method of bluetooth nodes of low-power consumption | |
CN103475524A (en) | Layered networking method based on master-slave node communication network | |
CN112468372B (en) | Method and device for detecting equipment state in power line communication network | |
JP2017126978A (en) | Abnormality detection method, abnormality detection device and abnormality detection system | |
CN103974310B (en) | The tree topology construction method of radio communication multihop network equipment, device and system | |
CN103441781B (en) | Power line carrier ad hoc network and system | |
CN107479514A (en) | A kind of industrial big data process control data collection and Transmission system and implementation method | |
CN102143018B (en) | Message loop detection method, routing agent equipment and networking system | |
CN103457812A (en) | Silent automatic networking method based on communication network of master node and slave nodes | |
Nitesh et al. | Distributed fault detection and recovery algorithms in two-tier wireless sensor networks | |
CN103491592A (en) | Method and device for constructing paths of wireless mesh sensor network and gateway | |
CN105656715A (en) | Method and device for monitoring state of network device under cloud computing environment | |
CN103490849A (en) | Method and device for analyzing signaling traffic | |
CN108881177A (en) | A kind of parallel block chain of isomery and its technology are realized | |
CN113949649B (en) | Fault detection protocol deployment method and device, electronic equipment and storage medium | |
CN104301131A (en) | Fault management method and device | |
CN102387210B (en) | Distribution type file system monitoring method based on rapid synchronization network | |
CN102946335B (en) | A kind of network condition detection method and system | |
CN106254150B (en) | Network failure processing method and system | |
JP2018152745A (en) | Recording device, vehicle and record method | |
CN103885441B (en) | A kind of adaptive failure diagnostic method of controller local area network | |
CN103197981B (en) | Storage space method for early warning and system | |
CN107294853B (en) | Power communication network path optimization method | |
CN105472481A (en) | Intercommunication system and method | |
Bhuiyany et al. | Application-oriented sensor network architecture for dependable structural health monitoring |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20131218 |
|
RJ01 | Rejection of invention patent application after publication |