METHOD OF DATA TRANSMISSION IN A MESH NETWORK AND COMMUNICATION DEVICE IN SUCH A NETWORK
The method and device for mesh networks address instability by storing data parts locally and using tree structures with cost functions to ensure data availability and stability, optimizing data retrieval within the network.
Patent Information
- Application Number
- FR2021011029
- Authority / Receiving Office
- FR · FR
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-10-18
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2041-10-18
AI Technical Summary
Dynamic mesh networks face instability due to devices becoming unavailable, leading to disrupted data connections, especially when large data quantities need to be retrieved from external sources.
A method and device for mesh networks that store data parts from external sources locally, utilizing a tree structure for efficient data retrieval and distribution, with cost functions to optimize data sourcing from neighboring nodes over external connections.
Ensures data availability even when external sources are inaccessible, enhancing network stability and data integrity through localized storage and intelligent data routing.
Smart Images

Figure 00000025_0000 
Figure 00000026_0000 
Figure 00000027_0000
Abstract
Description
Title of the invention: METHOD FOR TRANSMITTING DATA IN A MESH NETWORK AND COMMUNICATION DEVICE IN SUCH A NETWORK Technical field of the invention
[0001] The present invention relates to a method for transmitting data in a mesh network. The transmitted data may in particular comprise files or parts of files. The invention also relates to a communication device participating in this mesh network. Technical background
[0002] In the context of mobile applications, wireless peer-to-peer mesh networks of autonomously forming mobile devices have multiple applications. In particular, it is possible to equip vehicles with mesh network functionalities, with networks of such vehicles then forming according to the position of each vehicle, the range of the network interfaces and other factors. The network(s) then evolve dynamically according to the movements of the vehicles. Although this type of network has many advantages, its dynamic evolution also imposes constraints - devices in the mesh network can suddenly become unavailable because they are out of range, unplugged or in a location that does not allow the passage of radio waves.This instability can, for example, be troublesome when a device or node in the network needs to retrieve a relatively large amount of data, for example from a server external to the mesh network. The connection between the node and the server, whether direct or indirect through other nodes, can be cut. The present invention aims to compensate for certain constraints due to the dynamic evolution of the network. Summary of the invention
[0003] One embodiment relates to a method of transmitting data in a mesh network of communication devices, the method being implemented by a given device of the mesh network provided with a processor, the method comprising:
[0004] obtaining first data identifying a file to be obtained from a source external to the mesh network and excluding devices of the mesh network, said file being obtainable in the form of a plurality of parts, the whole of which makes it possible to form the complete file;
[0005] obtaining second data identifying the parts forming the file from the external source or another device in the mesh network;
[0006] obtaining at least part of the file from the external source or from a other mesh network device;
[0007] storing, in a storage module of the given device, the second data and file parts for transmission in case of request from another device of the mesh network.
[0008] Storing, by one or more devices of the mesh network, second information identifying the parts of a file to be loaded, as well as the file parts identified by this second information, makes it possible to make this information available even when the external source is not accessible.
[0009] According to a particular embodiment, the mesh network is organized in the form of a tree structure according to which each device is connected to at most one parent device and can be connected to zero, one or more child devices.
[0010] According to a particular embodiment, obtaining the second data or at least one part of the file comprises transmitting a request to the devices directly connected to the given device in the mesh network in the tree structure, said request identifying the second data or at least one part of the file to be obtained.
[0011] According to a particular embodiment, the method comprises receiving responses from the devices to which the request has been sent, the responses including, where appropriate, the address of one or more devices of the mesh network having stored the second data or at least part of the file to be obtained and to which the request will have been sent or at least partially propagated.
[0012] According to a particular embodiment, the method comprises determining, among the device(s) whose address(es) have been received, a device from which the second data or at least part of the file is to be obtained, the determination being based on a cost function taking into account the link(s) on the path, in the tree structure, between the given device and each of the device(s) whose address(es) have been received.
[0013] According to a particular embodiment, the cost function takes into account one or more of one or more signal levels on the link(s) on said path, the number of hops on said path, the nature of the link(s) on said path, one or more stability indicators of the link(s) on said path.
[0014] According to a particular embodiment, the cost function takes into account the combination of one or more signal levels on the connection(s) on said path and one or more stability indicators of the link(s) on said path.
[0015] According to a particular embodiment, the cost induced by a link between a device of the mesh network and the external source is taken to be greater than the cost induced by a link between two devices of the mesh network.
[0016] According to a particular embodiment, the method comprises receiving a requesting a device directly connected to the given device in the mesh network tree, said request identifying a searched item, and sending a positive response to the device whose request was received if the searched item is one of the second data and the at least one file part stored by said given device, the positive response comprising an address of the given device.
[0017] According to a particular embodiment, the method comprises, in the event of absence of the element sought in the storage of the given device, the propagation of the request to the devices directly connected to the given device in the tree structure outside the device from which the request was initially received, and the collection of the responses from the devices from which the request was propagated for returning a response to the device from which the request was initially received.
[0018] According to a particular embodiment, the method comprises, if the given device is connected to said external source and does not have the element sought in its storage, returning the address of said external source in the response.
[0019] According to a particular embodiment, the method comprises receiving, from the external source, register data of a blockchain maintained by said external source, said blockchain containing a block with the second and third types of information or blocks with respectively the second type of information and the third type of information, the register data being adapted to allow verification, by the node, of the integrity of the second and third types of information.
[0020] One embodiment relates to a communication device adapted to connect to a mesh network comprising other devices, said device comprising a mesh network interface, a local storage module and a processor configured to cause said communication device to implement:
[0021] obtaining first data identifying a file to be obtained from a source external to the mesh network and excluding devices of the mesh network, said file being obtainable in the form of a plurality of parts, the whole of which makes it possible to form the complete file;
[0022] obtaining second data identifying the parts forming the file from the external source or another device in the mesh network;
[0023] obtaining at least a portion of the file from the external source or another device in the mesh network;
[0024] storing, in the storage module of the communication device, the second data and file parts for transmission in case of request from another device of the mesh network
[0025] According to a particular embodiment, the communication device comprises:
[0026] - a programmable application interface for transmitting the first data to a client device and receiving from that client device a request to obtain a file identified in the first data and to transmit the identified file to the client device;
[0027] - a download client for downloading the plurality of cor file parts corresponding to the identified file, to form the complete identified file from the parts of the file.
[0028] A node can thus be used by one or more clients, for example several client devices carried by a vehicle which also carries the node.
[0029] According to a particular embodiment, the communication device comprises a memory comprising software code, the processor of the communication device causing said device to implement the steps of any one of the above methods. Brief description of the figures
[0030] Other characteristics and advantages of the invention will appear during the reading of the detailed description which follows for the understanding of which one will refer to the appended drawings among which:
[0031] [Fig-1] - [Fig.l] is a diagram of an overview of a system comprising a mesh network and in which the method and device according to a particular non-limiting example can be implemented;
[0032] [Fig.2] - [Fig.2] is a functional block diagram of a device according to a specific non-limiting example;
[0033] [Fig.3] - [Fig.3] is a simplified diagram of a non-limiting example of a network mesh comprising a plurality of nodes;
[0034] [Fig.4] - [Fig.4] is a first diagram illustrating the commu connections communication between a node of the mesh network and other devices for the choice of a data source for the evaluation of a cost function;
[0035] [Fig.5] - [Fig.5] is a second diagram illustrating the commu connections communication between a node of the mesh network and other devices for the selection of a data source for the evaluation of a cost function;
[0036] [Fig.6] - [Fig.6] is a diagram representing the contents of a seed file and the partition of a file to be downloaded according to a non-limiting example of implementation;
[0037] [Fig.7] - [Fig.7] is a diagram representing the contents of a file instructions according to a non-limiting example of embodiment:
[0038] [Fig.8] - [Fig.8] is a flowchart of certain steps of a method according to a non-limiting example of embodiment;
[0039] [Fig.9] - [Fig.9] is a flowchart of certain steps of a method according to a non-limiting example of embodiment;
[0040] [Fig. 10] - [Fig. 10] is a flowchart of certain steps according to a non-limiting example embodiment. Detailed description of the invention
[0041] In the following description, as well as in the figures, identical, similar or analogous elements will be designated by the same reference numbers.
[0042] The functionalities of the elements described using the figures can be implemented using one or more software programs executed by one or more suitable processors, by dedicated or generic circuits, or a combination of circuits and software.
[0043] The term processor used in the following may designate any circuit or any combination of circuits capable of implementing the described functionalities, in particular one or more microprocessors, microcontrollers or other circuits executing suitable software code, or even dedicated circuits for providing the described functionalities.
[0044] The detailed embodiments that will be described are placed in the context where a node of the mesh network is generally carried by a vehicle-type mobile device. Other applications are however not excluded, in particular for the transmission of data and in particular files in the context of edge computing.
[0045] According to the present exemplary embodiment and as schematically illustrated by [Fig.l], a communication device 101 - also called 'node' in the following - configured to operate within the framework of a mesh network communicates with a client application 102 of the vehicle carrying the node. According to the present exemplary embodiment, the link between the node 101 and an electronic control unit of the vehicle is a wired serial link, for example by implementing a serial peripheral interface ('SPI'), a universal asynchronous receiver transmitter ('UART') link or even an I2C bus. Other links can be envisaged, including wireless, in particular WiFi (registered trademark) or Bluetooth (registered trademark). As will be seen in more detail later, the control unit(s) of the vehicle send requests to the node 101 and receive messages from it. When within range of other nodes, node 101 integrates into a wireless mesh network 103.The mesh network has a tree structure in which a node is elected root node (node 104 in the example of [Fig.l]). Node 101 may also be a root node if necessary. The root node 104 has the role of establishing communication between the mesh network 103 and a server 105, through another network 106. According to a non-limiting exemplary embodiment, the network 106 is the internet. The interface between the root node and the network 106 may, depending on the implementation, comprise a cellular network interface, for example 4G or 5G according to the standards. maintained by 3GPP. The root node communicates directly with a base station (not shown). According to an alternative embodiment, the connection between the root node (104) and the network 106 is established through a router which may be a Wi-Fi access point. According to another alternative embodiment, the connection between the root node (104) and the network (106) may, if necessary, be wired (for example, a wired Ethernet connection).
[0046] According to the present exemplary embodiment, the transfer of data between the root node 104 and the server 105 is done, without this being restrictive, by one or more of the HTTP, HTTPS, FTP, FTPS or UPD protocols, above the TCP / IP protocol. The exchanges can be encrypted, in particular when using HTTPS and FTPS, and a key-based authentication mechanism can also be implemented between devices exchanging data and / or files.
[0047] [Fig. 2] is a functional block diagram of the node 101 and an electronic control unit 200 of the vehicle, this unit comprising the client application 102, according to the present exemplary embodiment. The node 101 comprises an application programmable interface 201, commonly designated by the acronym API, allowing the client application 102 to communicate with the node 101, and in particular to transmit requests to it from the electronic control unit 200, as well as to return data to this unit. This API interface supports in particular communication with the download application or client 202. The node further comprises a wireless interface 203, a file server 204, an interrupt management module 205, a status module 206, a mass memory 207, a processor 208, a program memory 213, as well as a working memory 214 of the processor 208.
[0048] The wireless interface 203 allows the node to interact with other nodes of the mesh network. According to the present non-limiting exemplary embodiment, this interface is based on the IEEE 802.11 standard, an additional layer implementing the mesh network functionality. According to the present non-limiting exemplary embodiment, this additional layer is for example based on the 'ESP-Wifi-Mesh' protocol described in the document "ESP32 - ESP-IDF Programming Guide" v4.4-dev-2825-gb63ec47 from Espressif Systems published on August 27, 2021. This protocol provides the possibility of using a node both as a station to connect to an access point (then considered as a parent node) and, if necessary, as an access point to establish communication with one or more other nodes (considered as child nodes).The protocol allows for a tree-like structure of the mesh network that goes back to a root node, elected from among the network nodes according to certain predetermined criteria. Some basic rules for the operation of this type of mesh network will be described later.
[0049] The role of the file server 204 is to manage the local storage function of the files that the node 101 and / or the electronic control unit 200 need, but also to manage a cache function - for certain types of file - for access by other nodes of the mesh network. The server has access to the non-volatile mass memory 207 for this purpose, which can be implemented using a hard disk or another long-term storage medium.
[0050] The interrupt management module 205 is connected to the electronic control unit 200 of the vehicle - it is bidirectional and allows, without this being limiting, the latter to notify the node 101 of a request from the electronic control unit 200 of the vehicle or to carry out a predetermined action. By this interrupt management module, the electronic control unit 200 can notify the node 101 of the end of taking into account a file or even of a desire to transmit data. The role of the status module 206 is to notify the client application 102 of the status of the connection of the node to a mesh network (connected to a mesh network, not connected).
[0051] Although illustrated separately as functions of the node 101, the download client 202 and the status and interrupt modules may be implemented via one or more suitable software programs whose code is stored in the program memory 213 of the processor 208. Generally, the processor 208 manages all of the functions of the node based on one or more software programs whose code is stored in the program memory 213 of the processor 208.
[0052] The electronic control unit 200 comprises, as already indicated, a client application 102 of the vehicle. It further comprises an electronic control unit system 209, which comprises a program memory 210, a processor 211, a working memory 212 of the processor 211, as well as a mass memory 215. According to the present exemplary embodiment, the program memory 210 contains, among other things, the firmware of the unit 200. The processor 211 manages all of the functions of the unit by means of appropriate software stored in the memory 210 or on another storage medium not illustrated - this processor executes in particular the code of the client application 102. Other components necessary for the execution of the functions of the electronic control unit are not illustrated. The electronic control unit 200 has a unique identifier, called the vehicle identification number or 'VIN'.Mass memory 215 is used to store downloaded files in particular.
[0053] An example of a mesh network configuration 103 on the basis of which certain rules of behavior of this network will be explained is illustrated in [Fig. 3]. The network comprises seven nodes numbered 301 to 307. Element 300 represents the access point of the network 106 - a cellular base station for example. a. According to the present exemplary embodiment, a node has at most one parent node and zero or more child nodes. A node has at most one parent node and zero or more child nodes. According to an exemplary embodiment, the number of child nodes is limited. b. One node is elected as the root node (node 301 in [Fig.3]) - for example, the node with the best signal level with an access point to a network of type 106. Several nodes near the same access point or near several access points may be in competition. c. The rank of a node is the number of nodes on the path to the root node incremented by 1. For example, node 301, which in the example in [Fig.3] is the root node, has rank 0. Node 207, for example, has rank 2. The maximum number of ranks in the network can be limited. d. A new node chooses as its parent node the node that gives the lowest rank and if there are several possible choices according to this criterion, the node giving the best signal level. e. When a node disappears, the tree is rebuilt locally.
[0054] For example, the child nodes, grandchildren... of the disappeared node will apply the previous step carried out by a new node.
[0055] Each node also knows what its parent node is and what its child nodes are, regardless of their generation (children, grandchildren, etc.).
[0056] The mesh network therefore comprises two types of nodes, the first type communicating only through the wireless mesh network and capable of serving as a relay between two other nodes of this network, the second type, also called a gateway, having the wireless mesh network functionality, but also the functionality of communication with an external network, for example of the cellular type. To do this, in the case of a cellular network, the second type is equipped with a physical or electronic SIM card issued by a cellular network operator. A node of the second type can have its communication functionality with the cellular network deactivated if it is not elected root node and then becomes a node of the first type. Each node also has a medium access control address (MAC address).
[0057] Since nodes are in principle mobile, a given node can be disconnected at any time from the rest of the mesh network, or see its parent or one of its children disappear. Some nodes can remain in the same mesh network for a fairly long time, in particular when they are carried by vehicles parked in a parking lot.
[0058] According to an exemplary embodiment, the server 105 has a role of updating data from the electronic control units in the mesh network. The data to be updated may include one or more files present in the control units, such as the firmware of these units, but the data is not limited to this context and may extend to updates of databases (for example geolocation maps) or applications or another type of data. The server has several types of information for this purpose:
[0059] (I) A first type of information comprises at least one or more identifiers of the or files that a control unit must download. An indication for determining the validity of the first type of information is included. According to an alternative embodiment, this information is an electronic signature of the content by private key issued by the server 105, present in the header of the file and verified by the node by means of the public key that it holds in its program memory.
[0060] According to an exemplary embodiment, this indication is an expiration date beyond which information of the first type is no longer considered valid.
[0061] According to an exemplary embodiment, the first type of information takes the form of an instruction file comprising information identifying information of the second type described below, this information making it possible, according to a non-limiting exemplary embodiment, to obtain the downloading of one or more files, called 'seed' files.
[0062] [Fig.7] is an example of an instruction file 700 according to a non-limiting embodiment. This file comprises a header 701 (which according to the embodiment variant mentioned above includes the electronic signature by private key) as well as a list of one or more files (600, n, n-1, n-2...) that a destination node must load.
[0063] According to an exemplary embodiment, the content of the file may differ from one control unit to another.
[0064] According to an exemplary embodiment, the first type of information also comprises instructions 703 to be executed by the unit receiving this first type of information.
[0065] (II) A second type of information identifies, for a file identified by the first type of information, the identification of the constituent parts of this file. An example of such a file 600 is illustrated by [Fig.6]. Depending on its size, a file is divided into several parts (referenced 605 to 608, i.e. four parts in the example of [Fig.6], without this being limiting) for easier transmission. Indeed, given the instability of the mesh network, the probability of transmitting parts of a file rather than the entire file is greater. Files of reasonable size given the transmission times in the mesh network are not divided into several parts. A maximum size of a file or of a part of a file can be fixed. The parts of a file can be downloaded separately by a node. According to a non-limiting exemplary embodiment, it is not necessary for any order to be respected. in the transmission of the different parts of the file.
[0066] According to a particular embodiment, the division into parts is carried out by the server, which also prepares the second type of information. The second type of information can also take the form of a file, called “seed file” 601 in the following, and which comprises a header 602 as well as a section 603 listing the references 605 to 608 of all the parts necessary to reconstitute the file 600.
[0067] According to another particular embodiment, the seed file comprises the data indicated in table 1:
[0068] [Tables 1] Seed file File ID Version number Creation date Author identification Obsolescence date Cryptographic signature of the file by private key (hash) Full file size Number of parts in the file List of file parts Electronic signature by private key of each part of the file Additional Information
[0069] It is clear to the person skilled in the art that the information of the second type may differ from the content of the file given as an example. For example, some information is not necessarily essential (identification of the author, for example). Furthermore, the function of certain information may be fulfilled by other information.
[0070] The private key signature allows each node to verify that the information of the second and third type has not been altered by mistake or intentionally thanks to the public key held by all the nodes in a secure part of their non-volatile memory. In a variant of this embodiment, a semi-closed blockchain mechanism (or also called "blockchain" in English)consortium") insofar as the blocks are mined by the server 105, is implemented. When making new files available to be distributed to the electronic control units, the server 105 adds to the blockchain (the ledger) a new block containing the second and third type information and then validates the block by a proof of work (mining). The nodes obtain from the server 105, at the same time as the first type information, the ledger. With this ledger, a node ensures that it is in possession of the most recent version of the second type and third type information, regardless of the source (another node in the mesh network). According to an alternative embodiment, the second and third type data are contained in separate blocks.The obsolescence date can also be replaced by other information that allows the validity of the file to be determined, for example it can be implicit (and in this case this information is not sent explicitly) or it can be indicated in the form of a validity period. Validity can also be indicated in the form of one or more conditions to be met other than those related to time or date.
[0071] According to one embodiment, the default behavior of a node is that it will store the seed file on its mass memory 207 accessible by its file server 204 if it has requested the downloading of this file for the electronic control unit with which it is associated, and that it does not store it in the opposite case (for example when the node serves only as a relay for the transmission of the file to another node).
[0072] According to an alternative embodiment, the seed file 601 comprises additional information in the form of instructions 604 to the node or nodes through which the file transits, for example relating to the storage of data by the local file server 204 of the node(s) and in particular to deviate from the default behavior.
[0073] According to a first non-limiting example, this additional information comprises an instruction not to store the seed file in the mass memory 207 of the local file server 204. This instruction can be sent for example when the content of the seed file is sensitive and its accessibility by nodes other than a specific destination node must be controlled. The destination node transmits the received file (after reconstitution of the file 600 on the basis of the downloaded parts, i.e. 605 to 608 according to the non-limiting example of [Fig. 6]) to the electronic control unit 200 but does not keep it in memory beyond this use.
[0074] According to a second non-limiting example, the additional information comprises an instruction 604 to store the seed file 601 as well as the constituent file parts of the file 600 associated with the seed file 601. In this case, a node will store the seed file 601, as well as the parts of the associated file 600, even if it is not among the final recipient(s), for example if it sees the file as a relay node. This option can be implemented for example for a seed file 601 and an associated file 600 that are in high demand or potentially in high demand, in order to increase the number of nurse nodes that can provide the related data in case of request from other nodes.
[0075] According to an exemplary embodiment, a node deletes a seed file and the files relating thereto (600 and 605 to 608 in the non-limiting example according to the non-limiting example of [Fig.6]) stored by its file server once the file is no longer valid.
[0076] According to an exemplary embodiment, the list of parts of the file includes the respective unique identifiers of these parts. A requesting node will include the unique identifier of a part in a request to download this part.
[0077] (III) A third type of information comprises the file parts themselves (605 to 608 in the non-limiting example of [Fig.6]). According to an exemplary embodiment, the file parts are binary files. I. According to an alternative embodiment, the server also transmits a fourth type of information intended for the complete or partial cleaning of the file servers of a node. This fourth type of information can also take the form of a file transmitted when a node connects and include instructions for deleting one or more specific files or all of the data stored locally in the node.
[0078] According to one embodiment, the steps when activating a new node are as follows:
[0079] (i) A new node, called the original node in the following, becomes active.
[0080] (ii) The original node is inserted into the mesh network tree.
[0081] (iii) The originating node transmits a message to its parent node, which message travels up the tree to the root node - the latter transmits it to the server if the root node is in communication with the server.
[0082] The message contains a unique identifier that can be authenticated by the server and allows it to identify both the originating node and the electronic control unit associated with the originating node. According to an exemplary embodiment, the unique identifier is the VIN identifier of the electronic control unit of the vehicle associated with the originating node or the MAC address of the originating node or the combination of the VIN identifier and the MAC address. According to an exemplary embodiment, the unique identifier is sent in the form of a hash.
[0083] The message also contains information allowing the server to determine whether an instruction file 700 must be sent to the electronic control unit of the originating node. This information is, for example, the indication of the validity of a file instruction files previously received by the originating node, or an indication that no instruction files are available at the originating node's control unit.
[0084] (iv) If applicable, an instruction file is transmitted by the server to the originating node.
[0085] According to an exemplary embodiment, an electronic control unit monitors the validity of the instruction file that it stores. When the file is no longer valid, for example when the expiration date has passed, the client application of the vehicle launches a request to the node associated with the vehicle to request a new instruction file from the server.
[0086] Based on the instruction file, the second type of information is then downloaded by the originating node. In the following, we will take the simple case where a single file must be obtained and therefore a single seed file is managed. It is understood that this constitutes a non-limiting example and that the instruction file may concern a plurality of files.
[0087] According to the present exemplary embodiment, the download client 202 of the node transmits the instruction file 700 to the electronic control unit 200. Upon request from the latter for the file 600 through the API 201, the download client proceeds to download the seed file 601 and then automatically proceeds to download the individual parts of the file (605 to 608 in the non-limiting example) based on the content of the seed file 601. Once all the individual parts have been downloaded, the download client verifies the integrity of the downloaded parts, assembles the complete file 600, verifies its integrity and informs the electronic control unit 200 through the interrupt management module. The complete file 600 can then be transmitted to the electronic control unit.According to an alternative embodiment, where appropriate, the download module implements the additional instructions that may be contained in the seed file.
[0088] From the point of view of the electronic control unit 200, the latter receives the instruction file 700 and can deduce from it, if necessary, the file(s) 600 to be obtained.
[0089] Following receipt of a request for a file 600, the download client 202 proceeds as follows: I. If a requested file is complete and available in the file server, this file is transmitted to the electronic control unit through API 201. IL If the file is not available or incomplete: • If the file is not being downloaded, the download client 102 initiates the download and puts the request from the electronic control unit on hold until the file is available. complete. • If the file is being downloaded but is not yet complete, the download client continues the download and puts the ECU request on hold until the complete file is available.
[0090] According to a particular embodiment, when a node receives a request for a file from the electronic control unit, it returns data relating to the download status. According to one embodiment, this data comprises at least one of an indication of whether the download of the file is in progress and a download progress rate. This latter data may simply consist of a ratio between the number of parts already downloaded compared to the total number of parts of the file.
[0091] The procedure for downloading the different types of information and file parts in the context of a mesh network according to an exemplary embodiment will now be described. In the following, we will mainly talk about file parts, but the process described applies equally to the second type of information or seed file. The first type of information or instruction file is only available from the server 105 and is not stored in a distributed manner in the network.
[0092] A node requesting a download has a queue of files and / or parts of files waiting to be downloaded. This queue is filled in particular on the basis of requests from the electronic control unit. This queue is not necessarily empty when connecting to the mesh network because the node may have been previously disconnected from the same mesh network or from another mesh network. If necessary, it may fill up as requests from the electronic control unit are received. The requesting node transmits a request for an element such as a part of a file or an entire file (for example concerning the seed file) to its parent node and its child nodes. The queue is used to feed the requests. A request may concern several parts of a file or files, but for reasons of clarity, the case of a single part of a file will be considered initially.A query is used to determine whether a node in the network has the item in its local storage and to obtain the address of that node. It should be noted that when it launches a query, the node ignores the address(es) of the node(s) that will be able to provide it with the requested data.
[0093] Generally speaking: a. a node receiving a request (whether from an initial requesting node or an intermediate node) and possessing the requested file part will inform the node that transmitted the request, attaching its own address, and stop propagating the request; b. a node receiving a request (whether from an initial requesting node or an intermediate node) and not possessing the requested part of the file will propagate the request to its direct neighbors (parent, children).
[0094] Gradually, the entire network can thus be reached - but the request is stopped in its propagation in a branch by a node which owns the part of the file. The initial requesting node will therefore not necessarily have an exhaustive list of nodes owning the file, but will have at least a list of the closest nodes.
[0095] The server is considered a parent node in this method, although not part of the mesh network as such.
[0096] The addresses of the nodes possessing the file, called source nodes, are sent back to the initial requesting node through the intermediate nodes.
[0097] The initial requesting node chooses one of the source nodes to request the download by sending it a message to that effect through the nearest node on the path to the chosen source node, a message which is transmitted from node to node on this path. The choice can be made for example by evaluating a cost function, or according to another criterion.
[0098] Once the source node is chosen, the initial requesting node sends a download request to this source node - the source node then initiates the transmission of the element through the mesh network. If the source node and the initial requesting node are not in direct contact, the data packets corresponding to this element are transmitted step by step by the intermediate node(s).
[0099] According to a particular embodiment, a node which does not have the part of the file requested in a request and which does not receive any positive response in this sense from its own subnetwork sends negative information to the node which propagated the request to it. 'Subnetwork' means the entire part of the mesh network which is connected directly or indirectly to the node which received the request, excluding the part of the network connected to the node from which the request originates.
[0100] According to an alternative embodiment, if the requested element is not available but is being downloaded by the parent node of the initial requesting node, then the parent node informs the initial requesting node that the element concerned is being downloaded, optionally with an indication of the progress rate. The initial requesting node transmits a new request for this element after a waiting time, which is for example a fixed time (for example a few tens of seconds) or a randomly chosen time.
[0101] In the case where a propagated request concerns several elements, the response from a node may contain distinct responses for each of the elements, and in the case of several positive responses, as many source node addresses.
[0102] According to an alternative embodiment, in the case where a request received by a node concerns several elements and this node has only a part of the requested elements, it only propagates the part of the request concerning the element(s) for which it cannot provide a positive response. It then concatenates all the responses received, including its own, into a single response which will be transmitted to the node from which it received the request.
[0103] According to an alternative embodiment, in order to allow the initial requesting node to receive all the addresses of the potential source nodes given that the various requests and responses must have time to propagate through the mesh network, the initial requesting node provides a waiting time after receiving a first positive response before choosing a source node. This waiting time, modifiable by configuring the node, can be, for example, a few seconds.
[0104] According to an alternative embodiment, the request from the initial requesting node contains the IP address of this node, so that a node indirectly receiving the request via an intermediate node can respond directly to the initial requesting node with a message using this IP address as the destination address. There is then no concatenation of the response by the intermediate node. This also assumes that this IP address is contained in the requests propagated beyond the nodes directly connected to the initial requesting node.
[0105] According to an alternative embodiment, the evaluation of a cost function of a download (of type of information, file or part of file) is implemented to choose one among several source nodes to download a given element. According to the present embodiment, the cost function tends to favor a node of the mesh network as a source rather than a server external to the mesh network, without however excluding this server.
[0106] According to a particular embodiment of this variant, the cost function takes into account: a. The signal level (given by the RSSI, which is a negative value in dBm between 0 and -255) between two nodes b. The number of hops (number of intermediate nodes between an initial requesting node and a source node) c. The type of connection (e.g., cellular or non-cellular)
[0107] Concerning point (a), the RSSI is the signal level between the Wifi client (the station part of a child node) and the Wifi access point (the Access Point part of a parent node). Each link has its own RSSI. The overall RSSI of a path between the requesting node and the potential provider node of the element to be downloaded is the sum of these RSSIs. In practice, to evaluate the cost of the link, we will take the value 255 subtracted from the RSSI because the higher the signal level, the higher the RSSI (close of 0). The RSSI values of the links between the requesting node and the provider node are conveyed in the positive response message from the provider node to the request for the file. To this end, the response message contains two digital registers: RSSI and STABILITY, initialized by the provider node to 0 and 1 respectively. The provider node transmits this message to the node that sent it the file request. The latter increments the RSSI register of the message with the value 255 subtracted from the value of the RSSI between itself and the provider node and performs the product of the value of the STABILITY register with the value of the stability of the link between itself and the provider node. Then it transmits this message to the node that sent it the request that it itself sent to the provider node. The process is repeated until the message reaches the requesting node.The latter performs the same operations then calculates the total cost of the path between it and the supplier node by dividing the value of the RSSI register by that of the STABILITY register.
[0108] Table 2 illustrates the successive values taken by the RSSI and STABILITY registers as the message progresses through the network.
[0109] [Tables2] Rank With previous node RSSI message registers RSSI stability STABILITY n Provider node (n) N / AN / A 0 1 n-1 Intermediate node (n-1) Rn 1 Sn.i 0+Rn i lxSnl n-2 Intermediate node (n-2) Rn 2 S„2 0 +Rn i+Rn 2 lxSn.ixSn.2 1 Intermediate node 1 Ri Si 0 +Rn l+Rn 2 +.. .+Rj lxSn-iXSn.2X...X Si 0 Requesting node Ro So 0 +Rn i+Rn 2 + .. .+R1+R0 lxSn.ixSn.2x...x SixSo
[0110] The cost of the path between the supplier node (n) and the requesting node (0) is: [YES] [Math.l] , . 1¾
[0112] Regarding point (c), a cost value of the link between the server 105 and the root node is provided by the latter to the other nodes of the mesh network.
[0113] According to another embodiment, the stability of the network is also taken into account in the form of a value between 0 and 1, where 1 represents maximum stability. The stability of several consecutive connections is obtained by the product of the stabilities of each connection between the requesting node and the source node, and an evaluation of the signal strength between these two nodes is compensated by dividing this power evaluation by the product of the stabilities. According to a particular embodiment, the stability of an individual connection is a function of one or more criteria among the connection time observed over a given period, the time of day, the stability of the neighborhood in the mesh network and other measurable criteria indirectly depending on the movements of the node.
[0114] [Fig.4] shows an example of a simple mesh network comprising a server 400 and nodes 401 to 404. The source 401 and node 404 are potential sources for data requested by the requesting node 402. Node 401 is the root node and nodes 402, 403 and 404 are nodes of respective ranks 1, 2, 3. An RSSI value is associated with each connection among the nodes. This RSSI value is denoted 'RSSI x-y' where x indicates the rank of a first node and y indicates the rank of a second node connected to the first node, with x <y.
[0115] The cost function evaluated for the two potential sources can then be of the form:
[0116] SourceCost = (255 - “RSSI 2-3”) + (255 - “RSSI 1-2”)
[0117] CostSource2 = (255 - “RSSI 0-1”) + TELCO
[0118] where 'TELCO' is a cost associated with the access network to which the root node is connected. In this example, the cost associated with the TELCO link is the maximum cost of a link in the mesh network, i.e. '-255.
[0119] [Fig.5] is a numerical example of a network and the cost evaluation taking into account the stability of each connection. In the example of [Fig.5], the server 500 and the nodes 501 to 504 are respectively connected in a similar manner to the server 400 and the nodes 401 to 404 of [Fig.4]. The node 502 also has a child 505 and a grandson 506. The figure gives the values of the different criteria taken into account in the cost function.
[0120] [Tables3] Source Destination Cost Server 500 Node 502 ((255 + 255) + (255 + 43)) / (0.99 * 0.7) = 1166 Node 506 Node 502 ((255 + 68) + (255 + 58)) / (0.85 * 0.9) = 831 Node 504 Node 502 ((255 + 38) + (255 + 33)) / (0.7 * 0.6) = 1383
[0121] Node 506 is the source node giving the lowest cost. Note that as a source, the server has an average cost, in particular thanks to the significant stability value associated with the connection with the root node.
[0122] Although the two examples given below combine different criteria of a certain in the cost functions presented, these different criteria can be used independently of each other or combined in different ways, depending on the needs. It is also possible to add one or more other criteria.
[0123] [Fig.8] is a flowchart illustrating some of the steps according to one of the previously described embodiments and implemented at a node.
[0124] A first step S801 comprises obtaining first data identifying a file to be obtained. A second step S802 comprises obtaining second data identifying a plurality of parts of the file to be obtained. A third step S803 comprises storing the second data locally. A fourth step S805 comprises obtaining at least one part of the file. A fifth step comprises storing the at least one part obtained locally.
[0125] The node can then serve as a source for the second information and / or the part(s) of the file stored locally. Note that the node can of course serve as a source for the second information without parts of the file already being stored locally.
[0126] [Fig.9] is a flowchart illustrating some of the steps according to one of the previously described embodiments and implemented at a node.
[0127] A first step S901 comprises receiving, at a given node, a request from another node of the mesh network to verify the presence of an element in the local storage of the given node. The given node verifies the presence of the element in its local storage (step S902). If the element is present, the given node identifies itself as the source node and transmits a positive response to the node that sent the request in a step S903. The given node specifies an identifier such as an address that will allow another node receiving this identifier to contact it. If the element is not present in the local storage, the request is propagated, according to a step S904, to the nodes directly linked to the given node, with the exception of the node that sent the request. The given node then waits for responses from the nodes to which the request will have been propagated. If a positive response is received with an identification of a source node, which is tested during a step S905, then the given node transmits this identification to the node that sent the request in a step S907. The source node can be one of the nodes directly linked to the given node, or another node to which the request will have been propagated elsewhere, or the server. Several source nodes can identify themselves and their identification transmitted. If no positive response is received, the given node transmits a negative response to the node that sent the request, according to a step S906.
[0128] [Fig. 10] is a flowchart illustrating some of the steps according to one of the previously described embodiments and implemented at a node.
[0129] According to a step S1001, a given node transmits, to the nodes in direct connection, a request to verify the presence of an element to be downloaded. If at least one identifier of a source node is obtained in return (positive test in step S1002), then a selection of a source node is made during a step S1003, a request to transmit the element is sent to the source node selected during a step S1004, and the element is received and stored locally in a step S1005. If no source node identifier is obtained, step S1001 is resumed if certain conditions are met (for example and in a non-limiting manner, such conditions may include one or more of: the mesh network is again connected to a server, the given node has obtained a new child node, new nodes have announced themselves in the mesh network, etc.).
Claims
Claims
1. A method of transmitting data in a mesh network (103) of communication devices (301-307), the method being implemented by a given device (101) of the mesh network provided with a processor (208), the method comprising: obtaining (S801) first data (700) identifying a file (600), said first data being to be obtained from a source external (105) to the mesh network and excluding the devices of the mesh network, said file being obtainable in the form of a plurality of parts, the whole of which makes it possible to form the complete file; obtaining (S802) second data (601) identifying the parts (605-608) forming the file (600) from the external source or from another device of the mesh network; obtaining (S804) at least a part of the file from the external source or from another device of the mesh network;storing (S803, S805), in a storage module (207) of the given device, the second data and the file parts for transmission in case of a request from another device of the mesh network; the mesh network being organized in the form of a tree structure according to which each device is connected to at most one parent device and can be connected to zero, one or more child devices, the method further comprising receiving (S901) a request from a device directly connected to the given device in the tree structure of the mesh network, said request identifying a searched item, and sending (S903) a positive response to the device whose request was received if the searched item is one of the second data and the at least one file part stored by said given device, the positive response comprising an address of the given device.;
2. The method of claim 1, wherein obtaining the second data (601) or the at least part of the file (605-608) comprises transmitting (S1001) a request to the devices directly connected to the given device in the mesh network in the tree structure, said request identifying the second data or the at least part of the file to be obtained.
3. A method according to claim 2, comprising receiving responses from the devices to which the request was sent, the responses including, where applicable, the address of one or more devices in the mesh network having stored the second data or at least part of the file to be obtained and to which the request will have been sent or at least partially propagated.
4. A method according to claim 3 comprising determining, from among the device(s) from which the address(es) have been received, a device from which the second data or at least part of the file is to be obtained, the determination being based on a cost function taking into account the link(s) on the path, in the tree structure, between the given device and each of the device(s) from which the address(es) have been received.
5. A method according to claim 4, wherein the cost function takes into account one or more of one or more signal levels on the link(s) on said path, the number of hops on said path, the nature of the link(s) on said path, one or more stability indicators of the link(s) on said path.
6. A method according to claim 5, wherein the cost function takes into account the combination of one or more signal levels on the connection(s) on said path and one or more stability indicators of the link(s) on said path.
7. Method according to claim 6, wherein the cost induced by a link between a device of the mesh network and the external source is taken to be greater than the cost induced by a link between two devices of the mesh network.
8. A method according to claim 1, comprising, in the event of absence of the searched item in the storage of the given device, propagating (S904) the query to devices directly connected to the given device in the tree structure apart from the device from which the query was initially received, and collecting responses from the devices from which the query was propagated for returning (S906, S907) a response to the device from which the query was initially received.
9. Method according to one of claims 1 or 8, comprising, if the given device is connected to said external source (105) and does not have the sought element in its storage, returning the address of said external source in the response.
10. A method according to one of claims 1 to 9, comprising receiving, from the external source (105), ledger data of a blockchain maintained by said external source, said blockchain containing a block with the second and third data or blocks with respectively the second data and the third data, the register data being adapted to allow verification, by the node, of the integrity of the second and third data, the third data comprising at least part of the file.
11. A communication device adapted to connect to a mesh network comprising other devices, said device comprising a mesh network interface (203), a local storage module (207) and a processor (208) configured to cause said communication device to implement: obtaining (S801) first data (700) identifying a file (600), said first data being to be obtained from an external source (105) to the mesh network and excluding devices of the mesh network, said file being obtainable in the form of a plurality of parts the whole of which makes it possible to form the complete file; obtaining (S802) second data (601) identifying the parts (605-608) forming the file (600) from the external source or another device of the mesh network; obtaining (S804) at least a portion of the file from the external source or another device in the mesh network; storing (S803, S805), in the storage module (207) of the communication device, the second data and the file parts for transmission in case of request from another device of the mesh network; and, the mesh network being organized in the form of a tree structure according to which each device is connected to at most one parent device and can be connected to zero, one or more child devices, receiving (S901) a request from a device directly connected to the given device in the mesh network tree, said request identifying a searched item, and sending (S903) a positive response to the device from which the request was received if the searched item is one of the second data and the at least one file part stored by said given device, the positive response comprising an address of the given device.
12. Communication device according to claim 11, comprising - an application programmable interface (201) for transmitting the first data to a client device (200) and receiving from this client device a request for obtaining an identified file (600) in the first data and to transmit the identified file to the client device; - a download client (202) for downloading the plurality of file parts corresponding to the identified file (600), to form the complete identified file from the file parts.
13. A communication device according to one of claims 11 or 12, wherein the processor is configured to cause said device to implement one of the methods of claims 1 to 10.
