CN107566264B - 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
- CN107566264B CN107566264B CN201710900067.4A CN201710900067A CN107566264B CN 107566264 B CN107566264 B CN 107566264B CN 201710900067 A CN201710900067 A CN 201710900067A CN 107566264 B CN107566264 B CN 107566264B
- Authority
- CN
- China
- Prior art keywords
- node
- net
- packet
- address
- level
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The present invention relates to a kind of means of communication based on tree network, node and communication system, which includes: that S11. first node receives communication bag in the net that second node is sent；S12. first node judges whether to need to forward to net interior communication bag, if so, thening follow the steps S13 according to sending direction, itself node level and pre-stored routing table；If it is not, thening follow the steps S14, wherein routing table includes the node address of the father node of each child node of first node, the node address of sub- child node and each child node, sub- child node；S13. first node setting net in communication bag header part forwarding label, and the node level of the second node in netting in the header part of communication bag is revised as itself node level, to generate communication bag in new net, and sends communication bag in new net；S14. first node, which abandons, nets interior communication bag.Implement technical solution of the present invention, power consumption is lower, 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 technique
In Internet of Things, data transmission is a vital link in various data collection systems, data transmission
Mode is gradually developed from wired to wireless mode, relative to wire transmission mode, wireless transmission method low, property with overall cost
Energy stabilization, networking flexibility are easy to the advantages such as extension, and can break through the application limitation under complicated geographical environment, therefore be easy to real
Existing and with high reliability wireless data transmission network occupies very important status, main body in field of data transmission
Two aspects of present network-building method and its Data Transport Protocol.
Currently, for wireless transmission method, generally by setting up dedicated data transmission network and its communication protocol come real
It is existing, for example, MESH network, NBIoT network.For MESH network, due to the communication between MESH network supporting node and node,
So each node needs have the function of calculating routing, therefore power consumption is larger, is not appropriate for the application of low-power consumption；For emerging
NBIoT network, due to being using Star Network, but in practical applications between its node and base station, it is possible to can be various
Unfrequented place placement sensor, if this place operator is not provided with base station, so place section cannot be met
The data transfer demands of point.Moreover, NBIoT network is dominated by operator, and for a user, other than lower deployment cost,
There are also operation costs.
Summary of the invention
The technical problem to be solved in the present invention is that being provided for the above-mentioned power consumption height of the prior art, defect at high cost
A kind of means of communication based on tree network, node and communication system, it is low in energy consumption, at low cost.
The technical solution adopted by the present invention to solve the technical problems is: constructing a kind of communication side based on tree network
Method, comprising:
S11. first node receives communication bag in the net that second node is sent, and the header part of communication bag includes in the net
The node level of the second node, source/destination node node address, forwarding label 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 pre-stored routing table, judgement according to described sender
It is no to need to forward communication bag in the net, if so, thening follow the steps S13；If it is not, thening follow the steps S14, wherein the routing
Table includes 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 father node；
S13. the forwarding label of the header part of communication bag in the net is arranged in first node, and by communication bag in the net
Header part in the node level of the second node be revised as itself node level, communicated with generating in new net
Packet, 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 judge described sender Xiang Weicong source node to gateway or for from gateway to destination node, if
To then follow the steps S122 from source node to gateway；If from gateway to destination node, S123 is thened follow the steps；
S122. first node judges whether the node level of itself is higher than the node level of the second node, if so,
Execute step S124；If it is not, thening follow the steps S14；
S123. first node judges whether the node level of itself is lower than the node level of the second node, if so,
Execute step S124；If it is not, thening follow the steps S14；
S124. first node routing table according to the pre-stored data, 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 so, determination needs to forward communication bag in the net, and executes
The step S13；If not, it is determined that do not need to forward communication bag in the net, and execute the step S14.
Preferably, the header part of communication bag further includes packet serial number in the net, moreover, after the step S13, also
Include:
S15. second node judges whether to receive communication bag in the new net of first node transmission, if so, thening follow the steps
S16；If it is not, thening follow the steps S17；
S16. then second node terminates using communication bag in the new net received as confirmation response bag；
S17. second node sends communication bag in the net again；
If S18. first node according to the packet serial number in communication bag in the net judge in the net communication bag for it is non-for the first time
Communication bag in received net then sends confirmation response bag.
Preferably, the step S17 are as follows:
Second node waits a delay time, and sends communication bag in the net again, when the delay time is default
Between random value in range or time value relevant to second node.
Preferably, the header part of communication bag further includes a group mark in the net, and the routing table includes respective sets mark
Under the node address of multiple nodes and the node address of each father node, moreover, before the step S121, further includes:
S120. first node is identified 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, thening follow the steps S121；If it is not, thening follow the steps S14.
Preferably, first node is followed the steps below when networking for the first time:
S21. receive in the initial state the third node that has networked issues first net in communication bag, wherein described the
One net in the header part of communication bag include the node level of the third node and the node address of fourth node, the described 4th
Node is the described first source/destination node for netting interior communication bag；
S22. the node level of itself is determined according to the node level of the third node, and according to the MAC Address of itself
The data portion for the application packet that networks is generated with itself node level, moreover, according to the node level of the third node and the
The node address of four nodes generates the header part for the application packet that networks, and networking application packet is sent to gateway；
S23. receive the networking approval packet from gateway that the third node issues, wherein gateway receive it is described enter
After net application packet, the third node is determined as to the father node of first node according to the routing table of itself storage, described in acquisition
The node address of father node records the node level of the first node, and is first node distribution node address, with life
At networking approval packet, and the third 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 is followed the steps below in network re-entry:
S31. it receives the 5th node to have networked issues second and nets interior communication bag, judge the node layer of the 5th node
Grade whether two-stage at least higher than the node level of itself, if so, thening follow the steps S22；Wherein, described second interior communication bag is netted
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 netting；
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
Location, new node level and node address generate the data portion of network re-entry application packet, moreover, according to the node of the 5th node
The node address of level and the 6th node generates the header part of network re-entry application packet, and the network re-entry application packet is sent to
Gateway so that all nodes for receiving the network re-entry application packet in the routing table of itself by first node and its child node and
Sub- child node is each configured to invalid state；
S33. receive the network re-entry approval packet from gateway that the 5th node issues, wherein gateway receive it is described
After network re-entry application packet, the 5th node is determined as to the new father node of first node according to the routing table of itself storage, is obtained
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 is followed the steps below in its child node failure:
S41. it is sending in third net after communication bag, is judging whether to receive described the of its child node forwarding in preset time
Three, which net interior communication bag, executes rapid S42 if nothing；
S42. judge whether the transmission times of communication bag in the third net is greater than preset times, if nothing, execute S41；
If so, thening follow the steps S43；
S43. report barrier packet is sent to gateway, so that all nodes for receiving the report barrier packet are in the routing table of itself by the
The child node of one node and sub- child node are each configured to invalid state, wherein the report barrier includes: the node layer of first node
The node address of grade, node address and the child node.
The present invention also constructs a kind of node, including memory and processor, is stored with computer program in the memory,
It is characterized in that, the processor is for executing the computer program stored in the memory and realizing above-described side
Method.
The present invention also constructs a kind of communication system based on tree network, which is characterized in that including multiple above-described
Node, moreover, the node is relay node or ordinary node.
Implement technical solution of the present invention, due to being previously stored with routing table in gateway and relay node, when a certain section
After point (such as first node) receives the interior communication bag of net, analyzed by the header part to communication bag in the net, and tie
Close the routing table of itself, it may be determined whether need to forward communication bag in the net, only just when needing to forward communication bag in the net
It is forwarded, rather than the node for each receiving communication bag in the net is forwarded.It is passed relative to the data in MESH network
Defeated mode, since node need not have calculates the function of routing, so the power consumption of node is lower；Relative in NBIoT network
Data transfer mode, due to needing not rely on operator by arranging that relay node ensures that being completely covered for wireless signal
The base station of arrangement, so, cost is relatively low.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.In attached drawing:
Fig. 1 is the flow chart of the means of communication embodiment one the present invention is based on tree network；
Fig. 2 is the flow chart of step S12 embodiment 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 the present invention is based on tree network；
Fig. 5 is the flow chart of the means of communication embodiment three the present invention is based on tree network.
Specific 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 realize, and including three classes equipment: one, gateway, corresponding
Tree root；Two, relay node, corresponding branch/trunk；Three, ordinary node, corresponding leaf.Wherein, gateway is for converging all sections
Point, and access Internet.The difference of relay node and ordinary node is: relay node can be corresponded to multiple by mains-supplied
The child node of junior and sub- child node, and its superior node only one, referred to as father node；Ordinary node is located at the most side of network
Edge 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 dormant state by Sensor Events,
There are three the time windows of RF for meeting after it wakes up: whether 1. detection RF channels are occupied, (having node giving out a contract for a project)；2. sending
Data；3. receiving confirmation.After time window reaches, continue suspend mode.
In addition, can largely use leaf nodes (low power consumption node), and use to reach energy conservation, easy working requirement
The branch node guarantee network coverage.
Fig. 1 is that the flow chart of the means of communication embodiment one the present invention is based on tree network is said first in this embodiment
Bright, what this communications protocol was supported is the communication between ordinary node and gateway (node to gateway or gateway to node), and
Operation of relays is carried out by the relay node between ordinary node and gateway.It is not communicated with each other two-by-two between supporting node.Moreover,
Gateway is also the intermediary of node online in fact, the collected data of node (such as sensor) and its service logic 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
Regardless of packet the method for the embodiment can be used all to be transmitted in the privately owned packet of APP packet and networking.
In this embodiment, by taking first node and second node as an example, first node, second node can be gateway, relaying
Node or ordinary node, moreover, first node, in the broadcasting area of second node, correspondingly, second node is also in first segment
In the broadcasting area of point.When second node, which is sent, nets interior communication bag, first node can receive communication bag in the net, the reality
Apply the means of communication of example specifically includes the following steps:
S11. first node receives communication bag in the net that second node is sent, and the header part of communication bag includes in the net
The node level of the second node, source/destination node node address, forwarding label 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 there are two types of situations for sending direction: being sent out from gateway
Out, it is sent to gateway.When forwarding label (Forward) field is significance bit, for example, 1, then it represents that communication bag is second in the net
Node forwarding, rather than what second node generated, that is, second node is relay node, on the contrary, then it represents that communication bag is in the net
What second node generated, that is, second node is ordinary node.
S12. first node is to, the node level of itself and pre-stored routing table, judgement according to described sender
It is no to need to forward communication bag in the net, if so, thening follow the steps S13；If it is not, thening follow the steps S14, wherein the routing
Table includes 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 father node；
S13. the forwarding label of the header part of communication bag in the net is arranged in first node, and by communication bag in the net
Header part in the node level of the second node be revised as itself node level, communicated with generating in new net
Packet, and send communication bag in the new net；
In this step, it should be noted that, when determining that needs forward communication bag in net, can only modify in header part
Node level and setting forwarding label, that is, node level is revised as to the level of itself, sets forwarding label to effectively, and
The node address and data portion of header part will not be modified.
S14. first node abandons communication bag in the net.
In this embodiment, due to being previously stored with routing table in gateway and relay node, when a certain node (such as
One node) it receives in net after communication bag, it is analyzed by the header part to communication bag in the net, and combine the road of itself
It is only just forwarded when needing to forward communication bag in the net by table to determine the need for forwarding 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 routing, so the power consumption of node is lower；Relative to the data transfer mode in NBIoT network,
Due to needing not rely on the base station of operator's arrangement, institute by arranging that relay node ensures that being completely covered for wireless signal
With cost is relatively low.
Fig. 2 is the flow chart of step S12 embodiment one in Fig. 1, the step S12 of the embodiment specifically includes the following steps:
S121. first node judge described sender Xiang Weicong source node to gateway or for from gateway to destination node, if
To then follow the steps S122 from source node to gateway；If from gateway to destination node, S123 is thened follow the steps；
S122. first node judges whether the node level of itself is higher than the node level of the second node, if so,
Execute step S124；If it is not, thening follow the steps S14；
In this step, about 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 junior's child node of gateway is 1, is analogized with secondary.
S123. first node judges whether the node level of itself is lower than the node level of the second node, if so,
Execute step S124；If it is not, thening follow the steps S14；
S124. first node routing table according to the pre-stored data, 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 so, determination needs to forward communication bag in the net, and executes
The step S13；If not, it is determined that do not need to forward communication bag in the net, and execute the step S14.
In this step, node combines the routing table of itself, and whether communication bag is intended for the son of oneself only in the net
Node or sub- child node, alternatively, communication bag is child node or sub- child node from oneself in the net, just can determine whether to need
Forwarding, can guarantee that exclusive node is only had in each layer to be forwarded in this way.
Further, since the RF module used between node (gateway also belongs to special node) is approximately uniform, so,
Since first node can receive communication bag in the net of second node transmission, it is evident that second node can also receive first node
Communication bag in the new net sent, therefore, second node improve data as confirmation response bag to make full use of bandwidth
Transmission efficiency.Specifically, the header part of communication bag further includes packet serial number in netting, moreover, the step S13 of above-described embodiment it
Afterwards, further comprising the steps of:
S15. second node judges whether to receive communication bag in the new net of first node transmission, if so, thening follow the steps
S16；If it is not, thening follow the steps 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 second node is sent, forwarding mark
Note may also be different, and the data portion of the two is identical, moreover, packet serial number is also identical, so can be determined according to packet serial number
The two is communication bag in same net actually.
S16. then second node terminates using communication bag in the new net received as confirmation response bag；
S17. second node sends communication bag in the net again, it is preferable that second node 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 relevant to second node
Between be worth, for example, can according to conflict the back off algorithm computation delay time；
If S18. first node according to the packet serial number in communication bag in the net judge in the net communication bag for it is non-for the first time
Communication bag in received net then sends confirmation response bag.
In this embodiment, directly using communication bag in the net of transmitting as the confirmation response bag to previous stage node, that is,
The response to node of giving out a contract for a project is realized while message transmissions, to realize efficient transmission response hand in hand.Certainly, for hair
Packet node (second node) can send communication in the net if communication bag in its net for not receiving first node forwarding again
It wraps, the packet serial number of communication bag is identical as the packet serial number of communication bag in the net of previous transmission in the net, at this point, 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 shunts node, and different gateways usually can physically use different RF channels.Specifically, communication bag in netting
Header part further includes a group mark, only possible to be present in a network for a certain specific node, so, routing
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, further includes:
S120. first node is identified 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, thening follow the steps S121；If it is not, thening follow the steps S14.
Process of data communication of the invention is illustrated with specific example below:
Illustrate the format for netting interior communication bag first, it includes header part (Header field) and data that one, which is netted interior communication bag,
Partially (Data field).
The format of Header field is as follows:
GroupID+LevelID+NodeAddr+Flag+PacketNum
Wherein, GroupID is group mark, for identifying different networks, be typically different ID network will use it is different
RF channel, its effect are the shuntings when node lays intensive；LevelID is node level, and the smaller level of number is higher, gateway
Level be 0, for indicate net in communication bag want it is a few jump get to gateway, the level that can directly receive the node of gateway packet 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, every time plus 1, counted from zero again after spilling, its packet serial number of the packet of repeating transmission remains unchanged；Flag is marker bit, and is had
Body includes:
1.Forward is forwarding label, and when Forward=1 shows that this packet is forwarding, and when Forward=0 shows this
A packet is non-forwarded；
2.To/From is the sending direction of packet, is based on gateway, and To=0 (From=1) representative is issued by gateway, To=1
(From=0) it represents and is sent to gateway；
3.Private/App is used to distinguish the packet used or the packet of application layer inside ad hoc network.
By taking the topological structure of communication system shown in Fig. 3 as an example, in the communication system, gateway G1 can directly receive node
The packet of N1, N2；Node N1 can directly receive the packet of gateway G1, node N3, N4；Node N2 can directly receive gateway G1, node N4
Packet；Node N3 can directly receive the packet of node N1, N4；Node N4 can directly receive the packet of node N1, N2, N3.
About routing tableau format, it should be noted that comprising 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 the section of gateway G1, node N1, node N2, node N3, node N4
Dot address is followed successively by 0,1,2,3,4 respectively, then combines the routing tableau format in gateway shown in following table, first row is net in table
The linear array of the node address of all child nodes, 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, the
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 packet from first row node, corresponding father node just has to forward the packet in second row, on the contrary, not forwarding then.
| 0 | 1 | 2 | 3 | 4 |
| 0 | 0 | 1 | 2 |
If node N3 generates an APP packet for needing to be sent to gateway G1, at this point, in the header part of the packet, LevelID=
2, GroupID=1, NodeAddr=3 forward flag F=0, and sending direction marks T=1, and Packet type marks P=0.Work as node
After N3 issues the packet, since node N1, N4 are in its broadcasting area, so, node N1, N4 can receive the packet.
For node N1, after receiving the packet, then first acknowledged checks LevelId=to be sent to gateway
2, it is bigger by 1 than the node level of oneself, identify it is oneself next stage node, then by checking the discovery of oneself routing table
NodeAddr=3 wherein, needs to forward the packet so determining.At this point, modifying node level therein and forwarding label, and turn
The packet is sent out, moreover, in header part after the modification, LevelID=1, GroupID=1, NodeAddr=3 forward flag F
=1, sending direction T=1, Packet type mark P=0.
For node N4, after receiving the packet, then first acknowledged checks LevelId to be sent to gateway
=2, discovery node level is identical as oneself, it is clear that node N3 is not the downstream site of oneself.It is not handled at this point, abandoning the packet
?.
In addition, node N3 can also receive the packet of node N1 forwarding after node N1 forwards the packet, confirm that the packet is sent with this
Success, is 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 packet.In addition, gateway G1 can also receive the packet of node N1 forwarding, then first acknowledged is checked to be sent to gateway
LevelId=1, it is bigger by 1 than the node level of oneself, identify it is oneself next stage node, then by checking oneself routing
Table find NodeAddr=3 wherein, so, LevelID can be set as to 0, send this packet again, as to node N1 really
Recognize.
About routing table, it should be noted that, it is stored in advance in each relay node and gateway, it can be by a variety of
Mode configures the routing table in relay node and gateway, it is preferable that a set of dynamic routing machine can be established by way of ad hoc network
System, and can optimize automatically, to store corresponding routing table in node and gateway.
If a sensor node, for example, first node are newly added in communication system, at this point, the first node is initial
State, that is, do not obtain the node address of gateway distribution, do not determine node level and father node, moreover, its higher level section is not written yet
In the routing table of point.Therefore, it is necessary first to which the first node networks.When networking, as long as first node can receive
Arbitrary one is netted interior communication bag, by taking first nets interior communication bag as an example, so that it may which judgement nearby has specific data transmission network to deposit
, and then the application that the data transmission network is added can be initiated.Specifically, in conjunction with Fig. 4, when networking for the first time, first node into
Row following steps:
S21. receive in the initial state the third node that has networked issues first net in communication bag, wherein described the
One net in the header part of communication bag include the node level of the third node and the node address of fourth node, the described 4th
Node is the described first source/destination node for netting interior communication bag；
In this step, first node receive first net in communication bag be that fourth node issues, during third node is
After the intermediate node of communication bag in first net, moreover, the first header part for netting interior communication bag includes fourth node (source/mesh
Mark node) node address and third node node level.In addition it should be noted that, under the original state of communication system,
An only gateway, there are no the networkings of any node, at this point, third node and fourth node are gateway, that is, gateway to
Own broadcast first nets interior communication bag.
S22. the node level of itself is determined according to the node level of the third node, and according to the MAC Address of itself
The data portion for the application packet that networks is generated with itself node level, moreover, according to the node level of the third node and the
The node address of four nodes generates the header part for the application packet that networks, and networking application packet is sent to gateway；
In this step, since first node can receive the networking application packet of third node transmission, and third node is
Network, node level it has been determined that so, the node level of itself can be determined according to the level of the third node, for example, the
The level of three nodes is 2, and the node level of the first node is 3, is lower than one grade of third node.In addition, working as first node
After itself level has been determined, can network identified node level and the MAC Address filling of itself application packet, then be sent out
It send to gateway.Herein it should be noted that, due to first node also unassigned nodes address at this time, so cannot be with the body of oneself
It part sends out the networking application packet, can only be sent in the level for the node address and third node that header part borrows fourth node
The networking application packet.Specifically, the header part of the networking application packet includes the section of the node address of fourth node, third node
Point level, the data portion of the networking application packet include the node level of first node, MAC Address, the node for particular value
Location (indicating to be allocated) etc..
S23. receive the networking approval packet from gateway that the third node issues, wherein gateway receive it is described enter
After net application packet, the third node is determined as to the father node of first node according to the routing table of itself storage, described in acquisition
The node address of father node records the node level of the first node, and is first node distribution node address, with life
At networking approval packet, and the third 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 receiving the application that networks and wrapping, according to the node of the fourth node in its header part
The node level field of first node in address field and data portion, in conjunction with the routing table of itself, from fourth node
In routing watch chain find node more higher leveled than the node level of first node, that is, find third node, and will find
Node is determined 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 data portion of networking approval packet includes the node of the node address of first node, node level, MAC Address, father node
Location.
In addition, since the node address of itself also has not been obtained in first node at this time, so, gateway can only be sent it to
The father node of first node, i.e. third node, so, the header part of networking approval packet includes the node address of third node.
Preferably, during being sent to third node, intermediate node judges first node after receiving the networking approval packet
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, that is, 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, that is, 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 third node after, since third 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 receiving networking approval packet, 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 (third node
Address).
In this embodiment, the node being 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, the networking approval that intermediate node is issued by analysis gateway
Packet makes each node receive message to establish the linear routing table of itself for managing its junior's child node and sub- child node
The message for only forwarding its child node or sub- child node afterwards, to realize automatic network-building.
It is found in message transmission procedure, node when forwarding packet, if its level is lower, get over by the hop count of the packet
More, package efficiency is lower, so, for node, it is always desirable to which the higher the better for its level.In this case, if node
The packet of the top-ranking's node of oneself can be received, then its can activly request network again, change level and routing relation.It is not difficult to manage
Solution, because node is in the initial state, as long as one detects that packet will network as early as possible, if section that is subsequent and detecting more high-level
The packet 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.
In conjunction with Fig. 5, by taking first node as an example, which follows the steps below in network re-entry:
S31. it receives the 5th node to have networked issues second and nets interior communication bag, judge the node layer of the 5th node
Grade whether two-stage at least higher than the node level of itself, if so, thening follow the steps S22；Wherein, described second interior communication bag is netted
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 netting；
In this step, first node receive second net in communication bag be that the 5th node issues, during the 5th node is
After the intermediate node of communication bag in second net, moreover, the second header part for netting interior communication bag includes the 6th node (source/mesh
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 daily maintenance of network, in daily maintenance, net
Pass selects most marginal relay node from routing table and carries out detection of giving out a contract for a project, and the packet sent out is network re-entry application packet, only needs less
Packet just in detectable network all relay nodes state.In another example, network re-entry request occurs to pass in data packet
During defeated.So the network re-entry application packet or data packet of either gateway sending, as long as first node receives on new
Communication bag in the second net that grade node issues, and judge the node level of the 5th node two-stage at least higher than the node level of itself
(that is, higher than the level of current father node), then judgement needs 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
Location, new node level and node address generate the data portion of network re-entry application packet, moreover, according to the node of the 5th node
The node address of level and the 6th node generates the header part of network re-entry application packet, and the network re-entry application packet is sent to
Gateway so that all nodes for receiving the network re-entry application packet in the routing table of itself by first node and its child node and
Sub- child node is each configured to invalid state；
In this step, it is preferable that in transmission process, intermediate node exists the network re-entry application packet that first node issues
After receiving the network re-entry application packet, 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 invalid state.
S33. receive the network re-entry approval packet from gateway that the 5th node issues, wherein gateway receive it is described
After network re-entry application packet, the 5th node is determined as to the new father node of first node according to the routing table of itself storage, is obtained
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 transmission process, intermediate node is receiving the network re-entry batch
After quasi- packet, judge the new father node of first node node address whether the section with itself node address or 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 for the first time, it is different only
Be: when networking for the first time, the node address that first node is assigned not yet, it is determined certainly after finding a father node
Oneself node level, and in received net the header packet information of communication bag issue the application packet that networks.And in network re-entry, it has obtained
Get the node address that gateway is distributed.
It has also been found that, some nodes can break down, if without handling in time, it will cause to lead in message transmission procedure
News are interrupted.In this case, if discovery relay node failure, superior node can issue report barrier packet and report to gateway, in this way,
In the transmission process of report barrier packet, all nodes for receiving report barrier packet save failure node and its son in the routing table of itself
Point is each configured to invalid state.It will be described in detail below and how to carry out reporting barrier to carry out Automatic Optimal to the routing table established,
By taking the child node failure of first node as an example, which follows the steps below in its child node failure:
S41. it is sending in third net after communication bag, is judging whether to receive described the of its child node forwarding in preset time
Three, which net interior communication bag, executes rapid S42 if nothing；
S42. judge whether the transmission times of communication bag in the third net is greater than preset times, if nothing, execute S41；
If so, thening follow the steps S43；
In this step, it is preferable that if judgement needs to retransmit message, first wait a delay time, and execute step again
Rapid S41, for example, by conflict the back off algorithm computation delay time, the delay time be preset time range in random value or with
The relevant time value of first node.
S43. report barrier packet is sent to gateway, so that all nodes for receiving the report barrier packet are in the routing table of itself by the
The child node of one node and sub- child node are each configured to invalid state, wherein the report barrier includes: the node layer of first node
The node address of grade, node address and the child node.
In this embodiment, for a certain node, superior node unsuccessfully can detect whether it fails by retransmitting, if
It has been failed that, then its superior node can generate report barrier packet, and report to gateway, in this way, all nodes for receiving report barrier packet can
According to the content modification routing iinformation of report barrier packet.
Further, the downstream site of failure node detects that it has failed also by retransmitting unsuccessfully, at this point, the junior
Node then returns init state, networks again.Specifically, first node is followed the steps below in his father's node failure:
S51. send the 4th net in after communication bag, judge whether to receive described the of its father node forwarding in preset time
Four, which net interior communication bag, thens follow the steps S52 if nothing；
Whether the transmission times for S52. judging that the described 4th nets interior communication bag is greater than preset times, if nothing, executes S51；
If so, thening follow the steps S53；
In this step, it is preferable that if judgement needs to retransmit message, first wait a delay time, and execute step again
Rapid S51, for example, by conflict the back off algorithm computation delay time, the delay time be preset time range in random value or with
The relevant time value of first node.
S53. original state is returned to.
Above embodiments illustrate the process that node networks, which does not need manually to participate in, it can be achieved that automatic group
Net.In addition, the forwarding wrapped in this way is minimum since node always pursues the raising of its node level, efficiency highest.Certainly, the mistake
Journey 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 according to the node level of itself can judge whether that new network is added.
Illustrate the process of ad hoc network below with reference to the topological structure of communication system shown in Fig. 3:
Firstly, the format about Data field, it should be noted that, due to the packet (Private packet) used inside ad hoc network
There are three types of types: JOIN packet (networking for node application, gateway ratifies node and networks), REPO packet (hinder, explanation for node report
Downstream site failure), (response to retransmitted packet is exactly the Header word of retransmitted packet without forwarding again to ACKN packet in fact
Section).So only illustrating the Data field portions in three kinds of Private packets below.
The Data field format of JOIN packet are as follows:
Type (JOIN)+node level+node address+superior node address+node MAC addr+powered types
The Data field format of REPO packet are as follows:
Type (REPO)+node level+node address+downstream site address+node MAC addr+powered types
The Data field format of ACKN packet are as follows:
Type(ACKN)+(GroupID+LevelID+NodeAddr+Flag+PacketNum)
In conjunction with Fig. 3, the communication system in the initial state, only one equipment in system, i.e. gateway G1.With node
It is added, starts to carry out ad hoc network.Firstly, gateway G1 sends out JOIN packet to oneself, at this point, node N1, N2 can receive the JOIN packet,
A random time is selected by conflict back off algorithm, sends the JOIN packet of oneself, in the header part of JOIN packet, 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 portion of JOIN packet, the node address of node N1 (or N2) is unallocated, fills out particular value (for example, 0), the spy
Different value indicates to be allocated, in addition, since node N1 (or N2) can receive the packet of gateway G1, so can determine that node level is 1, and
Node level and MAC Address are inserted in JOIN packet.Specifically:
Data field: Type=JOIN+ node level=1+ node address=0+ superior node address=0+ node M AC
Location+powered types
Header field: LevelID=0+GroupID=1+NodeAddr=0+Flag (T)+PacketNum
Gateway G1 records MAC Address after receiving the JOIN packet, is node N1 (or N2) distribution node address, and
Filling is the address of node distribution in JOIN packet, retransmits this JOIN packet, and destination is superior node address, i.e. gateway oneself,
Sending direction marker bit T=0, that is, the JOIN packet is issued by gateway G1, for networking approval packet.
It is that approval enters oneself according to MAC Address determination after node N1 (or N2) receives the JOIN packet that gateway issues gateway
The JOIN packet of net, just records level therein and node address.In this way, node N1 (or N2) is just completed and is networked for the first time.
After node N1 (or N2) networks, the fringe node for network is become, gateway periodically can send out JOIN packet to them, with
Safeguard network.After node N1 (or N2) receives the JOIN packet, the JOIN packet can be issued oneself again again, as to gateway
ACK packet then sent out at this point, node N3 (or N4) can receive the JOIN packet for issuing N1 (assuming that first receiving the packet for issuing N1)
Give the JOIN packet of oneself, wherein the node address of Data field fills out particular value 0, in addition, due to that can receive node level=1
Packet, so node level fills out 2, that is, Data field are as follows:
Type=JOIN+ node level=2+ node address=0+ superior node address=1+ node MAC addr+power supply class
Type
And Header field are as follows:
LevelID=1+GroupID=1+NodeAddr=1+Flag (T=1)+PacketNum
It after node N1 receives the JOIN packet, finds superior node address=1, is exactly oneself, then modification packet Header
In level and marker bit, that is, LevelID=1, Flag (F=1, T=1, P=0) then retransmit this packet.
After gateway G1 receives the JOIN, record MAC, distribution node address, and with inserting distributed node in JOIN packet
Location, retransmits this JOIN packet, and destination is exactly superior node address, that is, marker bit T=0 is modified, then in the address of node N1
It is sent to node N1.The Header field of the JOIN packet are as follows:
LevelID=0+GroupID=1+NodeAddr=1+Flag (T=0)+PacketNum
After node N1 receives the JOIN packet, the node address one of destination node address and oneself in Header is found
It causes, and is the JOIN packet that gateway issues, then record routing iinformation therein, level=1 in Header is wrapped in modification, again
This packet is sent, as the confirmation packet to gateway G1, while the node address that also notice node N3 is distributed for it.
In addition, node N1 is not necessarily to wait the retransmitted packet of nodes N3, because of the destination originally node address of node N1, this
Secondary transmission has terminated.Moreover, node N3 will not retransmit this packet, first is that N1 is originally issued because wrapping thus, second is that
Because not receiving the JOIN packet of node N1 hair if unsuccessful, node N3 applies once networking again.
In addition, when transmitting JOIN packet, as long as the node address of destination and is by gateway in the routing table of oneself
Information in JOIN packet will be added in the routing table of oneself by the JOIN packet that G1 is sent, node, it is also possible to delete certain
Routing.
Finally, the present invention also constructs a kind of node comprising have memory and processor, be stored with computer in memory
Program, processor is for executing the computer program stored in memory and the method for realizing above embodiments.
The present invention also constructs a kind of communication system based on tree network, including multiple above-described nodes, moreover, institute
Stating node is relay node or ordinary node.
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made any bun
Change, equivalent replacement, improvement etc., should be included within scope of the presently claimed invention.
Claims (10)
1. a kind of means of communication based on tree network characterized by comprising
S11. first node receives communication bag in the net that second node is sent, and the header part of communication bag includes described in the net
Node level, source/destination node node address, forwarding label and the sending direction of second node, described sender Xiang Weicong
Source node is to gateway or from gateway to destination node, wherein the forwarding indicates that communication bag is in the net when being labeled as effective
Second node forwarding, the forwarding indicates that communication bag is that second node generates in the net when being labeled as invalid；
S12. first node according to described sender to, itself node level and pre-stored routing table, judge whether need
Communication bag in the net is forwarded, if so, thening follow the steps S13；If it is not, thening follow the steps S14, wherein the routing table packet
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 label of the header part of communication bag in the net to effectively, and will lead in the net
Believe that the node level of the second node in the header part of packet is revised as the node level of itself, is led to generating in new net
Letter packet, 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, which is characterized in that the step S12 includes:
S121. first node judge described sender Xiang Weicong source node to gateway or for from gateway to destination node, if from
Source node thens follow the steps S122 to gateway；If from gateway to destination node, S123 is thened follow the steps；
S122. first node judges whether the node level of itself is higher than the node level of the second node, if so, executing
Step S124；If it is not, thening follow the steps S14；
S123. first node judges whether the node level of itself is lower than the node level of the second node, if so, executing
Step S124；If it is not, thening follow the steps S14；
S124. first node routing table according to the pre-stored data, judge the source/destination node node address whether with itself
Child node or sub- child node node address it is consistent, need to forward communication bag in the net if so, determining, and described in executing
Step S13；If not, it is determined that do not need to forward communication bag in the net, and execute the step S14.
3. the means of communication according to claim 1 based on tree network, which is characterized in that the packet of communication bag in the net
Head point further includes packet serial number, moreover, after the step S13, further includes:
S15. second node judges whether to receive communication bag in the new net of first node transmission, if so, thening follow the steps S16；
If it is not, thening follow the steps S17；
S16. then second node terminates using communication bag in the new net received as confirmation response bag；
S17. second node sends communication bag in the net again；
If S18. first node judges in the net that communication bag receives for the first time to be non-according to the packet serial number in communication bag in the net
Net in communication bag, then send confirmation response bag.
4. the means of communication according to claim 3 based on tree network, which is characterized in that the step S17 are as follows:
Second node waits a delay time, and sends communication bag in the net again, and the delay time is preset time model
Random value or time value relevant to second node in enclosing.
5. the means of communication according to claim 2 based on tree network, which is characterized in that the packet of communication bag in the net
Head point further includes a group mark, and the routing table includes the node address and each father node of multiple nodes under respective sets mark
Node address, moreover, before the step S121, further includes:
S120. first node is identified 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, thening follow the steps S121；If it is not, thening follow the steps S14.
6. the means of communication according to claim 1-5 based on tree network, which is characterized in that first node exists
When networking for the first time, follow the steps below:
S21. the third node to have networked issues first is received in the initial state and nets interior communication bag, wherein first net
The header part of interior communication bag includes the node level of the third node and the node address of fourth node, the fourth node
Source/the destination node for netting interior communication bag for described first；
S22. the node level of itself is determined according to the node level of the third node, and according to the MAC Address of itself and certainly
The node level of body generates the data portion for the application packet that networks, moreover, according to the node level of the third node and Section four
The node address of point generates the header part for the application packet that networks, and networking application packet is sent to gateway；
S23. the networking approval packet from gateway that the third node issues is received, wherein gateway is receiving the networking Shen
After please wrapping, the third node is determined as to the father node of first node according to the routing table of itself storage, obtains father's section
The node address of point, records the node level of the first node, and is first node distribution node address, with generate into
Net approval packet, and the third node is sent it to, so that road of the node of all forwarding networking approval packets at 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, which is characterized in that first node is in network re-entry
When, it follows the steps below:
S31. it receives the 5th node to have networked issues second and nets interior communication bag, judge that the node level of the 5th node is
No two-stage at least higher than the node level of itself, if so, thening follow the steps S22；Wherein, the packet header of the interior communication bag of the second net
Part includes the node level of the 5th node and the node address of the 6th node, and the 6th node is in 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
Node level and node address generate the data portion of network re-entry application packet, moreover, according to the node level of the 5th node
And the 6th the node address of node generate the header part of network re-entry application packet, and the network re-entry application packet is sent to net
It closes, so that all nodes for receiving the network re-entry application packet are in the routing table of itself by first node and its child node and son
Child node is each configured to invalid state；
S33. the network re-entry approval packet from gateway that the 5th node issues is received, wherein gateway is receiving the reentry
After net application packet, the 5th node is determined as to the new father node of first node according to the routing table of itself storage, 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
It is sent 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, which is characterized in that first node is in its child node
When failure, follow the steps below:
S41. the third net for after communication bag, judging whether to receive its child node in third net in preset time and forwarding is being sent
Interior communication bag executes rapid S42 if nothing；
S42. judge whether the transmission times of communication bag in the third net is greater than preset times, if nothing, execute S41；If so,
Then follow the steps S43；
S43. report barrier packet is sent to gateway, so that all nodes for receiving the report barrier packet are in the routing table of itself by first segment
Point child node and sub- child node be each configured to invalid state, wherein it is described report barrier include: first node node level,
The node address of node address and the child node.
9. a kind of node of the communication system based on tree network, including memory and processor, it is stored in the memory
Computer program, which is characterized in that the processor is for executing the computer program stored in the memory and realizing power
Benefit requires method described in any one of 1-8.
10. a kind of communication system based on tree network, which is characterized in that including multiple nodes as claimed in claim 9, and
And the node is relay 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 CN107566264A (en) | 2018-01-09 |
| CN107566264B true 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) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108347384B (en) * | 2018-01-26 | 2020-12-01 | 乐鑫信息科技（上海）股份有限公司 | One-to-many data packet transmission method suitable for mesh network |
| CN108900982B (en) * | 2018-06-25 | 2021-06-18 | 上海威惠智能科技有限公司 | Data forwarding method and device |
| CN111371733B (en) * | 2018-12-26 | 2024-03-12 | 上海新微技术研发中心有限公司 | System, apparatus, method, device and medium supporting NB-IOT protocol and LPmesh protocol |
| 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 |
| CN110611621B (en) * | 2019-09-26 | 2020-12-15 | 上海依图网络科技有限公司 | Tree-structured multi-cluster routing control method and cluster forest |
| CN113099507B (en) * | 2020-03-30 | 2022-11-29 | 深圳友讯达科技股份有限公司 | Hybrid routing method in mesh network |
| CN114513796B (en) * | 2022-02-17 | 2023-03-28 | 中建安装集团有限公司 | Narrow-band Internet of things networking method independent of power and communication infrastructure |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7007123B2 (en) * | 2002-03-28 | 2006-02-28 | Alcatel | Binary tree arbitration system and method using embedded logic structure for controlling flag direction in multi-level arbiter node |
| KR100835174B1 (en) * | 2006-12-08 | 2008-06-05 | 한국전자통신연구원 | Method for transmitting sensor data in the sensor network including pair node |
-
2017
- 2017-09-28 CN CN201710900067.4A patent/CN107566264B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107566264A (en) | 2018-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107566264B (en) | A kind of means of communication based on tree network, node and communication system | |
| US8306041B2 (en) | Determining bidirectional path quality within a wireless mesh network | |
| Polastre et al. | A unifying link abstraction for wireless sensor networks | |
| RU2468524C2 (en) | Method and system designed to provide network protocols and routing protocols for utility services | |
| CN107579915B (en) | Ad hoc network method, node, gateway and communication system based on tree network | |
| ES2701761T3 (en) | Communication device, communication control procedure and communication system | |
| US7310761B2 (en) | Apparatus and method for retransmitting data packets in mobile ad hoc network environment | |
| US8717943B2 (en) | Peer-to-peer communications in AMI with source-tree routing | |
| CN107852661A (en) | Operation for the low power sensor node of wireless network | |
| AU2016204037B2 (en) | Systems, methods and devices for networking over a network | |
| Oh et al. | A slotted sense multiple access protocol for timely and reliable data transmission in dynamic wireless sensor networks | |
| Dinh et al. | Method for organizing mesh topology based on LoRa technology | |
| JP5875696B2 (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| Cheng et al. | Taming collisions for delay reduction in low-duty-cycle wireless sensor networks | |
| Stathopoulos et al. | Mote herding for tiered wireless sensor networks | |
| Nobre et al. | Performance evaluation of WirelessHART networks using a new network simulator 3 module | |
| Thorup | Implementing and evaluating the DYMO routing protocol | |
| CN101478826B (en) | Communication scheduling method and system for wireless sensor network | |
| CN103249165A (en) | Wireless communication system, wireless communication control method, and wireless communication device | |
| Dubois-Ferriere | Anypath routing | |
| CN112995043B (en) | Information processing method and device in wireless mesh network and electronic equipment | |
| Gonzalez et al. | A self-synchronised scheme for automated communication in wireless sensor networks | |
| KR101442579B1 (en) | Data transmission method in wireless sensor network and wiress sensor node thereof | |
| Sugano et al. | Low-Energy-Consumption Ad Hoc Mesh Network Based on Intermittent Receiver-driven Transmission | |
| EP3327988A1 (en) | System and method for improving multicast latency and reliability of multicast transmissions in a wireless building automation network |
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 |