Abstract: This invention relates to a method for users localization and guidance of the movements of the users through a building adapted in relation to an event, along paths leading to one or more given target places, with connected objects (T, T?) in communication link with a remote resource server which is a control server (S) accessible by a communication network, comprising the following steps: on the basis of a digital model of the building (BIM, CIM), nodes (N) and edges (A) are computed; a user waiting list is assigned to each passage node; a Directed Acyclic Graph (DAG) of movement toward the target places (“E”, “S”, “W”) is automatically computed with the nodes and the edges (A); the actual location of an event is detected; the actual position of each user located in the building is computed; as a function of the profile of the user, of the user's location in real time in the building causing the inaccessibility of certain nodes of the Directed Acyclic Graph (DAG), the so-called ‘updated’ Directed Acyclic Gra

Abstract: This invention relates to a method for users localization and guidance of the movements of the users through a building adapted in relation to an event, along paths leading to one or more given target places, with connected objects (T, T?) in communication link with a remote resource server which is a control server (S) accessible by a communication network, comprising the following steps: on the basis of a digital model of the building (BIM, CIM), nodes (N) and edges (A) are computed; a user waiting list is assigned to each passage node; a Directed Acyclic Graph (DAG) of movement toward the target places (“E”, “S”, “W”) is automatically computed with the nodes and the edges (A); the actual location of an event is detected; the actual position of each user located in the building is computed; as a function of the profile of the user, of the user's location in real time in the building causing the inaccessibility of certain nodes of the Directed Acyclic Graph (DAG), the so-called ‘updated’ Directed Acyclic Gra

Abstract: The method concerns a method of communication between end-user terminals and user terminals that are static or have low relative mobility with respect to each other, wherein a control server: —selects the terminals that are static or have low relative mobility from among the assembly of terminals, the other terminals being referred to as end terminals; —determines a graph, the nodes of which are static or low relative mobility terminals, —determines, on this graph of nodes, a sub-graph of dominant nodes; —selects, in the sub-graph of dominant nodes, at least one gateway node capable of establishing a communication with the Cloud Computing type network over their second cellular communication link; —selects the nodes of the graph which do not belong to the nodes of the sub-graph, as nodes having only the access/relay function to the dynamic multi-hop proximity network for the end-user terminals; —transmits its hierarchy status over the second cellular communication link, only individually to each of the variou

Abstract: The method concerns a method of communication between end-user terminals and user terminals that are static or have low relative mobility with respect to each other, wherein a control server: —selects the terminals that are static or have low relative mobility from among the assembly of terminals, the other terminals being referred to as end terminals; —determines a graph, the nodes of which are static or low relative mobility terminals, —determines, on this graph of nodes, a sub-graph of dominant nodes; —selects, in the sub-graph of dominant nodes, at least one gateway node capable of establishing a communication with the Cloud Computing type network over their second cellular communication link; —selects the nodes of the graph which do not belong to the nodes of the sub-graph, as nodes having only the access/relay function to the dynamic multi-hop proximity network for the end-user terminals; —transmits its hierarchy status over the second cellular communication link, only individually to each of the variou