CN109194746B - Heterogeneous information processing method based on Internet of things - Google Patents
Heterogeneous information processing method based on Internet of things Download PDFInfo
- Publication number
- CN109194746B CN109194746B CN201811038319.8A CN201811038319A CN109194746B CN 109194746 B CN109194746 B CN 109194746B CN 201811038319 A CN201811038319 A CN 201811038319A CN 109194746 B CN109194746 B CN 109194746B
- Authority
- CN
- China
- Prior art keywords
- service
- data
- node
- internet
- vehicles
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a heterogeneous information processing method based on the Internet of things, which comprises the following steps: the vehicle networking platform establishes a service chain between a service supply end and a service demand end, and monitors the whole process of vehicle networking service in real time in the service process, wherein the service demand end comprises vehicles of the vehicle networking platform. The invention provides a heterogeneous information processing method based on the Internet of things, aiming at the characteristics of the mass property and heterogeneous variability of sensing data of an Internet of vehicles system, a uniform data interface is adopted to comprehensively sense and process heterogeneous information, and seamless interaction of information and standardized sharing of data of different application systems are realized.
Description
Technical Field
The invention relates to the Internet of things, in particular to a heterogeneous information processing method based on the Internet of things.
Background
With the rapid development of computers and networks, not only does intelligent transportation become more and more important in national economic status, but also the intelligent transportation service mode becomes an important influence factor for improving the transportation operation efficiency, reducing the transportation cost and improving the competitiveness of the whole society. At present, cloud computing has been developed to the application landing stage, and great achievements are made in the aspects of enterprises, search engines and the like, but the cloud computing is developed slowly in the intelligent transportation industry, and the development of the cloud computing provides challenges for modern transportation, is not limited to data concentration any more, and can provide more expansion. The information service based on the Internet of things and the cloud computing technology is perceived from a source, executed to the cloud service and provided with rich and customizable service content according to requirements. Various intelligent transportation resources and client resources are virtualized, and service encapsulation, release and registration are performed on the Internet of vehicles, so that a decision maker can use different terminals at any position of the cloud, and corresponding Internet of vehicles services are obtained.
At present, the existing scheme aiming at the intelligent traffic service mode mainly develops an intelligent traffic information system construction framework and a data center from the perspective of an information system; and the service integration does not relate to the consideration of the innovation of the intelligent transportation service mode in the cluster-end computing environment, namely, a system solution for service description, service encapsulation, service mining and service merging of the internet of vehicles does not exist. And the data perceived by the car networking system has the characteristics of high volume, multiple isomerism and time-space variability, a unified perception data description structure is not established for comprehensive perception and processing of heterogeneous information at present, event information cannot be subjected to standardized processing, associated pairing processing and the like, and seamless interaction of information and sharing and interoperation between different application system data are difficult to realize.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a heterogeneous information processing method based on the internet of things, which comprises the following steps:
the vehicle networking platform establishes a service chain between a service supply end and a service demand end, and monitors the whole process of vehicle networking service in real time in the service process, wherein the service demand end comprises vehicles of the vehicle networking platform.
Preferably, the service supply end performs virtualization, service encapsulation and standardization on the Internet of vehicles resources to form Internet of vehicles services, stores the Internet of vehicles services in the distributed server, then collects service requirements issued by the demand end in real time, models and decomposes Internet of vehicles services into a series of sub-services.
Preferably, the resource and environmental information of the vehicle-mounted node and the road-side node are sensed, and the access control and data transmission of the heterogeneous nodes are carried out in a heterogeneous network formed by the vehicle and the road-side infrastructure; data acquisition, fusion and mass data processing are performed in different types of sensors; and node negotiation and control based on feedback are realized.
Preferably, a correlation model between the vehicle data and the traffic process state is established, and the vehicle-associated data is acquired and transmitted; isomorphic processing is carried out on heterogeneous data, conversion of different structural data is carried out, and a process event unified description language and a processing operational character based on XML are established; establishing a multi-level event description model and a process-oriented multi-level event correlation model, and analyzing the relationship of multi-level events; performing logic operation on the perception data, and performing correlation operation on multi-level events by applying a key event processing engine to obtain service information with semantics; and performing higher-level value-added processing on the service information to obtain a key event.
Preferably, the acquiring, in real time, the service demand issued by the demand side, modeling and decomposing the internet of vehicles service into a series of sub-services, further includes:
after receiving a vehicle networking service request submitted by a service demand end, a cloud end firstly analyzes the characteristics of the service, wherein the characteristics of the service comprise the scale of service execution, the resources required by the service, the granularity of vehicle networking service decomposition and the complexity of the service, then the characteristics of the service are used as input, and a corresponding service decomposition algorithm is called to decompose the vehicle networking service into sub-services suitable for being processed by a vehicle networking platform to participate in the next operation.
Compared with the prior art, the invention has the following advantages:
the invention provides a heterogeneous information processing method based on the Internet of things, aiming at the characteristics of mass property and heterogeneous variability of sensing data of an Internet of vehicles system, the description of Internet of vehicles service, the encapsulation of service, the mining of service and the merging of service are realized by means of a system, a uniform data interface is adopted to comprehensively sense and process heterogeneous information, and the seamless interaction of information and the standardized sharing among different application system data are realized.
Drawings
Fig. 1 is a flowchart of a heterogeneous information processing method based on the internet of things according to an embodiment of the present invention.
Detailed Description
A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. These details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of these specific details.
The invention provides a heterogeneous information processing method based on the Internet of things. Fig. 1 is a flowchart of a heterogeneous information processing method based on the internet of things according to an embodiment of the present invention.
In the vehicle networking platform, the vehicle networking resources are virtualized to form services, the similar services form service groups, and different service groups form service spaces. After the resources are encapsulated, scheduling of the Internet of vehicles resources is converted to mining, selecting, and merging Internet of vehicles services in the service group. The service demand side, the platform and the supply side form a main part of the business process. The service supply end provides various heterogeneous services for the Internet of vehicles platform; the vehicle networking service demand side comprises member vehicles of the whole vehicle networking platform; the vehicle networking platform is responsible for establishing a supply and demand service chain between the supply and demand service chains, firstly, vehicle networking resources and services provided by a supply end are subjected to virtualization processing, service encapsulation and standardization processing to form vehicle networking services, the vehicle networking services are stored on a distributed server, then service requirements issued by a demand end are collected in real time, vehicle networking services are modeled and decomposed into a series of sub-services, finally, optimal vehicle networking services are paired for the vehicle networking services and merged through service mining, merging and cooperation, and meanwhile, the whole process of the vehicle networking services is monitored in real time in the service process.
The car networking platform comprises a collection sensing layer, an interaction layer and a service layer. The acquisition sensing layer senses resources and environment information of vehicle-mounted nodes and road side nodes in the vehicle networking environment, completes resource information management and cooperative application of the wireless vehicle-mounted network through the DNS server, and receives feedback decision information to execute corresponding control commands. The interaction layer realizes data access and network transmission, and senses the cleaning and extraction of data, key event correlation operation, data mining analysis and standardized packaging information; and providing real-time transmission service for field detection data and issuing a monitoring instruction of a management layer. The interaction layer defines network identification and communication protocol, so that heterogeneous network data can be mutually identified and fused to realize access of the heterogeneous network. The application layer provides decision application services under the support of the information processing tool.
In order to realize the data acquisition of optimization selection, the accessed client side is fed back and controlled, the node is selected to feed back the upper layer vehicle-mounted data flow information to the sensor node, and the communication protocol of the vehicle-mounted node is optimized in a cross-layer mode. In a heterogeneous network formed by a vehicle and a roadside infrastructure, access control and data transmission of heterogeneous nodes need to be completed; acquiring and fusing sensor data of different types and processing mass data; node negotiation and control based on feedback.
The acquisition sensing layer acquires multivariate data and manages heterogeneous sensors by using a high-reliability vehicle-connected data sensing environment, and comprises a vehicle-mounted network for sensing and transmitting real-time vehicle-connected data, an industrial local area network field bus and the like. Firstly, establishing a sensing environment required by data acquisition and transmission, establishing a sensor network configuration model for measuring different parameters, and determining a target function and constraint conditions of a sensor network by taking the lowest sensor cost as the target function; establishing a sensor information registration and information processing library, and performing data scribing to realize the description and definition of the vehicle networking resource information attached with various heterogeneous sensors; the real-time data of the Internet of vehicles resources are sensed and transmitted, when the vehicle nodes reach the sensing area, the data automatically acquire or identify the nodes, namely the sensing Internet of vehicles resources information, then the atomic events which occur are sensed in real time, and then the Internet of vehicles resources data acquired by the sensing nodes are transmitted through the communication network. The interaction layer mainly realizes the fusion and interconnection of heterogeneous networks and meets the transmission requirement of massive and real-time sensing data.
The key event processing of the Internet of vehicles comprises the steps of establishing a correlation model between vehicle data and a traffic process state, and acquiring and transmitting the vehicle-associated data; isomorphic processing of heterogeneous data, conversion of data with different structures, and establishment of a process event unified description language and a processing operator based on XML; establishing a multi-level event description model and a process-oriented multi-level event correlation model, and analyzing the relationship of multi-level events; performing logic operation on the perception data, and performing correlation operation on multi-level events by applying a key event processing engine to obtain service information with semantics; and performing higher-level value-added processing on the service information to obtain a key event.
And the interaction layer carries out real-time logic operation processing on the sensing data according to the data integration rule, completes the establishment of a mapping relation and a processing mechanism between the data and the event, and finally realizes the processing of the data and the information integration. On the basis of acquiring the vehicle-associated data, performing relation definition, rule operation and value-added processing of multivariate information to provide key event information supporting process monitoring and decision optimization; and according to the type of the event, carrying out classified collection and storage on the process event so as to be beneficial to efficient calling of data.
The vehicle networking platform packages heterogeneous entity resources into services after virtualization processing, deploys the services in different virtual machines to form cluster nodes, then divides the vehicle networking resources into a plurality of service groups according to the functions of the vehicle networking resources, and forms an overlay network with a specific topological structure by connecting registration nodes of each service group. After the resources are packaged, the similar services form a service group, the service group forms a service space, and the mining, the selection and the calling of the services are completed in the service space.
After the cloud receives a vehicle networking service request submitted by a service demand end, firstly, the characteristics of the service, including the size of the service execution scale, the resources required by the service, the granularity of vehicle networking service decomposition and the complexity of the service, are analyzed, then the characteristics of the service are used as input, and a corresponding service decomposition algorithm is called to decompose the vehicle networking service into sub-services suitable for being processed by a vehicle networking platform to participate in the next operation.
The method comprises the following steps of taking the acquired data volume, the acquisition precision and the perception range of the vehicle-mounted data as constraints, determining the minimum hardware cost of a corresponding sensor in a vehicle-mounted network as a target function, and establishing a model for optimal configuration of the vehicle-mounted node wireless vehicle-mounted network:
wherein ASiIt indicates the i-th on-board sensor,
the ith vehicle-mounted sensor is equipped with the jth component of the m (i) heterogeneous sensing components, and n represents the total number of vehicle-mounted sensors required for acquiring information in the vehicle-mounted network. OmegaiAs a weight of the data, fiFor the sampling frequency of the node, i.e. the optimization object, piAnd ρmaxRespectively on-board data density and maximum on-board data density,
for the predefined relaxation factor, the constraint conditions are set such that the sampling frequency is between the minimum and maximum of the physical sampling frequency of the sensor, the sampling frequency is set to be less than the transmission rate, and the load of the node is less than the channel capacity.
The interaction layer provides a uniform data acquisition access port, nodes participating in sensing send access requests to the interaction layer through the Internet, the requests carry position and traffic parameter information, and if the nodes do not support the direct request sending to the interaction layer, the AP serves as a proxy server to carry out protocol conversion;
the interaction layer processes the position information uploaded by the sensing node and forwards the request to the load balancing processing server; the load balancing processing server appoints a partition server according to the position of the sensing node and a load balancing strategy;
the sensing node is connected with the partition server again; matching and correcting the position of the sensing node with a map, then making a decision according to the position of the sensing node and traffic parameters to determine whether to acquire data uploaded by the sensing node, if not, setting a working mode to reduce sampling frequency, and if so, processing a vehicle-mounted data stream uploaded by the sensing node;
the partition server stores the processed traffic information data into a database, queries a sensor protocol optimization strategy from the cooperative control strategy server, and returns a response to the sensing node; inquiring and actively selecting the optimal vehicle-mounted data stream from a database and providing the optimal vehicle-mounted data stream to a control algorithm for signal control optimization; selecting positions needing cooperation according to strategies, and coordinating a plurality of road side units for cooperation;
the cooperative control server provides a regional cooperative control strategy and an optimization result; the cooperative control server provides a timing strategy according to the optimization result and issues the timing strategy to the road side unit; the user inquires the Internet of vehicles information from the interaction layer through the Internet.
When the vehicle-mounted node is accessed to the network, the vehicle-mounted node registers information with the partitioned server, and at the moment, the server generates a unique node number in the partition. When the sensing node monitors that monitoring data are generated, a complete communication process from handshaking to disconnection is triggered. The connection is established through three-way handshake, the sensing node sends traffic data to the server after the connection is established, and the server fills a node control command according to real-time vehicle-mounted data flow and traffic control logic in response and controls the working mode and the transmission window of the sensing node in a feedback mode. And only receiving messages and messages defined by the state corresponding to each stage of the state machine. During communication, the signaling parameters are updated by setting messages, so that the protocol can adaptively adjust the parameters of sampling frequency, transmission opportunity, timeout time, retransmission times and transmission window size according to application customization.
The sensing node manager is used for managing heterogeneous sensors, controlling and connecting additional sensors on all car networking resources through a Web server, and managing sensor activities through an embedded processing system. And data perception and dynamic database transmission are executed in parallel, and commands of an upper-layer platform to the vehicle-mounted terminal are issued at the same time. And based on the data interaction universality requirement, the standardized and packaged sensing data transmission operation is regarded as a Web service request, and the transmission and the calling of the sensing data are realized through a communication network.
The bottom layer component is in direct contact with the sensor node; the plug-and-play operation service of the heterogeneous sensor is realized through the embedded processor; the intermediate member provides fusion and real-time transmission of data collected by the bottom layer node and issuing service of decision information, and performs logical operation on the data information to generate an event.
When the client needs to collect the traffic information of the relevant road sections, the request is sent to the corresponding road side nodes through the adjacent road side nodes. And the road side node predicts the topology change of the vehicle networking of the nodes in a subsequent period of time through the collected historical data of the vehicle networking topology of the vehicle-mounted nodes. On the basis, the road side node plans the routing path and the aggregation transmission time slot of the sensor node according to a certain time limit to obtain the next hop node ID of each node and the time of sending data. The roadside node broadcasts the information to the vehicle-mounted node, and then the vehicle-mounted node routes data according to the next hop node ID. The vehicle-mounted node performs convergence operation on the received data and the data of the vehicle-mounted node before sending the data to form converged data, and sends the converged data in a planned data transmission time slot. Most generally, the road side nodes collect as much aggregated data as possible within a deadline. The road side nodes return the aggregated information to the data center, which is then returned to the query client.
Let the vehicle-mounted node i be at the coordinate (x) at the moment j(j) i,y(j) i) Where the vehicle i is located in the period from 1 to D forms the moving route Trc of the vehicle i as the in-vehicle node movesi＝((x(1) i,y(1) i),···,(x(D) i,y(D) i)). The present invention employs the following data transmission model. The vehicle i and the vehicle j can communicate at the moment k, and if and only if the Euclidean distance between the node i and the node j at the moment k is smaller than the wireless communication radius R. If the moving routes of the n vehicles and the positions of the road side nodes are obtained, the vehicle networking topology sequence at D moments is obtained, and then the vehicle networking topology can be constructed by utilizing the vehicle networking topology sequence. The car networking topology covers the communication relation among the nodes at D moments. In the weighted vehicle networking topology G ═ (V, E, f), a node set V consists of vehicle-mounted nodes and road-side nodes, an edge set E consists of node pairs of wireless links existing between the nodes, and f is E to 2NWhen a wireless communication link exists between node i and node j at time t, t e f ((i, j)).
Note NiIs the set of sibling nodes for node i on the topology G. The edge on the graph G represents a link, and if the capacity of each link in a single time interval is constant, the data quantity required to be transmitted by the scheduled node in one time interval does not exceed the capacity of each link in one time intervalThis capacity value.
When the sensor nodes gather and transmit data on a given car networking topology, a tree structure taking roadside nodes as roots is adopted for routing and gathering. And when effective paths exist from all the sensor nodes to the road side nodes, a tree structure can be established. For an effective path and a route convergence tree, u and v are selected as nodes on G, e1,e2,···,ekIs an edge on G, t1,t2,···,tkFor k time points, when a path P exists between the node u and the node vuv＝(u,e1,v1,e2,···,ekV) and the presence of t1,t2,···,tkLet t be1∈f(e1),t2∈f(e2),···,tk∈f(ek) Let t be1<t2<···<tkThen path P will beuvAs an active path on graph G from node u to node v. A tree composed of effective paths from all nodes to the roadside node is referred to as a route aggregation tree T (V, E, f) with the roadside node as a root.
And the road side node plans the data sending time of all the sensor nodes, so that the road side node can collect the most aggregated information within a time limit. The set of connected time instants of the links of a node and a parent node is therefore the set of candidate time instants for the transmission time slot of the node. That is, for any node i of the route aggregation tree T ═ V, (E, f) belonging to V, node i and its parent node piSet of connection instants f (e (i, p) of the links of (c)i) Set of candidate instants RT) for node ii。
And planning the time sets of sending data of all the nodes on the candidate transmission time slot sets of the nodes according to the aggregation tree, wherein one-time planning is an aggregation transmission path. If i (i e V) is satisfied for any node
S is an aggregate transmission path.
At the initial moment, each sensor node generates sensing data, namely raw data. Assume that the information content of one original data is a constant Ψ. And then the node obtains the converged data through convergence operation in the process of transmitting the data. The information quantity of the converged data obtained by convergence is the sum of the information quantities of the original data participating in the calculation of the converged data. The accumulated aggregated information amount of a node up to the time t is the sum of the information amount of the original data of the node and the information amounts of all aggregated data received by the node:
Ms(i,t)＝Ψ+Σj∈CiMs(j,k)
wherein C isiThe node i is a child node set on T, s is an aggregation transmission path, the information amount of original data on any node i is psi, the sum of the information amount of the original data on the node i and the information amount of the aggregated data received by the node i from the time T under the aggregation transmission path s is called the accumulated aggregation information amount of the node i from the time T under the aggregation transmission path s, and k is the maximum element less than T in s (i).
The data aggregation transmission planning problem is that known vehicle networking topology G formed by n vehicle-mounted nodes and 1 road side node, a route aggregation tree T taking the road side node as a root generates sensing data d by the vehicle-mounted node i at the time of 0iTime limit D, solving the convergence transmission path s, so as to maximize the amount Max (M) of convergence information collected by the road side nodes before the cut-off time D under the condition of no interference of data transmissions(AP,D))。
And there are constraints:
Cia set of child nodes that are node i; n is a radical ofiA brother node set which is a node i;
indicating that node i is different from node jThe data is transmitted. Any node i that is not an AP does not transmit data simultaneously with any of its child nodes k. For any node i, any two of its sibling nodes i and j do not transmit data at the same time.
On the aggregation tree, the nodes of the same layer or adjacent layers plan the transmission time slots cooperatively, thereby avoiding direct interference. For a node between its child node and its other non-child nodes, the candidate time sets of these nodes are first processed so that their candidate time sets are disjoint, thereby avoiding the indirect interference of scheduling them to transmit data at the same time.
The invention proposes an algorithm for solving the problem, and the basic idea is to process two kinds of interference respectively. The candidate time sets of the nodes are filtered firstly, so that the candidate time sets of the nodes which are possibly subjected to indirect interference are not intersected, and the transmission time slot planning of the nodes is ensured not to generate the indirect interference. And then optimally matching the child nodes of the nodes with the candidate transmission time slots in a layer from far to near so that the child nodes of the same father node do not interfere in transmission.
The PTSDP algorithm is divided into three steps as follows.
Step 1, constructing a non-direct interference pattern.
And 2, a candidate moment set filtering algorithm is adopted to output a new route convergence tree T'.
Step 3, planning non-interference data transmission time slot on the tree T', and outputting the convergence transmission time slot of the node.
The indirect interferogram is constructed first. In the edge set E consisting of pairs of nodes of a radio link existing between the nodes, for
Construction node CiAnd node j and node CjAn edge set E 'is formed with the edge between the nodes i, nodes containing the same elements are merged to form a node set V', and a graph GV ═ V ', E' is referred to as an indirect interferogram.
The non-direct interference pattern describes possible non-direct interference in the transmission path, i.e. when on different sub-treesWhen a wireless link exists between nodes, when one node transmits data to its parent node, another node cannot receive the data of the child node, that is, the child node of another node cannot transmit the data at this time. The existence of edges between nodes in the indirect interferogram indicates that the candidate time sets of two nodes cannot be overlapped. Therefore, the intersected parts in the candidate time sets of the nodes in the two end points of the edge are divided according to the structure of the indirect interference graph, the intersected parts are reserved in the candidate time set of the node of one end point and are removed from the candidate time set of the node of the other end point, and finally the intersection is empty, so that the aim of avoiding indirect interference is fulfilled. Therefore, avoiding the possible indirect interference part requires two steps, firstly constructing the indirect interference tree, and then obtaining the candidate time set of the node according to the interference graph. First, two edges on the non-direct interference graph GV are constructed based on the edge e (u, v) on the car networking topology G but not on the route aggregation tree T, and the presence of the edge e (u, v) causes two interferences, nodes u and CvNode v and C cannot transmit simultaneouslyuThe nodes in (1) cannot transmit simultaneously.
After the indirect interferogram is constructed, the interference information of the nodes on different subtrees can be obtained through the indirect interferogram, and the interference candidate time sets are divided, so that no intersection exists between the candidate time sets of the nodes which are possibly interfered. Different partitioning rules determine candidate time sets on different nodes, and further influence the planning of transmission time slots.
The interference subsets are first partitioned according to the non-direct interference pattern such that the number of subsets is minimized. And then dividing the whole time period according to the number of the subsets to form non-overlapping time subsets. And finally, matching the interference subset with the time subset. The method specifically comprises the following steps:
step 1: inputting a non-direct interference graph GV, a route convergence tree T ═ V, E, f)
Step 2: dividing an interference subset, and performing vertex coloring on the indirect interference pattern GV;
and step 3: dividing a time subset;
and 4, step 4: structure of the organizationMaking a bipartite graph of color and time subsets and calculating a weight wij；
And 5: obtaining maximum weight bipartite graph matching;
step 6: f' in the filtering route convergence tree T is obtained: only the f (e (j, pj)) of node j in the interference subset that matches the subset of instants TSi can retain the same element as the subset of instants;
and 7: returning to the new route aggregation tree T '═ (V, E, f')
For step 2 partition of the interference subset, the invention vertex colors the non-direct interference map. Nodes of the same color constitute a subset of the interference. Firstly, sorting the nodes from large to small according to the degrees of the nodes, coloring a first color corresponding to the first node, coloring each point which is not adjacent to the coloring point in front with the same color according to the secondary nodes arranged by the nodes, repeating the steps until all the vertexes are colored, and sharing CN colors.
In the step 3, the time subsets are divided into CN subsets TS formed by dividing the time set TS {1, 2}, D }1,TS2,···,TSCNThe following two conditions need to be satisfied:
1.∪i∈[1,CN]TSi＝TS
2.
preferably, the time set TS is equally divided into CN subsets to obtain {1,2, [ | TS |/CN ] }, { [ | TS |/CN ] +1, [ | TS |/CN ] +2, · · [ |/CN ] }, { (CN-1) [ | TS |/CN ] +1, (CN-1) [ | TS |/CN ] +2, · }. Each node is assigned an available time period during which it can schedule a transmission timeslot if its set of candidate time instants matches the time period, and when this time period is exceeded, the node loses its transmission opportunity. Then, the time in the time set TS is extracted and divided into CN subsets to obtain {1, CN +1, [ | TS |/CN ] CN +1}, {2, CN +2, · [ |/CN ] CN +2}, · |, { CN,2CN, · · ·, and }, so that the nodes have transmission opportunities in each time period, but the available time is reduced in each time period.
For step 5, matching the interference subset with the time subset, each node in the indirect interference graph belongs to one interference subset, the node itself comprises a plurality of sensor nodes, and each sensor node has a candidate time set. When establishing a match of a subset of time instants to an interfering subset, the time instants in the subset of time instants may be in a candidate set of time instants for a node of the interfering subset. The candidate set of time instants for a node determines the solution space for the transmission slot plan. The invention considers three factors influencing the optimized transmission time slot of the node, the position of the node on the aggregation tree, the relation between the nodes and the connection time set of the link of the node and the father node.
1. And taking the distance between the node and the root node as a weight value for establishing mapping. Let the distance between node i and root node be hiThe node set of the paint j color in the non-direct interference map GV ═ (V ', E ') is V 'j＝{v′j1,v′j2,···,v′jbn}，
Define the average height of the nodes of j color as hj
hj＝Σv′∈Vj′；v∈v′hv/|V′j|
2. Let the number of child nodes of node i be ciThe node set of the paint j color in the graph is V'j＝{v′j1,v′j2,···,v′jbn}，
v′jk＝{v(1),v(2),···,v(m)}，
Define the average number of children of j color as cj。
cj＝Σv′∈Vj′；v∈v′cv/|V′j|
3. Let V be the node set of paint j color in the graph'j＝{v′j1,v′j2,···,v′jbn}，
v′jk＝{v(1),v(2),···,v(m)}，
Node v and parent node pvIs f (e (v, p)v)). Computing a connected time set and time subset TS of a j-color nodeiDegree of matching mij：
mij＝Σv′∈Vj′；v∈v′|f(e(v,pv))∩TSi|/Σv′∈Vj′；v∈v′|f(e(v,pv))|
The subset of time TS corresponding to the subset of interference j is determined as followsiWherein α, β, γ are scaling factors.
wij＝α/hj+βcj+γmij
Time subset TSiFinding w of all interference subsetsijThe subset of time instants is matched to the subset of interferers with the largest value, and the process is repeated until all subsets of time instants are matched.
For the mining and merging of the Internet of vehicles, on one hand, after the Internet of vehicles platform describes the Internet of vehicles formally, an Internet of vehicles service library is constructed, and a sub-service library is formed through an Internet of vehicles service decomposition mechanism; on the other hand, the service providing end of the Internet of vehicles registers own service on the platform, and forms a service library after the platform formalization description. And when the processing center receives the sub-business requirements, entering a vehicle networking service mining link, linking a vehicle networking service library, and calculating and pairing a series of vehicle networking businesses associated with the businesses.
And introducing the ontology during service modeling, and establishing a domain knowledge base by combining a business process and a situation, so as to realize intelligent merging and meet the individual requirements of customers. After the ontology is introduced, ontology reasoning based on description logic can be performed, that is, more implicit contexts are deduced from the display contexts, and meanwhile, the ontology provides clear semantic descriptions for context information. The car networking service is a serviced car networking resource, and has its own set of functional attributes and non-functional attributes, including Qos attributes and context attributes. The present invention defines this as follows:
the vehicle networking service VCS may be represented by a quintuple in the form of:
VCS＝{Category,ServiceProfile,ServiceModel,ServiceGrouding,Resource]：
category denotes the Category to which the service belongs.
The ServiceProfile represents basic information of a service, and pairing of the basic information is an important part for realizing service pairing, and can be represented by a 5-tuple:
ServiceProfile { GeneralInfo, Functional, Qos, Resource, State }, where:
GeneralInfo is used to describe basic information for the car networking service;
functional information describing the functionality of the car networking service, such as inputs, outputs, execution conditions and results of the car networking service;
qos is used to describe the quality of service of the car networking service. The measure of service quality is variable in the car networking platform, and the formalized description of defining Qos is an extensible model:
Qos＝{Time,Cost,Reputation,Reliability,…}
the method comprises the steps that Time represents the execution Time of the service, Cost represents the Cost of the service, reporting represents the credibility of the service, and the credibility is managed in a grading mode through statistics of user evaluation; reliability represents the Reliability of the service, measured by the rate of successful execution over a period of time.
Resource is used for describing the Internet of vehicles Resource and defines all attribute information of the Internet of vehicles Resource. The state is used to describe the current state of the vehicle networking service, including active and idle. The ServiceModel describes a service process of the car networking service, i.e., service implementation details of the car networking service. The servicegroup is used for describing an access method of the vehicle networking service provider, and comprises an access address, a message format and an access port. Resource represents the vehicle networking Resource corresponding to the vehicle networking service provided by the Category.
The car networking service mining process is based on the above formal description. After the context information of the internet of vehicles service is formed, a semantic context pairing stage is entered, the stage is divided into three steps, the similarity needs to be calculated in each step, corresponding threshold values are set, services which do not meet the threshold values are filtered, and the similarity calculation is not involved.
In the car networking service, the car networking service and the car networking service are paired in a semantic context mode according to the description of the car networking service. And extracting semantic description aiming at the input information of the Web service, and judging the concept of the semantic description and the pairing item in the description. The pairing results are divided into full pairing, insertion pairing, including pairing and pairing failure to varying degrees. In the vehicle networking platform, the matching degree of the vehicle networking services A and B can be calculated by a similarity algorithm, and the basic model of the similarity matching is as follows:
sf(A,B)＝(ω1sf(A1,B1)+ω2sf(A2,B2)—+ωnsf(An,Bn))
wherein A isi,BiItem i sub-service, ω, representing a car networking serviceiAnd the weight of the ith sub-service in the pairing function is represented. Specifically, the method comprises the following steps:
where dis (A)i,Bi) Represents an ontology Ai,Biα is an adjustment factor. The present invention preferably represents the semantic distance as the difference in the shortest path length of the node in the ontology graph for the two concepts.
In the whole service mining process, semantic analysis is firstly carried out on the service of the service demand end, so that the service type of the service is obtained. And integrating semantic analysis, ontology reasoning and semantic-based matching together to finally achieve service mining. The specific process is as follows:
(1) extracting related information of Category, ServiceProfile, ServiceModel, servicegroup, Resource and ServiceAttributes from the resolver;
(2) extracting ServiceProfile of all services; then extracting the category and attribute related information in the serviceProfile;
(3) using a Category pairing algorithm to pair service types and filtering out services which do not meet the conditions.
(4) Exact pairing using keywords. When pairing is performed, the similarity function sf is constructed to calculate the similarity between concepts on the basis of the semantic distance dis ().
(5) And matching the service quality of the service with the service quality, and outputting the service with the optimal matching degree.
In the process of mining the Internet of vehicles service, the requirement of a demand end, namely the Internet of vehicles service, is taken as the center of gravity, similar Internet of vehicles service is searched to form a cluster, and then a service quality comprehensive matching algorithm is operated in parallel in the cluster, so that a result is obtained.
In particular, the calculation of each element-to-center-of-gravity distance is implemented using a MapReduce model, i.e. one MapReduce process is initiated at each iteration. Constructing initial gravity center in mapping stage, designing sample as each line of file, extracting useful data from it, and using key value pair<K，V>Formally expressing, then calculating the distance from the sample to the initial barycenter, assigning the sample to the barycenter class with the minimum distance according to the distance, marking the sample as the new cluster class, and using key value pair to pair<K1，V1>The output form of (1). Wherein K1Is the ID of the minimum distance cluster. V1Are the coordinate values of the respective dimensions of the current record.
A merge operation is inserted after the mapping that performs localized reduction processing on the intermediate results. The merging operation is to preprocess the mapping result in the node where the mapping result is located, i.e. to have the same K1V of1And processing to obtain a local clustering result, and then outputting. Parsing of Merge FunctionsThe recorded coordinate values of all dimensions are added to obtain the cumulative sum of local clustering results, and the total sample number is calculated and output<K2，V2>In which K is2Is a cluster class ID, V2Is the above-mentioned cumulative sum plus the total number of records.
In the reduction stage, a new clustering center is obtained by summarizing local clustering results and is used for the next iteration. To be provided with<K2，V2>As input, firstly calculating the sample number of local cluster output by each node, analyzing coordinate value of each dimension, correspondingly adding the corresponding accumulated values of each dimension, dividing by the just calculated sample number to obtain new cluster center coordinate, and pairing by key value<K3，V3>Form and output, wherein K3Indicating the cluster class ID, V3The resulting new cluster center is represented.
The conversion and storage of relational data to structured documents are required to be carried out aiming at different structural features and types of the car networking perception data. First, the data sensed by the sensing nodes are processed by<si,t,D>A format representation in which siIs the sensor ID, t is the timestamp, D is the perceived dynamic data content. Firstly, preprocessing the acquired original data, then packaging the data by adopting a predefined standard, firstly converting the perceived static data into relational data by XML, and then carrying out standardized packaging. Wherein, the pretreatment process comprises the following steps:
converting raw sensed data into quantity information IQ(s) of resource kiT, k), where r represents a read function, 0 represents a single read, and 1 represents multiple reads; ut (k) represents ID SiWhether the sensor senses the resource k in the sensing range, 0 represents no sensing, and 1 represents sensing; c is a constant and represents the computational dimension of the resource.
In event correlation analysis and matching operation, determining information of a key monitoring link as a key event, generating a multi-layer event description file based on XML (extensive makeup language) according to the relationship between the mined key event and an original event, performing event matching processing according to a correlation model, combining the key event and the composition of a matching template thereof, realizing the processing of the key event based on the template matching process, and finally obtaining a correlation result. Selecting template matching as a processing scheme of the data stream in the key event processing, storing the template in a knowledge base in an XML format document, and processing the process event by combining the template matching and the key event processing technology. The handling of multi-level event instances is treated as a service. And matching the key event mode according to the set service priority, thereby shortening the processing time of the key event. The specific operation is as follows:
and mapping the key event patterns in the key event pattern library into a directed graph and storing the directed graph in an internal storage database, wherein nodes, intermediate nodes and root nodes of the directed graph respectively correspond to the atomic event, the intermediate patterns and the key event patterns, and the same nodes are merged.
When an atomic event is generated, the child node performs key event association pairing and transmits a processing result to the parent node. When the corresponding parent node detects an input of a child node event instance, a matching pattern in the corresponding node is searched and association processing is performed. If the pairing is successful, the intermediate node outputs the processed key event instance to the father node for subsequent association processing, and the root node outputs the final key event for output perception processing; and if the matching is not successful, storing or discarding the corresponding event instance according to semantic judgment.
Combining with a vehicle networking service mining mechanism, the vehicle networking service merging process is divided into three stages: the first stage is that a series of car networking services related to sub-services are classified into different service clusters according to the sub-services according to the result of service mining; the second stage is a negotiation stage, which is to set constraint conditions according to the attributes of the Internet of vehicles service, screen services which do not meet basic functional requirements, and randomly select a merging scheme consisting of the Internet of vehicles service from each service cluster to finish the Internet of vehicles service; and the third stage is an optimization stage, and a target function is set according to the screened service merging initial scheme to obtain an optimal merging scheme.
In order to screen services which cannot meet the business requirements of the Internet of vehicles in the service cluster, a two-step negotiation process is executed. The first step is to negotiate and delete the services which can not meet the running conditions of the service instance of the Internet of vehicles;
assume that the existing service set VCS ═ VCS1,vcs2,…,vcsn]The context of which is csciI ═ l, 2, …, n; m car networking resources exist in the system and are recorded as vsxThe context is vsc respectivelyxL, 2, …, m, the internet of vehicle service requirement context is ldc. The constraint conditions of the context negotiation between the Internet of vehicles service and the Internet of vehicles resource are designed as follows: the context attribute set of the internet of vehicles resource comprises a context attribute set of service requirement, the types of the context attribute set are the same, and the attribute value of the required internet of vehicles resource is not less than the attribute value of the context of the service requirement, and is represented as follows:
{ldci.paj,j∈N}∈{lscx.pak,k∈N}∧ldci.paj＝lscx.paj
ldci.vaj≤lscx.paj j∈N
wherein pajRepresents the jth attribute, va, in the attribute setjAnd when the vehicle networking resource has a plurality of service instances running at the same time, the sum of the service attribute values is not greater than the attribute value of the vehicle networking resource.
When a sub-service and a sub-service having a preorder relationship need to use different Internet of vehicles resources, respectively using the resources lslAnd lspThen the following constraints should also be satisfied:
te(ldci.vate,ldcj.vate)<te(lsl.vate,lsp.vate)
where, tate represents the attribute value of the traffic and te (x, y) is the cost function used to calculate the traffic value.
And step two, negotiation is carried out, and one service is randomly selected from each service cluster to form a service merging scheme, so that the characteristic of schedule triggering can be met among all services. The latest end time of the previous service must be before the earliest start time of the next service to satisfy the schedule-triggered feature.
The invention improves the ant colony algorithm for the multi-target problem of merging the internet-of-vehicles services in the cloud computing environment. First, data is set to<Ki,Vi>Key value pair, KiIs an integer number, which is the numerical label of the ith sub-population, and ViA data structure representing the ith sub-population, which is essentially an array of all individuals in that population. When individual migration is performed, k-v is used as an input individual replacement. The total service is decomposed by the parallel operation of the mapping function and distributed to the cluster for operation, and meanwhile, the generated intermediate data is directly imported into the distributed file system. Writing m empty files in the distributed file system, corresponding to m sub-populations, adding initialization individuals to the empty files according to key value pairs, dividing total services into m mapping parallel services by MapReduce, distributing the mapping parallel services to each data node for parallel calculation, and storing the sub-populations with the added individuals into the initial files on the distributed file system; and secondly, carrying out parallelization operation and iteration evolution for multiple times to carry out individual migration, thereby obtaining an optimal solution. Firstly, reading out the corresponding sub-population and the individual needing to be migrated according to the k value, and then, evolving the population for g generations, wherein g is a preset threshold value. At the moment, MapReduce corresponds the evolution service of each sub-population to a mapping service, distributes the mapping service to data nodes for parallel computation, performs individual migration among the sub-populations after g generations of evolution are completed, adopts a difference mode for replacement, and writes the newly formed sub-population into a sub-population file in a distributed file system. And after the migration is finished, carrying out the next iteration and repeatedly operating. Thus, after the operations of multiple evolutions and migration, the optimal solution is finally obtained.
In order to balance the diversity and convergence rate of the population, the variation strategy is improved as follows:
C＝F1Gbest+(1-F1)xi
in the formula, F1Is a random number between 0 and 1, i is the corresponding individual of the generation, GbestIs the optimal individual.
In summary, the invention provides a heterogeneous information processing method based on the internet of things, which aims at the characteristics of mass and heterogeneous variability of sensing data of an internet of vehicles system, realizes internet of vehicles service description, service encapsulation, service mining and service merging through a systematic means, and adopts a uniform data interface to comprehensively sense and process heterogeneous information, thereby realizing seamless interaction of information and standardized sharing among different application system data.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented in a general purpose computing system, centralized on a single computing system, or distributed across a network of computing systems, and optionally implemented in program code that is executable by the computing system, such that the program code is stored in a storage system and executed by the computing system. Thus, the present invention is not limited to any specific combination of hardware and software.
It is to be understood that the above-described embodiments of the present invention are merely illustrative of or explaining the principles of the invention and are not to be construed as limiting the invention. Therefore, any modification, equivalent replacement, improvement and the like made without departing from the spirit and scope of the present invention should be included in the protection scope of the present invention. Further, it is intended that the appended claims cover all such variations and modifications as fall within the scope and boundaries of the appended claims or the equivalents of such scope and boundaries.
Claims (1)
1. A heterogeneous information processing method based on the Internet of things comprises the following steps:
the method comprises the steps that a service chain between a service supply end and a service demand end is established by the Internet of vehicles platform, the whole process of Internet of vehicles service is monitored in real time in the service process, and the service demand end comprises vehicles of the Internet of vehicles platform; forwarding the Internet of vehicles service request of the sensing node to a load balancing processing server; the load balancing processing server appoints a partition server according to the position of the sensing node and a load balancing strategy;
sensing the resource and environmental information of the vehicle-mounted node and the road side node, and performing access control and data transmission of the heterogeneous nodes in a heterogeneous network formed by the vehicle and the road side infrastructure; data acquisition, fusion and mass data processing are performed in different types of sensors; node negotiation and control based on feedback are realized;
establishing a correlation model between vehicle data and a traffic process state, and acquiring and transmitting the vehicle-associated data; isomorphic processing is carried out on heterogeneous data, conversion of different structural data is carried out, and a process event unified description language and a processing operational character based on XML are established; establishing a multi-level event description model and a process-oriented multi-level event correlation model, and analyzing the relationship of multi-level events; performing logic operation on the perception data, and performing correlation operation on multi-level events by applying a key event processing engine to obtain service information with semantics; performing higher-level value-added processing on the service information to obtain a key event;
the service supply end carries out virtualization processing, service packaging and standardization processing on the Internet of vehicles resources to form Internet of vehicles services, the Internet of vehicles services are stored on the distributed servers, then service requirements issued by the demand end are collected in real time, and the Internet of vehicles services are modeled and decomposed into a series of sub-services;
the Internet of vehicles platform comprises an acquisition sensing layer, an interaction layer and a service layer, wherein the interaction layer realizes data access and network transmission, and the cleaning and extraction of sensing data, key event correlation operation, data mining analysis and standardized encapsulation information; providing real-time transmission service for field detection data and issuing a management layer monitoring instruction; the interaction layer defines network identification and communication protocol, so that heterogeneous network data can be mutually identified and fused to realize access of the heterogeneous network;
the real-time collection of the service demands issued by the demand side models and decomposes the internet of vehicles service into a series of sub-services, and further comprises the following steps:
after receiving a vehicle networking service request submitted by a service demand end, a cloud end firstly analyzes the characteristics of the service, wherein the characteristics of the service comprise the scale of service execution, resources required by the service, the granularity of vehicle networking service decomposition and the complexity of the service, then the characteristics of the service are used as input, and a corresponding service decomposition algorithm is called to decompose the vehicle networking service into sub-services suitable for being processed by a vehicle networking platform to participate in the next operation; the method further comprises the following steps:
for structural features and different types of the car networking perception data, the relational data are converted and stored into a structured document: first, the data sensed by the sensing nodes are processed by<si,t,D>A format representation in which siIs sensor ID, t is timestamp, D is perceived dynamic data content; preprocessing the acquired original data, and then packaging the data by adopting a predefined standard, wherein the perceived static data is firstly converted into relational data through XML (extensive makeup language), and then is packaged in a standardized way; wherein, the pretreatment process comprises the following steps:
converting raw sensed data into quantity information IQ(s) of resource kiT, k), where r represents a read function, 0 represents a single read, and 1 represents multiple reads; ut (k) represents ID SiWhether the sensor senses the resource k in the sensing range, 0 represents no sensing, and 1 represents sensing; c is a constant and represents the calculation dimension of the resource;
the method comprises the steps that an ant colony algorithm is adopted to improve the multi-target problem of merging internet-of-vehicles services in the cloud computing environment; first, data is set to<Ki,Vi>Key value pair, KiIs an integer number, which is the numerical label of the ith sub-population, and ViA data structure representing the ith sub-population, which is essentially an array of all individuals in the population; when individual migration is carried out, k-v is used as an input individual replacement; the total service is decomposed by the parallel operation of the mapping function and is distributed to the cluster for operation, and meanwhile, the generated intermediate data is directly imported into the distributed file system; writing m empty files in a distributed file system, corresponding to m sub-populations, adding an initialization individual to the empty files according to a key value pair, dividing a total service into m mapping parallel services by MapReduce, distributing the mapping parallel services to each data node and distributing the mapping parallel services to each data nodePerforming calculation, and then storing the sub-population added with the individuals into an initial file on a distributed file system; secondly, performing parallelization operation and iteration evolution for multiple times to perform individual migration so as to obtain an optimal solution; in order to balance the diversity and convergence rate of the population, the variation strategy is improved as follows:
C＝F1Gbest+(1-F1)xi
in the formula, F1Is a random number between 0 and 1, i is the corresponding individual of the generation, GbestIs the optimal individual.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011244059.7A CN112422666A (en) | 2018-09-06 | 2018-09-06 | Internet of vehicles platform |
| CN201811038319.8A CN109194746B (en) | 2018-09-06 | 2018-09-06 | Heterogeneous information processing method based on Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811038319.8A CN109194746B (en) | 2018-09-06 | 2018-09-06 | Heterogeneous information processing method based on Internet of things |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011244059.7A Division CN112422666A (en) | 2018-09-06 | 2018-09-06 | Internet of vehicles platform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109194746A CN109194746A (en) | 2019-01-11 |
| CN109194746B true CN109194746B (en) | 2021-03-26 |
Family
ID=64914909
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011244059.7A Withdrawn CN112422666A (en) | 2018-09-06 | 2018-09-06 | Internet of vehicles platform |
| CN201811038319.8A Active CN109194746B (en) | 2018-09-06 | 2018-09-06 | Heterogeneous information processing method based on Internet of things |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011244059.7A Withdrawn CN112422666A (en) | 2018-09-06 | 2018-09-06 | Internet of vehicles platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112422666A (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111857031B (en) * | 2020-07-27 | 2021-06-15 | 山东有人物联网股份有限公司 | Serial PLC protocol conversion method, device and system for requesting dynamic balance |
| CN111967753B (en) * | 2020-08-10 | 2023-06-02 | 成都信息工程大学 | Cloud manufacturing environment information sensing system and method for manufacturing task execution |
| CN112950929B (en) * | 2021-01-11 | 2022-08-05 | 张昕 | All-weather real-time traffic information monitoring and QOS hierarchical control system and method |
| CN112799818B (en) * | 2021-02-03 | 2022-09-23 | 上海交通大学 | Cloud fusion task migration method and system based on check point description file |
| CN113095084B (en) * | 2021-03-16 | 2022-09-23 | 重庆邮电大学 | Semantic service matching method and device in Internet of things and storage medium |
| CN113259341B (en) * | 2021-05-11 | 2022-06-07 | 南京信易达计算技术有限公司 | Vehicle-connected data sharing cloud storage system and method based on 5G |
| CN114095356B (en) * | 2021-11-16 | 2024-04-19 | 北京中科晶上科技股份有限公司 | Method and device for configuring node task strategy in real time |
| CN115460081B (en) * | 2022-09-06 | 2024-05-10 | 长城汽车股份有限公司 | Disaster recovery control method, device, system, equipment and storage medium |
| CN115550449B (en) * | 2022-09-16 | 2024-07-02 | 深蓝汽车科技有限公司 | Digital commodity processing method, device, equipment and medium based on Internet of vehicles |
| CN117670172B (en) * | 2023-10-27 | 2024-06-14 | 广东省电子口岸管理有限公司 | Foreign trade data processing method and system |
| CN117520606B (en) * | 2024-01-04 | 2024-04-09 | 浙江大学 | Method and device for importing heterogeneous data sources into graph database |
| CN117726147B (en) * | 2024-02-08 | 2024-04-26 | 中航信移动科技有限公司 | Adaptation-based server management method, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982389A (en) * | 2012-11-02 | 2013-03-20 | 东南大学 | Method for solving combination and optimization problems using ant colony optimization technology based on Map Reduce |
| CN103440522A (en) * | 2013-08-31 | 2013-12-11 | 福州大学 | Vehicle dispatching method with genetic algorithm and MapReduce combined |
| CN104331321A (en) * | 2014-10-09 | 2015-02-04 | 冷明 | Cloud computing task scheduling method based on tabu search and load balancing |
| CN105912409A (en) * | 2016-06-30 | 2016-08-31 | 天脉聚源(北京)传媒科技有限公司 | Task scheduling method and device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719933B (en) * | 2009-11-25 | 2012-06-27 | 北京航空航天大学 | Combination method of manufacturing grid resource services orienting whole life cycle and supporting semantemes |
| CN103207606B (en) * | 2013-03-27 | 2015-07-22 | 西北工业大学 | Embedded perception device and method for multi-source manufacturing information |
| CN103458033B (en) * | 2013-09-04 | 2016-05-11 | 北京邮电大学 | Event-driven, service-oriented Internet of Things service provider system and method for work thereof |
| EP3269126A4 (en) * | 2015-03-12 | 2018-09-05 | Intel Corporation | Method and apparatus for compaction of data received over a network |
-
2018
- 2018-09-06 CN CN202011244059.7A patent/CN112422666A/en not_active Withdrawn
- 2018-09-06 CN CN201811038319.8A patent/CN109194746B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982389A (en) * | 2012-11-02 | 2013-03-20 | 东南大学 | Method for solving combination and optimization problems using ant colony optimization technology based on Map Reduce |
| CN103440522A (en) * | 2013-08-31 | 2013-12-11 | 福州大学 | Vehicle dispatching method with genetic algorithm and MapReduce combined |
| CN104331321A (en) * | 2014-10-09 | 2015-02-04 | 冷明 | Cloud computing task scheduling method based on tabu search and load balancing |
| CN105912409A (en) * | 2016-06-30 | 2016-08-31 | 天脉聚源(北京)传媒科技有限公司 | Task scheduling method and device |
Non-Patent Citations (3)
| Title |
|---|
| 基于MapReduce的蚁群优化算法实现方法;王诏远等;《计算机科学》;20140731;全文 * |
| 基于改进蚁群算法的云计算资源分配研究;秦晓娜;《中国优秀硕士学位论文全文数据库 信息科技辑》;20150115;全文 * |
| 基于蚁群算法的云计算资源调度研究;王艳平;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160215;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109194746A (en) | 2019-01-11 |
| CN112422666A (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109194746B (en) | Heterogeneous information processing method based on Internet of things | |
| CN109151042B (en) | Internet of Things perception data Intelligent planning method | |
| CN113316118B (en) | Unmanned aerial vehicle cluster network self-organizing system and method based on task cognition | |
| Wan et al. | Toward dynamic resources management for IoT-based manufacturing | |
| CN109257422B (en) | Method for reconstructing perception network information | |
| Jabbarpour et al. | Applications of computational intelligence in vehicle traffic congestion problem: a survey | |
| Massobrio et al. | Towards a cloud computing paradigm for big data analysis in smart cities | |
| Abdoos et al. | Hierarchical control of traffic signals using Q-learning with tile coding | |
| Karagiannis et al. | Comparison of alternative architectures in fog computing | |
| Hussain et al. | CODE-V: Multi-hop computation offloading in Vehicular Fog Computing | |
| Pham | Optimization of resource management for nfv-enabled iot systems in edge cloud computing | |
| CN111432005B (en) | Service migration method under narrow-band weak networking condition | |
| CN116506474B (en) | Electric power micro-service layering system based on cloud edge cooperation | |
| Abosaif et al. | Quality of service-aware service selection algorithms for the internet of things environment: A review paper | |
| Guerrero et al. | Genetic-based optimization in fog computing: Current trends and research opportunities | |
| CN110460662A (en) | The processing method and system of internet of things data | |
| Premalatha et al. | Optimal energy-efficient resource allocation and fault tolerance scheme for task offloading in IoT-FoG computing networks | |
| Dai et al. | A software-defined-networking-enabled approach for edge-cloud computing in the internet of things | |
| Abbasi et al. | A fault-tolerant adaptive genetic algorithm for service scheduling in internet of vehicles | |
| Sahni et al. | Distributed resource scheduling in edge computing: Problems, solutions, and opportunities | |
| Lin et al. | A bottom-up tree based storage approach for efficient IoT data analytics in cloud systems | |
| Wu et al. | Characterizing user association patterns for optimizing small-cell edge system performance | |
| Alsadie | A Comprehensive Review of AI Techniques for Resource Management in Fog Computing: Trends, Challenges and Future Directions | |
| Almakdi et al. | An Intelligent Load Balancing Technique for Software Defined Networking based 5G using Macine Learning models | |
| Trabelsi et al. | Global aggregation node selection scheme in federated learning for vehicular ad hoc networks (VANETs) |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210309 Address after: 550000 No.9, 12 / F, unit 1, building B, Jinli building, 89 Duyun Road, Guiyang National High tech Industrial Development Zone, Guiyang City, Guizhou Province Applicant after: Guizhou Yilian Youlian Network Technology Co.,Ltd. Address before: 510000 Building A30, 68 Nanxiang Road, Huangpu District, Guangzhou City, Guangdong Province Applicant before: GUANGZHOU ZHIHONG TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 550000 No. 4, 18th floor, Qiangui Jinyang business office building, Chengxin North Road, guanshanhu District, Guiyang City, Guizhou Province Patentee after: Guizhou kaxiong Kadi Network Technology Co.,Ltd. Address before: 550000 No.9, 12 / F, unit 1, building B, Jinli building, 89 Duyun Road, Guiyang National High tech Industrial Development Zone, Guiyang City, Guizhou Province Patentee before: Guizhou Yilian Youlian Network Technology Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP02 | Change in the address of a patent holder |
Address after: No. 3, 19th Floor, Building B, Morgan Center, Lincheng West Road, Jinyang Street, Guanshanhu District, Guiyang City, Guizhou Province 550000 Patentee after: Guizhou kaxiong Kadi Network Technology Co.,Ltd. Address before: 550000 No. 4, 18th floor, Qiangui Jinyang business office building, Chengxin North Road, guanshanhu District, Guiyang City, Guizhou Province Patentee before: Guizhou kaxiong Kadi Network Technology Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |