CN101547149A - Dynamic scheduling method for OSEK COM messages based on CAN network - Google Patents
Dynamic scheduling method for OSEK COM messages based on CAN network Download PDFInfo
- Publication number
- CN101547149A CN101547149A CN200910097836A CN200910097836A CN101547149A CN 101547149 A CN101547149 A CN 101547149A CN 200910097836 A CN200910097836 A CN 200910097836A CN 200910097836 A CN200910097836 A CN 200910097836A CN 101547149 A CN101547149 A CN 101547149A
- Authority
- CN
- China
- Prior art keywords
- node
- priority
- network
- frame
- ipdu
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000004891 communication Methods 0.000 claims abstract description 14
- 230000011218 segmentation Effects 0.000 claims description 4
- 238000007689 inspection Methods 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000001960 triggered effect Effects 0.000 claims description 3
- 238000013507 mapping Methods 0.000 abstract description 2
- 238000013467 fragmentation Methods 0.000 abstract 1
- 238000006062 fragmentation reaction Methods 0.000 abstract 1
- 238000011161 development Methods 0.000 description 9
- 230000018109 developmental process Effects 0.000 description 9
- 238000013461 design Methods 0.000 description 5
- 238000012360 testing method Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000002253 acid Substances 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000005684 electric field Effects 0.000 description 1
- 230000008521 reorganization Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Images
Landscapes
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明属于CAN网络通讯技术领域，尤其是指一种基于CAN网络的OSEK COM消息动态调度方法，在以CAN网络为基础的OSEK COM通讯系统中，扩展CAN帧标识符高位的第二个域由IPDU ID组成，在同一个ECU上，IPDU ID越小的数据单元，拥有越高的优先级；每个ECU节点分配一个节点优先级，并在网络的运行过程中动态的调整各个ECU的节点优先级，尽量的保证IPDU消息不被饿死。本发明使用扩展CAN帧(29位的CAN ID)解决IPDU的灵活调度和分片问题。在OSEK COM的框架下，提出一种OSEK COM框架下的CAN优先级动态分配算法，解决OSEK COM与CAN网络之间的映射问题。
The present invention belongs to the technical field of CAN network communication, especially a kind of OSEK COM message dynamic scheduling method based on CAN network. In the OSEK COM communication system based on CAN network, the second domain of the high-order CAN frame identifier is extended by Composed of IPDU ID, on the same ECU, the data unit with smaller IPDU ID has higher priority; each ECU node is assigned a node priority, and the node priority of each ECU is dynamically adjusted during the operation of the network level, try to ensure that IPDU messages are not starved to death. The invention uses the extended CAN frame (29-bit CAN ID) to solve the problem of flexible scheduling and fragmentation of the IPDU. Under the framework of OSEK COM, a CAN priority dynamic allocation algorithm under the framework of OSEK COM is proposed to solve the mapping problem between OSEK COM and CAN network.
Description
Technical field
The invention belongs to CAN network communications technology field, refer in particular to a kind of OSEKCOM message dynamic dispatching method based on the CAN network.
Background technology
Compatibility between the portability of application software and the control module of different vendor, open system and interface-OSEK (the OpenSystems and the Corresponding Interface For Automotive Electronics) standard impelling the German automobiles industrial quarters to unite in 1993 to have proposed automotive electronics are intended to provide for the distribution control unit on the automobile industrial standard of an open architecture.Wherein OSEK communication standard (OSEK COM) has been stipulated the exchanges data behavior between ECU inside and a plurality of ECU, and unified communication environment is provided between the application software for automobile control unit.Fig. 1 is the hierarchical model figure of OSEK COM.
The message scheduling problem of a lot of people's researchs on the CAN network, because the uncertainty of CAN upper layer network, these researchs are general CAN message scheduling problem basically.Be not suitable in the communication system of OSEK COM as the CAN upper strata.
The CAN bus protocol has only defined physical layer and data link layer, and undefined application layer is not stipulated the producing method of the identifier of CAN frame.If we use the bottom communication network of CAN frame as OSEK COM, need solve two problems: the 1) IPDU of the OSEK COM layer problem of on the CAN network, dispatching.2) length is greater than the transmission problem of the I-PDU of 8 bytes.The present invention proposes a kind of dynamic dispatching method of CAN message, combine closely, formed OSEK COM communication system, be applicable to the communication behavior of vehicle electric field with OSEK COM module.
Summary of the invention
In order to overcome the above problems, the present invention proposes a kind of OSEK COM message dynamic dispatching method based on the CAN network.The IPDU of OSEK COM layer can dynamic dispatching on the CAN network, and it is hungry to death to guarantee certain node not occur.
A kind of OSEK COM message dynamic dispatching method based on the CAN network, in the OSEK COM communication system based on the CAN network, second territory of an expansion CAN frame identifier high position is made up of IPDU ID, on same ECU, the data cell that IPDU ID is more little has high more priority; Each ECU node distributes a node priority, and adjusts the node priority of each ECU in the running of network dynamically, and the assurance IPDU message of trying one's best is by hungry to death.
Further, described node priority is the highest territory of the CAN ID of expansion CAN frame, and each the ECU node on the CAN network all allows to have n node priority, and different, but in some moment, node only allows a node priority.
Further, described node priority is dynamically adjusted in the scope that this node allows according to the actual conditions of network, and it is tactful as follows that it is dynamically adjusted:
The user is L ms according to the adjustment priority time of the actual conditions configuration node i of node i, and the maximum frequency of failure that in the time of L ms, can stand of configure user Mi time, broadcast on the CAN bus, all nodes on the bus are all received this message simultaneously, and all receive that the local node of message is according to following protocol update node priority; Each node has periodic triggered time Li, at this constantly, and node i:
(1). inspection has surpassed Mi at whether L sends failure in the time number of times, if surpassed, Go to 2; Otherwise do not do any operation;
(2). node i improves his priority in the scope of its node priority permission, if CurrentNodePrioi=x (node priority of i is x at present), after improving, CurrentNodePrioi=x＜n? x:x-n.Go?to3；
(3). broadcast a special standard CAN frame and notify other node to reduce their node priority; After node i broadcasting particular criteria CAN frame, other all nodes:
1). other all nodes are received special standard CAN frame at the same time;
2). other nodes all reduce their node priority; With j is example, if CurrentNodePrioj=y (the current node priority of node j is y), after then adjusting, CurrentNodeProj=y〉(n-1) * n? y:y+n.
Further, the CAN ID of special standard CAN frame is a node serial number in described (3), and data length is 0.
Further, described expansion CAN frame is 29 a Extended Superframe Format, and CAN ID is divided into 4 territories, when sending, transmit leg is cut into appropriate C AN frame to the message greater than 8 bytes, and relevant segmentation control information is put among IPDUFragNum and the IPDUFragIndex, sends together; The recipient receives after the CAN frame, according to IPDUFragNum and two territories of IPDUFragIndex the CAN frame of segmentation is assembled into complete IPDU message.
In this agreement, if a node does not send data for a long time, perhaps the present node priority of a node can satisfy the data sending request of this node fully, and we just reduce the node priority of this node so.And require than higher node for frequent transmission and message real-time, this consultation improves the node priority of this node.This specific character is to match with many practical applications.
If at a time, all nodes do not need to adjust node priority, i.e. the continuous adjustment of node priority makes network reach a kind of stable status, and this agreement no longer needs extra offered load.This moment, this tactful expense was equivalent to the CAN ID that static priority produces.
The present invention uses expansion CAN frame (29 CAN ID) to solve flexible dispatching and the burst problem of IPDU.OSEK COM does not specify concrete bottom-layer network.Among the present invention, we use the bottom communication network of CAN network (one of present most popular bus) as OSEK COM, form complete OSEK COM communication system with OSEK COM.Under the framework of OSEK COM, the CAN priority dynamic allocation algorithm under a kind of OSEK COM framework is proposed, solve the mapping problems between OSEK COM and the CAN network.
Description of drawings
The hierarchical model figure of Fig. 1 OSEK COM
The composition schematic diagram of Fig. 2 CAN ID
The data flowchart of Fig. 3 node i
The software architecture that Fig. 4 Santana test platform and development board are formed
The logic line schematic diagram of Fig. 5 Santana test platform
Embodiment
Each ECU inside, each IPDU data cell of OSEK COM layer all has an IPDU ID to come addressing different IP DU, and the design is the important component part of IPDU ID as CANID.On same ECU, the data cell that IPDU ID is more little has high more priority.As shown in Figure 2, IPDU ID accounts for 8 ~ 14 7, and 2^7=128 IPDU arranged at most on the ECU.
An ECU inside, the priority between the IPDU are determined easily.But between different ECU, the priority of IPDU is determined relatively difficulty.For coordinating the IPDU priority between the different ECU, node priority (Node Priority) has been introduced in the wood design, as the important part of CAN ID.As shown in Figure 2, NodePriority accounts for 15 ~ 29 14.Can distribute 2^14 node priority on the CAN network at most.The Node Priority territory of CANID can be adjusted according to the actual state on the network.Allow carry sqrt (2^14)=2^7=128 CAN node on the network at most.
We use the fixed priority scheduling in ECU inside, and in the ECU outside, we carry out internodal dynamic priority scheduling by adjusting NodePriority.It is hungry to death to guarantee certain node not occur, and can constantly adjust the further reasonably Node Priority method of salary distribution of formation according to the actual conditions on the network.
Below we introduce the more New Deal of Node Priority in detail.
Suppose to have on the network n node, node serial number is 0,1,2 ..., n-1.Each node distributes n node priority.For example n node priority of node i distribution is: O*n+i, and 1*n+i, 2*n+i ..., (n-1) * n+i.The state that the user is initial according to network disposes the start node priority of each node.
The user is L ms according to the adjustment priority time of the actual conditions configuration node i of node i, and maximum failure (overtime) number of times that can stand in the time of L ms of configure user Mi time.In order to guarantee that the node priority counter-rotating can not take place.The present invention uses a simple agreement, broadcast on the CAN bus, and all nodes on the bus are all received this message simultaneously, all receive that the local node of message is according to following protocol update node priority.Each node has periodic triggered time Li, at this constantly, and node i:
1. inspection has surpassed Mi at whether L sends failure in the time number of times, if surpassed, and Go to 2; Otherwise do not do any operation.
2. node i improves his priority in the scope of its node priority permission.For example, if CurrentNodePrioi=x (node priority of i is x at present), after improving, CurrentNodePrioi=x＜n? x:x-n.Go?to?3。
3. broadcasting a special standard CAN frame notifies other node to reduce their node priority.
The CAN frame of the standard that sends on the CAN bus is adjusted node priority as other node of a signalisation.The CAN ID of this special CAN frame is a node serial number, and data length is 0.This CAN frame can increase by 44 additional transmissions.After node i broadcasting particular criteria frame, other all nodes:
1. other all nodes are received special standard CAN frame at the same time.
2. other nodes all reduce their node priority.With j is example, if CurrentNodePrioj=y (the current node priori ty of node j is y), after then adjusting, CurrentNodeProj=y〉(n-1) * n? y:y+n.
The flow chart of node i transmission data and adjustment node priority as shown in Figure 3.
In order to solve the burst problem of I-PDU, the design is the burst sum (IPDUFragNum) of IPDU, this CAN frame data skew (IPDUFragIndex) in IPDU wherein two parts as CANID.The burst of IPDU arrives the recipient according to the order of sequence according to the size of IPDUFragIndex.As shown in Figure 2, IPDUFragNum accounts for 4 ~ 74, and IPDUFragIndex accounts for 0 ~ 34.Each IPDU is the longest to be 2^4*8=128 byte, transmit leg and recipient according to these two territories to IPDU burst and reorganization.
The software environment of design: the Frame that CAN debugging acid ZLGCANTest comes testing CAN to receive; CodeWarriorIDE is used for compiling programming to HCS12, the code among HCS12X and the Embest S3CEV40.
The software architecture of each module is seen Fig. 4.Have 5 modules, collect signaling module and control module (HCS12 development board), control front end lamp module (HCS12X development board, it also is control centre's module), display module (ARM7) and control and real module (PC end).
The hardware environment of design: Santana's test platform, we select 1 development board HCS12 and HCS12X (HCS12 and HCS12X development board are integrated in the CAN controller in this development board) as the CAN node, an Embest S3CEV40 development board and connect into the needed number of C AN bus of CAN network etc.Embodiment can be carried out line according to wired logic shown in Figure 5.Development board HCS12X is responsible for controlling left front car light and right front car light, and HCS12 is responsible for controlling left back car light and right back car light, carries out communication with the CAN bus between HCS12 and the HCS12X.Be connected with the RS-232 Serial Port Line between Embest S3CEV40 and the HCS12 development board.Embest S3CEV40 is mutual by carrying out between serial port protocol and the HCS12, reads the corresponding C AN network information, and message is encapsulated, and the corresponding software of issuing the PC end shows.
Can prove that by this test this method can make sending node successfully send data, receiving node receives data, and the phenomenon hungry to death of having avoided IPDU of trying one's best, thereby has guaranteed reliable accuracy, the real-time of Data Receiving.
Claims (5)
1. OSEK COM message dynamic dispatching method based on the CAN network, it is characterized in that: in OSEK COM communication system based on the CAN network, second territory of an expansion CAN frame identifier high position is made up of IPDU ID, on same ECU, the data cell that IPDU ID is more little has high more priority; Each ECU node distributes a node priority, and adjusts the node priority of each ECU in the running of network dynamically, and the assurance IPDU message of trying one's best is by hungry to death.
2. the OSEK COM message dynamic dispatching method based on the CAN network according to claim 1, it is characterized in that: described node priority is the highest territory of the CAN ID of expansion CAN frame, each ECU node on the CAN network all allows to have n node priority, and it is different, but in some moment, node only allows a node priority.
3. the OSEK COM message dynamic dispatching method based on the CAN network according to claim 1 and 2, it is characterized in that: described node priority is dynamically adjusted in the scope that this node allows according to the actual conditions of network, and it is tactful as follows that it is dynamically adjusted:
The user is L ms according to the adjustment priority time of the actual conditions configuration node i of node i, and the maximum frequency of failure that in the time of L ms, can stand of configure user Mi time, broadcast on the CAN bus, all nodes on the bus are all received this message simultaneously, and all receive that the local node of message is according to following protocol update node priority; Each node has periodic triggered time Li, at this constantly, and node i:
(1). inspection has surpassed Mi at whether L sends failure in the time number of times, if surpassed, Go to 2; Otherwise do not do any operation;
(2). node i improves his priority in the scope of its node priority permission, if CurrentNodePrioi=x (node priority of i is x at present), after improving, CurrentNodePrioi=x＜n? x:x-n.Go?to?3；
(3). broadcast a special standard CAN frame and notify other node to reduce their node priority; After node i broadcasting particular criteria CAN frame, other all nodes:
1). other all nodes are received special standard CAN frame at the same time;
2). other nodes all reduce their node priority; With j is example, if CurrentNodePrioj=y (the current node priority of node j is y), after then adjusting, CurrentNodeProj=y〉(n-1) * n? y:y+n.
4. the OSEK COM message dynamic dispatching method based on the CAN network according to claim 3, it is characterized in that: the CAN ID of special standard CAN frame is a node serial number in described (3), data length is 0.
5. the OSEK COM message dynamic dispatching method based on the CAN network according to claim 1, it is characterized in that: described expansion CAN frame is 29 a Extended Superframe Format, CAN ID is divided into 4 territories, when sending, transmit leg is cut into appropriate C AN frame to the message greater than 8 bytes, relevant segmentation control information is put among IPDUFragNum and the IPDUFragIndex, sends together; The recipient receives after the CAN frame, according to IPDUFragNum and two territories of IPDUFragIndex the CAN frame of segmentation is assembled into complete IPDU message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100978367A CN101547149B (en) | 2009-04-20 | 2009-04-20 | Dynamic scheduling method for OSEK COM messages based on CAN network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100978367A CN101547149B (en) | 2009-04-20 | 2009-04-20 | Dynamic scheduling method for OSEK COM messages based on CAN network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101547149A true CN101547149A (en) | 2009-09-30 |
| CN101547149B CN101547149B (en) | 2013-06-19 |
Family
ID=41194050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100978367A Expired - Fee Related CN101547149B (en) | 2009-04-20 | 2009-04-20 | Dynamic scheduling method for OSEK COM messages based on CAN network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101547149B (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867570A (en) * | 2010-05-13 | 2010-10-20 | 浙江大学 | Communication Method in Reliability Testing of Embedded Software Based on CAN |
| CN102063083A (en) * | 2010-11-29 | 2011-05-18 | 浙江大学 | Multi-ECU (Electronic Control Unit) time-shared downloading method |
| CN102196583A (en) * | 2010-03-18 | 2011-09-21 | 中兴通讯股份有限公司 | Channel resource allocation method and base station |
| CN102594642A (en) * | 2012-02-15 | 2012-07-18 | 山东师范大学 | Method for real-time controller area network (CAN) communication |
| CN102801551A (en) * | 2012-03-14 | 2012-11-28 | 中国汽车技术研究中心 | Open systems and the corresponding interfaces for automotive electronics (OSEK) network management-based controller area network (CAN) management method |
| CN104009940A (en) * | 2014-05-30 | 2014-08-27 | 长城汽车股份有限公司 | Method and device for dispatching data in controller area network |
| CN105007208A (en) * | 2015-06-04 | 2015-10-28 | 南京阿凡达机器人科技有限公司 | Communication method, based on CAN bus, inside robot system |
| CN106059806A (en) * | 2016-05-27 | 2016-10-26 | 杭州华三通信技术有限公司 | CAN message sending method and device |
| CN106850660A (en) * | 2017-02-28 | 2017-06-13 | 大连理工大学 | A kind of method for designing of the SAE J1939 host-host protocols based on SocketCAN |
| CN107528798A (en) * | 2016-06-22 | 2017-12-29 | 宁波工程学院 | Optimization Scheduling based on RS485 bus systems |
| CN107665121A (en) * | 2016-07-28 | 2018-02-06 | 通用汽车环球科技运作有限责任公司 | Remote vehicle renewal installation scheduling |
| CN108243244A (en) * | 2016-12-26 | 2018-07-03 | 丰田自动车株式会社 | In-vehicle communication system and its control method |
| CN108667705A (en) * | 2018-05-09 | 2018-10-16 | 江苏恩达通用设备有限公司 | A kind of referee method of CANFD buses |
| CN111682987A (en) * | 2020-06-09 | 2020-09-18 | 联合汽车电子（重庆）有限公司 | Real vehicle environment simulation and rapid test system based on OSEK NM |
| CN112425101A (en) * | 2018-07-25 | 2021-02-26 | 大陆汽车有限公司 | Clock topology in Ethernet networks |
| CN114721350A (en) * | 2022-03-28 | 2022-07-08 | 深圳市赛格车圣科技有限公司 | A method and system for adaptive diagnosis of motor vehicle OBD protocol |
| CN115801671A (en) * | 2022-08-31 | 2023-03-14 | 成都赛力斯科技有限公司 | Data forwarding table generation and data forwarding method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1238787C (en) * | 2003-10-17 | 2006-01-25 | 清华大学 | Binary chop type task dispatching method for embedding real-time operating system |
| CN100351793C (en) * | 2005-09-12 | 2007-11-28 | 浙江大学 | Task scheduling method for embedded real-time operation system supporting OSEK standard |
| CN101295246B (en) * | 2008-05-28 | 2012-03-14 | 浙江大学 | Method for converting UML model to SmartC model |
-
2009
- 2009-04-20 CN CN2009100978367A patent/CN101547149B/en not_active Expired - Fee Related
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102196583B (en) * | 2010-03-18 | 2015-11-25 | 中兴通讯股份有限公司 | A kind of distribution method of channel resource and base station |
| CN102196583A (en) * | 2010-03-18 | 2011-09-21 | 中兴通讯股份有限公司 | Channel resource allocation method and base station |
| CN101867570B (en) * | 2010-05-13 | 2012-12-05 | 浙江大学 | CAN-based communication method in embedded software reliability test |
| CN101867570A (en) * | 2010-05-13 | 2010-10-20 | 浙江大学 | Communication Method in Reliability Testing of Embedded Software Based on CAN |
| CN102063083A (en) * | 2010-11-29 | 2011-05-18 | 浙江大学 | Multi-ECU (Electronic Control Unit) time-shared downloading method |
| CN102063083B (en) * | 2010-11-29 | 2014-10-08 | 浙江大学 | Multi-ECU (Electronic Control Unit) time-shared downloading method |
| CN102594642A (en) * | 2012-02-15 | 2012-07-18 | 山东师范大学 | Method for real-time controller area network (CAN) communication |
| CN102801551A (en) * | 2012-03-14 | 2012-11-28 | 中国汽车技术研究中心 | Open systems and the corresponding interfaces for automotive electronics (OSEK) network management-based controller area network (CAN) management method |
| CN102801551B (en) * | 2012-03-14 | 2014-09-24 | 中国汽车技术研究中心 | CAN Network Management Method Based on OSEK Network Management |
| CN104009940A (en) * | 2014-05-30 | 2014-08-27 | 长城汽车股份有限公司 | Method and device for dispatching data in controller area network |
| CN104009940B (en) * | 2014-05-30 | 2017-09-29 | 长城汽车股份有限公司 | Data dispatching method and device in controller LAN |
| CN105007208A (en) * | 2015-06-04 | 2015-10-28 | 南京阿凡达机器人科技有限公司 | Communication method, based on CAN bus, inside robot system |
| CN105007208B (en) * | 2015-06-04 | 2018-11-23 | 南京阿凡达机器人科技有限公司 | Communication means in a kind of CAN bus based robot system |
| CN106059806A (en) * | 2016-05-27 | 2016-10-26 | 杭州华三通信技术有限公司 | CAN message sending method and device |
| CN106059806B (en) * | 2016-05-27 | 2021-03-02 | 新华三技术有限公司 | CAN message sending method and device |
| CN107528798A (en) * | 2016-06-22 | 2017-12-29 | 宁波工程学院 | Optimization Scheduling based on RS485 bus systems |
| CN107528798B (en) * | 2016-06-22 | 2020-09-08 | 宁波工程学院 | RS485 bus system-based optimal scheduling method |
| CN107665121A (en) * | 2016-07-28 | 2018-02-06 | 通用汽车环球科技运作有限责任公司 | Remote vehicle renewal installation scheduling |
| CN107665121B (en) * | 2016-07-28 | 2021-02-26 | 通用汽车环球科技运作有限责任公司 | Remote vehicle update installation scheduling |
| CN108243244A (en) * | 2016-12-26 | 2018-07-03 | 丰田自动车株式会社 | In-vehicle communication system and its control method |
| CN108243244B (en) * | 2016-12-26 | 2020-11-03 | 丰田自动车株式会社 | Vehicle-mounted communication system and control method thereof |
| CN106850660B (en) * | 2017-02-28 | 2020-05-19 | 大连理工大学 | A Design Method of SAE J1939 Transmission Protocol Based on SocketCAN |
| CN106850660A (en) * | 2017-02-28 | 2017-06-13 | 大连理工大学 | A kind of method for designing of the SAE J1939 host-host protocols based on SocketCAN |
| CN108667705A (en) * | 2018-05-09 | 2018-10-16 | 江苏恩达通用设备有限公司 | A kind of referee method of CANFD buses |
| CN112425101A (en) * | 2018-07-25 | 2021-02-26 | 大陆汽车有限公司 | Clock topology in Ethernet networks |
| CN111682987A (en) * | 2020-06-09 | 2020-09-18 | 联合汽车电子（重庆）有限公司 | Real vehicle environment simulation and rapid test system based on OSEK NM |
| CN114721350A (en) * | 2022-03-28 | 2022-07-08 | 深圳市赛格车圣科技有限公司 | A method and system for adaptive diagnosis of motor vehicle OBD protocol |
| CN115801671A (en) * | 2022-08-31 | 2023-03-14 | 成都赛力斯科技有限公司 | Data forwarding table generation and data forwarding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101547149B (en) | 2013-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101547149A (en) | Dynamic scheduling method for OSEK COM messages based on CAN network | |
| CN100471162C (en) | Method for releasing and processing virtual circuit information and supplier edge device | |
| CN114545906B (en) | Vehicle-mounted Ethernet gateway and vehicle | |
| CN110401568A (en) | A kind of method for discovering network topology and equipment | |
| CN102571866B (en) | Dynamic vehicle companion club building method and system | |
| CN105022276A (en) | Smart home system and data interaction method thereof | |
| CN205666856U (en) | Train level ethernet switching equipment and system | |
| CN101635645A (en) | Method and device for managing network topology | |
| CN102799152A (en) | Intelligent household control system based on bluetooth | |
| CN108322437A (en) | For the adaptive communications method and apparatus between more stipulations equipment | |
| CN113709029A (en) | Standard MVB network card system based on MODBUS communication protocol and Microblaze platform realization | |
| CN101945044B (en) | For attribute logging method and the switching equipment of switching network | |
| CN105407515A (en) | Network switching method and device | |
| CN104683126A (en) | Network managing method based on CAN bus | |
| CN108768727A (en) | Access method, electronic device and the readable storage medium storing program for executing of third party's service | |
| CN105554089A (en) | DDS (Date Distribution Service) standard-based ''request-response'' type data communication method | |
| CN104426724A (en) | Intelligent home constructing system and intelligent home realizing method | |
| CN203616879U (en) | Bus arrival special reminding system based on Zigbee technology | |
| CN109068355A (en) | Method for saving data traffic, telephone watch, server and mobile terminal | |
| CN100382492C (en) | Family and car electronic interaction system and interaction method | |
| CN105530542B (en) | Module television upgrading method and module television | |
| CN106020175A (en) | Whole vehicle control power-on and power-off control circuit and whole vehicle controller | |
| CN105574292A (en) | Method for achieving multi-channel any-bandwidth packet sending based on dynamic arrays | |
| WO2022217431A1 (en) | Access control method for zigbee device, and open link association (ola) gateway | |
| CN205105246U (en) | Electrical equipment control system based on intelligence router |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20100108 Address after: 38, Da Da Lu, Xihu District, Zhejiang, Hangzhou Province, China: 310027 Applicant after: Zhejiang University Co-applicant after: INSIGMA GROUP CO., LTD. Address before: 38, Da Da Lu, Xihu District, Zhejiang, Hangzhou Province, China: 310027 Applicant before: Zhejiang University |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130619 Termination date: 20170420 |