CN107566264A - A kind of means of communication based on tree network, node and communication system - Google Patents
A kind of means of communication based on tree network, node and communication system Download PDFInfo
- Publication number
- CN107566264A CN107566264A CN201710900067.4A CN201710900067A CN107566264A CN 107566264 A CN107566264 A CN 107566264A CN 201710900067 A CN201710900067 A CN 201710900067A CN 107566264 A CN107566264 A CN 107566264A
- Authority
- CN
- China
- Prior art keywords
- node
- bag
- net
- communication
- address
- 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of means of communication based on tree network, node and communication system, the means of communication include：S11. first node receives communication bag in the net that section point is sent；S12. first node judges whether to need to forward communication bag in net, if so, then performing step S13 according to sending direction, the node level of itself and the routing table that prestores；If it is not, then perform step S14, wherein, each child node of routing table including first node, the node address of sub- child node and each child node, sub- child node father node node address；S13. first node sets the forwarding mark of the header part of communication bag in net, and the node level of the section point in the header part of communication bag in net is revised as to the node level of itself, to generate communication bag in new net, and sends communication bag in new net；S14. first node abandons communication bag in net.Implement technical scheme, power consumption is relatively low, and cost is relatively low.
Description
Technical field
The present invention relates to field of data transmission, more particularly to a kind of means of communication based on tree network, node and communication
System.
Background technology
In Internet of Things, data transfer is a vital link in various data collecting systems, data transfer
Mode is gradually developed from wired to wireless mode, and relative to wire transmission mode, wireless transmission method has that integrated cost is low, property
Energy stabilization, networking flexibility, it is easy to the advantages such as extension, and the application limitation under complicated geographical environment can be broken through, therefore is easy to real
Existing and with high reliability wireless data transmission network occupies very important status in field of data transmission, its main body
Present two aspects of network-building method and its Data Transport Protocol.
At present, for wireless transmission method, typically by setting up special data transmission network and its communication protocol come real
It is existing, for example, MESH network, NBIoT networks.For MESH network, due to the communication between MESH network supporting node and node,
So each node needs possess the function of calculating route, therefore power consumption is larger, is not appropriate for the application of low-power consumption；For emerging
NBIoT networks, due to being to use Star Network between its node and base station, but in actual applications, it is possible to can various
Unfrequented local placement sensor, if this local operator is not provided with base station, so cannot meet that the place is saved
The data transfer demands of point.Moreover, NBIoT networks are dominated by operator, and for a user, in addition to lower deployment cost,
Also operation cost.
The content of the invention
The technical problem to be solved in the present invention is, for prior art above-mentioned power consumption it is high, cost is high the defects of, there is provided
A kind of means of communication based on tree network, node and communication system, it is low in energy consumption, cost is low.
The technical solution adopted for the present invention to solve the technical problems is：Construct a kind of communication side based on tree network
Method, including：
S11. first node receives communication bag in the net that section point is sent, and the header part of communication bag includes in the net
The node level of the section point, the node address of source/destination node, forwarding mark and sending direction, described sender to
For from source node to gateway or from gateway to destination node；
S12. first node is to, the node level of itself and the routing table that prestores, judgement according to described sender
It is no to need to forward communication bag in the net, if so, then performing step S13；If it is not, step S14 is then performed, wherein, the route
Each child node of table including the first node, the node address of sub- child node and each child node, sub- child node
The node address of father node；
S13. first node sets the forwarding mark of the header part of communication bag in the net, and by communication bag in the net
Header part in the node level of the section point be revised as the node level of itself, communicated with generating in new net
Bag, and send communication bag in the new net；
S14. first node abandons communication bag in the net.
Preferably, the step S12 includes：
S121. first node judges described sender to for from source node to gateway or for from gateway to destination node, if
From source node to gateway, then to perform step S122；If from gateway to destination node, then step S123 is performed；
S122. first node judges whether the node level of itself is higher than the node level of the section point, if so, then
Perform step S124；If it is not, then perform step S14；
S123. first node judges whether the node level of itself is less than the node level of the section point, if so, then
Perform step S124；If it is not, then perform step S14；
S124. first node is according to the routing table prestored, judge the source/destination node node address whether with
The node address of the child node of itself or sub- child node is consistent, if, it is determined that need to forward communication bag in the net, and perform
The step S13；If not, it is determined that communication bag in the net need not be forwarded, and perform the step S14.
Preferably, the header part of communication bag also includes bag sequence number in the net, moreover, after the step S13, also
Including：
S15. section point judges whether to receive communication bag in the new net of first node transmission, if so, then performing step
S16；If it is not, then perform step S17；
S16. then section point terminates using communication bag in the new net received as response bag is confirmed；
S17. section point sends communication bag in the net again；
If S18. bag sequence number of the first node in communication bag in the net judge in the net communication bag for it is non-first
Communication bag in the net of reception, then send and confirm response bag.
Preferably, the step S17 is：
Section point waits a delay time, and sends communication bag in the net again, when the delay time is presets
Between in the range of random value or the time value related to section point.
Preferably, the header part of communication bag also includes group mark in the net, and the routing table identifies including respective sets
Under the node address of multiple nodes and the node address of each father node, moreover, before the step S121, in addition to：
S120. first node identifies according to the group of the header part of communication bag in the net, judges the road itself stored
By table whether be described group of mark corresponding routing table, if so, then performing step S121；If it is not, then perform step S14.
Preferably, first node follows the steps below when networking first：
S21. communication bag in the first net that the 3rd node to have networked sends is received in an initial condition, wherein, described the
The node address of node level and fourth node of the header part of communication bag including the 3rd node in one net, the described 4th
Node is source/destination node of communication bag in the described first net；
S22. the node level of itself is determined according to the node level of the 3rd node, and according to the MAC Address of itself
Network the data division of application bag with the generation of itself node level, moreover, according to the node level of the 3rd node and the
The header part of the node address generation networking application bag of four nodes, and the application that networks is wrapped and sent to gateway；
S23. receive the networking approval packet from gateway that the 3rd node is sent, wherein, gateway receive it is described enter
After net application bag, the 3rd node is defined as the father node of first node by the routing table stored according to itself, described in acquisition
The node address of father node, the node level of the first node is recorded, and be the first node distribution node address, with life
Into networking approval packet, and the 3rd node is sent it to, so that the node of all forwarding networking approval packets is at itself
Routing table in record first node node address and its father node node address；
S24. judge whether the MAC Address in the networking approval packet is consistent with the MAC Address of itself, and when consistent,
The node address of the node address of itself, node level and father node is recorded according to the networking approval packet.
Preferably, first node follows the steps below in network re-entry：
S31. communication bag in the second net that the 5th node to have networked is sent is received, judges the node layer of the 5th node
Level whether two-stage at least higher than the node level of itself, if so, then performing step S22；Wherein, communication bag in second net
Header part includes the node level of the 5th node and the node address of the 6th node, and the 6th node is described second
Source/destination node of communication bag in net；
S32. the new node level of itself is determined according to the node level of the 5th node, and according to the MAC of itself
The data division of location, new node level and node address generation network re-entry application bag, moreover, the node according to the 5th node
The node address of level and the 6th node generate network re-entry application bag header part, and by the network re-entry application bag send to
Gateway so that all nodes for receiving the network re-entry application bag in the routing table of itself by first node and its child node and
Sub- child node is each configured to disarmed state；
S33. receive the network re-entry approval packet from gateway that the 5th node is sent, wherein, gateway receive it is described
After network re-entry application bag, the 5th node is defined as the new father node of first node by the routing table stored according to itself, obtains
The node address of the new father node is taken, and records the new node level of the first node, to generate network re-entry approval packet, and
The 5th node is sent it to, so that the node of all forwarding network re-entry approval packets records in the routing table of itself
The node address of the node address of first node and its new father node；
S34. judge whether the MAC Address in the network re-entry approval packet is consistent with the MAC Address of itself, and consistent
When, according to the network re-entry approval packet update itself node level and father node node address.
Preferably, first node follows the steps below in its child node failure：
S41. sending in the 3rd net after communication bag, judging whether to receive described the of the forwarding of its child node in preset time
Communication bag in three nets, if nothing, performs rapid S42；
S42. judge whether the transmission times of communication bag in the 3rd net is more than preset times, if nothing, perform S41；
If so, then perform step S43；
S43. send report barrier bag to gateway so that all nodes for receiving the report barrier bag in the routing table of itself by the
The child node of one node and sub- child node are each configured to disarmed state, wherein, the report barrier bag includes：The node layer of first node
The node address of level, node address and the child node.
The present invention also constructs a kind of node, including memory and processor, and computer program is stored with the memory,
Characterized in that, the processor is used to perform the computer program stored in the memory and realizes above-described side
Method.
The present invention also constructs a kind of communication system based on tree network, it is characterised in that including multiple above-described
Node, moreover, the node is via node or ordinary node.
Implement technical scheme, due to being previously stored with routing table in gateway and via node, when a certain section
Point (such as first node) is received in net after communication bag, by analyzing the header part of communication bag in the net, and is tied
Close the routing table of itself, it may be determined whether need to forward communication bag in the net, only when needing to forward communication bag in the net
Forwarded, rather than each receive the node of communication bag in the net and forwarded.Passed relative to the data in MESH network
Defeated mode, because node need not have calculates the function of route, so the power consumption of node is relatively low；Relative in NBIoT networks
Data transfer mode, due to by arranging that via node ensures that being completely covered for wireless signal, it is not necessary to rely on operator
The base station of arrangement, so, cost is relatively low.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.In accompanying drawing：
Fig. 1 is the flow chart of the means of communication embodiment one of the invention based on tree network；
Fig. 2 is the flow chart of step S12 embodiments one in Fig. 1；
Fig. 3 is the topology diagram of communication system embodiment one of the present invention；
Fig. 4 is the flow chart of the means of communication embodiment two of the invention based on tree network；
Fig. 5 is the flow chart of the means of communication embodiment three of the invention based on tree network.
Embodiment
Illustrate first, the present invention devises one kind for low rate, low data bulk, low-power consumption and has one to delay
The communications protocol of fixed tolerance, this agreement are based on tree network and realized, and including three kind equipments：First, gateway, it is corresponding
Tree root；2nd, via node, corresponding branch/trunk；3rd, ordinary node, corresponding leaf.Wherein, gateway is used to converge all sections
Point, and access Internet.The difference of via node and ordinary node is：For via node by mains-supplied, it can be correspondingly multiple
The child node of subordinate and sub- child node, and its superior node only one, are referred to as father node；Ordinary node is located at the most side of network
Edge, it only has father node, without child node, does not do operation of relays to communication bag in the net of other nodes, therefore can be by battery
Power supply, belongs to low power consuming devices.Ordinary node is waken up or timing wake-up usually all in resting state by Sensor Events,
It has three RF time window after waking up：1. whether occupied, (having node to give out a contract for a project) if detecting RF channels；2. send
Data；Confirm 3. receiving.After time window reaches, continue dormancy.
In addition, in order to reach energy-conservation, easy working requirement, leaf nodes (low power consumption node) can be largely used, and use
The branch node guarantee network coverage.
Fig. 1 is the flow chart of the means of communication embodiment one of the invention based on tree network, in this embodiment, is said first
Communication bright, that what this communications protocol was supported is ordinary node between gateway (node to gateway, or gateway is to node), and
Operation of relays is carried out by the via node between ordinary node and gateway.Do not communicated two-by-two between supporting node.Moreover,
Gateway in fact also be node online intermediary, the data and its service logic that node (such as sensor) collects only with
Corresponding backstage on Internet is related.In addition, it should be noted that, communication bag is divided by type in net can be divided into application layer
APP bags and the privately owned bag of networking, regardless of bag, it can be all transmitted using the method for the embodiment.
In this embodiment, by taking first node and section point as an example, first node, section point can be gateway, relaying
Node or ordinary node, moreover, first node, in the broadcasting area of section point, correspondingly, section point is also in first segment
In the broadcasting area of point.When section point sends communication bag in net, first node can receive communication bag in the net, the reality
The means of communication for applying example specifically include following steps：
S11. first node receives communication bag in the net that section point is sent, and the header part of communication bag includes in the net
The node level of the section point, the node address of source/destination node, forwarding mark and sending direction, described sender to
For from source node to gateway or from gateway to destination node；
In this step, sending direction is the direction determined based on gateway, and sending direction has two kinds of situations：Sent out from gateway
Go out, be sent to gateway.When forwarding mark (Forward) field is significance bit, for example, 1, then it represents that communication bag is second in the net
Node forwarding, rather than caused by section point, i.e. section point is via node, conversely, then it represents that communication bag is in the net
Caused by section point, i.e. section point is ordinary node.
S12. first node is to, the node level of itself and the routing table that prestores, judgement according to described sender
It is no to need to forward communication bag in the net, if so, then performing step S13；If it is not, step S14 is then performed, wherein, the route
Each child node of table including the first node, the node address of sub- child node and each child node, sub- child node
The node address of father node；
S13. first node sets the forwarding mark of the header part of communication bag in the net, and by communication bag in the net
Header part in the node level of the section point be revised as the node level of itself, communicated with generating in new net
Bag, and send communication bag in the new net；
In this step, it should be noted that, when it is determined that needing to forward communication bag in net, can only change in header part
Node level and setting forwarding mark, i.e. node level is revised as to the level of itself, forwarding mark is arranged to effective, and
The node address and data division of header part will not be changed.
S14. first node abandons communication bag in the net.
In this embodiment, due to being previously stored with routing table in gateway and via node, when a certain node (such as
One node) receive in net after communication bag, by analyzing the header part of communication bag in the net, and combine the road of itself
By table, to determine the need for forwarding communication bag in the net, only just forwarded when needing to forward communication bag in the net, and
It is not that each node for receiving communication bag in net is forwarded.Relative to the data transfer mode in MESH network, due to section
Point need not have calculates the function of route, so the power consumption of node is relatively low；Relative to the data transfer mode in NBIoT networks,
Due to by arranging that via node ensures that being completely covered for wireless signal, it is not necessary to rely on the base station of operator's arrangement, institute
So that cost is relatively low..
Fig. 2 is the flow chart of step S12 embodiments one in Fig. 1, and the step S12 of the embodiment specifically includes following steps：
S121. first node judges described sender to for from source node to gateway or for from gateway to destination node, if
From source node to gateway, then to perform step S122；If from gateway to destination node, then step S123 is performed；
S122. first node judges whether the node level of itself is higher than the node level of the section point, if so, then
Perform step S124；If it is not, then perform step S14；
In this step, on node level, it should be noted that, the value of settable node level is smaller, corresponding node
The higher grade of level, for example, the node level of gateway is 0, the node level of subordinate's child node of gateway is 1, is analogized with secondary.
S123. first node judges whether the node level of itself is less than the node level of the section point, if so, then
Perform step S124；If it is not, then perform step S14；
S124. first node is according to the routing table prestored, judge the source/destination node node address whether with
The node address of the child node of itself or sub- child node is consistent, if, it is determined that need to forward communication bag in the net, and perform
The step S13；If not, it is determined that communication bag in the net need not be forwarded, and perform the step S14.
In this step, node combines the routing table of itself, and only whether communication bag is intended for the son of oneself in the net
Node or sub- child node, or, communication bag is the child node from oneself or sub- child node in the net, just can determine whether to need
Forwarding, can so ensure that only having exclusive node in each layer is forwarded.
Further, because the RF modules used between node (gateway falls within special node) are approximately the same, so,
Since first node can receive communication bag in the net of section point transmission, then obvious section point can also receive first node
Communication bag in the new net sent, therefore, section point, to make full use of bandwidth, improve data as response bag is confirmed
Transmission efficiency.Specifically, the header part of communication bag also includes bag sequence number in net, moreover, the step S13 of above-described embodiment it
Afterwards, it is further comprising the steps of：
S15. section point judges whether to receive communication bag in the new net of first node transmission, if so, then performing step
S16；If it is not, then perform step S17；
In this step, it should be noted that, although what first node sent is communication bag in new net, in the new net
Communication bag is only that the node level in header part is different compared with communication bag in the net that section point is sent, forwarding mark
Note may also be different, and both data divisions are identical, moreover, bag sequence number is also identical, so can be determined according to bag sequence number
Both are actually communication bag in same net.
S16. then section point terminates using communication bag in the new net received as response bag is confirmed；
S17. section point sends communication bag in the net again, it is preferable that and section point waits a delay time, and again
It is secondary to send communication bag in the net, when the delay time is random value in preset time range or is related to section point
Between be worth, for example, can according to conflict the back off algorithm computation delay time；
If S18. bag sequence number of the first node in communication bag in the net judge in the net communication bag for it is non-first
Communication bag in the net of reception, then send and confirm response bag.
In this embodiment, the confirmation response bag to previous stage node is used as directly using communication bag in the net of transmission, i.e.
The response to node of giving out a contract for a project is realized while message transmissions, so as to realize efficient transmission response hand in hand.Certainly, for hair
Packet node (section point), if it does not receive communication bag in the net of first node forwarding, it can again send in the net and communicate
Wrap, the bag sequence number of communication bag is identical with the bag sequence number of communication bag in the net of previous transmission in the net, now, if first node receives
Communication bag in the net retransmitted, then can send confirmation response bag.
In a preferred embodiment, if nodes number is excessive, multiple gateways can be laid again, set up multiple nets
Network, node is shunted, different gateways generally can physically use different RF channels.Specifically, communication bag in net
Header part also includes group mark, and for a certain specific node, its is only possible to be present in a network, so, it route
Table includes the node address of the father node of multiple child nodes, the node address of sub- child node and each node under respective sets mark,
Moreover, before step S121, in addition to：
S120. first node identifies according to the group of the header part of communication bag in the net, judges the road itself stored
By table whether be described group of mark corresponding routing table, if so, then performing step S121；If it is not, then perform step S14.
Illustrate the process of data communication of the present invention with a specific example below：
First explanation net in communication bag form, one net in communication bag include header part (Header fields) and data
Partly (Data fields).
The form of Header fields is as follows：
GroupID+LevelID+NodeAddr+Flag+PacketNum
Wherein, GroupID for group identify, for identifying different networks, be typically different ID network can use it is different
RF channels, its effect are shunted when node lays intensive；LevelID is node level, and the smaller level of numeral is higher, gateway
Level be 0, for represent net in communication bag want it is a few jump get to gateway, the level that can directly receive the node of gateway bag is
1；NodeAddr is node address, is distributed by gateway, and the node address of gateway oneself is always 0；PacketNum is Bao Xu
Number, add 1 every time, counted from zero again after spilling, its bag sequence number of the bag of repeating transmission keeps constant；Flag is marker bit, and is had
Body includes：
1.Forward marks for forwarding, shows that this bag is forwarding during Forward=1, shows this during Forward=0
Individual bag is non-forwarded；
2.To/From is the sending direction of bag, and based on gateway, To=0 (From=1) is represented and sent by gateway, To=1
(From=0) represent and be sent to gateway；
3.Private/App is used to distinguish the bag used inside MANET or the bag of application layer.
By taking the topological structure of the communication system shown in Fig. 3 as an example, in the communication system, gateway G1 can directly receive node
N1, N2 bag；Node N1 can directly receive gateway G1, node N3, N4 bag；Node N2 can directly receive gateway G1, node N4
Bag；Node N3 can directly receive node N1, N4 bag；Node N4 can directly receive node N1, N2, N3 bag.
On routeing tableau format, it should be noted that, it includes the address of all child nodes of the node and sub- child node, and
The table of the parent node address of each child node and sub- child node.If gateway G1, node N1, node N2, node N3, node N4 section
Dot address is followed successively by 0,1,2,3,4 respectively, then the route tableau format in the gateway with reference to shown in following table, and first row is net in table
All child nodes, the linear array of the node address of sub- child node closed, second row are then corresponding to the node difference in first row
Father node node address.Clearly for some node in first row, as long as being corresponding with father node in second row, then
Node in one row must be the downstream site or lower-level node of the node in second row.When transmitting data, as long as hair
Toward or the bag from first row node, corresponding father node just has to forward the bag in second row, on the contrary, not forwarding then.
| 0 | 1 | 2 | 3 | 4 |
| 0 | 0 | 1 | 2 |
If node N3, which produces one, to be needed to be sent to gateway G1 APP bags, now, in the header part of the bag, LevelID=
2, GroupID=1, NodeAddr=3, forward flag F=0, sending direction mark T=1, Packet type mark P=0.Work as node
After N3 sends the bag, because node N1, N4 are in its broadcasting area, so, node N1, N4 can receive the bag.
For node N1, after the bag is received, then first acknowledged checks LevelId=to be sent to gateway for it
2, it is bigger by 1 than the node level of oneself, identify it is the next stage node of oneself, then by checking that oneself routing table is found
NodeAddr=3 wherein, so determine need to forward the bag.Now, change node level therein and forwarding marks, and turn
The bag is sent out, moreover, in header part after the modification, LevelID=1, GroupID=1, NodeAddr=3, forwards flag F
=1, sending direction T=1, Packet type mark P=0.
For node N4, after the bag is received, then first acknowledged checks LevelId to be sent to gateway for it
=2, it is found that node level is identical with oneself, it is clear that node N3 is not the downstream site of oneself.Now, the bag is abandoned not handle
.
In addition, after node N1 forwards the bag, node N3 can also receive the bag of node N1 forwardings, confirm that the bag is sent with this
Success, equivalent to confirmation response bag.If node N3 is confiscated in a time window, delay is calculated with the back off algorithm that conflicts, and
Retransmit the bag.In addition, gateway G1 can also receive the bag of node N1 forwardings, then first acknowledged checks to be sent to gateway
LevelId=1, it is bigger by 1 than the node level of oneself, identify it is the next stage node of oneself, then route by checking oneself
Table find NodeAddr=3 wherein, so, LevelID can be set to 0, send this bag again, as to node N1 really
Recognize.
On routing table, it should be noted that, it is stored in advance in each via node and gateway, can be by a variety of
Mode configures the routing table in via node and gateway, it is preferable that a set of dynamic routing machine can be established by way of MANET
System, and can optimize automatically, so as to store corresponding routing table in node and gateway.
If newly adding a sensor node, for example, first node in communication system, now, the first node is initial
State, i.e. do not obtain the node address of gateway distribution, do not determine node level and father node, moreover, also not writing its higher level section
In the routing table of point.Therefore, it is necessary first to which the first node is networked.When networking, as long as first node can receive
Communication bag in an arbitrary net, by taking communication bag in the first net as an example, so that it may judge nearby there is specific data transmission network to deposit
, and then can initiate to add the application of the data transmission network.Specifically, with reference to Fig. 4, when networking first, first segment clicks through
Row following steps：
S21. communication bag in the first net that the 3rd node to have networked sends is received in an initial condition, wherein, described the
The node address of node level and fourth node of the header part of communication bag including the 3rd node in one net, the described 4th
Node is source/destination node of communication bag in the described first net；
In this step, communication bag is that fourth node is sent in the first net that first node receives, during the 3rd node is
After the intermediate node of communication bag in first net, moreover, the header part of communication bag includes fourth node (source/mesh in the first net
Mark node) node address and the 3rd node node level.In addition it should be noted that, under the original state of communication system,
An only gateway device, also without any node network, now, the 3rd node and fourth node are gateway, i.e. gateway to
Own broadcast first nets interior communication bag.
S22. the node level of itself is determined according to the node level of the 3rd node, and according to the MAC Address of itself
Network the data division of application bag with the generation of itself node level, moreover, according to the node level of the 3rd node and the
The header part of the node address generation networking application bag of four nodes, and the application that networks is wrapped and sent to gateway；
In this step, because first node can receive the networking application bag of the 3rd node transmission, and the 3rd node is
Network, its node level it has been determined that so, the node level of itself can be determined according to the level of the 3rd node, for example, the
The level of three nodes is 2, and the node level of the first node is 3, less than one grade of the 3rd node.In addition, work as first node
After itself level is determined, identified node level and the MAC Address of itself can be inserted to networking application bag, then sent out
Deliver to gateway.Herein it should be noted that, due to now first node also unassigned nodes address, so can not be with the body of oneself
Part send out the networking application bag, the node address of fourth node and the level of the 3rd node can only be borrowed in header part to send
The networking application bag.Specifically, the header part of the networking application bag includes node address, the section of the 3rd node of fourth node
Point level, the data division of the networking application bag include the node level of first node, MAC Address, the node for particular value
Location (representing to be allocated) etc..
S23. receive the networking approval packet from gateway that the 3rd node is sent, wherein, gateway receive it is described enter
After net application bag, the 3rd node is defined as the father node of first node by the routing table stored according to itself, described in acquisition
The node address of father node, the node level of the first node is recorded, and be the first node distribution node address, with life
Into networking approval packet, and the 3rd node is sent it to, so that the node of all forwarding networking approval packets is at itself
Routing table in record first node node address and its father node node address；
In this step, gateway is after the application bag that networks is received, the node of the fourth node in its header part
The node level field of first node in address field and data division, in conjunction with the routing table of itself, from fourth node
The higher leveled node of node level than first node is found in route watch chain, i.e. is found the 3rd node, and will be found
Node is defined as the father node of first node, using the address of node as parent node address.Meanwhile also record networking application is wrapped
Header part in first node node level, be first node distribution node address, then generate networking approval packet,
That is, the node of the node address of the data division of networking approval packet including first node, node level, MAC Address, father node
Location.
Further, since now first node does not get the node address of itself also, so, gateway can only be sent it to
The father node of first node, i.e. the 3rd node, so, the header part of networking approval packet includes the node address of the 3rd node.
Preferably, during sending to the 3rd node, middle node judges first node after the networking approval packet is received
The node address of father node whether with the node address of itself or the node address of the child node of itself or the sub- child node of itself
Node address it is consistent, i.e. check whether the networking approval packet is intended for oneself or oneself child node or sub- child node, if
Unanimously, then the node address of first node and its node address of father node are recorded in the routing table of itself, i.e. addition " the
The routing iinformation of one node-father node ", and forward the networking approval packet；If it is not, do not add above-mentioned routing iinformation then, and
The networking approval packet is not forwarded.
Finally it should be noted that, the networking approval packet reach the 3rd node after, because the 3rd node can also forward this
Networking approval packet, using as the confirmation to even higher level of node, so, first node can also receive the networking approval packet.
S24. judge whether the MAC Address in the networking approval packet is consistent with the MAC Address of itself, and when consistent,
The node address of the node address of itself, node level and father node is recorded according to the networking approval packet.
In this step, first node is after networking approval packet is received, if judge MAC Address in networking approval packet with from
The MAC Address of body is consistent, then record itself node address, node level and its father node node address (the 3rd node
Address).
In this embodiment, the node each newly added can be networked by above-mentioned ad hoc network method, determine itself
Node level, obtain the node address that is distributed of gateway.Moreover, middle node is ratified by analyzing the networking that gateway is sent
Wrap to establish the linear routing table of itself, for managing its subordinate's child node and sub- child node, each node is being received message
The message of its child node or sub- child node is only forwarded afterwards, it is achieved thereby that automatic network-building.
Found in message transmission procedure, node when forwarding bag, if its level is lower, get over by the hop count of the bag
More, package efficiency is lower, so, for node, it is always desirable to which its level is the higher the better.In this case, if node
The bag of the top-ranking's node of oneself can be received, then its can active request network again, change level and routing relation.It is not difficult to manage
Solution, because node is in an initial condition, as long as one detects that bag will network as early as possible, if the follow-up section for detecting more high-level again
The bag of point hair, the then request that is bound to reset level and routing relation.It will be described in detail below and how to carry out network re-entry and come pair
The routing table established carries out Automatic Optimal.
With reference to Fig. 5, by taking first node as an example, the first node follows the steps below in network re-entry：
S31. communication bag in the second net that the 5th node to have networked is sent is received, judges the node layer of the 5th node
Level whether two-stage at least higher than the node level of itself, if so, then performing step S22；Wherein, communication bag in second net
Header part includes the node level of the 5th node and the node address of the 6th node, and the 6th node is described second
Source/destination node of communication bag in net；
In this step, communication bag is that the 5th node is sent in the second net that first node receives, during the 5th node is
After the intermediate node of communication bag in second net, moreover, the header part of communication bag includes the 6th node (source/mesh in the second net
Mark node) node address and the 5th node node level.
In addition, it should be noted that, the request of network re-entry can occur in the regular maintenance of network, in regular maintenance, net
The via node that most edge is selected in pass from routing table carries out detection of giving out a contract for a project, and the bag sent out is network re-entry application bag, only needs less
Bag just in detectable network all via nodes state.In another example, network re-entry request occurs to pass in packet
During defeated.So the network re-entry application bag that either gateway is sent, or packet, as long as first node is received on new
Communication bag in the second net that level node is sent, and judge the node level two-stage at least higher than the node level of itself of the 5th node
(that is, the level than current father node is high), then judge to need network re-entry, moreover, being determined according to the node level of the 5th node
The new node level of itself.
S32. the new node level of itself is determined according to the node level of the 5th node, and according to the MAC of itself
The data division of location, new node level and node address generation network re-entry application bag, moreover, the node according to the 5th node
The node address of level and the 6th node generate network re-entry application bag header part, and by the network re-entry application bag send to
Gateway so that all nodes for receiving the network re-entry application bag in the routing table of itself by first node and its child node and
Sub- child node is each configured to disarmed state；
In this step, it is preferable that in transmitting procedure, middle node exists the network re-entry application bag that first node is sent
After receiving the network re-entry application bag, judge first node node address whether with the node address of the child node of itself or itself
Sub- child node node address it is consistent, if unanimously, by first node and its child node and son in the routing table of itself
Node is each configured to disarmed state.
S33. receive the network re-entry approval packet from gateway that the 5th node is sent, wherein, gateway receive it is described
After network re-entry application bag, the 5th node is defined as the new father node of first node by the routing table stored according to itself, obtains
The node address of the new father node is taken, and records the new node level of the first node, to generate network re-entry approval packet, and
The 5th node is sent it to, so that the node of all forwarding network re-entry approval packets records in the routing table of itself
The node address of the node address of first node and its new father node；
In this step, it is preferable that for network re-entry approval packet in transmitting procedure, middle node is receiving the network re-entry batch
After quasi- bag, judge first node new father node node address whether with itself node address or the section of the child node of itself
The node address of dot address or the sub- child node of itself is consistent, if unanimously, first node is recorded in the routing table of itself
The node address of node address and its new father node, and forward the network re-entry approval packet.
S34. judge whether the MAC Address in the network re-entry approval packet is consistent with the MAC Address of itself, and consistent
When, according to the network re-entry approval packet update itself node level and father node node address.
In this embodiment, it should be noted that, the process of network re-entry is similar with the process to network first, it is different only
It is：When networking first, node address that first node is also not previously allocated, it be after a father node is found, it is determined that from
Oneself node level, and the header packet information of communication bag sends networking application bag in the net to be received.And in network re-entry, obtain
Get the node address that gateway is distributed.
It has also been found that, some nodes can break down, if without timely processing, it will cause to lead in message transmission procedure
News are interrupted.In this case, if finding via node failure, superior node can send report barrier bag and be reported to gateway, so,
In the transmitting procedure of report barrier bag, all nodes for receiving report barrier bag save failure node and its son in the routing table of itself
Point is each configured to disarmed state.It will be described in detail below and how to carry out report barrier to carry out Automatic Optimal to the routing table established,
By taking the child node failure of first node as an example, the first node follows the steps below in its child node failure：
S41. sending in the 3rd net after communication bag, judging whether to receive described the of the forwarding of its child node in preset time
Communication bag in three nets, if nothing, performs rapid S42；
S42. judge whether the transmission times of communication bag in the 3rd net is more than preset times, if nothing, perform S41；
If so, then perform step S43；
In this step, it is preferable that if judge to need to retransmit message, first wait a delay time, and perform step again
Rapid S41, such as by the back off algorithm computation delay time that conflicts, the delay time be random value in preset time range or with
The related time value of first node.
S43. send report barrier bag to gateway so that all nodes for receiving the report barrier bag in the routing table of itself by the
The child node of one node and sub- child node are each configured to disarmed state, wherein, the report barrier bag includes：The node layer of first node
The node address of level, node address and the child node.
In this embodiment, unsuccessfully it can detect whether it fails by retransmitting for a certain node, its superior node, if
It has been failed that, then its superior node can generate report barrier bag, and be reported to gateway, and so, all nodes for receiving report barrier bag can
According to the content modification routing iinformation of report barrier bag.
Further, the downstream site of failure node detects that it has failed also by retransmitting unsuccessfully, now, the subordinate
Node then returns init state, networks again.Specifically, first node follows the steps below in his father's node failure：
S51. sending in the 4th net after communication bag, judging whether to receive described the of the forwarding of its father node in preset time
Communication bag in four nets, if nothing, perform step S52；
S52. judge whether the transmission times of communication bag in the 4th net is more than preset times, if nothing, perform S51；
If so, then perform step S53；
In this step, it is preferable that if judge to need to retransmit message, first wait a delay time, and perform step again
Rapid S51, such as by the back off algorithm computation delay time that conflicts, the delay time be random value in preset time range or with
The related time value of first node.
S53. original state is returned to.
Above example illustrates the process that node is networked, and the process need not be participated in manually, can be achieved automatic group
Net.Further, since node always pursues the rise of its node level, the forwarding so wrapped is minimum, efficiency highest.Certainly, the mistake
Journey be may also occur in different networks, if a communication system has multiple networks, the corresponding gateway of each network, node is being examined
After measuring new gateway, it can judge whether to add new network according to the node level of itself.
Illustrate the process of MANET with reference to the topological structure of the communication system shown in Fig. 3：
First, the form on Data fields, it should be noted that, due to the bag (Private bags) used inside MANET
There are three types：JOIN bags (being used to node application network, gateway approval node networks), REPO bags (are used to node report hinder, explanation
Downstream site fail), ACKN bags (response to retransmitted packet, be exactly the Header words of retransmitted packet in fact without forwarding again
Section).So only illustrate the Data field portions in three kinds of Private bags below.
The Data field formats of JOIN bags are：
Type (JOIN)+node level+node address+superior node address+node MAC addr+powered types
The Data field formats of REPO bags are：
Type (REPO)+node level+node address+downstream site address+node MAC addr+powered types
The Data field formats of ACKN bags are：
Type(ACKN)+(GroupID+LevelID+NodeAddr+Flag+PacketNum)
With reference to Fig. 3, the communication system only has an equipment, i.e. gateway G1 in original state in system.With node
Add, proceed by MANET.First, gateway G1 sends out JOIN bags to oneself, and now, node N1, N2 can receive the JOIN bags,
A random time is selected by conflict back off algorithm, sends the JOIN bags of oneself, in the header part of JOIN bags, node N1 (or
N2 node address) is because also unallocated, so filling out the address of father node, i.e., the address 0 of gateway, node level are also father node
Level.In the data division of JOIN bags, node N1 (or N2) node address is unallocated, fills out particular value (being, for example, 0), the spy
Different value represents to be allocated, further, since node N1 (or N2) can receive gateway G1 bag, so can determine that node level is 1, and
Node level and MAC Address are inserted in JOIN bags.Specially：
Data fields：Type=JOIN+ nodes level=1+ node address=0+ superior nodes address=0+ node Ms AC
Location+powered types
Header fields：LevelID=0+GroupID=1+NodeAddr=0+Flag (T)+PacketNum
Gateway G1 records MAC Address, is node N1 (or N2) distribution nodes address after the JOIN bags are received, and
The address for node distribution to be inserted in JOIN bags, retransmits this JOIN bag, destination is superior node address, i.e. gateway oneself,
Sending direction marker bit T=0, i.e. the JOIN bags are sent by gateway G1, for networking approval packet.
After node N1 (or N2) receives the JOIN bags that gateway issues gateway, determine it is that approval enters oneself according to MAC Address
The JOIN bags of net, just record level therein and node address.So, node N1 (or N2) is just completed networks first.
After node N1 (or N2) networks, the fringe node for network is become, gateway regularly can send out JOIN bags to them, with
Safeguard network.After node N1 (or N2) receives the JOIN bags, the JOIN bags can be issued oneself again again, using as to gateway
ACK bags, now, node N3 (or N4) can receive the JOIN bags for issuing N1 (assuming that first receiving the bag for issuing N1), Ran Houfa
The JOIN bags of oneself are given, wherein, the node address of Data fields fills out particular value 0, further, since node level=1 can be received
Bag, so node level fills out 2, i.e. Data fields are：
Type=JOIN+ nodes level=2+ node address=0+ superior nodes address=1+ node MAC addrs+power supply class
Type
And Header fields are：
LevelID=1+GroupID=1+NodeAddr=1+Flag (T=1)+PacketNum
After node N1 receives the JOIN bags, superior node address=1 is found, is exactly oneself, then modification bag Header
In level and marker bit, i.e. LevelID=1, Flag (F=1, T=1, P=0), then retransmit this bag.
After gateway G1 receives the JOIN, record MAC, distribution node address, and in JOIN bags with inserting distributed node
Location, retransmits this JOIN bag, and destination is exactly superior node address, i.e. node N1 address, changes marker bit T=0, then
It is sent to node N1.The Header fields of the JOIN bags are：
LevelID=0+GroupID=1+NodeAddr=1+Flag (T=0)+PacketNum
After node N1 receives the JOIN bags, purpose node addresses and the node address one of oneself in Header are found
Cause, and be the JOIN bags that gateway is sent, then record routing iinformation therein, level=1 in Header is wrapped in modification, again
This bag is sent, as the confirmation bag to gateway G1, while also notifies that node N3 is its allocated node address.
In addition, retransmitted packets of the node N1 without waiting node N3, because destination originally node N1 node address, this
Secondary transmission has terminated.Moreover, node N3 will not also retransmit this bag, when because this bag originally issues N1, second,
If because unsuccessful, i.e., the JOIN bags of node N1 hairs are not received, node N3 applies once networking again.
In addition, when transmitting JOIN bags, as long as the node address of destination and is by gateway in the routing table of oneself
Information in JOIN bags will be added in the routing table of oneself by the JOIN bags that G1 is sent, node, it is also possible to delete certain
Route.
Finally, the present invention also constructs a kind of node, and it includes memory and processor, and computer is stored with memory
Program, processor are used to perform the computer program stored in memory and the method for realizing above example.
The present invention also constructs a kind of communication system based on tree network, including multiple above-described nodes, moreover, institute
It is via node or ordinary node to state node.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.Within the spirit and principles of the invention, any bun made
Change, equivalent substitution, improvement etc., should be included within scope of the presently claimed invention.
Claims (10)
- A kind of 1. means of communication based on tree network, it is characterised in that including：S11. first node receives communication bag in the net that section point is sent, and the header part of communication bag includes described in the net The node level of section point, the node address of source/destination node, forwarding mark and sending direction, described sender to for from Source node is to gateway or from gateway to destination node；S12. first node judges whether to need according to described sender to, the node level of itself and the routing table that prestores Communication bag in the net is forwarded, if so, then performing step S13；If it is not, step S14 is then performed, wherein, the routing table bag Include father's section of each child node of the first node, the node address of sub- child node and each child node, sub- child node The node address of point；S13. first node sets the forwarding mark of the header part of communication bag in the net, and the bag by communication bag in the net The node level of the section point in head point is revised as the node level of itself, to generate communication bag in new net, and Send communication bag in the new net；S14. first node abandons communication bag in the net.
- 2. the means of communication according to claim 1 based on tree network, it is characterised in that the step S12 includes：S121. first node judges described sender to for from source node to gateway or for from gateway to destination node, if from Source node then performs step S122 to gateway；If from gateway to destination node, then step S123 is performed；S122. first node judges whether the node level of itself is higher than the node level of the section point, if so, then performing Step S124；If it is not, then perform step S14；S123. first node judges whether the node level of itself is less than the node level of the section point, if so, then performing Step S124；If it is not, then perform step S14；S124. first node is according to the routing table prestored, judge the source/destination node node address whether with itself Child node or sub- child node node address it is consistent, if, it is determined that need to forward communication bag in the net, and described in performing Step S13；If not, it is determined that communication bag in the net need not be forwarded, and perform the step S14.
- 3. the means of communication according to claim 1 based on tree network, it is characterised in that the bag of communication bag in the net Head point also includes bag sequence number, moreover, after the step S13, in addition to：S15. section point judges whether to receive communication bag in the new net of first node transmission, if so, then performing step S16； If it is not, then perform step S17；S16. then section point terminates using communication bag in the new net received as response bag is confirmed；S17. section point sends communication bag in the net again；S18. if bag sequence number of the first node in communication bag in the net judges that communication bag receives first to be non-in the net Net in communication bag, then send confirm response bag.
- 4. the means of communication according to claim 3 based on tree network, it is characterised in that the step S17 is：Section point waits a delay time, and sends communication bag in the net again, and the delay time is preset time model Random value or the time value related to section point in enclosing.
- 5. the means of communication according to claim 2 based on tree network, it is characterised in that the bag of communication bag in the net Head point also includes group mark, node address and each father node of the routing table including multiple nodes under respective sets mark Node address, moreover, before the step S121, in addition to：S120. first node identifies according to the group of the header part of communication bag in the net, judges the routing table itself stored Whether be described group of mark corresponding routing table, if so, then performing step S121；If it is not, then perform step S14.
- 6. according to the means of communication based on tree network described in claim any one of 1-5, it is characterised in that first node exists When networking first, follow the steps below：S21. communication bag in the first net that the 3rd node to have networked is sent is received in an initial condition, wherein, first net The header part of interior communication bag includes the node level of the 3rd node and the node address of fourth node, the fourth node For source/destination node of communication bag in the described first net；S22. the node level of itself is determined according to the node level of the 3rd node, and according to the MAC Address of itself and oneself The node level generation of body, which networks, applies for the data division of bag, moreover, according to the node level of the 3rd node and Section four The header part of the node address generation networking application bag of point, and the application that networks is wrapped and sent to gateway；S23. the networking approval packet from gateway that the 3rd node is sent is received, wherein, gateway is receiving the networking Shen After please wrapping, the 3rd node is defined as the father node of first node by the routing table stored according to itself, obtains father's section The node address of point, records the node level of the first node, and be the first node distribution node address, with generate into Net approval packet, and the 3rd node is sent it to, so that the node of all forwarding networking approval packets is on the road of itself By recording the node address of first node and its node address of father node in table；S24. judge whether the MAC Address in the networking approval packet is consistent with the MAC Address of itself, and when consistent, according to The networking approval packet records the node address of the node address of itself, node level and father node.
- 7. the means of communication according to claim 6 based on tree network, it is characterised in that first node is in network re-entry When, follow the steps below：S31. communication bag in the second net that the 5th node to have networked is sent is received, judging the node level of the 5th node is No two-stage at least higher than the node level of itself, if so, then performing step S22；Wherein, it is described second net in communication bag packet header Part includes the node level of the 5th node and the node address of the 6th node, and the 6th node is in the described second net Source/destination node of communication bag；S32. the new node level of itself is determined according to the node level of the 5th node, and according to the MAC Address of itself, new The data division of node level and node address generation network re-entry application bag, moreover, the node level according to the 5th node And the 6th node node address generation network re-entry application bag header part, and the network re-entry application bag is sent to net Close so that all nodes for receiving the network re-entry application bag in the routing table of itself by first node and its child node and son Child node is each configured to disarmed state；S33. the network re-entry approval packet from gateway that the 5th node is sent is received, wherein, gateway is receiving the reentry After net application bag, the 5th node is defined as the new father node of first node by the routing table stored according to itself, obtains institute State the node address of new father node, and record the new node level of the first node, to generate network re-entry approval packet, and by its Send to the 5th node, so that the node of all forwarding network re-entry approval packets records first in the routing table of itself The node address of the node address of node and its new father node；S34. judge whether the MAC Address in the network re-entry approval packet is consistent with the MAC Address of itself, and when consistent, root According to the network re-entry approval packet update itself node level and father node node address.
- 8. the means of communication according to claim 6 based on tree network, it is characterised in that first node is in its child node During failure, follow the steps below：S41. in the net of transmission the 3rd after communication bag, judge the 3rd net of its child node forwarding whether is received in preset time Interior communication bag, if nothing, perform rapid S42；S42. judge whether the transmission times of communication bag in the 3rd net is more than preset times, if nothing, perform S41；If so, Then perform step S43；S43. sent to gateway and report barrier bag, so that all receive the node for reporting barrier to wrap in the routing table of itself by first segment The child node and sub- child node of point are each configured to disarmed state, wherein, the report barrier bag includes：The node level of first node, The node address of node address and the child node.
- 9. a kind of node, including memory and processor, computer program is stored with the memory, it is characterised in that institute Processor is stated to be used to perform the computer program stored in the memory and realize in claim 1-8 described in any one Method.
- A kind of 10. communication system based on tree network, it is characterised in that including the node described in multiple claims 9, and And the node is via node or ordinary node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710900067.4A CN107566264B (en) | 2017-09-28 | 2017-09-28 | A kind of means of communication based on tree network, node and communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710900067.4A CN107566264B (en) | 2017-09-28 | 2017-09-28 | A kind of means of communication based on tree network, node and communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107566264A true CN107566264A (en) | 2018-01-09 |
| CN107566264B CN107566264B (en) | 2019-09-20 |
Family
ID=60984110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710900067.4A Active CN107566264B (en) | 2017-09-28 | 2017-09-28 | A kind of means of communication based on tree network, node and communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107566264B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108347384A (en) * | 2018-01-26 | 2018-07-31 | 乐鑫信息科技（上海）有限公司 | A method of being suitable for transmission packet one-to-many in mesh networks |
| CN108900982A (en) * | 2018-06-25 | 2018-11-27 | 上海威惠智能科技有限公司 | Data forwarding method and device |
| CN109787825A (en) * | 2019-01-14 | 2019-05-21 | 山东建筑大学 | Internet of things equipment adaptive configuring method, system, storage medium and equipment |
| CN110278138A (en) * | 2019-06-27 | 2019-09-24 | 苏州市厚宏智能科技有限公司 | The communication system and method for kinds of goods management |
| CN110611621A (en) * | 2019-09-26 | 2019-12-24 | 上海依图网络科技有限公司 | Tree-structured multi-cluster routing control method and cluster forest |
| CN111371733A (en) * | 2018-12-26 | 2020-07-03 | 上海新微技术研发中心有限公司 | System, apparatus, method, device and medium supporting NB-IOT protocol and LPmesh protocol |
| CN113099507A (en) * | 2020-03-30 | 2021-07-09 | 深圳友讯达科技股份有限公司 | Hybrid routing method in mesh network |
| CN114513796A (en) * | 2022-02-17 | 2022-05-17 | 中建安装集团有限公司 | Narrow-band Internet of things networking method independent of power and communication infrastructure |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030188065A1 (en) * | 2002-03-28 | 2003-10-02 | Golla Prasad N. | Binary tree arbitration system and method |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
| US20080136620A1 (en) * | 2006-12-08 | 2008-06-12 | Electronics And Telecommunications Reaserch Institute | Method for transmitting sensor data in sensor network including pair node |
| CN101667954A (en) * | 2009-10-14 | 2010-03-10 | 中兴通讯股份有限公司 | Network of multilayer virtual private LAN (local area network) service and data processing method thereof |
| CN102143546A (en) * | 2011-04-02 | 2011-08-03 | 华南理工大学 | Method for reducing redundant routing packet in tree ZigBee network |
| CN105050149A (en) * | 2015-06-01 | 2015-11-11 | 苏州博联科技有限公司 | Routing method for overcoming congestion of tree type Zigbee network |
-
2017
- 2017-09-28 CN CN201710900067.4A patent/CN107566264B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030188065A1 (en) * | 2002-03-28 | 2003-10-02 | Golla Prasad N. | Binary tree arbitration system and method |
| US20080136620A1 (en) * | 2006-12-08 | 2008-06-12 | Electronics And Telecommunications Reaserch Institute | Method for transmitting sensor data in sensor network including pair node |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
| CN101667954A (en) * | 2009-10-14 | 2010-03-10 | 中兴通讯股份有限公司 | Network of multilayer virtual private LAN (local area network) service and data processing method thereof |
| CN102143546A (en) * | 2011-04-02 | 2011-08-03 | 华南理工大学 | Method for reducing redundant routing packet in tree ZigBee network |
| CN105050149A (en) * | 2015-06-01 | 2015-11-11 | 苏州博联科技有限公司 | Routing method for overcoming congestion of tree type Zigbee network |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108347384A (en) * | 2018-01-26 | 2018-07-31 | 乐鑫信息科技（上海）有限公司 | A method of being suitable for transmission packet one-to-many in mesh networks |
| CN108347384B (en) * | 2018-01-26 | 2020-12-01 | 乐鑫信息科技（上海）股份有限公司 | One-to-many data packet transmission method suitable for mesh network |
| CN108900982A (en) * | 2018-06-25 | 2018-11-27 | 上海威惠智能科技有限公司 | Data forwarding method and device |
| CN111371733A (en) * | 2018-12-26 | 2020-07-03 | 上海新微技术研发中心有限公司 | System, apparatus, method, device and medium supporting NB-IOT protocol and LPmesh protocol |
| CN111371733B (en) * | 2018-12-26 | 2024-03-12 | 上海新微技术研发中心有限公司 | System, apparatus, method, device and medium supporting NB-IOT protocol and LPmesh protocol |
| CN109787825A (en) * | 2019-01-14 | 2019-05-21 | 山东建筑大学 | Internet of things equipment adaptive configuring method, system, storage medium and equipment |
| CN109787825B (en) * | 2019-01-14 | 2021-09-03 | 山东建筑大学 | Self-adaptive configuration method and system for Internet of things equipment, storage medium and equipment |
| CN110278138A (en) * | 2019-06-27 | 2019-09-24 | 苏州市厚宏智能科技有限公司 | The communication system and method for kinds of goods management |
| CN110611621A (en) * | 2019-09-26 | 2019-12-24 | 上海依图网络科技有限公司 | Tree-structured multi-cluster routing control method and cluster forest |
| CN110611621B (en) * | 2019-09-26 | 2020-12-15 | 上海依图网络科技有限公司 | Tree-structured multi-cluster routing control method and cluster forest |
| CN113099507A (en) * | 2020-03-30 | 2021-07-09 | 深圳友讯达科技股份有限公司 | Hybrid routing method in mesh network |
| CN114513796A (en) * | 2022-02-17 | 2022-05-17 | 中建安装集团有限公司 | Narrow-band Internet of things networking method independent of power and communication infrastructure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107566264B (en) | 2019-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107566264B (en) | A kind of means of communication based on tree network, node and communication system | |
| US20200025629A1 (en) | Systems, methods and devices for networking over a network | |
| AU2018374839B2 (en) | Limiting forwarding of multicast communications | |
| CN107852661B (en) | Network manager and mesh network system | |
| AU2017203559B2 (en) | Peer-to-peer communications in AMI with source-tree routing | |
| US11290295B2 (en) | Multi-network operation with member node for multicast groups | |
| US7310761B2 (en) | Apparatus and method for retransmitting data packets in mobile ad hoc network environment | |
| CN107579915B (en) | Ad hoc network method, node, gateway and communication system based on tree network | |
| AU2021203207B2 (en) | Systems, methods and devices for networking over a network | |
| CN102457935A (en) | Centralized path notification in a wireless multi-hop network | |
| Dinh et al. | Method for organizing mesh topology based on LoRa technology | |
| US20150110108A1 (en) | Distributed data transmission in data networks | |
| JP5875696B2 (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| US20130201970A1 (en) | Wireless communication system, wireless communication control method, and wireless communication device | |
| US9226219B2 (en) | System and method for route learning and auto-configuration | |
| WO2019108548A1 (en) | Multi-network operation for multicast groups | |
| KR20120088053A (en) | Apparatus and method for providing sensor network | |
| CN102611523A (en) | System and method for single-channel serial wireless multi-hop link rapid transmission | |
| Saravanan et al. | Guaranteed delivery based on 1-hop neighbor information and reducing the redundancy in transmission | |
| Kim | Analysis of Link Error in Reducing Broadcasting Redundancy of MANET AAPs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |