CN114615238A - Lightweight network layer MTLink protocol suitable for embedded system - Google Patents

Lightweight network layer MTLink protocol suitable for embedded system Download PDF

Info

Publication number
CN114615238A
CN114615238A CN202210235379.9A CN202210235379A CN114615238A CN 114615238 A CN114615238 A CN 114615238A CN 202210235379 A CN202210235379 A CN 202210235379A CN 114615238 A CN114615238 A CN 114615238A
Authority
CN
China
Prior art keywords
packet
data
node
network
protocol
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210235379.9A
Other languages
Chinese (zh)
Inventor
田辰
王娇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Shenghai Huize Technology Co ltd
Original Assignee
Beijing Shenghai Huize Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Shenghai Huize Technology Co ltd filed Critical Beijing Shenghai Huize Technology Co ltd
Priority to CN202210235379.9A priority Critical patent/CN114615238A/en
Publication of CN114615238A publication Critical patent/CN114615238A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/26Special purpose or proprietary protocols or architectures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1004Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40Bus networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/06Notations for structuring of protocol data, e.g. abstract syntax notation one [ASN.1]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40Bus networks
    • H04L2012/40208Bus networks characterized by the use of a particular bus standard
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W80/00Wireless network protocols or protocol adaptations to wireless operation
    • H04W80/04Network layer protocols, e.g. mobile IP [Internet Protocol]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a lightweight network layer MTLink protocol suitable for an embedded system, belonging to the technical field of wireless and wired network communication with different physical layer mixture, comprising: (1): the MTLink protocol manages the current state of data through a PSTATE byte so as to realize packet loss retransmission, non-response and long packet judgment of data response and read or write data by a sender; (2): and (4) simple data packet loss retransmission is realized through an ACK (acknowledgement) bit of PSTATE. The invention has the advantages of high efficiency, simple and convenient networking mechanism, flexible network configuration, strong network stability, less occupied resources, greatly improved reliability of large data transmission, no waste of communication opportunities each time, less occupied communication resources, high efficiency, easy network cross-medium communication, low requirement of a protocol on a physical layer, capability of sending 60 bytes of data by an RF module at a time, capability of automatically configuring and subpackaging the data by an MTLink protocol and good compatibility.

Description

Lightweight network layer MTLink protocol suitable for embedded system
Technical Field
The invention belongs to the technical field of wireless and wired network communication with different physical layers, and particularly relates to a lightweight network layer MTLink protocol applicable to an embedded system.
Background
The network layer is an information processing system located at the second layer of the three-layer structure of the internet of things, and the function of the network layer is 'transmission', namely information transmission is carried out through a communication network.
The bluetooth protocol with low power consumption adopted in the prior art has limited data transmission speed and cannot be further improved to a certain extent, and if data is lost in the data transmission process, the packet loss rate of a bus is higher, and the compatibility is poorer.
Based on the above, the invention designs a lightweight network layer MTLink protocol suitable for an embedded system to solve the above problems.
Disclosure of Invention
The invention aims to: the light-weight network layer MTLink protocol is suitable for an embedded system and aims to solve the problems that the data transmission speed of a low-power-consumption Bluetooth protocol adopted in the prior art is limited and cannot be further improved to a certain extent, and if data are lost in the data transmission process, the bus loss rate is high and the compatibility is poor.
In order to achieve the purpose, the invention adopts the following technical scheme:
a lightweight network layer MTLink protocol for embedded systems, comprising:
(1): the MTLink protocol manages the current state of data through a PSTATE byte so as to realize packet loss retransmission, non-response and long packet judgment of data response and read or write data by a sender;
(2): the simple data packet loss retransmission is realized through a response ACK bit of PSTATE;
(3): the large data transmission mechanism can reduce the error rate under a limited communication channel under the condition that the physical layer packet length is limited or the error rate is improved due to the overlong sent data packet, and can only occupy 11-bit resources, so that the transmission speed of the large data packet after protocol coding is only reduced by 1%, the response only occupies the bus transmission bandwidth, and the data transmission efficiency is high;
(4): the method comprises the steps of predefining networking functions, wherein logic required by lightweight networking is added on the basis of the protocol frame format, and a set of efficient networking mechanism with nodes configured in advance is designed for improving the bus utilization rate and considering the stability of networking across different physical layers.
As a further description of the above technical solution:
the long packet judgment content includes a start packet, a process packet, and an end packet.
As a further description of the above technical solution:
the simple data packet loss retransmission specifically realizes the logic as follows:
step 1: firstly, a sender sends data, and the ACK position is 1 to wait for the response of a receiver;
step 2: then the receiver sends a response packet after receiving the data, and the sender waits for receiving the response packet all the time, which indicates that the data is successfully sent;
step 3: if the data packet is not received within the time-out, the data packet is sent again, the steps are repeated for three times, no response packet is received in the three times in the communication process, the communication failure is indicated, and a communication failure log is returned.
As a further description of the above technical solution:
the specific transmission mechanism of the big data transmission mechanism is as follows:
step 1: firstly, an ES position 1, an SL position 1 and RPC bytes of a sender are set as a packet number N to be transmitted after big data is packetized to send a first packet, and a receiver receives and checks the received packet and makes a response;
step 2: after the first packet is successfully sent, the RPC-1, the ES position 0 and the SL position 1 are sent by the sender, and then the second packet is sent, and the N-1 packet is sent by the same method;
step 3: and finally, the sender sends the last packet, the sender RPC =0, the ES position 3 and the SL position 1 send the last packet, the receiver checks after receiving the last packet, and the long message packet is successfully sent after the last packet passes the post-response.
As a further description of the above technical solution:
and after the big data message is packetized, each packet transmission process is multiplexed with a simple data packet loss retransmission mechanism.
As a further description of the above technical solution:
and when 100k of data is transmitted, the transmission limit of each packet is 1k bytes, the RPC is equal to 100, and the RPC +1 cannot be divided.
As a further description of the above technical solution:
and the receiver receives and checks, RPC judges whether the data is continuous or not, and CRC checks whether the data passes or not.
As a further description of the above technical solution:
the predefined networking functionality mechanism is illustrated as follows:
step 1: the network node defines: the network defines three nodes, one is a routing node, one is a common node, the other is a main node, and the common node is a child node of the routing node;
step 2: a networking mechanism: each routing node has a routing table, the routing table contains all IDs of all ordinary nodes connected with the routing node and current network quality, whether the routing node is in fault or not, the ordinary nodes send heartbeat messages to the routing node through an OBJECT =0XF001 command, the interval is 1s, the data content is Count of one byte added each time, the data is sent to the routing node, the routing node judges the network quality of each sub-node through the received Count, the connection condition data, any node in the network can read the routing table stored by the routing node through OBJECT =0XF000, the network information is intercommunicated, in the whole network communication, each node can send and receive data to all other nodes through the network, at the moment, the routing node judges the optimal forwarding path through judging DID (destination ID, namely receiver ID) in a frame format, and forwards the messages to other routing nodes, there are some simple mechanisms for forwarding the coordinated link load until the destination node.
As a further description of the above technical solution:
the common node only has one communication link and is connected to the routing node, similar to terminal equipment in network communication, the routing node is used as a relay, forwarding coordination and node for collecting network conditions of the nearby nodes, and the common node is also a terminal equipment and has the same function as the common node, so that the waste of hardware equipment can be greatly reduced, and resources are saved.
As a further description of the above technical solution:
the main node is a node summarized by the whole network, has the highest priority, and gives consideration to log collection, network monitoring and summary of the working condition of the whole network, whether each node is active or not, whether a link is damaged or not and the like, the main node can not be configured in the link, the relationship of the three nodes is that the main node is connected with a plurality of routing nodes or common nodes, the routing nodes are connected with a plurality of common nodes, and the common nodes are terminal nodes and are only connected with one routing node.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. the invention has the advantages of high efficiency, simple and convenient networking mechanism, flexible network configuration, strong network stability, less occupied resources, greatly improved reliability of large data transmission, no waste of communication opportunities each time, less occupied communication resources, high efficiency, easy network cross-medium communication, low requirement of a protocol on a physical layer, capability of sending 60 bytes of data by an RF module at a time, capability of automatically configuring and subpackaging the data by an MTLink protocol and good compatibility.
2. Compared with an HCI layer and an L2CAP layer in a low-power-consumption Bluetooth protocol, the MTLink protocol frame format is simple, the protocol only occupies 11 bytes, networking communication can be realized directly on a physical layer, the power consumption is lower, and the transmission efficiency is higher.
3. In the invention, the transmission efficiency of the big data transmission sub-package is high, compared with the light-weight CANOPEN protocol in actual measurement, the transmission rate is only 20kb/s at the rate of 500K of the CAN bus, while the protocol CAN reach 40kb/s, the transmission efficiency of the big data transmission sub-package is high by one time of rate improvement, compared with the light-weight CANOPEN protocol in actual measurement, the transmission rate is only 20kb/s at the rate of 500K of the CAN bus, while the protocol CAN reach 40kb/s and the rate is improved by one time.
4. In the invention, the MTLink protocol gives consideration to data verification and data packet loss retransmission, stable communication CAN be realized even under the condition that the bus packet loss rate is 20%, the MTLink protocol CAN be used in both wired (CAN, USART and USB) or wireless (RF, 5G and 2.4G), a plurality of communication combination modes are allowed in the network, the data interconnection and intercommunication are convenient, and the use is flexible.
Drawings
FIG. 1 is a schematic diagram of an MtLink protocol frame format in a lightweight network layer MTLink protocol suitable for an embedded system according to the present invention;
FIG. 2 is a schematic diagram showing the meaning of each field of MTLink protocol in a lightweight network layer MTLink protocol suitable for an embedded system according to the present invention;
FIG. 3 is a schematic diagram of PSTATE byte definition in a lightweight network layer MTLink protocol applicable to an embedded system according to the present invention;
fig. 4 is a schematic diagram of packet loss retransmission of the simple red data packet of the MTLink protocol in the lightweight network layer applicable to the embedded system according to the present invention;
FIG. 5 is a logic diagram of a big data transmission mechanism in a lightweight network layer MTLink protocol suitable for an embedded system according to the present invention;
fig. 6 is a schematic diagram of networking in a lightweight network layer MTLink protocol suitable for an embedded system according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-6, the present invention provides a technical solution: a lightweight network layer MTLink protocol for embedded systems, comprising:
(1): the MTLink protocol manages the current state of data through a PSTATE byte so as to realize packet loss retransmission, non-response and long packet judgment of data response and read or write data by a sender;
(2): the simple data packet loss retransmission is realized through a response ACK bit of PSTATE;
(3): the big data transmission mechanism enables the big data message to be automatically transmitted and used in a sub-packet mode under the condition that the physical layer packet length is limited or the error rate is improved due to the fact that the sent data packet is too long, the error rate can be reduced under the limited communication channel, and because only 11-bit resources are occupied, the transmission speed of the big data sub-packet after being coded by a protocol is reduced by 1%, the response only occupies the bus transmission bandwidth, and the data transmission efficiency is high;
(4): the method comprises the steps of predefining networking functions, wherein logic required by lightweight networking is added on the basis of the protocol frame format, and a set of efficient networking mechanism with nodes configured in advance is designed for improving the bus utilization rate and considering the stability of networking across different physical layers.
Specifically, the long packet judgment content includes a start packet, a process packet, and an end packet.
Specifically, the simple packet loss retransmission implementation logic is as follows:
step 1: firstly, a sender sends data, and the ACK position is 1 to wait for the response of a receiver;
step 2: then the receiver sends a response packet after receiving the data, and the sender waits for receiving the response packet all the time, which indicates that the data is successfully sent;
step 3: if the data packet is not received within the time-out, the data packet is sent again, the steps are repeated for three times, no response packet is received in the three times in the communication process, the communication failure is indicated, and a communication failure log is returned.
Specifically, the specific transmission mechanism of the big data transmission mechanism is as follows:
step 1: firstly, an ES position 1, an SL position 1 and RPC bytes of a sender are set as a packet number N to be transmitted after big data is packetized to send a first packet, and a receiver receives and checks the received packet and makes a response;
step 2: after the first packet is successfully sent, the sender RPC-1, ES position 0 and SL position 1 send the second packet, and so on, send the N-1 packet;
step 3: and finally, the sender sends the last packet, the sender RPC =0, the ES position 3 and the SL position 1 send the last packet, the receiver checks after receiving the last packet, and the long message packet is successfully sent after the last packet passes the post-response.
Specifically, after the big data packet is packetized, each packet transmission process multiplexes a simple data packet loss retransmission mechanism.
Specifically, when 100k of data is transmitted, each packet is limited to 1k bytes, RPC equals 100, and RPC +1 cannot be divided.
Specifically, the receiver receives and checks, the RPC determines whether the CRC is continuous, and the CRC check passes.
Specifically, the predefined networking function mechanism is described as follows:
step 1: the network node defines: the network defines three nodes, one is a routing node, one is a common node, the other is a main node, and the common node is a child node of the routing node;
step 2: a networking mechanism: each routing node has a routing table, the routing table contains all IDs of all ordinary nodes connected with the routing node and current network quality, whether the routing node is in fault or not, the ordinary nodes send heartbeat messages to the routing node through an OBJECT =0XF001 command, the interval is 1s, the data content is Count of one byte added each time, the data is sent to the routing node, the routing node judges the network quality of each sub-node through the received Count, the connection condition data, any node in the network can read the routing table stored by the routing node through OBJECT =0XF000, the network information is intercommunicated, in the whole network communication, each node can send and receive data to all other nodes through the network, at the moment, the routing node judges the optimal forwarding path through judging DID (destination ID, namely receiver ID) in a frame format, and forwards the messages to other routing nodes, there are some simple mechanisms for forwarding the coordinated link load until the destination node.
Specifically, the common node has only one communication link connected to the routing node, and similar to a terminal device in network communication, the routing node is used as a relay, a node for forwarding coordination and collecting network conditions of nearby nodes, and the routing node is also a terminal device, and has the same function as the common node, so that waste of hardware devices can be greatly reduced, and resources are saved.
Specifically, the master node is a node summarized by the whole network, has the highest priority, and gives consideration to log collection, network monitoring, summary of the working condition of the whole network, whether each node is active, whether a link is damaged, and the like, the master node can not be configured in the link, the relationship of the three nodes is that the master node is connected with a plurality of routing nodes or common nodes, the routing nodes are connected with a plurality of common nodes, and the common nodes are terminal nodes and are only connected with one routing node.
The working principle is as follows: when in use:
the simple implementation mode for establishing the mtlink communication network is as follows:
step 1: selecting three development boards, connecting CAN1 with IDs of 1, 2 and 3 and connecting the IDs 1 and 2, connecting CAN2 with IDs 2 and 3, and turning on respective communication links, wherein the IDs 1 and the ID3 do not have communication links which are communicated;
step 2: writing an mtlink protocol, respectively hanging three board sub-physical layers on connected CAN lines, configuring ID2 as a routing node, configuring ID1 and ID3 as common nodes, configuring a routing table of ID2, wherein the routing table comprises the three IDs, and establishing a simple local area network;
step 3: ID3 obtains the network status from ID2, and checks whether the networks of the three IDs are normally connected;
step 4: if the third step checks that the status of each network node is good, a message is sent from ID3 to ID1 to check whether ID1 can receive the data of ID 3. To this end a simple network communication has been implemented.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.

Claims (10)

1. A lightweight MTLink protocol for embedded systems, comprising:
(1): the MTLink protocol manages the current state of data through a PSTATE byte so as to realize packet loss retransmission, non-response and long packet judgment of data response and read or write data by a sender;
(2): the simple data packet loss retransmission is realized through a response ACK bit of PSTATE;
(3): the large data transmission mechanism can reduce the error rate under a limited communication channel under the condition that the physical layer packet length is limited or the error rate is improved due to the overlong sent data packet, and can only occupy 11-bit resources, so that the transmission speed of the large data packet after protocol coding is only reduced by 1%, the response only occupies the bus transmission bandwidth, and the data transmission efficiency is high;
(4): the method comprises the steps of predefining networking functions, wherein logic required by lightweight networking is added on the basis of the protocol frame format, and a set of efficient networking mechanism with nodes configured in advance is designed for improving the bus utilization rate and considering the stability of networking across different physical layers.
2. The MTLink protocol adapted for embedded systems as claimed in claim 1, wherein the long packet judgment content includes an initial packet, a procedure packet and an end packet.
3. The MTLink protocol applicable to a lightweight network layer of an embedded system according to claim 1, wherein the specific implementation logic of the simple packet loss retransmission is as follows:
step 1: firstly, a sender sends data, and the ACK position is 1 to wait for the response of a receiver;
step 2: then the receiver sends a response packet after receiving the data, and the sender waits for receiving the response packet all the time, which indicates that the data is successfully sent;
step 3: if the data packet is not received within the time-out, the data packet is sent again, the steps are repeated for three times, no response packet is received in the three times in the communication process, the communication failure is indicated, and a communication failure log is returned.
4. The MTLink protocol for a lightweight network layer in an embedded system according to claim 1, wherein the specific transmission mechanism of the big data transmission mechanism is as follows:
step 1: firstly, an ES position 1 of a sender, an SL position 1 and RPC bytes are set as a packet number N which needs to be transmitted after big data is packetized to send a first packet, and a receiver receives and verifies the received packet and makes a response;
step 2: after the first packet is successfully sent, the sender RPC-1, ES position 0 and SL position 1 send the second packet, and so on, send the N-1 packet;
step 3: and finally, the sender sends the last packet, the sender RPC =0, the ES position 3 and the SL position 1 send the last packet, the receiver checks after receiving the last packet, and the long message packet is successfully sent after the last packet passes the post-response.
5. The MTLink protocol applicable to embedded systems in lightweight network layers according to claim 4, wherein a mechanism for retransmission of lost simple data packets is multiplexed in each packet transmission process after the large data packets are packetized.
6. The MTLink protocol suitable for embedded systems in lightweight forms, according to claim 4, wherein 100k of data is transmitted, RPC equals 100 with a transmission limit of 1k bytes per packet, and RPC +1 cannot be divided.
7. The MTLink protocol applicable to embedded systems in lightweight network layer as claimed in claim 4, wherein the receiver receives and checks, RPC determines if it is continuous, and CRC checks if it passes.
8. The MTLink protocol for a lightweight network layer of an embedded system as claimed in claim 1, wherein the predefined networking function mechanism is specified as follows:
step 1: the network node defines: the network defines three nodes, one is a routing node, one is a common node, the other is a main node, and the common node is a child node of the routing node;
step 2: a networking mechanism: each routing node has a routing table, the routing table contains all IDs of all ordinary nodes connected with the routing node and current network quality, whether the routing node is in fault or not, the ordinary nodes send heartbeat messages to the routing node through an OBJECT =0XF001 command, the interval is 1s, the data content is Count of one byte added each time, the data is sent to the routing node, the routing node judges the network quality of each sub-node through the received Count, the connection condition data, any node in the network can read the routing table stored by the routing node through OBJECT =0XF000, the network information is intercommunicated, in the whole network communication, each node can send and receive data to all other nodes through the network, at the moment, the routing node judges the optimal forwarding path through judging DID (destination ID, namely receiver ID) in a frame format, and forwards the messages to other routing nodes, there are some simple mechanisms for forwarding the coordinated link load until the destination node.
9. The MTLink protocol of claim 8, wherein the generic node has only one communication link, and is connected to the routing node, and the routing node acts as a relay, forwarding coordination, and node for collecting network conditions of nearby nodes, and is a terminal device, and has the same function as the generic node, so that waste of hardware devices can be greatly reduced, and resources can be saved.
10. The MTLink protocol applicable to a lightweight network layer of an embedded system according to claim 9, wherein the master node is a node that is summarized by the entire network, has the highest priority, and gives consideration to log collection, network monitoring, and summarizing the entire network operating conditions, whether each node is active, whether a link is damaged, and the like, and the master node may not be configured in the link, and the relationship of the three nodes is that the master node connects a plurality of routing nodes or common nodes, the routing nodes connect a plurality of common nodes, and the common nodes are terminal nodes, and only connect one routing node.
CN202210235379.9A 2022-03-11 2022-03-11 Lightweight network layer MTLink protocol suitable for embedded system Pending CN114615238A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210235379.9A CN114615238A (en) 2022-03-11 2022-03-11 Lightweight network layer MTLink protocol suitable for embedded system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210235379.9A CN114615238A (en) 2022-03-11 2022-03-11 Lightweight network layer MTLink protocol suitable for embedded system

Publications (1)

Publication Number Publication Date
CN114615238A true CN114615238A (en) 2022-06-10

Family

ID=81863708

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210235379.9A Pending CN114615238A (en) 2022-03-11 2022-03-11 Lightweight network layer MTLink protocol suitable for embedded system

Country Status (1)

Country Link
CN (1) CN114615238A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104639552A (en) * 2015-02-13 2015-05-20 李明 Linked network wireless high-speed communication protocol
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所(中国电子科技集团公司第十研究所) High dynamic time-delay network propagation delay time minimizes method for routing
CN113115365A (en) * 2021-05-06 2021-07-13 安徽汉威电子有限公司 Data packet transmission method based on LoRaWAN communication protocol

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104639552A (en) * 2015-02-13 2015-05-20 李明 Linked network wireless high-speed communication protocol
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所(中国电子科技集团公司第十研究所) High dynamic time-delay network propagation delay time minimizes method for routing
CN113115365A (en) * 2021-05-06 2021-07-13 安徽汉威电子有限公司 Data packet transmission method based on LoRaWAN communication protocol

Similar Documents

Publication Publication Date Title
US7991351B2 (en) Extension of wired controller area networks to wireless personal area networks
CN105743755B (en) A kind of dual-redundant CAN bus communication system
KR101187076B1 (en) Method for transmitting signals in the moblie communication system
US8913627B2 (en) Method to improve channel utilization in a time division multiple access based protocol
US20080137669A1 (en) Network of nodes
CN101877672A (en) On the communication channel network, send the system and method for grouping
WO2005083951A1 (en) Communication apparatus, communication method, communication program, and recording medium having recorded communication program therein
CN103152260A (en) Message forwarding system, method and device
CN111770428B (en) Monitoring method of wireless equipment
CN108712787B (en) Multichannel concurrent downlink Internet of things LoRa base station
WO2022052507A1 (en) Bluetooth low-power consumption audio data transmission method, and apparatus and device
WO2004047368A1 (en) Flow control method of man transmission device
US20230119412A1 (en) Arbitration line-based full-duplex spi communication method
EP2178230A1 (en) Performance improvement of dual mode devices for data over cable applications
WO2021208694A1 (en) Data transmission method and network device
CN114615238A (en) Lightweight network layer MTLink protocol suitable for embedded system
EP3843467B1 (en) Wireless connection method, device group, system, and storage medium
CN109067497B (en) Efficient networking method suitable for ultrashort wave TDMA wireless channel
CN107959956B (en) WIA-PA network packet aggregation method based on wireless channel state
CN113709011B (en) CAN-based DN-CAN communication protocol configuration method and communication method
CN112235745B (en) Multi-layer distributed LoRa network based on channel subscription
CN112689263B (en) Redundancy control method for data channel of locomotive double-end wireless synchronous control communication equipment
WO2021109821A1 (en) Network structure, method for sending packet between network elements in network, and receiving method
CN110944299B (en) Multicast method and system thereof
WO2020116184A1 (en) Communication device and communication method

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