CN104469877A - 433M wireless automatic networking method and system - Google Patents
433M wireless automatic networking method and system Download PDFInfo
- Publication number
- CN104469877A CN104469877A CN201410805935.7A CN201410805935A CN104469877A CN 104469877 A CN104469877 A CN 104469877A CN 201410805935 A CN201410805935 A CN 201410805935A CN 104469877 A CN104469877 A CN 104469877A
- Authority
- CN
- China
- Prior art keywords
- node
- address
- network
- child
- routing
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
- Y04S40/12—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them characterised by data transport means between the monitoring, controlling or managing units and monitored, controlled or operated electrical equipment
- Y04S40/126—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them characterised by data transport means between the monitoring, controlling or managing units and monitored, controlled or operated electrical equipment using wireless data transmission
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a 433M wireless automatic networking method and system. The 433M wireless automatic networking method comprises the following steps that S1, the node type and the network identification are set, wherein different types of nodes include coordinator nodes, routing nodes and terminal nodes; S2, the coordinator nodes are started, a network is established according to the network identification and the node type, and routing tables corresponding to all the nodes in the network in a one-to-one mode are generated; S3, data packet transmission between any two nodes in the network is conducted by means of the routing addressing algorithm according to the routing tables. The 433M wireless automatic networking method has the advantages of being high in barrier avoiding capacity, low in cost and the like; in addition, the antijamming capability is high in a certain range, the stability is high, automatic networking is achieved based on the 433M wireless technology, and the application field of wireless control networks is widened.
Description
Technical field
The present invention relates to the communications field, particularly relate to the wireless automatic network-building method of a kind of 433M and system.
Background technology
433M wireless technology has the features such as low-power consumption, low cost, high modularization, communication distance length, can be widely used in controlled in wireless field; 433M wireless technology also has defects such as being easily disturbed, reliability is lower simultaneously, is often applied to point-to-point daily remote control, also therefore at present also not based on the net control of 433M wireless technology.
At wireless sensing control field, can realize networking function and apply more is 2.4G frequency range, such as ZigBee Wireless Network, and this technology has the advantages such as dynamic group net, reliability are high; But compare 433M wireless technology, the signal obstacle thing of ZigBee is indifferent, cost is high, and this affects the expansion of its range of application to a certain extent.If realize automatic network-building function on 433M wireless technology basis, then can expand the application of wireless control network.
Summary of the invention
For solving the problem, one of the technical solution used in the present invention is:
The wireless automatic network-building method of a kind of 433M is provided, wherein, comprises step:
S1, setting node type and network identity, described node type comprises coordinator node, routing node, terminal node;
S2, open coordinator node and set up network according to network identity and node type, and generate and each node routing table one to one in network; And
S3, the data packet transmission adopting routing addressing algorithm to carry out in network between arbitrary node according to described routing table.
Further, the routing table of described terminal node comprises node ID, node type and reserves; The routing table of coordinator node and routing node comprises node ID, node type, routing iinformation and reserves, routing iinformation comprises father node ID, child node number, child list and reserves, child node list comprises the nodal information of each child node, and each nodal information comprises child node ID, node type, node state and whether has next stage node.
Further, described step S2 specifically comprises:
S201, unlatching coordinator node;
S202, within the scope of address values for request adds new node stochastic generation node ID of network, then enter step S203 and step S204 respectively;
S203, select the strongest node of signal as the father node of new node according to network identity, the nodal information of new node is added in the routing table of father node;
S204, in network, send broadcast singal whether there is the node with described single byte address with identical address with inquiry, and judge whether to receive and change address notice;
S205, when new node receive change address notice time, return step S204, notify simultaneously described father node upgrade child list; And
S206, when new node do not receive in Preset Time change address notice time, confirm that described single byte address is the effective address of new node.
Further, also comprise after described step S2:
S4, network configuration step of updating, be specially:
S401, eachly there is the child node of father node to its father node timed sending status signal;
When S402, child node send status signal failure to father node, child node is searched according to signal strength signal intensity and is judged whether to there is the father node that can add, if, enter step S303, if not, enter step S304, wherein, this father node that can add is the non-self child node of described child node;
The father node added that S403, child node access signal is the strongest sends access request, and what can add adds in routing table entry by child node information; And
Type set is telegon by S404, child node, and the father node ID in routing iinformation is set to 0xFF.
Further, the data segment form of described packet comprises starting resource address, final goal address, current source address, current target address and signal jumping figure; Starting resource address is the original source node address initiating signal at first, and final goal address is the destination node address of signal, and current source address is the current current source Node address sending repeating signal; Current target address is the current current target node address that will receive repeating signal, and signal jumping figure is the number for recording through route.
Further, described step S3 specifically comprises:
S301, starting resource node or current source Node are by Packet Generation to current target node, and wherein current target node is the father node of starting resource node or current source Node;
After S302, current target node receive packet, as new current source Node, judge that whether self is destination node, if not, enters step S303;
S303, new current source Node judge whether there is destination node in routing table child node, are if so, forwarded by packet and give destination node, if not, enter step S305; And
S305, new current source Node judge whether to there is father node, and if so, with the current target node that described father node is new, new current source Node returns and performs step S301, if not, and packet of automatically withering away.
For solving the problem, two of the technical solution used in the present invention is:
The wireless automatic network-building system of a kind of 433M is provided, wherein, each described system comprises a coordinator node, multiple routing node and multiple terminal node, arrange at least one routing node under described coordinator node to be connected with it, arrange at least one terminal node under each described routing node to be connected with it, described system carries out networking by the following method:
S1, setting node type and network identity, described node type comprises coordinator node, routing node, terminal node;
S2, open coordinator node and set up network according to network identity and node type, and generate and each node routing table one to one in network; And
S3, the data packet transmission adopting routing addressing algorithm to carry out in network between arbitrary node according to described routing table.
Further, the routing table of described terminal node comprises node ID, node type and reserves; The routing table of coordinator node and routing node comprises node ID, node type, routing iinformation and reserves, routing iinformation comprises father node ID, child node number, child list and reserves, child node list comprises the nodal information of each child node, and each nodal information comprises child node ID, node type, node state and whether has next stage node.
Further, also comprise after described step S2:
S4, network configuration step of updating, be specially:
S401, eachly there is the child node of father node to its father node timed sending status signal;
When S402, child node send status signal failure to father node, child node is searched according to signal strength signal intensity and is judged whether to there is the father node that can add, if, enter step S303, if not, enter step S304, wherein, this father node that can add is the non-self child node of described child node;
The father node added that S403, child node access signal is the strongest sends access request, and what can add adds in routing table entry by child node information; And
Type set is telegon by S404, child node, and the father node ID in routing iinformation is set to 0xFF.
Further, the data segment form of described packet comprises starting resource address, final goal address, current source address, current target address and signal jumping figure; Starting resource address is the original source node address initiating signal at first, and final goal address is the destination node address of signal, and current source address is the current current source Node address sending repeating signal; Current target address is the current current target node address that will receive repeating signal, and signal jumping figure is the number for recording through route.
433M wireless networking method disclosed in this invention has following beneficial effect: the 433M applications of wireless technology being originally often applied to point-to-point daily remote control has been arrived the net control based on 433M wireless technology, substitute the Wireless Network of the 2.4G frequency ranges such as ZigBee, the features such as obstacle thing ability is strong, cost is low should be had based on the net control of 433M wireless technology, and, antijamming capability is comparatively strong within the specific limits, and stability is better.Therefore, by realizing automatic network-building function on 433M wireless technology basis, expand the application of wireless control network.
Accompanying drawing explanation
Fig. 1 is the flow chart of the wireless automatic network-building method of a kind of 433M in an embodiment of the present invention.
Fig. 2 is the concrete flowchart of step S2 in Fig. 1.
Fig. 3 is the data format figure in the routing table of terminal node described in the present invention.
Fig. 4 is routing node of the present invention and telegon node data format figure in the routing table.
Fig. 5 is the concrete flowchart of network configuration step of updating S4 of the present invention.
Fig. 6 is the data segment form schematic diagram of packet of the present invention.
Fig. 7 is the schematic network structure in an execution mode of the present invention.
Fig. 8 is the data packet format schematic diagram in an execution mode of the present invention.
Embodiment
By describing technology contents of the present invention, structural feature in detail, realized object and effect, accompanying drawing is coordinated to be explained in detail below in conjunction with execution mode.
First, related terms is defined." radio node " is the wireless device with independent data transmission-receiving function." wireless self-networking " is initiated by multiple radio node, by the process of the automatic setting up wireless networks of certain method." network identity ", for distinguishing different networks, in same network, all nodes have identical network identity." node type " is the logical type that radio node is played the part of in the wireless network, comprises coordinator node, routing node, terminal node." node address " is the unique identifier in the wireless network of radio node, and address adopts byte to store, and coordinator node address is defaulted as 0x00, and all the other node address scopes are that 0x01-0xFE, 0xFF are as broadcast address." routing addressing " is after wireless network is set up, the communication mechanism that will adopt between any two nodes in network.
Seeing also Fig. 1, is the flow chart of the wireless automatic network-building method of a kind of 433M in an embodiment of the present invention.This 433M is wireless, and automatic network-building method comprises step:
Step S1, setting node type and network identity.
Particularly, before networking starts, first carry out type set to the node that will join in wireless network, type comprises coordinator node, routing node, terminal node.
Coordinator node, for initiating a network, is waited for that other nodes add, is had routing function; Routing node can join in network automatically, has routing function; Terminal node can join in network automatically, does not have routing function.Each network has a coordinator node, multiple routing node and multiple terminal node.
On the other hand, need, to the unified network identity of each Node configuration that will add consolidated network, to avoid internetwork signal disturbing.In the present embodiment, using the address register value of node device as network identity, this address register will be assigned when program upgrade.Upgrading refers to the burning process of the singlechip chip of node device, can by particular value writing address register in burning process.
Data transmit-receive is all according to address pattern in network for node, and namely the address field of transceiving data bag is for recording network identification information.Only have the address register value node consistent with network identity just can add network and receive data, otherwise node cannot add network, and the data received will be simply discarded.
Step S2, unlatching coordinator node open other types node to set up network according to network identity and node type subsequently, and generate and each node routing table one to one in network.
Step S3, the data packet transmission adopting routing addressing algorithm to carry out in network between arbitrary node according to described routing table.
Referring to Fig. 2, is the concrete flowchart of step S2 in Fig. 1.In the present embodiment, described step S2 specifically comprises the following steps:
Step S201, unlatching coordinator node; Wherein, namely coordinator node sets up new network after opening, and now network only comprises a node, and the node address of telegon is 0x00.
Step S202, within the scope of address values for request adds new node stochastic generation node ID of network, then enter step S203 and step S204 respectively.
Step S203, select the strongest node of signal as the father node of new node according to network identity, the nodal information of new node is added in the routing table of father node.
, see also Fig. 3, Fig. 4 herein, to be described the data structure of described routing table, Fig. 3 is terminal node data format figure in the routing table, Fig. 4 is routing node and telegon node data format figure in the routing table.The data format of terminal node comprises node ID, node type and reserves.The data format of routing node comprises node ID, node type, routing iinformation and reserves, routing iinformation comprises father node ID, child node number, child list and reserves, child node list comprises the nodal information of each child node, and each nodal information comprises child node ID, node type, node state and whether has next stage node.
Step S204, in network, send broadcast singal whether there is the node with described single byte address with identical address with inquiry, and judge whether to receive and change address notice;
Step S205, when new node receive change address notice time, return step S204, notify simultaneously described father node upgrade child list; And
Step S206, when new node do not receive in Preset Time change address notice time, confirm that described single byte address is the effective address of new node.
By above-mentioned steps, also formed gradually along with new node adds network topology structure one by one.
Referring to Fig. 5, is the concrete flowchart of network configuration step of updating.In the present embodiment, also comprise network configuration step of updating S4 after described step S2, specifically comprise:
Step S401, eachly there is the child node of father node to its father node timed sending status signal;
When step S402, child node send status signal failure to father node, child node is searched according to signal strength signal intensity and is judged whether to there is the father node that can add, if, enter step S403, if not, enter step S404, wherein, this father node that can add is the node for having routing function, and is not included in the child list of described child node;
The father node added that step S403, child node access signal is the strongest sends access request, and child node information adds in routing table entry by the father node that can add;
Type set is telegon by step S404, child node, and the father node ID in routing iinformation is set to 0x00.
By above-mentioned network configuration step of updating, when running into branch of a network signal interruption situation, when namely child node can not find father node situation when father node sends signal, realize re-establishing network configuration.This mechanism also can process telegon collapse case, and former telegon next stage child node adds in another sub-network in order successively, until a child node can add without father node, then this child node is new telegon.
Described step S3 according to the design of routing addressing algorithm, maximum 12 of the next stage child node of a routing node.The design object of routing addressing algorithm is following several respects: (1) efficiency: reduce signal and be issued to the time delays receiving feedback, avoids intra-network signal to explode and overlap; (2) reliability: part of nodes lost efficacy, and did not affect the signal communication of whole network; (3) extensibility: the communication requirement meeting newly-increased node.
According to above-mentioned target, 433M wireless networking of the present invention adopts layer-stepping Routing Protocol.The basic thought of this agreement is by terminal node and routing node sub-clustering, in bunch, communication has been come by leader cluster node, leader cluster node carries out data gathering and synthesizes to reduce transmission information amount, and last leader cluster node sends coordinator node or upper level bunch head to the data of assembling.This mode can meet the extensibility of wireless network, the effective energy ezpenditure maintaining terminal node and routing node, thus extends network lifecycle.Wherein, the signal transacting rule of all types of node is as follows: coordinator node only processes from next stage child node signal; Routing node only processes from father node and next stage child node signal; Terminal node only processes from father node signal.
Referring to Fig. 6, is the data segment form schematic diagram of packet.For meeting routing addressing algorithm, first signal data paragraph format is defined.Data segment mentioned here is the user data loading section sending described packet between 433M node.Data segment form comprises starting resource address, final goal address, current source address, current target address and signal jumping figure.Starting resource address is the original source node address initiating signal at first; Final goal address is the destination node address of signal; Current source address is the current current source Node address sending repeating signal; Current target address is the current current target node address that will receive repeating signal; Signal jumping figure is the number for recording through route.
Based on above-mentioned data segment form, in one embodiment, described step S3 specifically comprises the steps:
Step S301, starting resource node or current source Node are by Packet Generation to current target node, and wherein current target node is the father node of starting resource node or current source Node or non-starting resource child node;
After step S302, current target node receive packet, as new current source Node, judge that whether self is destination node, if not, enters step S303;
Step S303, new current source Node judge whether there is destination node in routing table child node, are if so, forwarded by packet and give destination node, if not, enter step S305;
Step S305, new current source Node judge whether to there is father node, and if so, with the current target node that described father node is new, new current source Node returns and performs step S301, if not, and packet of automatically withering away.
Below in conjunction with an instantiation, " carrying out the data packet transmission in network between arbitrary node according to described routing table employing routing addressing algorithm " is described in detail.
See also Fig. 7, Fig. 8, Fig. 7 is the schematic network structure of an example, when terminal node Src to terminal node Dst send data time, every step data packet format as shown in Figure 8:
Step 1-1, node Src send packet and judge that final goal address D st does not mate with Self address to its father node D, node D, then enter step 2-1 and step 2-2 respectively;
Packet is transmitted to the father node A of node D by step 2-1, node D, and node A receives after signal to its child node B and child node C forwarding data bag, i.e. step 3-1 and 3-2; ;
Packet is transmitted to another child node E of node D by step 2-2, node D, the child node E of node D is routing node, therefore, node E forwards to node E1 after receiving signal, node E1 receives signal and judges that final goal address D st does not mate with Self address, then do not process, this road signal leaves it at that;
It is identical with the process of step 2-2 interior joint E that step 3-1 and 3-2, Node B and node C receive the process after packet, and final signal can arrive node Dst, the data segment information in node Dst read data packet.
The definition of above data packet format, can effectively avoid routing node when forward signal, sends data, namely avoid signal to reflux to signal source Nodes.
The foregoing is only embodiments of the invention; not thereby the scope of the claims of the present invention is limited; every utilize specification of the present invention and accompanying drawing content to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in other relevant technical fields, be all in like manner included in scope of patent protection of the present invention.
Claims (10)
1. the wireless automatic network-building method of 433M, is characterized in that, comprise step:
S1, setting node type and network identity, described node type comprises coordinator node, routing node, terminal node;
S2, open coordinator node and set up network according to network identity and node type, and generate and each node routing table one to one in network; And
S3, the data packet transmission adopting routing addressing algorithm to carry out in network between arbitrary node according to described routing table.
2. the wireless automatic network-building method of a kind of 433M according to claim 1, is characterized in that, the routing table of terminal node comprises node ID, node type and reserves; The routing table of coordinator node and routing node comprises node ID, node type, routing iinformation and reserves, routing iinformation comprises father node ID, child node number, child list and reserves, child node list comprises the nodal information of each child node, and each nodal information comprises child node ID, node type, node state and whether has next stage node.
3. the wireless automatic network-building method of a kind of 433M according to claim 2, it is characterized in that, described step S2 specifically comprises:
S201, unlatching coordinator node;
S202, within the scope of address values for request adds new node stochastic generation node ID of network, then enter step S203 and step S204 respectively;
S203, select the strongest node of signal as the father node of new node according to network identity, the nodal information of new node is added in the routing table of father node;
S204, in network, send broadcast singal whether there is the node with described single byte address with identical address with inquiry, and judge whether to receive and change address notice;
S205, when new node receive change address notice time, return step S204, notify simultaneously described father node upgrade child list; And
S206, when new node do not receive in Preset Time change address notice time, confirm that described single byte address is the effective address of new node.
4. the wireless automatic network-building method of a kind of 433M according to claim 1, is characterized in that, also comprise step S4 after described step S2: network configuration step of updating, is specially:
S401, eachly there is the child node of father node to its father node timed sending status signal;
When S402, child node send status signal failure to father node, child node is searched according to signal strength signal intensity and is judged whether to there is the father node that can add, if, enter step S403, if not, enter step S404, wherein, this father node that can add is the non-self child node of described child node;
The father node added that S403, child node access signal is the strongest sends access request, and what can add adds in routing table entry by child node information; And
Type set is telegon by S404, child node, and the father node ID in routing iinformation is set to 0xFF.
5. the wireless automatic network-building method of a kind of 433M according to claim 2, is characterized in that, the data segment form of described packet comprises starting resource address, final goal address, current source address, current target address and signal jumping figure; Starting resource address is the original source node address initiating signal at first, and final goal address is the destination node address of signal, and current source address is the current current source Node address sending repeating signal; Current target address is the current current target node address that will receive repeating signal, and signal jumping figure is the number for recording through route.
6. the wireless automatic network-building method of a kind of 433M according to claim 5, it is characterized in that, described step S3 specifically comprises:
S301, starting resource node or current source Node are by Packet Generation to current target node, and wherein current target node is the father node of starting resource node or current source Node;
After S302, current target node receive packet, as new current source Node, judge that whether self is destination node, if not, enters step S33;
S303, new current source Node judge whether there is destination node in routing table child node, are if so, forwarded by packet and give destination node, if not, enter step S305; And
S305, new current source Node judge whether to there is father node, and if so, with the current target node that described father node is new, new current source Node returns and performs step S301, if not, and packet of automatically withering away.
7. the wireless automatic network-building system of 433M, it is characterized in that: each described system comprises a coordinator node, multiple routing node and multiple terminal node, arrange at least one routing node under described coordinator node to be connected with it, arrange at least one terminal node under each described routing node to be connected with it, described system carries out networking by the following method:
S1, setting node type and network identity, described node type comprises coordinator node, routing node, terminal node;
S2, open coordinator node and set up network according to network identity and node type, and generate and each node routing table one to one in network; And
S3, the data packet transmission adopting routing addressing algorithm to carry out in network between arbitrary node according to described routing table.
8. the wireless automatic network-building system of a kind of 433M according to claim 7, is characterized in that: the routing table of described terminal node comprises node ID, node type and reserves; The routing table of coordinator node and routing node comprises node ID, node type, routing iinformation and reserves, routing iinformation comprises father node ID, child node number, child list and reserves, child node list comprises the nodal information of each child node, and each nodal information comprises child node ID, node type, node state and whether has next stage node.
9. the wireless automatic network-building system of a kind of 433M according to claim 7, is characterized in that: also comprise after described step S2:
S4, network configuration step of updating, be specially:
S401, eachly there is the child node of father node to its father node timed sending status signal;
When S402, child node send status signal failure to father node, child node is searched according to signal strength signal intensity and is judged whether to there is the father node that can add, if, enter step S303, if not, enter step S304, wherein, this father node that can add is the non-self child node of described child node;
The father node added that S403, child node access signal is the strongest sends access request, and what can add adds in routing table entry by child node information; And
Type set is telegon by S404, child node, and the father node ID in routing iinformation is set to 0xFF.
10. the wireless automatic network-building system of a kind of 433M according to claim 7, is characterized in that: the data segment form of described packet comprises starting resource address, final goal address, current source address, current target address and signal jumping figure; Starting resource address is the original source node address initiating signal at first, and final goal address is the destination node address of signal, and current source address is the current current source Node address sending repeating signal; Current target address is the current current target node address that will receive repeating signal, and signal jumping figure is the number for recording through route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410805935.7A CN104469877A (en) | 2014-12-23 | 2014-12-23 | 433M wireless automatic networking method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410805935.7A CN104469877A (en) | 2014-12-23 | 2014-12-23 | 433M wireless automatic networking method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104469877A true CN104469877A (en) | 2015-03-25 |
Family
ID=52915065
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410805935.7A Pending CN104469877A (en) | 2014-12-23 | 2014-12-23 | 433M wireless automatic networking method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104469877A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106102123A (en) * | 2016-06-30 | 2016-11-09 | 深圳中盛智兴科技有限公司 | A kind of network-building method based on 433MHZRF network |
| CN106297221A (en) * | 2016-08-19 | 2017-01-04 | 广东司南物联股份有限公司 | A kind of agricultural irrigation security alarm mode based on technology of Internet of things |
| CN109068400A (en) * | 2018-08-21 | 2018-12-21 | 广州市保伦电子有限公司 | Wireless voting device group network system and method |
| CN110557185A (en) * | 2018-05-31 | 2019-12-10 | 成都鼎桥通信技术有限公司 | method and device for determining operation mode of relay equipment |
| CN110996266A (en) * | 2019-11-29 | 2020-04-10 | 北京展讯高科通信技术有限公司 | Multicast group data transmission method of ad hoc network system |
| CN111092631A (en) * | 2019-12-31 | 2020-05-01 | 成都麦杰康科技有限公司 | 433M communication system for realizing low power consumption |
| CN111556489A (en) * | 2020-04-30 | 2020-08-18 | 杭州涂鸦信息技术有限公司 | Communication address allocation method, device, equipment and medium based on Sub-G network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070290793A1 (en) * | 2006-06-12 | 2007-12-20 | Tran Bao Q | Mesh network door lock |
| CN101902772A (en) * | 2009-05-25 | 2010-12-01 | 北京时代凌宇科技有限公司 | Method and system for fusion of multi-source monitoring data based on heterogeneous clustering wireless sensor network |
| CN102006610A (en) * | 2010-12-24 | 2011-04-06 | 南京大学 | Dynamic adjustment method of nodes in Internet of Things system |
| CN102111912A (en) * | 2011-03-09 | 2011-06-29 | 南京瀚之显电子科技有限公司 | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network |
| CN102724733A (en) * | 2011-12-30 | 2012-10-10 | 北京时代凌宇科技有限公司 | Wireless sensor network networking method |
| CN104079461A (en) * | 2014-07-16 | 2014-10-01 | 上海诺诚电气有限公司 | 470M router with ZigBee communication function and communication method |
-
2014
- 2014-12-23 CN CN201410805935.7A patent/CN104469877A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070290793A1 (en) * | 2006-06-12 | 2007-12-20 | Tran Bao Q | Mesh network door lock |
| CN101902772A (en) * | 2009-05-25 | 2010-12-01 | 北京时代凌宇科技有限公司 | Method and system for fusion of multi-source monitoring data based on heterogeneous clustering wireless sensor network |
| CN102006610A (en) * | 2010-12-24 | 2011-04-06 | 南京大学 | Dynamic adjustment method of nodes in Internet of Things system |
| CN102111912A (en) * | 2011-03-09 | 2011-06-29 | 南京瀚之显电子科技有限公司 | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network |
| CN102724733A (en) * | 2011-12-30 | 2012-10-10 | 北京时代凌宇科技有限公司 | Wireless sensor network networking method |
| CN104079461A (en) * | 2014-07-16 | 2014-10-01 | 上海诺诚电气有限公司 | 470M router with ZigBee communication function and communication method |
Non-Patent Citations (2)
| Title |
|---|
| 周武斌等: "《Zigbee无线组网技术的研究》", 《信息科技辑》 * |
| 李快快等: ""一种433MHz无线传感器网络的设计与应用"", 《信息技术》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106102123A (en) * | 2016-06-30 | 2016-11-09 | 深圳中盛智兴科技有限公司 | A kind of network-building method based on 433MHZRF network |
| CN106102123B (en) * | 2016-06-30 | 2019-08-20 | 深圳中盛智兴科技有限公司 | A kind of network-building method based on 433MHZRF network |
| CN106297221A (en) * | 2016-08-19 | 2017-01-04 | 广东司南物联股份有限公司 | A kind of agricultural irrigation security alarm mode based on technology of Internet of things |
| CN110557185A (en) * | 2018-05-31 | 2019-12-10 | 成都鼎桥通信技术有限公司 | method and device for determining operation mode of relay equipment |
| CN110557185B (en) * | 2018-05-31 | 2022-08-19 | 成都鼎桥通信技术有限公司 | Method and device for determining operation mode of relay equipment |
| CN109068400A (en) * | 2018-08-21 | 2018-12-21 | 广州市保伦电子有限公司 | Wireless voting device group network system and method |
| CN109068400B (en) * | 2018-08-21 | 2022-10-11 | 广州市保伦电子有限公司 | Networking method of wireless voter |
| CN110996266B (en) * | 2019-11-29 | 2022-03-22 | 北京紫光展锐通信技术有限公司 | Multicast group data transmission method of ad hoc network system |
| CN110996266A (en) * | 2019-11-29 | 2020-04-10 | 北京展讯高科通信技术有限公司 | Multicast group data transmission method of ad hoc network system |
| CN111092631B (en) * | 2019-12-31 | 2021-10-19 | 成都麦杰康科技有限公司 | 433M communication system for realizing low power consumption |
| CN111092631A (en) * | 2019-12-31 | 2020-05-01 | 成都麦杰康科技有限公司 | 433M communication system for realizing low power consumption |
| CN111556489A (en) * | 2020-04-30 | 2020-08-18 | 杭州涂鸦信息技术有限公司 | Communication address allocation method, device, equipment and medium based on Sub-G network |
| CN111556489B (en) * | 2020-04-30 | 2022-07-19 | 杭州涂鸦信息技术有限公司 | Communication address allocation method, device, equipment and medium based on Sub-G network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104469877A (en) | 433M wireless automatic networking method and system | |
| CN103428031B (en) | A kind of inter-domain link fast failure recovery method based on software defined network | |
| JP4882555B2 (en) | Wireless bridge communication device | |
| CN101521895A (en) | Forwarding method used for constructing multi-hop routing in wireless self-organizing network | |
| CN102413542B (en) | Wireless mesh network routing method and wireless mesh network | |
| JP2014525718A (en) | Topology discovery in hybrid networks | |
| US20050157749A1 (en) | System and method for communication with an external network in an IPv6 MANET network | |
| CN109474970A (en) | A kind of method for routing suitable for cordless communication network | |
| CN110249634B (en) | Electricity meter comprising a power line interface and at least one radio frequency interface | |
| US10116511B2 (en) | Method and apparatus for controlling topology | |
| CN103108374A (en) | Energy saving routing algorithm of composite structure mine emergency rescue wireless mesh network | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN102428690B (en) | A method for assigning a network address for communicating in a segmented network | |
| JP6264856B2 (en) | Node device, control program, wireless communication system, and data communication method | |
| US20150055498A1 (en) | System for Message Acknowledgement and Data Collection in Wireless Mesh Networks | |
| US20140198770A1 (en) | Node device, communication method, and storage medium | |
| KR20090070883A (en) | Self-making and self-healing method of mesh network for communication node | |
| CN107786684B (en) | Simulation method of mobile ad hoc network address automatic allocation protocol in NS2 | |
| CN103781199A (en) | Networking method of micropower wireless communication network | |
| US20070258425A1 (en) | Method of assigning address in wireless personal area network | |
| CN105050148A (en) | Implementation method for routing of wireless sensor network | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN101626341B (en) | Method and device for synchronizing information under link-state protocol | |
| US20190007299A1 (en) | Network system, communication device, and communication method | |
| CN102595552B (en) | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |
Application publication date: 20150325 |
|
| RJ01 | Rejection of invention patent application after publication |