CN109194746A - Heterogeneous Information processing method based on Internet of Things - Google Patents
Heterogeneous Information processing method based on Internet of Things Download PDFInfo
- Publication number
- CN109194746A CN109194746A CN201811038319.8A CN201811038319A CN109194746A CN 109194746 A CN109194746 A CN 109194746A CN 201811038319 A CN201811038319 A CN 201811038319A CN 109194746 A CN109194746 A CN 109194746A
- Authority
- CN
- China
- Prior art keywords
- node
- service
- car networking
- data
- services
- 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
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 Heterogeneous Information processing method based on Internet of Things that the present invention provides a kind of, this method comprises: car networking platform establishes the service chaining between service provision end and demand for services end, the whole process of car networking service is monitored in real time in service process, the demand for services end includes the vehicle of car networking platform.The Heterogeneous Information processing method based on Internet of Things that the invention proposes a kind of, magnanimity and isomery variability feature for car networking system perception data, using unified data-interface to the comprehensive perception of Heterogeneous Information and processing, realize that the standardization between the seamless interaction of information and different application systems data is shared.
Description
Technical field
The present invention relates to Internet of Things, in particular to a kind of Heterogeneous Information processing method based on Internet of Things.
Background technique
With the sharply development of computer and networks, intelligent transportation not only becomes more and more important in position in its national economy,
Intelligent transportation service mode becomes the important shadow for improving traffic operation efficiency, reducing transportation cost, improving entire society's competitiveness
The factor of sound.Currently, cloud computing had evolved to using the landing stage, enterprise, in terms of all achieve it is huge at
Just, but slower in intelligent transportation industry development, its development proposes challenge to Modern Traffic, be no longer limited to it is data-intensive,
But more extensions can be provided.Information service based on Internet of Things and cloud computing technology is perceived from source, is taken to cloud
Business executes, and provides abundant, customized service content according to demand.All kinds of intelligent transportation resources and customer resources are virtualized,
Serviceization encapsulation, publication and registration are carried out to car networking, any position of policymaker beyond the clouds is allowed to use different ends
End, to obtain corresponding car networking service.
Currently, the existing scheme for intelligent transportation service mode is mainly from information system angle, developing intellectual resource traffic
Information System configuration frame and data center；And the intelligent transportation clothes under collection group terminal calculating environment are not directed to for Services Integration
The considerations of model innovation of being engaged in, i.e., there is no the service describing of car networking, service encapsulation, services mining and the systems for servicing merger
Solution.And the data of car networking system perception have magnanimity, polynary isomerism and space-time variability, currently to isomery
Unified perception data description scheme is not yet established in informix perception and processing, and place can not be standardized to event information
Reason, association pairing processing etc., it is difficult to realize the shared and interoperability between the seamless interaction of information and different application systems data.
Summary of the invention
To solve the problems of above-mentioned prior art, the invention proposes at a kind of Heterogeneous Information based on Internet of Things
Reason method, comprising:
Car networking platform establishes the service chaining between service provision end and demand for services end, to car networking in service process
The whole process of service is monitored in real time, and the demand for services end includes the vehicle of car networking platform.
Preferably, the service provision end carries out virtualization process, service encapsulation, standardization to car networking resource,
Car networking service is formed, is stored on distributed server, the demand for services that then acquisition demand end is issued in real time, to car networking
Business model resolves into a series of subservices.
Preferably, the resource and environmental information of vehicle-mounted node and trackside node are perceived, in vehicle and trackside basis
In the heterogeneous network that facility is constituted, the access control and data transmission of heterogeneous nodes are carried out；It is held in different types of sensor
The acquisition of row data, fusion and mass data processing；Realize that the node based on feedback is negotiated and controlled.
Preferably, the correlation model between vehicle data and traffic process state is established, vehicle joins the acquisition and transmission of data；
Homogeneous processing is carried out to isomeric data, carries out the conversion of different structure data, and establishes the process event based on XML and uniformly retouches
Predicate make peace processing operation symbol；The multi-level event correlation model of multi-level event description model and procedure-oriented is established, is carried out
The relation decomposing of multi-level event；Perception data is subjected to logical operation, key application Event processing engine carries out multi-level thing
The association operation of part obtains semantic information on services；The increment processing that information on services is carried out to higher, obtains crucial thing
Part.
Preferably, the demand for services of real-time acquisition demand end publication, to car networking business model, resolve into it is a series of
Subservice further comprises:
After cloud is connected to the car networking service request of demand for services end submission, the feature of business is analyzed first, institute
The feature for stating business includes resource, granularity, the industry of car networking service decomposition of the scale of business execution, finishing service needs
The complexity of business calls corresponding service decomposition algorithm by car networking business point then using the characteristic of these business as input
Solution participates in operating in next step at the subservice of suitable car networking platform processes.
The present invention compared with prior art, has the advantage that
The Heterogeneous Information processing method based on Internet of Things that the invention proposes a kind of, for car networking system perception data
Magnanimity and isomery variability feature realize car networking service describing, service encapsulation, services mining kimonos by the means of system
Business merger realizes that the seamless interaction of information and difference are answered using unified data-interface to the comprehensive perception of Heterogeneous Information and processing
It is shared with the standardization between system data.
Detailed description of the invention
Fig. 1 is the flow chart of the Heterogeneous Information processing method according to an embodiment of the present invention based on Internet of Things.
Specific embodiment
Retouching in detail to one or more embodiment of the invention is hereafter provided together with the attached drawing of the diagram principle of the invention
It states.The present invention is described in conjunction with such embodiment, but the present invention is not limited to any embodiments.The scope of the present invention is only by right
Claim limits, and the present invention covers many substitutions, modification and equivalent.Illustrate in the following description many details with
Just it provides a thorough understanding of the present invention.These details are provided for exemplary purposes, and without in these details
Some or all details can also realize the present invention according to claims.
An aspect of of the present present invention provides a kind of Heterogeneous Information processing method based on Internet of Things.Fig. 1 is according to the present invention
The Heterogeneous Information processing method flow chart based on Internet of Things of embodiment.
In car networking platform of the invention, car networking resource is formed after being virtualized and is serviced, similar service composition service group,
And different service groups constitutes service clearance.After resource is packed, the scheduling of car networking resource is converted to and is dug in service group
Pick, selection and merger car networking service.The main part for the operation flow that demand for services end, platform and feed end constitute.Clothes
Business feed end provides the service of various isomeries to car networking platform；Car networking demand for services end include entire car networking platform at
Member's vehicle；Car networking platform is responsible for establishing supply and demand service chaining between the two, firstly, car networking resource that feed end is provided and
After service carries out virtualization process, service encapsulation, standardization, car networking service is formed, is stored on distributed server,
Then the demand for services that acquisition demand end is issued in real time, to car networking business model, resolves into a series of subservices, finally by
Services mining, merger, cooperation match out optimal car networking for car networking business and service merger, meanwhile, it is right in service process
The whole process of car networking service is monitored in real time.
Car networking platform includes acquisition sensing layer, alternation of bed and service layer.Sensing layer is acquired to the vehicle in car networking environment
The resource and environmental information for carrying node and trackside node are perceived, and the resource of wireless automotive networks is completed by dns server
Information management and synergistic application, and the decision information for receiving feedback executes corresponding control command.Alternation of bed realizes data access
Cleaning with network transmission, perception data is associated with operation, data mining analysis, standardized packages information with extraction, critical event；
Real-time Transmission service is provided for on-site test data, and issues management level monitoring instruction.Alternation of bed defines network identity, communication protocols
View, allows heterogeneous network data to be mutually distinguishable and merge, realizes the access of heterogeneous network.Application layer is in information processing tool
Under support, decision application service is provided.
In order to realize the data acquisition of optimum choice, the client of access is fed back and controlled, node data is selected
To carry out cross-layer optimizing to the communication protocol of vehicle-mounted node for the vehicle-mounted data stream information on upper layer feedback to sensor node.?
In the heterogeneous network that vehicle and trackside infrastructure are constituted, need to complete the access control and data transmission of heterogeneous nodes；It is different
Sensor data acquisition, fusion and the mass data processing of type；Node based on feedback negotiates and control.
It acquires sensing layer and joins data perception environment using the vehicle of high reliability, acquire multivariate data and management heterogeneous sensor
Device, In-vehicle networking, industrial local network fieldbus etc. including perceiving and transmitting real-time vehicle connection data.Structure building data acquisition first
The perception environment needed with transmission, establishes the sensor network allocation models for measuring different parameters, and with sensor cost
The minimum objective function and constraint condition that sensor network is determined as objective function；Establish sensor information registration and information
Library is handled, and carries out data delineation, realizes the description and definition of the car networking resource information with various heterogeneous sensors；Perception
With the real time data of transmission vehicle networked resources, when vehicle node reaches sensing region, automatic data collection or recognition node are felt
Know car networking resource information, then it represents that the atomic event of generation is adopted by real-time perception, then by communication network transmission sensing node
The car networking resource data collected.Alternation of bed mainly realizes the fusion of heterogeneous network and interconnects, and meets magnanimity, real-time sensing
The transmission demand of data.
The processing of car networking critical event includes the correlation model established between vehicle data and traffic process state, and vehicle joins number
According to acquisition and transmission；The Homogeneous of isomeric data is handled, and carries out the conversion of different structure data, and establish the mistake based on XML
Journey event Unify legislation language and processing operation symbol；The multi-level event for establishing multi-level event description model and procedure-oriented is closed
Gang mould type carries out the relation decomposing of multi-level event；Perception data is subjected to logical operation, key application Event processing engine into
The association operation of the multi-level event of row, obtains semantic information on services；The increment processing that information on services is carried out to higher, obtains
To critical event.
Alternation of bed carries out the Real-time Logic calculation process of perception data, and complete data and thing according to Data Integration rule
The foundation of mapping relations and treatment mechanism between part, the final processing and information integration for realizing data.Join data obtaining vehicle
On the basis of, contextual definition, regular operation and the increment processing of multiple information are carried out, supports process monitoring and decision excellent to provide
The critical event information of change；According to the type of event, the classification for carrying out process event collects and stores, efficient in favor of data
It calls.
Car networking platform virtualization handles the actual resource post package of isomery into service, is deployed in shape in different virtual machines
At clustered node, multiple service groups are then divided into according to the function of car networking resource, by connecting each service group
Register node forms the overlay network with special topological structure.After resource is packed, similar service composition service group, service group
Service clearance is formed, excavation, selection and the calling of service are all completed in service clearance.
After cloud is connected to the car networking service request of demand for services end submission, the feature of business is analyzed first, is wrapped
Include the scale of business execution, resource, the granularity of car networking service decomposition, the complexity of business that finishing service needs, so
Afterwards using the characteristic of these business as input, call corresponding service decomposition algorithm by car networking service decomposition at suitable car networking
The subservice of platform processes participates in operating in next step.
Using the acquisition data volume of vehicle connection data, acquisition precision, sensing range as constraint, determines in In-vehicle networking and accordingly pass
The minimal hardware cost of sensor is objective function, establishes the model that vehicle-mounted node wireless In-vehicle networking is distributed rationally:
Wherein ASiIndicate i-th of onboard sensor,Indicate that i-th of onboard sensor is equipped with m (i) a heterogeneous sensor group
J-th of component of part, n are represented in In-vehicle networking for onboard sensor quantity sum needed for acquisition information.ωiFor data
Weight, fiFor sample frequency, that is, optimization object of node, ρiAnd ρmaxRespectively vehicle-mounted data density and maximum vehicle-mounted data density,For predefined coefficient of relaxation, constraint condition is set as, sample frequency between the physics sample frequency of sensor minimum and
Between maximum, setting sample frequency is less than transmission rate, and the load of node is less than channel capacity.
Alternation of bed provides unified data acquisition access port, and the node for participating in perception is connect by internet to alternation of bed transmission
Enter request, carry position and traffic parameter information in request, is requested if node is not supported directly to send to alternation of bed, by AP
Protocol conversion is carried out as proxy server；
The location information of alternation of bed processing sensing node upload simultaneously forwards a request to load balance process server；Load
Position and load balancing specified partition server of the equilibrium treatment server according to sensing node；
Sensing node reconnects partitioned server；The position of sensing node and map are subjected to matching and correlation, then root
The data that decision decides whether to acquire node upload are carried out according to the position of sensing node and traffic parameter, if being not required to acquisition
Operating mode, which is arranged, reduces sample frequency, and the vehicle-mounted data stream of sensing node upload is then handled if necessary to acquisition；
By treated, traffic information data is stored in database to partitioned server, inquires and passes to coordination control strategy server
Sensor protocol optimization strategy gives sensing node returning response；Inquiry actively selects optimal vehicle-mounted data stream to mention from database
It supplies control algolithm and carries out signal control optimization；Need the position that cooperates with according to policy selection, and coordinate multiple roadside units into
Row collaboration；
Collaborative Control server provides Regional Synergetic control strategy and optimum results；Collaborative Control server is tied according to optimization
Fruit provides timing strategy and is handed down to roadside unit；User inquires car networking information to alternation of bed by internet.
Vehicle-mounted node will be to partitioned server registration information when accessing network, and server generates in subregion only at this time
One node serial number.When sensing node has listened to monitoring data generation, trigger once complete from shaking hands to disconnecting
Communication process.It completes to establish connection by three-way handshake, traffic data is sent to server by sensing node after connection is established,
Server fills node control order, feedback control perception section according to real-time vehicle-mounted data stream and traffic control logic in the response
Operating mode, the transmission window of point.Each stage of corresponding states machine only receives message and message that the state defines.Communication
Period supports to update signaling parameter by setting message, allow the agreement according to applied customization and to sample frequency, transmission
Opportunity, time-out time, number of retransmissions and transmission window size parameter are adaptively adjusted.
Sensing node manager is realized by Web server in all car networking resources for managing heterogeneous sensor
Additional sensor is controlled and is connected, and passes through the activity of embedded processing systems management of sensor.Data perception and dynamic
Database transmission is parallel to be executed, while assigning order of the upper platform to car-mounted terminal.It will based on data interaction versatility requirement
Standardized packages perception data transmission operation is considered as Web service request, by communication network realize perception data transmission and
It calls.
Infrastructure is directly contacted with sensor node；The plug and play of heterogeneous sensor is realized by Embedded Processor
Operation service；Intermediate member provides the service of assigning for fusion, real-time Transmission and the decision information that bottom layer node acquires data, and
Data information is subjected to logical operation and generates event.
When client needs to collect the traffic information of relevant road segments, phase is sent the requests to by neighbouring trackside node
The trackside node answered.Trackside node predicts subsequent a period of time by the historical data for the vehicle-mounted node car networking topology collected
The car networking change in topology of node.On this basis, trackside node plans the routed path of sensor node according to a certain time limit
With aggregate transmission time slot, obtain each node next-hop node ID and send data at the time of.Trackside node is by these information
It is broadcast to vehicle-mounted node, then vehicle-mounted node routes data according to next-hop node ID.Vehicle-mounted node will be received before sending data
The data and the data of oneself arrived carry out converge operation and form convergence data, send convergence number in the data transmission slots of planning
According to.Most comprehensive, trackside node collects convergence data as much as possible within the cut-off time limit.Accumulated information is returned to number by trackside node
According to center, then the information is returned to inquiring client terminal.
If vehicle-mounted node i is in coordinate (x in moment j(j) i,y(j) i) at, with the movement of vehicle-mounted node, vehicle i is 1 to D
The mobile route Trc of period present position formation vehicle ii=((x(1) i,y(1) i),···,(x(D) i,y(D) i)).The present invention adopts
With following data transfer model.Vehicle i and vehicle j can communicate at the k moment, and if only if in k moment node i and node
Euclidean distance between j is less than wireless communication radius R.If obtaining the mobile route of n vehicle and the position of trackside node,
The car networking topological sequences at D moment are obtained, and then can use car networking topological sequences construction car networking topology.The car networking
Topology covers the connected relation between the node at D moment.Weighting car networking topology G=(V, E, f) in, node collection V by
Vehicle-mounted node and trackside node composition, for side collection E by the node of the Radio Link existed between node to forming, f is E to 2N's
(wherein N is nature manifold for one mapping.When node i and node j in moment t there are when wireless communication link, t ∈ f ((i, j)).
Remember NiFor brotgher of node collection of the node i on topological diagram G.The side schemed on G indicates a link, if single period
The capacity of interior each link is constant, then the data volume that node needs to transmit within a period that is scheduled is no more than the capacity
Value.
Sensor node is used when carrying out aggregate transmission data in given car networking topology using trackside node as root
Tree is routed and is converged.When all the sensors node to trackside node is there are when active path, tree-shaped can be established
Structure.For active path and route assemblage tree, the present invention selects u and v for the node on G on a car networking topological diagram G,
e1,e2,···,ekFor the side on G, t1,t2,···,tkFor k moment, when there are a roads between node u and node v
Diameter Puv=(u, e1,v1,e2,···,ek, v) and there are t1,t2,···,tk, so that t1∈f(e1),t2∈f
(e2),···,tk∈f(ek), so that t1<t2<···<tk, then by path PuvAs node u to node v having on figure G
Imitate path.The tree being made of the active path of all nodes to trackside node is known as using trackside node as the route assemblage tree T of root
=(V, E, f).
Trackside node plans the data transmission time of all the sensors node, and the trackside node within the time limit is collected into
Most accumulated informations.Therefore the connection moment collection of the link of node and father node is combined into the candidate moment of the node-node transmission time slot
Set.V, node i and its father node p are belonged to for any node i of route assemblage tree T=(V, E, f)iLink connection
Moment set f (e (i, pi)) be node i candidate moment set RTi。
Gather at the time of planning the transmission data of all nodes according to convergence tree on the candidate transport time slot sets of node,
Such the primary system plan is exactly an aggregate transmission path.If met for any node i (i ∈ V)Then s is
One aggregate transmission path.
It carves at the beginning, each sensor node generates a perception data, as initial data.Assuming that an original number
According to information content be constant Ψ.Then node obtains convergence data by converge operation during transmitting data.It converges
To the information content of a convergence data be the sum of the information content of initial data for participating in the convergence data and calculating.On one node
By the end of all convergence numbers that the accumulation accumulated information amount of t moment receives for the information content of the node initial data with the node
According to the sum of information content:
Ms(i, t)=Ψ+Σj∈CiMs(j,k)
Wherein CiThe child nodes collection for being node i on T, s is aggregate transmission path, the initial data on any node i
Information content be Ψ, the information content and node i of the initial data in node i are received at the s of aggregate transmission path by the end of moment t
The information content summations of convergence data be known as node i at the s of aggregate transmission path by the end of the accumulation accumulated information amount of t moment, k
For the greatest member for being less than t in s (i).
Data aggregate transmission planning problem is the car networking topology G that known n vehicle-mounted nodes and 1 trackside node are constituted,
Using trackside node as the route assemblage tree T of root, perception data d is generated in 0 moment vehicle-mounted node ii, time limit D, solution aggregate transmission
Path s, so that maximizing the accumulated information that trackside node is collected in the case where meeting data transmission without interference before cut-off time D
Measure Max (Ms(AP,D))。
And there is constraint:
CiFor the child nodes collection of node i；NiFor the brotgher of node collection of node i；Indicate node i and node
J does not send data simultaneously.The node i of any one non-AP and its any child nodes k do not send data simultaneously.For any node
I, its any two brotgher of node i and j do not send data simultaneously.
On convergence tree, its transmission time slot of the node collaborative planning of same layer or adjacent layer, to avoid directly interfering.It is right
Between the child nodes and its other non-child nodes of a node, the candidate moment of these nodes of first processing gathers,
So that non-intersecting between their set of candidate moment, thus avoid for they being planned for synchronization send data generate it is non-straight
Connect interference.
The invention proposes the algorithm for solving the problem, basic thought is exactly to handle two kinds of interference respectively.Filtering section first
The set of candidate moment of point, the set of candidate moment for allowing to occur the node of indirect interference is non-intersecting, to guarantee to save
The transmission time slot planning of point will not generate indirect interference.Then from as far as the nearly child nodes by layer plan node and candidate
The Optimized Matching of transmission time slot, so that not generating interference when the child nodes of same father node are transmitted.
It is as follows that PTSDP algorithm is divided into three steps.
Step 1. constructs indirect interference pattern.
Step 2. candidate's moment gathers filter algorithm, exports new route assemblage tree T '.
Step 3. is above planned without interference data transmission time slot, the aggregate transmission time slot of output node in tree T '.
Indirect interference pattern is constructed first.In the node by the Radio Link existed between node to the side collection E formed
In, forStructure node CiSide and node C between node jjThe collection when being formed between node i
E ', the node containing identical element merge to form node collection V ', and figure GV=(V ', E ') is known as indirect interference pattern.
The indirect interference pattern describes possible indirect interference in transmission path, i.e., when the node in different subtrees
Between there are when Radio Link, when a node sends data to its father node, another node cannot receive child nodes
Data, i.e., the child nodes of another node cannot send data at this time.There are side tables between indirect interference pattern interior joint
Showing cannot be overlapped between the set of candidate moment of two nodes.Therefore, two of side are held according to the structure of indirect interference pattern
The part intersected is divided in the set of candidate moment of point interior joint, to the part of intersection the node of an endpoint candidate
Retain in moment set, is removed in the set of candidate moment of the node of another endpoint, finally make intersection for sky, that is, reach
Avoid the purpose of indirect interference.Therefore, it avoids possible indirect interference portion from needing two steps, constructs first non-straight
Interference tree is connect, is then gathered according to the candidate moment that interference pattern obtains node.Basis is on car networking topology G without on road first
By the side e (u, v) on convergence tree T, two sides on indirect interference pattern GV are constructed, the presence of side e (u, v) will lead to two and do
It relates to, node u and CvIn node be unable to simultaneous transmission, node v and CuIn node be unable to simultaneous transmission.
After construction obtains indirect interference pattern, the interference of the node in different subtrees can be obtained by indirect interference pattern
Information below demarcates the set of candidate moment of interference, does not have between the set of candidate moment for the node for allowing to interfere
Intersection.Different division rules just determines that the candidate moment on different nodes gathers, and then influences the planning of transmission time slot.
Dividing interference subset according to indirect interference pattern first makes the number of subset minimum.Then by entire period root
It is divided according to subset number, forms nonoverlapping moment subset.Finally interference subset is matched with moment subset.Specifically
The following steps are included:
Step 1: inputting indirect interference pattern GV, route assemblage tree T=(V, E, f)
Step 2: dividing interference subset, vertex coloring is carried out to indirect interference pattern GV；
Step 3: dividing moment subset；
Step 4: the bigraph (bipartite graph) of construction color and moment subset calculates weight wij；
Step 5: seeking max weighted bipartite matching；
Step 6: the f in filtering route assemblage tree T obtains f ': only and in the matched interference subset of moment subset TSi
Element identical with the moment subset can be retained in the f (e (j, pj)) of node j；
Step 7: returning to new route assemblage tree T '=(V, E, f ')
Division for step 2 interference subset, the present invention carry out vertex coloring to indirect interference pattern.The section of same color
Point one interference subset of composition.It is sorted from large to small first according to the degree of node, corresponding first node of first color
Coloring, and light same color according to the minor node pair of node arrangement and front colored spots be not each of adjacent, repeatedly above-mentioned step
Suddenly until all vertex colorings are completed, if having shared CN color.
In the division of step 3 moment subset, it is sub that set TS=constantly { 1,2, D } is divided to CN formed
Collect TS1,TS2,···,TSCN, it needs to meet two following conditions:
1.∪i∈[1,CN]TSi=TS
2.
Preferably, moment set TS is divided into CN subset, obtain 1,2, [| TS |/CN], [| TS
|/CN]+1,[|TS|/CN]+2,···,2[|TS|/CN]},···,{(CN-1)[|TS|/CN]+1,(CN-1)[|TS|/
CN]+2,···}.Each node is assigned one section of pot life, if the set of candidate moment of node and this period
Match, then the node can during this period of time plan transmission time slot, and when being more than this period, which loses transmission opportunity.So
It carries out extracting at the time of afterwards by set TS constantly and is divided into CN subset, obtain 1, CN+1, [| TS |/CN] CN+1 },
2, CN+2, [| TS |/CN] CN+2 }, { CN, 2CN, } allows node to have within each period
The chance of transmission, but can be reduced with the moment within each period.
Interfere the matching of subset and moment subset for step 5, each node in indirect interference pattern, which belongs to one, to be done
Subset is related to, the node itself includes multiple sensor nodes, and each sensor node has the candidate moment to gather.The triplet when establishing
When collection and the matching of interference subset, it can gather at the candidate moment of the node of the interference subset at the time of in the moment subset
In.The set of candidate moment of node determines the solution space of transmission time slot planning.When the present invention considers to influence node optimization transmission
Three factors of gap, position of the node on convergence tree, the relationship between node and node are connected to the link of father node
Moment set.
1. by node as the weight for establishing mapping at a distance from root node.If distance of the node i apart from root node is hi,
The node that j color is applied in indirect interference pattern GV=(V ', E ') integrates as V 'j={ v 'j1,v′j2,···,v′jbn, The node average height for defining j color is hj
hj=Σv′∈Vj′；v∈v′hv/|V′j|
2. setting the child nodes number of node i as ci, the node that j color is applied in the figure integrates as V 'j={ v 'j1,v
′j2,···,v′jbn,v′jk={ v(1),v(2),···,v(m),Define being averaged for j color
Child's number is cj。
cj=Σv′∈Vj′；v∈v′cv/|V′j|
3. the node for setting painting j color in the figure integrates as V 'j={ v 'j1,v′j2,···,v′jbn,v′jk=
{v(1),v(2),···,v(m),Node v and father node pvLink connection moment collection be combined into f (e (v, pv))。
Calculate the connection moment set and moment subset TS of the node of j coloriMatching degree mij:
Mij=Σv′∈Vj′；v∈v′|f(e(v,pv))∩TSi|/Σv′∈Vj′；v∈v′|f(e(v,pv))|
Interference subset j is defined below and corresponds to moment subset TSiWeight w ij, wherein α, beta, gamma are scale factor.
wij=α/hj+βcj+γmij
Moment subset TSiFind out the w of all interference subsetsijIt is worth maximum, which is matched into the interference subset, weight
This multiple process, until all moment subsets match.
For above-described car networking services mining and merger, on the one hand, car networking platform of the present invention formalizes it
After description, car networking business library is constructed, by car networking service decomposition mechanism, forms subservice library；On the other hand, car networking takes
Business provides the service that oneself is registered in end on platform, forms service library after flat formization description.When processing center receives
When subservice demand, into car networking services mining link, car networking service library is linked, calculating is matched out a series of and business and closed
The car networking business of connection.
Ontology is introduced in service modeling, in conjunction with operation flow and situation, establishes domain knowledge base, realizes intelligent merger,
Meet the individual demand of client.The ontology inference based on description logic can be carried out after introducing ontology, i.e., from display context
In derive more implicit contexts, meanwhile, ontology provides specific semantic description for contextual information.Car networking service is
The car networking resource of serviceization has its own functional attributes collection and nonfunctional space collection, including Qos attribute and context category
Property.The present invention is defined as follows:
Car networking services VCS and can be indicated with five-tuple, shaped like:
VCS=Category, ServiceProfile, ServiceModel, ServiceGrouding, Resource]:
Category indicates classification belonging to the service.
ServiceProfile indicates the essential information of service, and the pairing to essential information is to realize that service is matched important
Part can use 5 element group representations:
ServiceProfile={ GeneralInfo, Functional, Qos, Resource, State }, in which:
GeneralInfo is used to describe the essential information of car networking service；
Functional is used to describe the function information of car networking service, such as the input, output, execution of car networking service
Condition and result；
Qos is used to describe the service quality of car networking service.The measurement of service quality is variable in car networking platform,
The formalized description for defining Qos is expansible model:
Qos=Time, Cost, Reputation, Reliability ... }
Wherein, Time indicates the execution time of the service, and Cost indicates the cost of service, and Reputation indicates the service
Credit worthiness, the evaluation of user carry out statistics using classification by way of credit worthiness is managed；Reliability is indicated
The reliability of service is measured by the successful execution rate in a period of time.
Resource is used to describe car networking resource, defines all properties information of car networking resource.State is used to retouch
It states car networking and services current state, be included in use and free time.ServiceModel describes the service process of car networking service, i.e.,
Details is realized in the service of car networking service.ServiceGrouding is used to describe the access method of car networking ISP, packet
Include access address, message format, access port.Resource indicates the corresponding vehicle of the car networking service that the Category is provided
Networked resources.
Car networking services mining process is based on the above formalized description.After forming car networking business contexts information, into
Enter the semantic context pairing stage, this stage is divided into three steps, is required to calculate similarity in each step, and all set
Corresponding threshold value is set, the service for being unsatisfactory for threshold value is filtered, similarity calculation is not involved in.
In car networking service, in conjunction with the description of car networking service, car networking service is directed to from semantic context level
Service pairing is carried out with car networking business.For the input information of Web service, extract semantic description, judge its said concepts with
Pairing item in description.By degree difference will pairing result be divided into pairing completely, insertion is matched, include pairing and pairing is lost
It loses.In car networking platform, the pairing degree of car networking service A and B can be calculated with similarity algorithm, it is similar
The basic model for spending pairing is as follows:
Sf (A, B)=(ω1sf(A1,B1)+ω2sf(A2,B2)—+ωnsf(An,Bn))
Wherein, Ai,BiIndicate i-th subservice of car networking service, ωiIndicate i-th subservice institute in pairing function
The weight accounted for.Specifically:
Wherein dis (Ai,Bi) indicate ontology Ai,BiSemantic distance, α is regulatory factor.The present invention preferably by semanteme away from
From being expressed as two concepts in the difference of ontology diagram interior joint shortest path length.
Entire services mining process carries out semantic parsing to the service at demand for services end first, to obtain the clothes of the service
Service type.Semantic parsing, ontology inference, semantic-based pairing are combined, services mining is finally reached.Detailed process
It is as follows:
(1) analytically extract in device Category, ServiceProfile, ServiceModel,
ServiceGrouding, Resource, ServiceAttributes relevant information；
(2) extracts the ServiceProfile of all services；Then the classification and attribute in ServiceProfile are extracted
Relevant information；
(3) matches service type using Category pairing algorithm, filters out the service for the condition of being unsatisfactory for.
(4) uses keyword perfect match.It is carrying out with clock synchronization, constructing similarity function sf with semantic distance dis () is
Basis calculates the similarity between concept.
(5) it is matched using the service quality of quality of service services, the optimal service of output pairing degree.
During car networking services mining, it is center of gravity by the demand at demand end, that is, car networking business, finds similar vehicle
The Internet services form clustering cluster, then the parallel operation service quality comprehensive matching algorithm in cluster again, to obtain a result.
Specifically, the calculating of each element to center of gravity distance is realized using MapReduce model, i.e., in iteration each time
Mono- MapReduce process of Shi Qidong.Original center of gravity is constructed in mapping phase, then design sample is every row of file, from
Middle extraction useful data, with key-value pair<K, V>form is indicated, then the distance of calculating sample to original center of gravity, according to distance
Sample is assigned in the smallest center of gravity class by size, and marker samples are the classification newly clustered, with key-value pair < K1, V1>
Output form.Wherein K1It is the ID of minimum range cluster.V1It is each dimensional coordinate values of current record.
It is inserted into the union operation that specification processing is localized to intermediate result after mapping.Union operation is pair
Mapping result pretreatment in locating node, i.e., to same K1V1Processing, obtains Local Clustering as a result, then exporting.It closes
And each dimensional coordinate values of the solution new record of function, obtained after addition the cumulative of Local Clustering result and, while calculating total number of samples,
Output < K2, V2>, wherein K2It is cluster category IDs, V2It is above-mentioned cumulative and plus record sum.
The specification stage by summarizing local cluster result, obtains new cluster centre, is used for next round iteration.With < K2, V2>
As input, the sample number of the Local Clustering of each node output is calculated first, and parses each dimensional coordinate values, it then will be corresponding
Each dimension accumulated value is corresponding to be added, then divided by the sample number just calculated, new cluster centre coordinate is obtained, with key-value pair < K3,
V3> form simultaneously exports, wherein K3Indicate cluster category IDs, V3Indicate obtained new cluster centre.
Structure feature and type for car networking perception data is different, needs to carry out by relational data to structuring text
The conversion and storage of shelves.First by the data of sensing node perception with < si, t, D > format indicate, wherein siFor sensor ID, t is
Timestamp, D are the dynamic data content of perception.The initial data of acquisition is pre-processed first, then uses predefined standard
It is packaged, the static data of perception passes through XML first to be converted to relational data, then is standardized encapsulation.Wherein, pre- place
Reason process includes:
The data of raw sensed are converted to the quantity information IQ (s of resource ki, t, k), wherein r indicates read functions, 0 table
Show single reading, 1 indicates multiple readings；Ut (k) represents ID as SiSensor whether perceive resource k in sensing range, 0
Indicate unaware, 1 indicates perception；C is constant, indicates the calculating dimension of resource.
In event correlation analysis and matching operation, determine that the information of key monitoring link is critical event, by excavation
Critical event and the relationship of primitive event generate the multilayer event description file based on XML, carry out event according to correlation model
The process key event handling based on template matching is realized, finally in conjunction with critical event and its composition of matching template with processing
Obtain association results.Select template matching as, to the processing scheme of data flow, template is literary in xml format in critical event processing
Shelves are stored in knowledge base, are handled in conjunction with template matching and critical event processing technique process event.By multi-level thing
The processing of part example is as business.Critical event pattern match is carried out according to the service priority of setting, so as to shorten crucial thing
Part handles the time.Concrete operations are as follows:
It is digraph by the critical event mode map in critical event pattern base and is stored in memory database,
In, node, intermediate node, the root node of digraph respectively correspond as atomic event, middle model, critical event mode, identical
Node merges.
When generating atomic event, child node carries out critical event association and matches and processing result is sent to father node.
When corresponding father node detects the input of child node event instance, search for respective nodes in match pattern and execute association
Processing.If successful matching, intermediate node output treated critical event example to father node with to subsequent association process,
Root node exports the critical event of final output perception processing；If matching is failed, phase is stored or abandoned according to Semantic judgement
The event instance answered.
In conjunction with car networking services mining mechanism, car networking service merger process is divided into three phases: the first stage is root
According to services mining as a result, sorting out to form different services by subservice from the associated car networking business of subservice by a series of
Cluster；Second stage is negotiation phase, is that constraint condition is arranged according to car networking Service Properties, screening is unsatisfactory for basic function requirement
Service, randomly choosed from each service cluster car networking service composed by merger scheme complete car networking business；The
Three stages were the optimizing phase, for the service merger initial scheme after screening, objective function are arranged, finds out optimal merger scheme.
In order to screen the service for not being able to satisfy car networking business demand in service cluster, two step negotiations process are executed.The first step
Those services for not being able to satisfy car networking Service Instance service condition are deleted in negotiation；
Assuming that existing services set VCS={ vcs1,vcs2,…,vcsn], context is csc respectivelyi, i=l, 2 ..., n；
There are m car networking resource in system, it is denoted as vsx, context is vsc respectivelyx=l, 2 ..., m, above and below car networking demand for services
Text is ldc.Design the constraint condition of the context negotiation of car networking service and car networking resource are as follows: car networking resource context category
Property set include demand for services context property set, and type is identical, and the attribute value of required car networking resource is not less than
The attribute value of demand for services context, is expressed as follows:
{ldci.paj,j∈N}∈{lscx.pak,k∈N}∧ldci.paj=lscx.paj
ldci.vaj≤lscx.paj j∈N
Wherein pajIndicate j-th of attribute in attribute set, vajThe attribute value of j-th of the attribute indicated, when car networking provides
There are multiple Service Instances in source at runtime in the same time point, and the summation of these service attribute values is no more than the car networking resource
Attribute value.
When a certain subservice has the subservice of preceding order relation to be respectively necessary for using different car networking resources from it, if point
It Shi Yong not resource lslAnd lsp, then should also meet following constraint condition:
te(ldci.vate,ldcj.vate)<te(lsl.vate,lsp.vate)
Wherein, vate indicates the attribute value of communication service, and te (x, y) is the cost function for calculating communication service value.
Second step is negotiated, and from each service cluster, a service is randomly selected and forms a service merger scheme, so that
The characteristics of timetable triggering is able to satisfy between each service.The late finish time of previous service must be close to next clothes
Before the earliest start time of business, the characteristics of satisfaction by timetable triggering.
It gets off the multi-objective problem of the Internet services merger to cloud computing environment, the present invention improves ant group algorithm.It is first
First setting data are < Ki,Vi> key-value pair, KiIt is integer, it is the digital label of i-th of sub- population, and ViIndicate i-th of son
The data structure of population, its essence is the arrays of individuals all in the population.When carrying out individual migration, k-v is as input
Body replacement.The parallel work-flow that total business is mapped function is decomposed, and distributes to cluster operation, while the intermediate data generated is direct
Import distributed file system.M empty file, corresponding m sub- populations, then according to key assignments are written in distributed file system
Right, the addition initialization individual into empty file, at this moment, total business is divided into m mapping concurrent service by MapReduce, is assigned to
Each back end parallel computation, the original document then sub- population for being added to individual being saved in distributed file system
In；Second step, parallelization run the multiple evolution of iteration, individual migration are carried out, to obtain optimal solution.First according to k value, read
The individual for corresponding to sub- population out and needing to migrate, then Evolution of Population g generation, g are preset threshold.At this moment, MapReduce will be every
The corresponding mapping business of the evolution business of a sub- population is assigned to parallel computation on back end, after the completion of in g generation, evolves,
Individual migration is carried out between each sub- population, is replaced using excellent differential mode formula, and distributed field system is written in the sub- population newly formed
In system neutron population file.After the completion of migration, next iteration is carried out, is reruned.Behaviour in this way by repeatedly evolving, migrating
After work, optimal solution is finally obtained.
For balance population diversity and convergence rate, Mutation Strategy is improved are as follows:
C=F1Gbest+(1-F1)xi
In formula, F1It is the random number between 0 to 1, i is that this generation is individual accordingly, GbestIt is optimum individual.
In conclusion the invention proposes a kind of Heterogeneous Information processing method based on Internet of Things, for car networking system
The magnanimity and isomery variability feature of perception data realize car networking service describing, service encapsulation, clothes by the means of system
Business is excavated and service merger, using unified data-interface to the comprehensive perception of Heterogeneous Information and processing, realizes the seamless friendship of information
Mutually the standardization between different application systems data is shared.
Obviously, it should be appreciated by those skilled in the art, each module of the above invention or each steps can be with general
Computing system realize that they can be concentrated in single computing system, or be distributed in multiple computing systems and formed
Network on, optionally, they can be realized with the program code that computing system can be performed, it is thus possible to they are stored
It is executed within the storage system by computing system.In this way, the present invention is not limited to any specific hardware and softwares to combine.
It should be understood that above-mentioned specific embodiment of the invention is used only for exemplary illustration or explains of the invention
Principle, but not to limit the present invention.Therefore, that is done without departing from the spirit and scope of the present invention is any
Modification, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.In addition, appended claims purport of the present invention
Covering the whole variations fallen into attached claim scope and boundary or this range and the equivalent form on boundary and is repairing
Change example.
Claims (5)
1. a kind of Heterogeneous Information processing method based on Internet of Things, comprising:
Car networking platform establishes the service chaining between service provision end and demand for services end, to car networking service in service process
Whole process monitored in real time, the demand for services end includes the vehicle of car networking platform.
2. the method according to claim 1, wherein the service provision end virtualizes car networking resource
Processing, service encapsulation, standardization, form car networking service, are stored on distributed server, then real-time acquisition demand
The demand for services for holding publication, to car networking business model, resolves into a series of subservices.
3. the method according to claim 1, wherein further include:
The resource and environmental information of vehicle-mounted node and trackside node are perceived, constituted in vehicle and trackside infrastructure different
In network forming network, the access control and data transmission of heterogeneous nodes are carried out；Data acquisition is executed in different types of sensor, is melted
Conjunction and mass data processing；Realize that the node based on feedback is negotiated and controlled.
4. according to the method described in claim 3, it is characterized by further comprising:
The correlation model between vehicle data and traffic process state is established, vehicle joins the acquisition and transmission of data；To isomeric data
Homogeneous processing is carried out, carries out the conversion of different structure data, and establish and be based on
The process event Unify legislation language and processing operation of XML accords with；Establish multi-level event description model and procedure-oriented
Multi-level event correlation model, carries out the relation decomposing of multi-level event；Perception data is subjected to logical operation, key application thing
Part processing engine carries out the association operation of multi-level event, obtains semantic information on services；Information on services is subjected to higher
Increment processing, obtain critical event.
5. according to the method described in claim 2, it is characterized in that, the demand for services of real-time acquisition demand end publication, right
Car networking business model resolves into a series of subservices, further comprises:
After cloud is connected to the car networking service request of demand for services end submission, the feature of business is analyzed first, the industry
The feature of business includes resource, granularity, the business of car networking service decomposition of the scale of business execution, finishing service needs
Complexity, then using the characteristic of these business as input, call corresponding service decomposition algorithm by car networking service decomposition at
It is suitble to the subservice of car networking platform processes, participates in operating in next step.
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 true CN109194746A (en) | 2019-01-11 |
| CN109194746B 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) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111857031A (en) * | 2020-07-27 | 2020-10-30 | 山东有人信息技术有限公司 | Serial PLC protocol conversion method, device and system for requesting dynamic balance |
| CN111967753A (en) * | 2020-08-10 | 2020-11-20 | 成都信息工程大学 | Cloud manufacturing environment information perception system and method for manufacturing task execution |
| CN112799818A (en) * | 2021-02-03 | 2021-05-14 | 上海交通大学 | Cloud fusion task migration method and system based on check point description file |
| CN112950929A (en) * | 2021-01-11 | 2021-06-11 | 张昕 | All-weather real-time traffic information monitoring and QOS hierarchical control system and method |
| CN113095084A (en) * | 2021-03-16 | 2021-07-09 | 重庆邮电大学 | Semantic service matching method and device in Internet of things and storage medium |
| CN115460081A (en) * | 2022-09-06 | 2022-12-09 | 长城汽车股份有限公司 | Disaster tolerance control method, device, system, equipment and storage medium |
| CN117520606A (en) * | 2024-01-04 | 2024-02-06 | 浙江大学 | Method and device for importing heterogeneous data sources into graph database |
| CN115460081B (en) * | 2022-09-06 | 2024-05-10 | 长城汽车股份有限公司 | Disaster recovery control method, device, system, equipment and storage medium |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN117726147B (en) * | 2024-02-08 | 2024-04-26 | 中航信移动科技有限公司 | Adaptation-based server management method, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719933A (en) * | 2009-11-25 | 2010-06-02 | 北京航空航天大学 | Combination method of manufacturing grid resource services orienting whole life cycle and supporting semantemes |
| CN102982389A (en) * | 2012-11-02 | 2013-03-20 | 东南大学 | Method for solving combination and optimization problems using ant colony optimization technology based on Map Reduce |
| CN103207606A (en) * | 2013-03-27 | 2013-07-17 | 西北工业大学 | Embedded perception device and method for multi-source manufacturing information |
| CN103440522A (en) * | 2013-08-31 | 2013-12-11 | 福州大学 | Vehicle dispatching method with genetic algorithm and MapReduce combined |
| CN103458033A (en) * | 2013-09-04 | 2013-12-18 | 北京邮电大学 | System for providing services of event-driven service-oriented internet of things and working method thereof |
| 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 |
| US20170041419A1 (en) * | 2015-03-12 | 2017-02-09 | 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 (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719933A (en) * | 2009-11-25 | 2010-06-02 | 北京航空航天大学 | Combination method of manufacturing grid resource services orienting whole life cycle and supporting semantemes |
| CN102982389A (en) * | 2012-11-02 | 2013-03-20 | 东南大学 | Method for solving combination and optimization problems using ant colony optimization technology based on Map Reduce |
| CN103207606A (en) * | 2013-03-27 | 2013-07-17 | 西北工业大学 | Embedded perception device and method for multi-source manufacturing information |
| CN103440522A (en) * | 2013-08-31 | 2013-12-11 | 福州大学 | Vehicle dispatching method with genetic algorithm and MapReduce combined |
| CN103458033A (en) * | 2013-09-04 | 2013-12-18 | 北京邮电大学 | System for providing services of event-driven service-oriented internet of things and working method thereof |
| CN104331321A (en) * | 2014-10-09 | 2015-02-04 | 冷明 | Cloud computing task scheduling method based on tabu search and load balancing |
| US20170041419A1 (en) * | 2015-03-12 | 2017-02-09 | Intel Corporation | Method and apparatus for compaction of data received over a network |
| CN105912409A (en) * | 2016-06-30 | 2016-08-31 | 天脉聚源(北京)传媒科技有限公司 | Task scheduling method and device |
Non-Patent Citations (4)
| Title |
|---|
| 王艳平: "基于蚁群算法的云计算资源调度研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 王诏远等: "基于MapReduce的蚁群优化算法实现方法", 《计算机科学》 * |
| 秦晓娜: "基于改进蚁群算法的云计算资源分配研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 黄小远: "基于车联网应用的云平台资源调度问题的研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111857031A (en) * | 2020-07-27 | 2020-10-30 | 山东有人信息技术有限公司 | Serial PLC protocol conversion method, device and system for requesting dynamic balance |
| CN111857031B (en) * | 2020-07-27 | 2021-06-15 | 山东有人物联网股份有限公司 | Serial PLC protocol conversion method, device and system for requesting dynamic balance |
| CN111967753A (en) * | 2020-08-10 | 2020-11-20 | 成都信息工程大学 | Cloud manufacturing environment information perception system and method for manufacturing task execution |
| CN111967753B (en) * | 2020-08-10 | 2023-06-02 | 成都信息工程大学 | Cloud manufacturing environment information sensing system and method for manufacturing task execution |
| CN112950929A (en) * | 2021-01-11 | 2021-06-11 | 张昕 | All-weather real-time traffic information monitoring and QOS hierarchical control system and method |
| CN112950929B (en) * | 2021-01-11 | 2022-08-05 | 张昕 | All-weather real-time traffic information monitoring and QOS hierarchical control system and method |
| CN112799818A (en) * | 2021-02-03 | 2021-05-14 | 上海交通大学 | Cloud fusion task migration method and system based on check point description file |
| CN113095084A (en) * | 2021-03-16 | 2021-07-09 | 重庆邮电大学 | Semantic service matching method and device in Internet of things and storage medium |
| CN115460081A (en) * | 2022-09-06 | 2022-12-09 | 长城汽车股份有限公司 | Disaster tolerance control method, device, system, equipment and storage medium |
| CN115460081B (en) * | 2022-09-06 | 2024-05-10 | 长城汽车股份有限公司 | Disaster recovery control method, device, system, equipment and storage medium |
| CN117520606A (en) * | 2024-01-04 | 2024-02-06 | 浙江大学 | Method and device for importing heterogeneous data sources into graph database |
| CN117520606B (en) * | 2024-01-04 | 2024-04-09 | 浙江大学 | Method and device for importing heterogeneous data sources into graph database |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109194746B (en) | 2021-03-26 |
| CN112422666A (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109151042B (en) | Internet of Things perception data Intelligent planning method | |
| CN109194746A (en) | Heterogeneous Information processing method based on Internet of Things | |
| Chen et al. | Task replication for vehicular cloud: Contextual combinatorial bandit with delayed feedback | |
| CN109644143A (en) | Method and apparatus for network slice | |
| CN109257422A (en) | Sensing network signal reconstruct method | |
| CN108431796A (en) | Distributed resource management system and method | |
| CN103886508B (en) | The monitoring method and system of magnanimity farm field data | |
| Ayoubi et al. | An autonomous IoT service placement methodology in fog computing | |
| CN106228263A (en) | Materials stream informationization methods based on big data | |
| CN104881581A (en) | IoT (Internet of Things) data high-efficiency analysis method | |
| CN114721833A (en) | Intelligent cloud coordination method and device based on platform service type | |
| CN109688056A (en) | Intelligent Network Control System and method | |
| CN104834751A (en) | Data analysis method based on Internet of things | |
| Abdulazeez et al. | Offloading mechanisms based on reinforcement learning and deep learning algorithms in the fog computing environment | |
| CN105956723A (en) | Logistics information management method based on data mining | |
| CN109196807A (en) | The method of network node and operation network node to carry out resource dissemination | |
| CN110460662A (en) | The processing method and system of internet of things data | |
| CN103824127B (en) | Service self-adaptive combinatorial optimization method under cloud computing environment | |
| Yang et al. | E-tree learning: A novel decentralized model learning framework for edge ai | |
| CN113688284B (en) | Processing method and device of Internet of vehicles service data, electronic equipment and storage medium | |
| Lin et al. | A bottom-up tree based storage approach for efficient iot data analytics in cloud systems | |
| Chen et al. | A Lightweight SFC Embedding Framework in SDN/NFV-enabled wireless network based on reinforcement learning | |
| CN105956816A (en) | Cargo transportation information intelligent processing method | |
| Bu et al. | Task scheduling in the internet of things: challenges, solutions, and future trends | |
| Wu et al. | Characterizing user association patterns for optimizing small-cell edge system performance |
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 |