CN109861916A - A kind of data processing method and relevant device - Google Patents
A kind of data processing method and relevant device Download PDFInfo
- Publication number
- CN109861916A CN109861916A CN201910042242.XA CN201910042242A CN109861916A CN 109861916 A CN109861916 A CN 109861916A CN 201910042242 A CN201910042242 A CN 201910042242A CN 109861916 A CN109861916 A CN 109861916A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- target packet
- target
- data
- 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
Abstract
The embodiment of the invention discloses a kind of data processing method and relevant devices to be not necessarily to networking for the automatic routing of data packet, and maintenance is simple.This method comprises: whether the target packet that judgement receives is silence data packet；If it is not, then judging that duplicate packages check to whether there is in queue have data packet identical with target packet；If it is not, then judging whether the destination address of target packet and the node address of first node match；If it is not, then judging whether the routing series of target packet reaches default value；If it is not, the forwarding moment of setting target packet；If current time is the forwarding moment, judge whether the life cycle of target packet exhausts；If it is not, then judging whether the physical link of first node is idle；When the physical link free time of first node, the target packet after setting to be routed to series is sent to the surroundings nodes of first node.
Description
Technical field
The present invention relates to internet of things field more particularly to a kind of data processing method and relevant devices.
Background technique
Internet of Things is exactly the connected internet of object object.This has two layers of meaning: first, the core of Internet of Things and basis are still
Internet is the network of extension based on the internet and extension；Second, its user terminal extends and extends to any article
Between article, information exchange and communication are carried out, that is, object object mutually ceases.
The communication mode used in Internet of Things at present, either carrier communication or micro power radio communication, communication away from
It is limited from all, in order to deliver a packet to farther away node, relate to the routing forwarding of intermediate node.
How more preferably to realize that the storage forwarding of data packet in power line carrier or micro power radio communication local area network is one
More promising project.
Summary of the invention
In view of the above technical problems, it the embodiment of the invention provides a kind of data processing method relevant device, may be implemented
The routing forwarding of data packet.
First aspect of the embodiment of the present invention provides a kind of data processing method, comprising:
Whether the target packet that first node judgement receives is silence data packet；
If it is not, then the first node judge duplicate packages check queue in the presence or absence of have it is identical as the target packet
Data packet；
When the duplicate packages check, and data packet identical with the target packet is not present in queue, the first segment
Point judges whether the destination address of the target packet matches with the node address of the first node；
When the node address of the destination address of the target packet and the first node mismatches, the first segment
Point judges whether the routing series of the target packet reaches default value；
When the routing series of the target packet is not up to the default value, the mesh is arranged in the first node
Mark the forwarding moment of data packet；
If the current time is the forwarding moment, judge whether the life cycle of the target packet exhausts；
When the life cycle of the target packet does not exhaust, then the first node judges the object of the first node
Whether idle manage link；
When the physical link free time of the first node, setting is routed the target after series by the first node
Data packet is sent to the surroundings nodes of the first node.
Optionally, when the target packet is silence data packet, the method also includes:
The first node, which judges to whether there is in data to be forwarded packet queue, number identical with the target packet
According to packet；
If so, data packet identical with the target packet in the data to be forwarded packet queue is deleted；
If it is not, then the first node abandons the target packet.
Optionally, described when the node address matches of the destination address of the target packet and the first node
Method further include:
The first node is by the corresponding target silence packets of the target packet to the surroundings nodes of the first node
Send preset times.
Optionally, described when the node address matches of the destination address of the target packet and the first node
Method further include:
The first node handles the target packet；
The corresponding response data of the target packet is sent to second node, the second node by the first node
For the source node for sending the target packet.
Optionally, when the routing series of the target packet reaches the default value, the method also includes:
The first node abandons the target packet.
Second aspect of the embodiment of the present invention provides a kind of terminal node, and the terminal node is first node, comprising:
Judging unit, for judging whether the target packet received is silence data packet；
The judging unit is also used to when the target packet is not silence data packet, judges that duplicate packages check team
Whether there is in column has data packet identical with the target packet；
The judging unit is also used to check that there is no identical with the target packet in queue when the duplicate packages
When data packet, whether the node address of the destination address and the first node that judge the target packet matches；
The judging unit is also used to the node address of the destination address and the first node when the target packet
When mismatch, judge whether the routing series of the target packet reaches default value；
Setting unit, for when the routing series of the target packet is not up to the default value, described in setting
The forwarding moment of target packet；
The judging unit judges the target packet if being also used to the current time is the forwarding moment
Life cycle whether exhaust；
The judging unit is also used to judge the first segment when the life cycle of the target packet does not exhaust
Whether the physical link of point is idle；
Transmission unit, for the mesh when the physical link free time of the first node, after setting to be routed to series
Data packet is marked to send to the surroundings nodes of the first node.
Optionally, it the judging unit: is also used to judge number to be forwarded when the target packet is silence data packet
There is data packet identical with the target packet according to whether there is in packet queue；
The terminal node further include: processing unit, the processing unit are used for:
When in the data to be forwarded packet queue there are when data packet identical with the target packet, will it is described to
Data packet identical with the target packet in data packet queue is forwarded to delete；
Or,
When being not present in the data to be forwarded packet queue has data packet identical with the target packet, then abandon
The target packet.
Optionally, the transmission unit is also used to destination address and the first node when the target packet
When node address matches, the corresponding target silence packets of the target packet are sent in advance to the surroundings nodes of the first node
If number.
Optionally, the processing unit is also used to destination address and the first node when the target packet
When node address matches, the target packet is handled；
With,
The corresponding response data of the target packet is sent to second node, the second node is to send the mesh
Mark the source node of data packet.
Optionally, the processing unit is also used to reach the default value when the routing series of the target packet
When, the first node abandons the target packet.
The 5th aspect of the embodiment of the present invention provides a kind of processor, and the processor is for running computer program, institute
The step of executing the data processing method and note transmission method as described in above-mentioned any one when stating computer program operation.
The 6th aspect of the embodiment of the present invention provides a kind of computer readable storage medium, is stored thereon with computer journey
Sequence, it is characterised in that: the computer program realizes data processing method described in above-mentioned any one when being executed by processor
The step of.
In conclusion terminal node is when sending data packet, due to each data in embodiment provided by the invention
The limitation of Bao Douyou degree of transitivity, after receiving each data packet, there is service life limitation, so a data coating is transmitted to one
After determining number, it can wither away, no longer be passed automatically, can ceaselessly be transmitted in a network to avoid data packet, network is caused to shake
It swings.
Detailed description of the invention
Fig. 1 is the embodiment schematic diagram of data processing method provided in an embodiment of the present invention；
Fig. 2 is the embodiment schematic diagram of terminal node provided in an embodiment of the present invention；
Fig. 3 is the hardware structural diagram of terminal node provided in an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those skilled in the art's every other implementation obtained without creative efforts
Example, shall fall within the protection scope of the present invention.
In Internet of Things, there are two kinds of communication nodes: one is the node referred to as concentrator or gateway, responsible and local
The data communication of other nodes in netting, another is terminal node, is responsible for the acquisition of terminal data, and is sent to concentrator.Collection
The communication of middle device to terminal node is downlink communication, and the communication of terminal node to concentrator is uplink communication.Between two kinds of nodes
It is master-slave relationship, concentrator is host node, and terminal node is from node.
The agreement of physical layer communication is illustrated below:
Version number: referring to the version number of agreement, convenient for the extension of later agreement；
Priority: being the transmission priority for defining data packet；
Source address: node address is sent out in the source of data packet；
Destination address: the data packet node address to be sent to；
Domain name: Domain Name, when for mark data transmission, local area network locating for node.In order to avoid different locals
Data packet communication forwarding between net, the data packet of Different LANs is distinguished with domain name.
Transaction number: the serial number of the data packet sent from source hair node is identified.Destination node is sent in response source hair node
When the data packet come, need to be consistent with request data package.
Command word: the concrete operations of identification data packet；
Data cell: the carrying data content to be transmitted.
For the communication link of terminal node in idle state, random competition time window is divided into 2 parts: priority slot
(Priority Slot, PS) and free competition time slot (Shared Contention Period, SCP), wherein priority slot
It can flexible configuration according to the actual situation with the length of free competition time slot.
Terminal node is when sending data packet, the data packet high for importance, priority slot transmission can be used, generally
Data packet is just sent in free competition time slot, and the high data packet of the importance is user according to specifically fixed using oneself
Justice.User thinks which data packet is critically important, it is necessary to preferentially be sent, is reliably sent to, that is just defined as the high number of priority
According to packet, such as alarm packet.
Referring to Fig. 1, Fig. 1 is one embodiment schematic diagram of data processing method provided in an embodiment of the present invention, specifically
Include:
101, whether the target packet that first node judgement receives is silence data packet, if so, thening follow the steps
109, if it is not, thening follow the steps 102.
In the present embodiment, which is terminal node, which, can be with after receiving target packet
Judging whether the target packet is silence data packet, wherein silence data packet refers to the data packet comprising command word 0xFF, when
When target packet is silence data packet, 109 are thened follow the steps, when target packet is not silence data packet, then executes step
Rapid 102.
It should be noted that above-mentioned be illustrated so that silence data packet is the data packet comprising command word 0xFF as an example, when
So it is also possible to comprising other command words, specifically without limitation, as long as can determine that as silence data packet.
102, when target packet is not silence data packet, first node judge duplicate packages check queue in whether include
There is data packet identical with target packet, if so, 109 are thened follow the steps, if it is not, thening follow the steps 103.
In the present embodiment, when determining target packet not is silence data packet, which can sentence first node
Disconnected duplicate packages check whether in queue include data packet identical with target packet, include if duplicate packages check in queue
When data packet identical with target packet, 109 are thened follow the steps, if it is not, thening follow the steps 103.
It should be noted that each terminal node contains, there are two queues:
1, duplicate packages check queue, save the data packet received；
2, data to be forwarded packet queue is received, the data packet to be forwarded to other nodes for saving.
Each terminal node includes that a duplicate packages check queue, and each element in queue includes following information: number
According to packet source address, packet rs destination address and data packet transaction number.
It is understood that judging that duplicate packages check in queue whether there is number identical with target packet in step 102
According to packet, be by judge duplicate packages check the source data packet address of each data packet in queue, packet rs destination address and
Whether data packet transaction number is identical simultaneously as target packet source address, destination address and transaction number, if identical simultaneously, really
It is scheduled on duplicate packages and checks in queue there is data packet identical with target packet, if identical when different, it is determined that duplicate packages inspection
Data packet not identical with target packet in queue.
103, when duplicate packages check, and data packet identical with target packet is not present in queue, first node judges mesh
Whether the node address of the destination address and first node of marking data packet matches, if so, 109 are executed, if it is not, then executing step
Rapid 104.
In the present embodiment, first node is not present in the identical data of target packet in determining duplicate packages inspection queue
The target packet can be added duplicate packages and checked in queue and sentenced to re-start after subsequently received data packet by Bao Shi
It is disconnected, and judge whether the destination address of the target packet matches with the node address of the first node, that is to say, that judgement should
Whether target packet is destined to the data packet of first node, if so, 109 are thened follow the steps, if it is not, thening follow the steps 104.
104, when the node address of the destination address of target packet and first node mismatches, first node judges mesh
Whether the routing series of mark data packet reaches default value, if so, 109 are thened follow the steps, if it is not, thening follow the steps 105.
In the present embodiment, first node the destination address and first node that determine the target packet node address not
When matching, it can be determined that whether the routing series of the target packet reaches default value (for example, 10 times, naturally it is also possible to be
Other numerical value, depending on application), that is to say, that the routing series of the target packet referred to is exactly the target
The number that data packet is forwarded, the default value are exactly the maximum value that the target packet is forwarded number, work as target packet
Routing series when reaching default value, then follow the steps 109, if the routing series of target packet is not up to default value,
Then follow the steps 105.
105, when the routing series of target packet is not up to default value, turning for target packet is arranged in first node
Send out the moment.
In the present embodiment, when the routing series of target packet is not up to default value, which is arranged target
The forwarding moment of data packet, specifically, in order to avoid repeat, can within a period of time for receiving target packet (example
In 1000 milliseconds), using the UID (Unique Node ID) of oneself as seed, a forwarding moment, the forwarding are generated at random
Moment is the sending instant of target packet.
If 106, current time is the forwarding moment, judge whether the life cycle of target packet exhausts, if so, holding
Row step 109, if it is not, thening follow the steps 107.
In the present embodiment, after forwarding moment of the first node in setting target packet, current time can be monitored,
If current time is the forwarding moment, judge whether the life cycle of target packet exhausts, if the week in service life of target packet
Phase exhausts, and thens follow the steps 109, if the life cycle of target packet does not exhaust, thens follow the steps 107.
It is understood that a life cycle can be arranged for data packet, (life cycle of the data packet is each end
End node is after receiving data packet, a regular time value of imparting, such as 2 seconds, during this period of time, if data packet exists
It cannot be forwarded away in this regular time, just abandon, illustrate that the communication link environment of the terminal node is crowded, Wu Fazhuan
Hair), that is to say, that in the life cycle of data packet, the data packet be it is effective, if being more than the life cycle of data packet,
Then the data packet is exactly invalid.
It, can be with by step 106 it should be noted that forwarding moment of target packet can be set by step 105
Judge whether the life cycle of target packet exhausts, however the not limitation of successive execution sequence between the two steps,
Step 105 can be first carried out, step 106 can also be first carried out, or be performed simultaneously, specifically without limitation.
107, when the life cycle of target packet does not exhaust, then first node judges that the physical link of first node is
The no free time, if so, 108 are thened follow the steps, if it is not, step 109.
In the present embodiment, when the life cycle of the target packet does not exhaust, it can be determined that the physics of the first node
Whether link is idle, when the physical link free time of first node, thens follow the steps 108, if the physical link of first node is numerous
Busy, step 109.
It should be noted that first node can also judge the different degree of the target packet whether reach by it is preferential when
The degree that gap is sent, if so, directly the target packet is sent by priority slot, if it is not, then passing through free competition time slot
Send target packet.
108, when the physical link free time of first node, first node will setting routing series after target packet to
The surroundings nodes of first node are sent.
In the present embodiment, when the physical link free time of first node, after setting can be routed series by first node
Target packet to the surroundings nodes of first node send, it is to be understood that in order to prevent target data in a local network
It is ceaselessly forwarded, causes network oscillation, routing series namely the every forwarding of target packet of target packet can be set
Once, i.e., on routing series plus 1, when the routing series of target packet reaches max-forwards number, then the target data
Packet is no longer forwarded, and is directly abandoned.
109, other operations are executed.
In the present embodiment, when target packet is silence data packet, first node judges in data to be forwarded packet queue
Whether there is identical with target packet data packet (it is understood that herein identical refers to source data packet address, data
Packet destination address and data packet transaction number are identical), when there are identical with target packet in data to be forwarded packet queue
When data packet, then illustrate, the target packet has been received in first node, then will by the data to be forwarded packet queue with mesh
It marks the identical data packet of data packet to delete, no longer be forwarded, when there is no have and target data in data to be forwarded packet queue
When wrapping identical data packet, then the target packet is abandoned, is not processed；
When duplicate packages, which check, is present in the identical data packet of target packet in queue, then the target packet is abandoned；
When the node address matches of the destination address of target packet and first node, then the target data can be determined
The data packet of first node is sent to when packet, at this point, target packet ceaselessly forwards in a local network in order to prevent, first segment
The corresponding target silence packets of target packet can be sent preset times to the node around first node by point, be sent default time
Several purposes is that the node of surrounding in order to prevent does not receive the target silence packets, is still ceaselessly forwarding the target data
Packet, causes link circuit resource to waste；In addition, determining destination address and the first node address of the target packet in first node
Timing, the first node can be handled target packet, and obtain the source address carried in target packet, and pass through
The response data of target packet is sent to second node by source address, which is the source section for sending target packet
Point；
When the routing series of target packet reaches default value, then the target packet is abandoned；
When the physical link of first node is busy, then wait the physical link of first node idle, in the process of waiting
In, it is also necessary to ceaselessly judge whether the life cycle of the target packet exhausts and the forwarding moment of the target packet is
It is no to reach, if so, abandon the target packet, if it is not, then waiting the physical link of first node idle and to first node
Surroundings nodes send the target packet.
In conclusion terminal node is when sending data packet, due to each data in embodiment provided by the invention
The limitation of Bao Douyou degree of transitivity, after receiving each data packet, there is service life limitation, so a data coating is transmitted to one
After determining number, it can wither away, no longer be passed automatically, can ceaselessly be transmitted in a network to avoid data packet, network is caused to shake
It swings.
The data processing method in the embodiment of the present invention is described above, below to the end in the embodiment of the present invention
End node is described, referring to Fig. 2, Fig. 2 is one embodiment schematic diagram of terminal node in the embodiment of the present invention, the terminal
Node is first node, is specifically included:
Judging unit 201, for judging whether the target packet received is silence data packet；
The judging unit 201 is also used to judge duplicate packages inspection when the target packet is not silence data packet
Whether there is in queue has data packet identical with the target packet；
The judging unit 201 is also used to be not present and the target packet phase when the duplicate packages check in queue
With data packet when, whether the node address of the destination address and the first node that judge the target packet matches；
The judging unit 201 is also used to the node of the destination address and the first node when the target packet
When address mismatches, judge whether the routing series of the target packet reaches default value；
Setting unit 202, for institute to be arranged when the routing series of the target packet is not up to the default value
State the forwarding moment of target packet；
The judging unit 201 judges the target data if being also used to the current time is the forwarding moment
Whether the life cycle of packet exhausts；
The judging unit 201 is also used to judge described first when the life cycle of the target packet does not exhaust
Whether the physical link of node is idle；
Transmission unit 203, for it when the physical link free time of the first node, will be arranged after routing series described in
Target packet is sent to the surroundings nodes of the first node.
Optionally, it the judging unit 201: is also used to judge when the target packet is silence data packet wait turn
Whether there is in hair data packet queue has data packet identical with the target packet；
The terminal node further include: processing unit 204, the processing unit 204 are used for:
When in the data to be forwarded packet queue there are when data packet identical with the target packet, will it is described to
Data packet identical with the target packet in data packet queue is forwarded to delete；
Or,
When being not present in the data to be forwarded packet queue has data packet identical with the target packet, then abandon
The target packet.
Optionally, the transmission unit 203 is also used to destination address and the first node when the target packet
Node address matches when, by the corresponding target silence packets of the target packet to the surroundings nodes of the first node send
Preset times.
Optionally, the processing unit 204 is also used to destination address and the first node when the target packet
Node address matches when, the target packet is handled；
With,
The corresponding response data of the target packet is sent to second node, the second node is to send the mesh
Mark the source node of data packet.
Optionally, the processing unit 204 is also used to reach the preset number when the routing series of the target packet
When value, the first node abandons the target packet.
In conclusion in embodiment provided by the invention, terminal node is sending data in embodiment provided by the invention
When packet, since each data packet has degree of transitivity limitation, after receiving each data packet, there are service life limitation, institute
After being transmitted to certain number with a data coating, it can wither away, no longer be passed automatically, it can be to avoid data packet in a network
It ceaselessly transmits, causes network oscillation.
It should be noted that in the above-described embodiments, all emphasizing particularly on different fields to the description of each embodiment, in some embodiment
The part being not described in may refer to the associated description of other embodiments.
Referring to Fig. 3, the terminal node includes processor 301 the embodiment of the invention also provides a kind of terminal node
With memory 302, the units such as above-mentioned judging unit, setting unit, transmission unit and processing unit are used as program unit to store
In the memory 302, above procedure unit stored in memory is executed by processor to realize corresponding function.
Include kernel in processor 301, is gone in memory 302 to transfer corresponding program unit by kernel.Kernel can be set
One or more is set, user data is updated by adjusting kernel parameter.
Memory 302 may include the non-volatile memory in computer-readable medium, random access memory (RAM)
And/or the forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM), memory includes at least one
Storage chip.
The embodiment of the invention provides a kind of storage mediums, are stored thereon with program, real when which is executed by processor
The step of existing data processing method.
The embodiment of the invention provides a kind of processor, the processor is for running program, wherein described program operation
Described in Shi Zhihang the step of data processing method.
Present invention also provides a kind of computer program products, when executing on data processing equipment, are adapted for carrying out just
Beginningization executes the step of data processing method:
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application be referring to the method for the embodiment of the present application, equipment (system) and computer program product flow chart and/
Or block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/
Or the combination of the process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions
To general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
A machine so that by the instruction that the processor of computer or other programmable data processing devices executes generate for realizing
The device for the function of being specified in one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable Jie
The example of matter.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices
Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates
Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including element
There is also other identical elements in process, method, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can provide as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to the foregoing embodiments
Invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each implementation
Technical solution documented by example is modified or equivalent replacement of some of the technical features；And these modification or
Replacement, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (10)
1. a kind of data processing method characterized by comprising
Whether the target packet that first node judgement receives is silence data packet；
If it is not, then the first node judges that duplicate packages check to whether there is in queue have number identical with the target packet
According to packet；
When the duplicate packages check, and data packet identical with the target packet is not present in queue, the first node is sentenced
Whether the destination address for the target packet of breaking matches with the node address of the first node；
When the node address of the destination address of the target packet and the first node mismatches, the first node is sentenced
Whether the routing series for the target packet of breaking reaches default value；
When the routing series of the target packet is not up to the default value, the number of targets is arranged in the first node
According to the forwarding moment of packet；
If the current time is the forwarding moment, judge whether the life cycle of the target packet exhausts；
When the life cycle of the target packet does not exhaust, then the first node judges the physics chain of the first node
Whether road is idle；
When the physical link free time of the first node, setting is routed the target data after series by the first node
It wraps and is sent to the surroundings nodes of the first node.
2. the method according to claim 1, wherein when the target packet be silence data packet when, it is described
Method further include:
The first node, which judges to whether there is in data to be forwarded packet queue, data packet identical with the target packet；
If so, data packet identical with the target packet in the data to be forwarded packet queue is deleted；
If it is not, then the first node abandons the target packet.
3. the method according to claim 1, wherein working as the destination address and described first of the target packet
When the node address matches of node, the method also includes:
The first node sends the corresponding target silence packets of the target packet to the surroundings nodes of the first node
Preset times.
4. the method according to claim 1, wherein working as the destination address and described first of the target packet
When the node address matches of node, the method also includes:
The first node handles the target packet；
The corresponding response data of the target packet is sent to second node by the first node, and the second node is hair
Send the source node of the target packet.
5. the method according to claim 1, wherein the routing series when the target packet reaches described pre-
When setting value, the method also includes:
The first node abandons the target packet.
6. a kind of terminal node, the terminal node is first node characterized by comprising
Judging unit, for judging whether the target packet received is silence data packet；
The judging unit is also used to when the target packet is not silence data packet, judges that duplicate packages check in queue
With the presence or absence of there is data packet identical with the target packet；
The judging unit is also used to check that there is no data identical with the target packet in queue when the duplicate packages
Whether the node address of Bao Shi, the destination address for judging the target packet and the first node match；
The judging unit, be also used to when the target packet destination address and the first node node address not
Timing, judges whether the routing series of the target packet reaches default value；
Setting unit, for the target to be arranged when the routing series of the target packet is not up to the default value
The forwarding moment of data packet；
The judging unit judges the longevity of the target packet if being also used to the current time is the forwarding moment
Whether the life period exhausts；
The judging unit is also used to judge the first node when the life cycle of the target packet does not exhaust
Whether physical link is idle；
Transmission unit, for the number of targets when the physical link free time of the first node, after setting to be routed to series
It is sent according to packet to the surroundings nodes of the first node.
7. terminal node according to claim 6, which is characterized in that the judging unit: being also used to when the number of targets
When according to packet being silence data packet, judge in data to be forwarded packet queue with the presence or absence of there are data identical with the target packet
Packet；
The terminal node further include: processing unit, the processing unit are used for:
When in the data to be forwarded packet queue there are when data packet identical with the target packet, will be described to be forwarded
Data packet identical with the target packet is deleted in data packet queue；
Or,
When being not present in the data to be forwarded packet queue has data packet identical with the target packet, then described in discarding
Target packet.
8. terminal node according to claim 6, which is characterized in that the transmission unit is also used to when the number of targets
According to packet destination address and the first node node address matches when, by the corresponding target silence packets of the target packet
Preset times are sent to the surroundings nodes of the first node.
9. a kind of processor, the processor executes such as right for running computer program when the computer program is run
It is required that the step of method described in any one of 1-5.
10. a kind of computer readable storage medium, is stored thereon with computer program, it is characterised in that: the computer program
The step of method according to any one of claims 1 to 5 is realized when being executed by processor.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201821785798 | 2018-10-31 | ||
| CN2018217857985 | 2018-10-31 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109861916A true CN109861916A (en) | 2019-06-07 |
| CN109861916B CN109861916B (en) | 2021-08-31 |
Family
ID=66895041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910042242.XA Active CN109861916B (en) | 2018-10-31 | 2019-03-13 | Data processing method and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109861916B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110650087A (en) * | 2019-10-09 | 2020-01-03 | 四川灵通电讯有限公司 | Grid network and data forwarding type reliable transmission method applying grid network |
| CN112671771A (en) * | 2020-12-24 | 2021-04-16 | 上海银基信息安全技术股份有限公司 | Data transmission method, device, electronic equipment and medium |
| CN113163346A (en) * | 2021-04-21 | 2021-07-23 | 成都锐成芯微科技股份有限公司 | Broadcast packet filtering method and wireless communication system |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6985476B1 (en) * | 2001-08-20 | 2006-01-10 | Bbnt Solutions Llc | Automatic setting of time-to-live fields for packets in an ad hoc network |
| CN101272351A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Packet processing method and switchboard |
| CN101373556A (en) * | 2007-08-23 | 2009-02-25 | 瑞斯康微电子（深圳）有限公司 | Method for transmitting and receiving low pressure carrier wave centralized type network and apparatus thereof |
| CN101635974A (en) * | 2009-09-09 | 2010-01-27 | 东南大学 | Self-organizing cognitive wireless network routing method |
| CN101888682A (en) * | 2010-04-21 | 2010-11-17 | 东南大学 | Method for realizing wireless personal area network routing protocol based on ultra-wide band positioning assist |
| CN102076052A (en) * | 2010-12-31 | 2011-05-25 | 深圳市北川电子有限公司 | Automatic relay route method |
| CN102752027A (en) * | 2012-08-01 | 2012-10-24 | 郑州航天赛世特电子有限公司 | Pure flooding adaptive low-voltage power line carrier communication unit |
| CN103687080A (en) * | 2013-08-30 | 2014-03-26 | 江苏沙湖科技发展有限公司 | A Zigbee dynamic networking method |
| CN105847278A (en) * | 2016-05-03 | 2016-08-10 | 杭州寒舍科技有限公司 | Distributed self-adaptive transmission routing protocol |
| CN106034341A (en) * | 2015-03-13 | 2016-10-19 | 北京信威通信技术股份有限公司 | Active routing forwarding method based on cooperative diversity |
| US20160359736A1 (en) * | 2014-02-19 | 2016-12-08 | Huawei Technologies Co., Ltd. | Data Packet Forwarding Method, Apparatus, and System |
| CN107196855A (en) * | 2017-05-10 | 2017-09-22 | 深圳讯智物联科技有限公司 | A kind of method for rapidly converging of flood networking |
-
2019
- 2019-03-13 CN CN201910042242.XA patent/CN109861916B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6985476B1 (en) * | 2001-08-20 | 2006-01-10 | Bbnt Solutions Llc | Automatic setting of time-to-live fields for packets in an ad hoc network |
| CN101373556A (en) * | 2007-08-23 | 2009-02-25 | 瑞斯康微电子（深圳）有限公司 | Method for transmitting and receiving low pressure carrier wave centralized type network and apparatus thereof |
| CN101272351A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Packet processing method and switchboard |
| CN101635974A (en) * | 2009-09-09 | 2010-01-27 | 东南大学 | Self-organizing cognitive wireless network routing method |
| CN101888682A (en) * | 2010-04-21 | 2010-11-17 | 东南大学 | Method for realizing wireless personal area network routing protocol based on ultra-wide band positioning assist |
| CN102076052A (en) * | 2010-12-31 | 2011-05-25 | 深圳市北川电子有限公司 | Automatic relay route method |
| CN102752027A (en) * | 2012-08-01 | 2012-10-24 | 郑州航天赛世特电子有限公司 | Pure flooding adaptive low-voltage power line carrier communication unit |
| CN103687080A (en) * | 2013-08-30 | 2014-03-26 | 江苏沙湖科技发展有限公司 | A Zigbee dynamic networking method |
| US20160359736A1 (en) * | 2014-02-19 | 2016-12-08 | Huawei Technologies Co., Ltd. | Data Packet Forwarding Method, Apparatus, and System |
| CN106034341A (en) * | 2015-03-13 | 2016-10-19 | 北京信威通信技术股份有限公司 | Active routing forwarding method based on cooperative diversity |
| CN105847278A (en) * | 2016-05-03 | 2016-08-10 | 杭州寒舍科技有限公司 | Distributed self-adaptive transmission routing protocol |
| CN107196855A (en) * | 2017-05-10 | 2017-09-22 | 深圳讯智物联科技有限公司 | A kind of method for rapidly converging of flood networking |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110650087A (en) * | 2019-10-09 | 2020-01-03 | 四川灵通电讯有限公司 | Grid network and data forwarding type reliable transmission method applying grid network |
| CN112671771A (en) * | 2020-12-24 | 2021-04-16 | 上海银基信息安全技术股份有限公司 | Data transmission method, device, electronic equipment and medium |
| CN112671771B (en) * | 2020-12-24 | 2024-01-19 | 上海银基信息安全技术股份有限公司 | Data transmission method, device, electronic equipment and medium |
| CN113163346A (en) * | 2021-04-21 | 2021-07-23 | 成都锐成芯微科技股份有限公司 | Broadcast packet filtering method and wireless communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109861916B (en) | 2021-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109861916A (en) | A kind of data processing method and relevant device | |
| US9596187B2 (en) | Time-triggered Ethernet-based data transmission method and node device | |
| CN109936640A (en) | From the address distribution method and device of node device | |
| CN104348677A (en) | Deep packet inspection method and equipment and coprocessor | |
| CN108809759A (en) | Detect the method, apparatus and router of link state | |
| CN109586959B (en) | Fault detection method and device | |
| US11172016B2 (en) | Device, method and system to enforce concurrency limits of a target node within a network fabric | |
| CN106789638A (en) | A kind of method and the network equipment for processing route | |
| CN108028781A (en) | Technology for network round-trip time estimation | |
| CN111801911A (en) | Traffic function chain congestion tracking | |
| KR101558833B1 (en) | Techniques for forwarding or receiving data segments associated with a large data packet | |
| EP3097662A1 (en) | Methods, systems and computer readable media for testing network devices using simulated application traffic | |
| CN114978600B (en) | Abnormal flow processing method, system, equipment and storage medium | |
| EP3166273B1 (en) | Method and system for processing service node ability | |
| CN104869062A (en) | Data packet forwarding method and device | |
| CN105634842B (en) | A kind of method, apparatus and system of detection bandwidth | |
| CN100579075C (en) | Method for rapid response to ICMP echo request message | |
| Hajji et al. | Dynamic network function chain composition for mitigating network latency | |
| CN103488530B (en) | A kind of lock moving method and device | |
| US11960943B2 (en) | Event log management | |
| EP4198726A1 (en) | Event log management | |
| US9385935B2 (en) | Transparent message modification for diagnostics or testing | |
| US8774195B2 (en) | Using probabilistic values for routing data packets on a data center network | |
| Sherwin et al. | Reducing the latency of OpenFlow rule changes in data centre networks | |
| Mishra et al. | Empirical study of dynamics of amoebiasis transmission in mobile ad hoc networks (MANETs) |
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 |