KR20160009683A - Method and system for discovery of services in interconnected smart spaces - Google Patents

Abstract

The invention relates to a method for enabling discovery of at least one service provided by an object located between interconnected smart spaces, the at least one service (24) matching the discovery request. The method includes: modeling interconnected smart spaces in an n-level structure (10) consisting of lowest level nodes (2) representing spaces containing physical connection objects, 2): clustering the services (24) associated with the physically interconnected objects into at least one lowest level service cluster (22), storing parameters (26,28) defining each cluster (22) (5) at each node (3, 4) from level 2 to n: aggregating the received information aggregation into at least one higher-level cluster 32 , 42), collecting parameters (36, 38) defining each cluster (32, 42) into a local information aggregation, cluster matching based on local information aggregation and aggregation of received information (50) of sending the local information aggregation to the parent nodes, if any, that are repeatedly performed within each node starting at level 2, and processing between parent nodes At the node, upon receipt of the discovery request for the service, the request is received by the cluster matching table until reaching the target lowest node (2), which represents the space containing the object providing the service (24) Processing the request to deliver the request to the child nodes one level at a time of successful matching of the request.

Description

[0001] METHOD AND SYSTEM FOR DISCOVERY OF SERVICES IN INTERCONNECTED SMART SPACES [0002]

The present invention relates to the field of paired computing. More particularly, the present invention relates to a method for enabling discovery of at least one service provided by an object located in a space between interconnected smart spaces.

Intelligent spatial environments have recently become an important issue in everyday life, especially in the context of pervasive computing with the goal of seamless embedding or information processing. Particularly in connection with the Internet of things, a communication network such as the Internet is connected not only to computers and terminals but also to all kinds of peripheral objects and their virtual representations, and to wireless technologies, computer technologies and electronic identification technologies As well as various technologies. Linked objects can be identified by electronic labels and can be connected to the Internet through communication terminals, thus allowing reception, storage, processing and delivery of object related data. Objects, interfaces, and terminals connected to computers or smart space may be considered for service specific user requirements. The smart spaces also feature communication means for connecting virtual representations of objects within the system of interconnected smart spaces.

Objects can be located in physical or virtual spaces, and are typically associated with services provided by spaces. Examples of smart spaces and embedded objects include:

● Office or corporate departments, including telephones, computers, printers, and video projectors, etc.,

• Hotels or residences that include alarms, heaters, remote controls, televisions, label chairs, etc.,

• Airports, shopping centers, or other public buildings that include computers or servers, sensors, etc.

In order to benefit from the services provided by the operated or otherwise used objects, the service discovery request may be initiated in the smart space or in a plurality of interconnected smart spaces, Lt; / RTI > Typically, requests and services provided are described using semantic descriptions, for example, depending on concepts from many ontologies.

The current centralized technology is, for example, by regrouping all semantic service descriptions by comparing their concepts and processing incoming service requests. However, such a method is very cost intensive in terms of computation time and memory, and may experience a "performance bottleneck" due to its centralized nature.

In addition, when simple smart spaces (i.e., physical spaces including objects) are considered, a so-called peer-to-peer approach can be used. However, in order for this solution to correctly resolve location-intensive requests, supplemental information is needed (i.e., requests for multiple services are hosted in different spaces).

In accordance with the foregoing, there is a need for improved service discovery in the context of interconnected smart spaces hosting a large number of available objects and their associated services. An efficient and fast service discovery mechanism that economically uses computation and memory resources is highly desirable.

Embodiments of the present invention provide an improved method and an improved system for enabling discovery of at least one service associated with an object located in a space between interconnected smart spaces, Resolve.

According to a first aspect, there is provided a method for enabling discovery of at least one service provided by an object located in a space between interconnected smart spaces, as at least one service matching a discovery request, Includes:

Level structure of parent and child nodes, wherein the least significant nodes are child nodes that represent spaces containing physical connection objects, while each higher level node is at least a lower level The modeling step being parent nodes for one node and / or child nodes for at least one node at a higher level,

At each lowest level node:

a) clustering services associated with the physical connection objects into at least one lowest level service cluster,

b) aggregating the parameters that define each lowest level service cluster in the node into an information aggregation,

c) constructing a service matching table based on the information aggregation and associated services

d) transmitting the information aggregation from the second level to the n-th level in each node to the parent nodes;

e) clustering the received information aggregation into at least one higher-level cluster,

f) collecting, in a local information aggregation, parameters defining each high level cluster in the node,

g) constructing a cluster matching table based on the aggregation of the local information and the aggregation of the received information. And

h) transmitting the local information aggregation, if any, to the parent nodes, wherein steps e) to h) are performed repetitively within each node starting at level 2; And

At the processing node between the parent nodes, upon receipt of the discovery request for the service, the request by the cluster matching table until the request arrives at the target lowest node representing the space containing the object providing the service matched to the request Processing the request to deliver the request to the child nodes one level at a time of successful matching of the request.

Preferably, the processing step may comprise:

i) comparing the received discovery request with the information aggregation of the processing node,

j) using the cluster matching table of the processing node to forward the request to the child node,

k) if the request is not matched, sending the request to the parent node, wherein steps i) -k) are performed iteratively until the request reaches the target lowest level node or the highest level node.

In some embodiments, step i) may include:

Matching the request with a local information aggregation using a first decision threshold; and

And using the second decision threshold to match the request with the received information aggregation.

Any of the above methods may also include, at the target lowest level node, matching the request with related services using a third decision threshold.

Any of the above methods, wherein the request may include a location restriction indicating the requested space between interconnected smart spaces, may also include routing the request to a node representing the requested space.

Preferably, upon receipt of a discovery request for a service at the lowest level node, the method also includes:

Comparing the request to an aggregation of information of the lowest level node, and if there is no match, sending the request to the parent node.

According to a second aspect, there is provided a system for enabling discovery of at least one service provided by an object located in a space between interconnected smart spaces, the at least one service matching the discovery request, Level structure of parent and child nodes, wherein the lowest nodes are child nodes that represent spaces containing physical connection objects, while each higher-level node comprises parent nodes of at least one lower- And / or child nodes for at least one node of a higher level, wherein:

Each lowest level node includes:

Means for clustering services associated with the physical connection objects into at least one lowest service cluster,

Means for collecting parameters aggregating information defining each lowest level service cluster in the node,

Means for building a service matching table based on said information aggregation and associated services, and

- means for transmitting the information aggregation to the parent nodes,

Each level 2 through n node includes:

Means for clustering the received information aggregation into at least one higher level cluster,

Means for collecting in the local information aggregation parameters defining each higher level cluster in the node,

Means for building a cluster matching table based on said local information aggregation and said received information aggregation, and

- means for sending the local information aggregation, if any, to the parent nodes,

As soon as the processing node between the parent nodes receives the discovery request for the service, the request is made by the cluster matching table until the request arrives at the target lowest level node representing the space containing the object providing the service matched to the request And processing means for processing the request to transfer the request to the child nodes one level at a time of successful matching of the request.

Additional aspects and advantages of the methods and systems in accordance with the embodiments disclosed herein will in part be now described in accordance with the detailed description, drawings and claims, and in part will be apparent from the description, Will be.

It is to be understood that both the foregoing general description and the following detailed description are exemplary only, and are not restrictive of the claimed invention.

Exemplary embodiments of methods and systems are described with reference to the accompanying drawings:

1 schematically illustrates an example in a three-level structure of interrelated smart spaces of parent and child nodes and associated service clusters and upper clusters obtained according to the steps of embodiments of the method of the present disclosure;

The drawings and the following description show illustrative embodiments.

Embodiments of the present disclosure disclose a method for enabling discovery of at least one service provided by an object located in a space between interconnected smart spaces, the at least one service matching a discovery request. The method is illustrated with reference to Figure 1 and includes the following steps.

In the first step, interconnected smart spaces are modeled in an n-level structure (level beta = l ... n) (1) of parent and child nodes 2-4. The lowest level nodes 2 are child nodes that represent spaces containing physical connection objects and their associated services. The objects may be connected to communication networks, such as the Internet, via communication terminals and wired or wireless connection means. Each of the upper level nodes (3, 4) is parent nodes for at least one node of a lower level, child nodes for at least one node of a higher level, or both child and parent nodes. The structure 1 of the nodes can typically be used to reflect the distribution of physical spaces. As such, the n-level structure 1 of the nodes represents a graph, where each node 2-4 represents a smart space. For example, the lowest level nodes 2 may physically correspond to simple smart spaces that contain objects and logically host their services in the form of a service description 24. Typically, the services provided are described in terms of semantics from different ontologies that are linked to different technology domains.

The upper level nodes 3,4 may correspond to complex smart spaces including other smart spaces. The edges 11 are the edges connecting the parent nodes to the child nodes of the edges.

In a second step, at each lowest level node (2), the services (24) associated with the physical connection objects are clustered into at least one lowest level service cluster (22). Clustering may be performed using semantic service descriptions of services. Any clustering technique may be used. For example, a hierarchical agglomerative clustering technique may be used, wherein for each pair of services a similarity distance value is calculated to regroup similar services. Clusters are obtained according to the desired dissimilarity level, i. E. A clustering threshold. For example, the similarity distance may represent the similarity of the concepts of semantic explanations of services.

In a third step, at each bottom node 2, the parameters 26, 28 defining each lowest level service cluster 22 in the node 2 are aggregated into an information aggregation. Information aggregation can be viewed as the extraction of information from the cluster and provides an overview of the entire contents of the cluster. The parameters 26 and 28 may include a representative 28 of the cluster 22 and a radius 28 of the cluster 22 such that the radius 28 is representative of all the services of cluster 22, (26), and the representative (26) can be regarded as the center of the cluster (22). The representative 26 of the lowest level cluster 22 may be one of the clustered service descriptions 24 representing the residual service description of the cluster 22.

In a fourth step, at each lowest level node (2), a service matching table is built based on information aggregation (26, 28) and associated clustered services (24). For example, the service matching table may list each cluster 22, the representative 26, and association radius 28 of the considered node 2 as well as the clustered services. The service matching table is stored in the node (2).

In a fifth step, at each lowest level node 2, as shown by the arrow 5 between the lowest level nodes 2 and upper level node 3 (? = 2) Aggregations 26 and 28 are sent to the parent nodes.

In a sixth step, in a manner analogous to that mentioned in connection with the second step performed at the lowest level nodes, at each higher level node (3,4) from level 2 to n, the received information aggregation includes at least one Level clusters 32 and 42, respectively.

In the seventh step, in each upper level node (3,4) from level 2 to n, the parameters (36,38) defining each high level cluster (32,42) in the node (3,4) Information gathering. As with the lowest level nodes 2, the parameters 36 and 38 may include the representative 36 of the cluster 32 and the radius 38 of the cluster 32. [ Thus, for example, the high level clusters 32 of level beta = 2 include representations received from the lowest level clusters 22, but not all of the service descriptions contained in the lowest level clusters 22 . Referring to Figure 1, the representative 26 of the lowest level cluster 22 is the clustering element 34 of the higher level cluster 32.

In an eighth step, in each of the higher level nodes (3,4) from level 2 to n, a cluster matching table is constructed based on the local information aggregation and the received information aggregation. The matching table is stored in the node. For example, a cluster matching table may be generated for each cluster 32 of the considered node 3 of level beta = 2, as well as the received representatives 34 clustered from the lowest level clusters 22, 36 and an associated radius 36. [

Each received representative 34 of the cluster may be connected to its source node (i. E., The node hosting the cluster) through a forwarding table. The source node may be identified, for example, by its level beta, serial number and / or its location in the construct. The forwarding table may be part of a cluster matching table, or it may be a detached table. In the latter case, the separate forwarding table is preferably also stored in the node.

In the ninth step, as shown by the arrow 50 between the upper level node (? = 2) 3 in FIG. 1 and the higher level node (? = 3) 4, , 4), the local information aggregation is sent to the parent nodes, if any.

In the method according to the present disclosure, the sixth through ninth steps are repeatedly performed in each higher level node starting at level 2. Thus, at each higher level node (beta > 1), clustering and information aggregation are performed based on the result of information aggregation of at least one child node, i.e. based on the aggregation of received information. This allows the parent nodes to have a concise view of the contents of their child node (s) that do not contain the information itself (service descriptions, aggregation of received information), thus facilitating request transmission.

In the method according to the present disclosure, upon receipt of a discovery request for a service 24 at a processing node between the parent nodes 3, 4, the request is sent to the target lowest level node 2, , And is successfully processed to be transmitted to the child nodes one level at a time of successful matching of the request by the cluster matching table. Between the interconnected smart spaces, the target lowest level node 2 represents the space containing the object providing the service 24 to match the request.

Discovery requests are described using semantic concepts in the same way as services. The matching (or mismatching) of requests for services can be based on the similarity of their semantic concepts.

In some embodiments, the processing step includes comparing the received discovery request to a local information aggregation of the processing node, and in the case of matching, using the cluster matching table of the processing node to forward the request to the child node . In case of mismatching, the request can be passed to the parent node. These steps may be performed by the lowest level node that contains the object providing the target lowest level node 2, i.e., the requested service 24 (i.e., the service matching the request), or the highest level node 4 And so on. At the top level node, the case of mismatching is obtained between the request and the local information aggregation of that node, and the request is canceled because the requested service can not be found in the underlying hierarchy.

In some embodiments, if a discovery request for a service is received at the lowest level node 2, the method also includes comparing the request to an information aggregation of the lowest level node 2, And sending the request to the parent node (3,4). At the parent node, the request is then compared to a local information aggregation to possibly find another lowest level node hosting the service description matching the request.

In some embodiments, comparing the received discovery request with the local information aggregation of the processing node includes matching the request with a local information aggregation using a first decision threshold, and comparing the request with a local information aggregation using the second decision threshold. And matching the request with the received information aggregation. Each cluster in each node has an associated decision threshold.

의 제 1 결정 임계값

은 처리 노드 N(level β) 내의 클러스터

의 반경

에 연결될 수 있다. 예를 들어, 제 1 결정 임계값

은 다음과 같이 쓰여질 수 있다.cluster

Lt; RTI ID = 0.0 >

Lt; RTI ID = 0.0 > N (level beta)

Radius of

Lt; / RTI > For example, the first decision threshold < RTI ID = 0.0 >

Can be written as

(1)

(One)

는 받아 들일 준비가 된 부정확성의 정도이다. 예를 들어, 요청이 "컬러 프린터 찾기"로 판독되는 경우, "흑백 프린터들"이라고 표시된 클러스터의 대표는 컬러 프린트가 일반적으로 흑백 출력물들을 제공할 수 있는 것으로 또한 표현될 수 있으므로 긍정적인 매치를 야기할 수 있다. 제 1 결정 임계값

은 해당 클러스터가 요청에 매칭하는 서비스(예를 들어, 프린팅 서비스를 제공하는 컬러 프린터)를 포함한다는 것을 나타낼 수 있는 대표(로컬 정보 집계)를 가지는지의 여부를 알아차리는 것을 가능하게 한다. here

Is the degree of inaccuracy that is ready to be accepted. For example, when a request is read as "Find Color Printer ", a representative of the cluster labeled" Black and White Printers "may also be represented as being able to provide black and white printouts, can do. The first determination threshold

(Local information aggregation) that may indicate that the cluster includes a service that matches the request (e.g., a color printer that provides a printing service).

) 사이의 유사성 거리를 측정하는 매칭 함수 Q를 사용하여 수행될 수 있다. 요청과 대표 사이에 매칭의 경우에, 매칭 함수 Q의 값은 제 1 결정 임계값보다 작거나 같고

, 만일 그렇지 않다면 매칭은 없는 것이다. In detail, the matching is performed on the request (R) and the representative of cluster K in node N

Lt; RTI ID = 0.0 > Q < / RTI > In the case of a match between the request and the representative, the value of the matching function Q is less than or equal to the first decision threshold

If not, there is no matching.

은 처리 노드 N의 자식 노드 N' 내의 클러스터 K' 에 연관되고, 클러스터 K'의 반경

에 연결될 수 있다. 처리 노드 N의 클러스터 매칭 테이블(클러스터 K의 매칭 로컬 정보 집계 및 상응하는 수신 정보 집계(들)의 목록) 및 제 2 결정 임계값

에 의해, 상기 요청은 매칭 함수를 사용하여, 제 1 결정 임계값

을 사용하는 로컬 정보 집계에 의해 표현된 각 수신 정보 집계와 비교된다. 매칭의 경우, 상기 요청은 예로서, 처리 노드 N의 클러스터 K의 포워딩 테이블을 사용하여, 수신된 매칭 정보 집계를 호스팅하는 자식 노드 N'로 라우팅된다. The second decision threshold determines whether any of the aggregated received information represented in the cluster K contains the requested service (or their representations according to the node level?), I.e., which of the child nodes N '(level? ≪ / RTI > contains a cluster K 'containing the requested service. As shown in equation (1), the second determination threshold value

Is associated with a cluster K 'in the child node N' of the processing node N, and the radius of the cluster K '

Lt; / RTI > The cluster matching table of the processing node N (the list of matching local information of the cluster K and the corresponding list of received information aggregation (s)) and the second determination threshold

, The request uses a matching function to calculate a first decision threshold < RTI ID = 0.0 >

Is compared with each received information aggregation represented by the local information aggregation using the < RTI ID = 0.0 > In the case of matching, the request is routed, as an example, to the child node N 'hosting the received matching information aggregation, using the forwarding table of cluster K of processing node N. [

Once the request is received at the child node N ', it is matched against the aggregation of the received information of the cluster K' of that node N ', using the above-described second decision threshold.

이다. 그러므로, 매칭에 대해, 매칭 함수 Q의 값은 최하위 레벨 노드

에서 간주된 클러스터 K의 반경

보다 작거나 동일해야한다. 예를 들어, 요청 "컬러 프린터 찾기"는 오직 컬러 프린터가 실제로 타깃 최하위 레벨 노드(2)에 의해 표현된 공간에서 이용가능한 경우에만 결과를 야기시킨다.Advantageously, the method according to the embodiments disclosed herein further comprises the step of matching the request R and associated services S using a third decision threshold at the target lowest level node 2, . Thus, as described above, once the request is routed to the target lowest level node, it is compared with each of the clustered service descriptions of the identified cluster to find services that match the request. Preferably, at this stage, if services that exactly match the request are required, then the inaccuracy is 0,

to be. Therefore, for matching, the value of the matching function Q is the lowest level node

The radius of the cluster K considered in

Should be less than or equal to. For example, the request "Find Color Printer" causes a result only if the color printer is actually available in the space represented by the target lowest level node (2).

A matching service description is attached to the answer and forwarded to the requesting user. It is also possible that a plurality of services 24 in the service cluster 22 or the lowest level node 2 match the request. Then, some of the services or all of the plurality of services may be attached to the answer. Finally, some of the services hosted by the different lowest level nodes 20 may match the request.

In some embodiments, the request may include a location constraint indicating the requested space between interconnected smart spaces, and the method according to the present disclosure may also include transmitting the request to a node (2,3, 4). ≪ / RTI > For example, if the request is read as "Find Color Printer in Meeting Room" and the meeting room is represented by the lowest level node (β = 1), then the request is sent directly to that lowest level node Lt; / RTI > Similarly, if the request is read as "look for a color printer at the first layer" and the "first layer" is mapped to a node at level β = 2, then the request is forwarded directly to the corresponding high level node.

If the request represents a location restriction and if the receive discovery request is compared to the local information aggregation of the addressed node, no match is found and the request can then be canceled.

If the request does not include a location constraint, then the request is processed by a node that first receives the request in accordance with the method of the present disclosure.

Some embodiments of the disclosure of the present invention provide at least one service 24 that matches a discovery request that enables discovery of at least one service 24 provided by an object located in a space between interconnected smart spaces System is also provided. The system includes means for performing the method according to the embodiments described hereinabove. Referring back to FIG. 1, the system includes an n-level structure of parent and child nodes (2,3,4), wherein the bottom nodes (2) are child nodes , While each higher level node (3, 4) is at least one node of a lower level and / or a child node of at least one node of a higher level. Each lowest level node 2 comprises means for clustering into at least one lowest service cluster 22 associated with physical connection objects, parameters 26,28 defining each lowest service cluster 22 in the node 2, Means for aggregating the information aggregation into the information aggregation, means for building a service matching table based on the information aggregation and associated services 24, and means for transmitting the information aggregation to the parent nodes. Each upper node 3, 4 (? = 2 ... n) comprises means for clustering the received information aggregation into at least one higher level cluster 32, 42, Means for aggregating parameters (36, 38) defining clusters (32, 42) into a local information aggregation, means for building a cluster matching table based on said local information aggregation and said received information aggregation, And means for transmitting the information aggregation, if any, to the parent nodes. The system also includes means for determining, at the processing node between the parent nodes (3, 4), upon receiving a discovery request for the service, Processing means for processing the request to transfer the request to the child nodes one level at the time of successful matching of the request by the cluster matching table until reaching the level node (2).

The method and system according to the embodiments disclosed herein provide a number of advantages, some of which are mentioned below.

The method and system according to the present disclosure relies on the physical and logical layer topology of the nodes, and thus on the location-derived distribution of services and information aggregation. In an n-level structure of nodes, each higher-level node (β> 1) clusters and aggregates information aggregations received from its child node (s). Incoming requests can therefore be effectively processed because they are compared with only a small number of service technologies or representations. The costs for computation time and memory space can thus be advantageously reduced, and the solution of the service discovery requests is considerably simplified.

Those skilled in the art will readily recognize that the steps of the embodiments of the methods described above may be performed by the programmed computers, in particular by a system of distributed computers and / or servers. In the present specification, some embodiments are intended to include program storage devices, such as a digital data storage medium that is machine-executable and that encodes machine-readable or computer-executable programs of instructions, And performs some or all of the steps of the method described in the specification. The program storage devices may be, for example, magnetic storage media such as digital memories, magnetic disks or tapes, hard drives, or an optically readable digital storage medium. Embodiments are also intended to include computers programmed to perform the steps of the methods described herein.

While some embodiments of the invention have been illustrated in the accompanying drawings and described in the foregoing Detailed Description, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, It should be understood that various rearrangements, modifications, and objects are possible.

Claims (7)

A method for enabling discovery of at least one service (24) provided by an object located in a space between interconnected smart spaces, as at least one service (24) matching a discovery request,
- modeling the interconnected smart spaces in an n-level structure (1) of parent and child nodes (2,3,4), wherein the bottom nodes (2) represent spaces containing physical connection objects Level nodes (3, 4) are child nodes, and each of the higher-level nodes (3,4) is a parent node for at least one node of a lower level and / or a child node for at least one node of a higher level,
- At each lowest level node (2):
CLAIMS 1. A method comprising: a) clustering services (24) associated with the physical connection objects into at least one lowest level service cluster (22)
b) collecting into the information aggregation parameters (26,28) defining each lowest level service cluster (22) in the node (2)
c) constructing a service matching table based on said information aggregation and associated services (24), and
d) transmitting (5) the information aggregation to the parent nodes,
- At each node (3,4) from level 2 to n:
e) clustering the received information aggregation into at least one high-level cluster (32, 42)
f) collecting parameters (36,38) defining each higher level cluster (32,42) in the node (3,4) into a local information aggregation,
g) constructing a cluster matching table based on the aggregation of the local information and the aggregation of the received information. And
h) transmitting the local information aggregation, if any, to the parent nodes, wherein steps e) to h) are performed repetitively within each node starting at level 2; And
At the processing node between the parent nodes (3, 4), upon receipt of the discovery request for the service (24), the request indicates a space containing the object providing the service (24) Processing the request to transfer the request to the child nodes by one level upon successful matching of the request by the cluster matching table until reaching the target node (2). How to enable discovery of services. The method according to claim 1,
Wherein the processing step comprises:
i) comparing the received discovery request with the local information aggregation of the processing node,
j) using the cluster matching table of the processing node to forward the request to the child node,
k), if the request is not matched, sending the request to the parent node, wherein steps i) -k) are repeated until the request reaches the target lowest level node (2) or the highest level node (4) The method comprising the step of transmitting, wherein the method comprises the steps of: 3. The method of claim 2,
Step i) comprises:
- matching the request with the local information aggregation using a first decision threshold, and
- matching the request with the received information aggregation using a second decision threshold. ≪ RTI ID = 0.0 > - < / RTI > 4. The method according to any one of claims 1 to 3,
At the target lowest level node (2):
- matching the request with the associated services (24) using a third decision threshold. ≪ RTI ID = 0.0 > - < / RTI > 5. The method according to any one of claims 1 to 4,
Wherein the request comprises a location constraint indicating a requested space between the interconnected smart spaces, and the method also comprises routing the request to a node (2,3,4) representing the requested space , Enabling the discovery of at least one service. 6. The method according to any one of claims 1 to 5,
Upon receipt of a discovery request for a service at the lowest level node (2), the method also includes:
- comparing the request to the information aggregation of the lowest level node (2), and
- if there is no match, sending the request to the parent node (3,4). A system for enabling discovery of at least one service (24) provided by an object located in a space between interconnected smart spaces, as at least one service (24) matching a discovery request,
Level structure 1 of the parent and child nodes 2, 3, 4, and the lowest nodes 2 are child nodes representing spaces containing physical connection objects, while each upper level Wherein the nodes (3,4) of the lower level are child nodes relating to at least one node of a higher level and / or parent nodes related to at least one node of a lower level:
- each lowest level node (2):
Means for clustering services 24 associated with the physical connection objects into at least one lower service cluster 22,
Means for collecting in the information aggregation parameters (26,28) defining each lowest level service cluster (22) in the node (2)
Means for building a service matching table based on said information aggregation and associated services (24), and
- means for transmitting the information aggregation to the parent nodes,
- Each node (3, 4) from level 2 to n:
Means for clustering the received information aggregation into at least one higher-level cluster (32, 42)
- means for collecting parameters (36,38) defining each higher level cluster (32,42) in the node (3,4) into a local information aggregation,
Means for building a cluster matching table based on said local information aggregation and said received information aggregation, and
- means for sending the local information aggregation, if any, to the parent nodes,
A processing node between the parent nodes (3,4) receives, immediately upon receipt of the discovery request for the service, a request for a service (24) that matches the request, Processing means for processing the request to transfer the request to the child nodes by one level upon successful matching of the request by the cluster matching table until reaching the level node (2) A system that enables discovery of services.

Images