METHOD FOR COMMUNICATING IN A DYNAMIC DEPTH CLUSTER OF COMMUNICATING ELECTRONIC DEVICES, ELECTRONIC

专利摘要:
The invention relates to a communication method (P100) within a network (N1) of wireless electronic communicating devices (10, 10i) for dynamically and automatically regulating the propagation of enrollment messages (MH, MH '). when forming clusters (Cl1, Cl2, Cl3). The invention further relates to any electronic device implementing said communication method and any system comprising such a device. Such a communicating electronic device (10, 10i) comprises a processing unit (11) cooperating with a program memory (14) comprising instructions of a program (P) whose execution or interpretation by said processing unit (11) causes the implementation of the communication method (P100).
公开号:FR3034280A1
申请号:FR1552522
申请日:2015-03-25
公开日:2016-09-30
发明作者:Pascal Daragon；Natale Guzzo；Arulnambi Nandagoban；Nathalie Mitton
申请人:Inst Nat De Rech En Informatique Et Automatique；Traxens；
IPC主号:

专利说明:

[0001] A method of communication within a dynamic depth cluster of communicating electronic devices, an electronic device implementing said method and associated system The invention relates to a method of adhesion to a cluster of communicating electronic devices, said method being implemented. implemented by a processing unit of one of said electronic devices communicating with peers through a wireless communication network. The invention further relates to a system comprising a plurality of devices implementing such a method of adhesion.
[0002] As an example of a preferred but nonlimiting application, the invention is described by way of an example of application relating to the collection of quantities, such as, for example, a temperature, a humidity level, a luminous intensity, vibration frequency, shock, etc., in connection with the internal and / or external environments of containers of goods or merchandise or more generally containers. According to said example of application, said containers are agglomerated and / or stacked on a storage area or still roaming on a transport platform such as a container ship, a freight train or any other suitable transport platform. Each container cooperates with one of said communicating devices. The latter are responsible for collecting and routing said quantities through service messages to even devices acting as "heads of cluster" or "Heads" according to English terminology. One of the missions of a Head is to implement a specific service. Such a service may, for example, consist in aggregating data collected by the communicating devices and in transmitting said data, after their aggregation, to a remote entity, by means of a long-range or long-distance link of the satellite link type. or radiotelephone link. The invention, however, can not be limited to this single application example. More generally, a Head is responsible for implementing a given service in connection with data collected and conveyed by his peers, said given service being able to concern a supervision or an alarm management, instead and in addition to or in addition to a communication with a distant entity. Many typologies or configurations of networks of communicating objects exist. Figure 1 thus schematically shows a wireless communication network N1. Whatever the network operated, each communicating device, which is also commonly referred to as a "node" of said network, implements a communication method enabling it to exchange data and / or service messages with a node. third or even. Thus, the network N1 situates forty communicating electronic devices respectively referenced in FIG. 1: a1 to a8, b1 to b8, c1 to c8, d1 to d8 and el to e8. Such a network is generally referred to as a multi-hop network or a "multi-hop network" according to English terminology. According to this typology, a first node that we will call "source", elaborates a service message, represented in FIG. 1 by a double arrow, comprising data related to, by way of nonlimiting example, a quantity measured by a sensor cooperating with said first node, to a second node "recipient". Unlike necessarily direct communication between two nodes of a single-hop network (or "single-hop network" in English terminology), the communication between first and second 3034280 3 nodes can be direct or indirect between two nodes of a multi-hop network such as the network N1 according to FIG. 1. Thus, according to indirect communication, a message addressed from a source node can be relayed by one or more third or intermediate nodes, whose respective roles consist of relaying said message from the source node so that said message is ultimately routed to and received by the destination node. Such nodes form clusters or "clusters" according to English terminology. For example, a cluster C11 is represented by an in-line hoop dotted by FIG. 1. The path in which a service message from a source node to a destination node, via one or more nodes runners, is generally called "road". Thus, according to FIG. 1, a message sent from the node a4 to the node d2 is relayed successively by the intermediate nodes b4 and c3.
[0003] The communication within a multi-hop communication network is generally carried out by radio. The communication is generally of short range, that is to say of the order of a few meters to a few tens of 25 meters, so that, step by step, service messages are transmitted between the different nodes. When data is supposed to be routed to a server or more generally to a remote entity, a second mode of communication is implemented, for example, by GSM ("Global System for Mobile Communications" in a terminology Anglo-Saxon) or GPRS ("General Packet Radio Service" in English terminology) or even by a satellite link.
[0004] As indicated by way of a preferred example of FIG. 2, a node generally and mainly consists of an electronic device 10 comprising a processing unit 11, for example in the form of a microcontroller, cooperating with a memory module. data 12, possibly a program memory 14, said memories possibly being dissociated. The processing unit 11 cooperates with said memories 12 and 14 by means of internal communication buses, represented in FIG. 2 by double arrows in single lines. Generally, an electronic device 10 comprises one or more sensors 15 for measuring a physical quantity in relation to the environment of the device 10. Such a sensor can measure the surrounding temperature, a humidity level or the presence / absence of light. The device 10 further comprises first communication means 13 cooperating with the processing unit 11 and ensuring a wireless proximity communication with any other electronic device 10i located within communication range. It may further comprise second means of communication 16 of the "long distance" type also cooperating with the processing unit 11. These second communication means allow such a device 10 to be able to transmit to a distant entity, for example a RS server, data through MC messages distributed by an RR network operator, for example, GSM, GPRS or satellite technologies. To function, that is to say for the processing unit 11 to implement a method resulting from the interpretation or execution, by said processing unit, of program instructions P recorded in the In the program memory 14, the device 10 comprises a source of electrical energy 17, in the form of one or more batteries for example. The ability to communicate or simply to be able to operate from one node is directly related to the remaining and available energy capacity of said node. Indeed, the exchanges between nodes, the processing or calculations implemented by the latter operating data exchanged, and the possible routing and remote data collected within a network or a cluster of communicating devices, are all actions consuming electricity.
[0005] Some manufacturers or operators have sought to optimize networks or communication methods implemented by nodes within a network or cluster to preserve globally the electrical energy capacity of the network or cluster. Overall, a first approach is to distribute the energy cost resulting from the exchanges between the nodes on all of said nodes of the network or the cluster. A second approach consists in distributing the energy consumption resulting from the processing operations carried out on collected data, for example a long-distance emission, on most of the nodes, thus sharing the power consumption on a plurality of nodes. Thus, whether the contactless communication network is in single-hop or multi-hop configuration, a node may be arbitrarily designated or promoted as a "head-end" node or at least as a cluster head, a Head node. In connection with Figure 1, a device acting as Head is represented by a circle drawn in thick lines. This is the node 30 d2 for the network N1. The node d2 thus acts as Head of the cluster C11. In this way, the energy consumed, in particular for remotely transmitting data collected within a network, is shared over a plurality of nodes. Alternatively, the Heads 35 may be randomly designated, or more precisely may randomly self-designate 3034280 heads respectively, provided that they have sufficient hardware and / or software to implement a particular service. By way of example, the "LEACH" method, as described in particular by the document titled "An ApplicationSpecific Protocol Architecture for Wireless Microsensors" (W. Heinzelman, A. Chandrakasan, H. Balakrishnan - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Vol 1, No. 4, OCT 2002), allows in a single-hop network to randomly designate a node to become Head. The other nodes belonging to the cluster of said Head, nodes that we will call respectively "Member" or "Member" in English terminology, address to the head of the cluster, and therefore to the Head, their service messages. In connection with Figure 1, each Member node is represented by a circle drawn in fine line. Thus, within the network N1, the head d2 communicates directly with the nodes C1 to c4, d1, d3 and d4 as well as with the nodes 20 el to e4. Via Member Cl, Head d2 communicates with Member Bl who can relay messages to or to Member al. Head d2 collects said data transmitted from different Member nodes, processes, aggregates or even consolidates them, and triggers, for example, a long-range transmission to a remote entity, such as an RS server described in connection with According to this known technique, once a node has assumed the role of Head, it can not perform such a role again before the expiry of a specified period. A new Member node is then randomly designated Head, ensuring continuity of service. For a node, which we will call "free" or "loose" in English terminology, represented by a circle drawn in double lines in connection with FIG. 1, can "adhere" to a Head and thus constitute a new cluster or join an existing cluster, such a free node, located within radio range of a node promoted or designated Head, is arranged to receive an enrollment message MH emanating from said Head, generally issued in the form of a undifferentiated broadcast 5 (also known as "broadcast") of MH enrollment messages to any node located within radio range of the Head. FIG. 1, allows, through the network N1, to describe the resultant of a transmission of an MH message transmitted from the node 10 d2, designated to act as Head, MH message transmitted according to a short-range broadcast mode nodes located within communication range. On receipt of such an enrollment message MH, a free node, for example the node e2, updates its data memory, said memory cooperating with its processing unit to record the coordinates or the value of the data. identifier of the Head, the identifier of the node d2 in conjunction with Figure 1. The device e2, previously free, becomes a member of the cluster C11. It thus appears represented by a thin line circle in FIG. 1. The device d2, acting as Head, becomes the recipient of any MS service message including data collected by the newly discovered member e2 of cluster C11. like the other Member devices of said cluster. The transmission of the message MH by the node d2 is limited in scope. Also nodes, located out of reach, do not receive the message MH as an intelligible message, or do not receive it at all. The nodes being out of range of d2, such that the nodes a5 to 30 a8 or nodes b5 to b8 remain free nodes, represented by circles drawn in double lines. Cluster C11 has only node d2, acting as Head, and the nodes Members, that is to say having accepted the enrollment of Head d2.
[0006] A transposition of the LEACH teaching in the context of a multi-hop network, such as the N1 network described in connection with FIG. 1, could suggest that the nodes, becoming members of a cluster comprising a node acting as Head, record, within their respective data memories, the route, i.e., the value of the node identifier acting as Head and at least the value of the identifier. the node having relayed the enrollment message of said Head, or alternatively, the respective values of the identifiers of intermediate or relay nodes 10 separating it from said Head. Thus, for example, the node c2 stores the value of the identifier of the Head d2, having received directly an enrollment message MH of said node d2. The node b2 records, in addition to the value of the identifier of the node d2, the value of that of the node c2 having relayed the enrollment message MH of d2 in favor of the node b2. Such an approach makes it possible in theory, or at least according to a perfect mode of application, to preserve the overall energy resources of a communication network comprising a plurality of communicating nodes. In practice or in reality, and particularly according to fields of application or operation of such a communication network in relation to the transport of containers cooperating with communicating electronic devices, such a solution remains irrelevant, at least not very effective. In fact, let us take as an example of a preferred and nonlimiting application, the operation of a wireless communication network whose nodes record, collect and transmit measurements in connection with a plurality of containers, such as containers of goods. or goods. Imagine that each container is associated with a communicating electronic device implementing a communication method such as LEACH or a multi-hop type equivalent. According to this hypothesis, each communicating electronic device associated with a container acts as a node within the wireless network, such as the network N1 described in connection with FIG. 1. Imagine that the mode of communication between nodes is done by radio channel. In addition to the fact that a LEACH communication method involves a single hop approach, thus requiring that each node be able to communicate directly with a Head, the relative arrangement of the containers, for example on a ship, on storage area or on any road or rail transport platform, creates an application context, such as a designated node Head might not be or no longer able to fulfill its mission, consisting for example of transmitting data aggregated to a remote unit, simply because of its positioning in a stack of containers for example. Indeed, there are many obstacles constituted by a transport platform and / or a storage space, because of partitioning or partial confinement imposed by the container reception structure 20, or by the interactions generated by each other by the containers. themselves, whose stacking can lead to degradation or even loss of capacity to transmit data over long distance from a Head. The risk of noting a loss of data, delays in routing said data, but also useless and irrelevant energy expenditure to "animate" a cluster whose Head would not be able to effectively perform its function or service, is very large. This risk is all the more so in the event that random elections of consecutive Heads result in unhelpful "choices". To solve such drawbacks, the applicants have designed a communication network that is not particularly innovative and efficient, whatever the relative arrangement of the nodes and whatever the applicative or operating framework of said network, that it is either of single-hop or multi-hop type. Such a network makes it possible to optimize the overall capacity of the network to provide a service determined from data collected by the different nodes. It relies mainly on a method of joining a cluster of communicating devices according to the ability of a Head to assume such a role, for, by way of non-limiting example, transmit data in a long communication mode distance. Each node implementing such a method may decide to act as Head if it is able to do so. Conversely, any free node may decide to adhere or not to a cluster 15 according to the capacity of the Head, preferably self-designated cluster head or Head. In addition, the applicants have designed a particularly innovative and robust wireless communication network, even when nodes constituting said network are mobile with respect to one another or when the topology of said network is particularly fluctuating. According to this innovation, any free node can request, on demand, an affiliation procedure from a Member of a cluster. Such an affiliation procedure may result from an adaptation of a network such as that described above and illustrated with reference to FIG. 1. A request for affiliation of a free node is represented by an arrow in double lines. In the present case, this is the free node a4, previously free, which solicits an affiliation with the node b4, Member of the cluster C11 whose Head is the node d2. The node a4 becomes Affiliated with the cluster C11, represented by a discontinuous circle. Thus, while a4 was not in a position to receive an enrollment message MH from the Head d2, it can join, at its request, the cluster C11. Each node, implementing such an affiliation procedure, can more generally at its request and independently of the enrollment policy of a Head, request an affiliation with a Member of a cluster and thus transmit service messages to said Head, in particular via the Member node having accepted the affiliation procedure. It is thus possible to extend clusters formed after an enrollment procedure, or even to transform a simple hop-type network into a "pseudo multi-hop network" or more precisely to adapt a simple-hop network of which a cluster becomes a network structure. multi-hop type, a Member node, having accepted an affiliation request, working as a relay node of the affiliated node for the transmission of service messages.
[0007] Whatever the type of network operated, the respective capabilities of the nodes implementing a method of membership and / or affiliation to a cluster evolve over time.
[0008] Although proposing a significant advance, such a solution presents, like the competing solutions mentioned above, certain limits or disadvantages, especially when such a communication network is exploited in an application context for which the topology of said network is particularly changeable. In fact, whatever the chosen communication network, the routes or topologies, that is to say the constitution or the destruction of clusters, of said network are not updated with sufficient regularity OR at a sufficient frequency to take into account the dynamics of said network. With the help of known solutions, if such updates were carried out at a high frequency, the number of enlistment, cluster destruction or service messages would be increased tenfold, so that the main objective of to preserve the 3034280 12 energy consumption nodes network can not be held. On the other hand, the formation of a deep cluster, that is to say that a Member can be located at a distance in a significant number of jumps, can generate an important message traffic inherent, for example, in MH enrollment message relay or MS service relay relay members. Such high frequency relaying, and moreover by many Members, may interfere with the energy capabilities of said relaying members to collect data, produce and transmit to a head its own service messages. For a single jump network, the depth is set to a jump. For a multi-hop network, there is no known method to limit wisely, or even dynamically regulate, in a homogeneous and controlled manner, the depth of a cluster.
[0009] The invention makes it possible to meet all or some of the disadvantages raised by the known solutions. By constituting a wireless communication network, particularly innovative and powerful, whatever the relative arrangement of the nodes and whatever the applicative or operating framework of said network, the invention makes it possible to optimize the overall capacity of the network. to provide a service determined from data collected by the different nodes. The main originality of the method of adhesion to a cluster of communicating devices resides in the election of Heads and / or the ability of any node to accept or modulate its role as a relay member. Each node implementing a method according to the invention can decide to act as Head by specifying the depth of cluster that it wishes. In addition, each node may, depending on its ability to dedicate a portion of its resources to the relay of enlistment or service messages, for example, maintain or limit this action. Such a limitation has the effect of reducing the depth of the cluster whose node is Member, or at least limiting the downstream path to which said node belongs. Among the numerous advantages provided by the invention, we can mention that it makes it possible: to regulate in a relevant manner the energy expenditure on the nodes of the network, thus prolonging the capacity to render a service of said network in an unparalleled manner in relation to in the state of the art; to design a network, or at least a node structure, that is automatically adaptable and functional as changes in relative positions between the nodes or the evolution of the operating conditions of said nodes, for example during handling, storage or transport of containers each associated with an electronic device according to the invention; To favor the robustness of the service, for example the transmission of data by long distance, by giving each node in accordance with the invention the opportunity to determine its role within the network.
[0010] For this purpose, the invention firstly relates to a method of communication within a network comprising a plurality of communicating electronic devices, said method being implemented by a processing unit of a first communicating electronic device. among said communicating electronic devices within the network, said first communicating electronic device comprising in addition to said processing unit, a data memory, first communication means ensuring a wireless proximity communication with a third electronic device of the network located in communication range, said data memory and said first communication means cooperating with said processing unit, the data memory having the value of an identifier dedicated to said first communicating electronic device and a record for storing the current value of an identifier of a second e communicating electronic device acting as the head of a cluster. Such a method comprises: a step for receiving, via the first communication means, an enrollment message developed and transmitted by a communicating electronic device within the network, said enrollment message encoding the identifier of the second device; communicating electronics acting as a head that cluster; a step for decoding said enrollment message and deducing therefrom the value of said identifier of the second communicating electronic device acting as a cluster head and, where appropriate, the value of the identifier of a third communicating electronic device having relayed said enrollment message; A step of updating the recording so that the latter stores, as the current value of the device identifier acting as a cluster head, said value of the identifier of the second device acting as a head derived from the decoded enrollment message and, if appropriate, that said record further stores, as an ascending route to said second communicating electronic device acting as a cluster head, the value of the identifier of the Third communicating electronic device. To control the cluster depth, the invention provides that: said enrollment message further encodes a TTL data item reflecting the ability of a communicating electronic device receiving said enrollment message to be able to relay the latter; the step of decoding said enrollment message further deduces the value of said TTL data; the step of updating the record is adapted so that said record stores the current value of said TTL data previously decremented by one unit.
[0011] The invention further provides that a communication method according to the invention comprises: a step for producing a relayed enrollment message, said message comprising: a first field encoding the current value of device identifier acting in as a cluster head in the record; a second field characterizing an ascending route to the second communicating electronic device acting as a cluster head, and encoding the identifier of the first communicating electronic device; a third field encoding the current value of the TTL data item recorded in the record; A step for triggering the transmission by the first communication means of said relayed message if a prior step of comparing the current value of the TTL data item recorded in the record with a determined floor value, attests that said value current TTL is strictly greater than said floor data.
[0012] In order to advantageously verify that the second communicating electronic device is indeed capable of acting as a cluster head: the enrollment message received may include data reflecting the capacity of the second communicating electronic device acting as a head cluster to be able to provide a given service; the step for decoding said enrollment message can further deduce from said enrollment message 20 said data reflecting said capacity; the step of updating the recording may also include recording in said record the value of said datum representing the capacity of the device acting as a cluster head. According to this advantageous embodiment, the first communicating electronic device can decide to join the cluster of the second communicating electronic device 30 according to certain capabilities of the latter. For this, the step of updating the record and recording the current value of the communicating electronic device identifier acting as a cluster head may advantageously be accomplished only if the data translating said capacity is superior. or equal to a specified minimum threshold of requirement.
[0013] In order to implement a cluster depth reduction, the invention provides that a communication method may comprise: a step for receiving an end of relay message elaborated and transmitted by the third communicating electronic device, said message end of relay comprising the identifier of said third communicating electronic device 10; a step for decoding said end of relay message and for deducing the value of said identifier; a step for updating the record comprising the current value of an identifier of a device acting as a cluster head, in order to erase said current value or to replace it by a predetermined value expressing an absence of a device identifier acting as a cluster head, said updating of the record being performed only if the value of the identifier derived from the end-of-relay message is included in the record as a route 25 ascending towards said device acting as a cluster head. For a member of a cluster to be able to suspend its bearer member role itself and thus preserve its ability to produce and transmit a service message to the device acting as a cluster head, the step of comparing the current value of the TTL data item recorded in the record with a determined floor value may also consist in producing an ability to relay messages for the benefit of communicating electronic devices, 3034280 18 said communicating electronic devices belonging to a road descending from the first communicating electronic device, according to a functional parameter of said device, and comparing said produced capacitance with a predetermined minimum functional threshold. The step of triggering the transmission by the first communication means of said relayed message is therefore implemented only if said capacity produced is strictly greater than said predetermined minimum functional threshold. In order to regulate the cluster depth induced by the reception of an enrollment message encoding TTL data less than that of a previous enrollment message, the invention provides a first embodiment according to which the step of In the course of the day the recording following the decoding of an enrollment message may also consist in triggering, together with the updating of the recording, means for measuring a duration, said method of communication comprising a step of comparing said duration with a predetermined maximum waiting period and updating said record and erasing or replacing the current communicating electronic device identifier value acting as a cluster head by a predetermined value translating a service. communicating electronic device deidentifier acting as a cluster head.
[0014] According to a second embodiment, an enrollment message may comprise a field encoding TTL-e data characterizing the maximum cluster depth desired by the second communicating electronic device acting as a cluster head and a field encoding a data item. DST characterizing the distance separating the communicating electronic transmitter device 3034280 19 from said enrollment message on a downward route from the communicating electronic device acting as a cluster head (d2). According to this second embodiment, the step of decoding said enrollment message can deduce the values of said data TTL-e and DST. The step of updating the record may also be adapted so that said record stores the value of the TTL-e data item and the value, previously incremented by one unit, of the DST data item.
[0015] The invention then provides that said communication method may further comprise a step for comparing said TTL-e and DST values recorded in the record and for updating said record and erasing or replacing the current identifier value of communicating electronic device acting as a cluster head by a predetermined value reflecting a lack of device identifier acting as a cluster head.
[0016] Whatever the embodiment of a communication method according to the invention, the first communicating electronic device can dynamically determine a relevant depth of the cluster which it wishes to act as a cluster head. As such, the communication method according to the invention may advantageously comprise: a step for determining the maximum depth of the cluster of which the first communicating electronic device wishes to be a cluster head according to an operating parameter of said device; a step for encoding an enrollment message and triggering the transmission of said message by the first communication means, said message comprising a first field encoding the identifier of said first communicating electronic device and a second field encoding the TTL data item; whose value is initialized to that of the maximum cluster depth produced.
[0017] As a variant, such a communication method may comprise: a step for determining the maximum depth of the cluster from which the first communicating electronic device wishes to be cluster head according to an operating parameter of said device; a step for encoding an enrollment message and triggering the transmission of said message by the first 15 communication means, said message comprising fields encoding respectively: the identifier of said device; o the TTL data whose value is entered in the record; O The TTL-e data whose value is initialized to that of the maximum depth of the determined cluster o The DST data whose value is initialized to a value indicating a zero distance in number of hops. In order not to trigger the sending of enrollment messages while the first communicating electronic device may not be able to fully assume the role of cluster head, a communication method according to the invention may advantageously comprise a step for evaluating the ability of the first communicating electronic device to assume a particular service, said step of estimating an operating parameter of said device and producing data reflecting the capacity of said device to be able to provide said determined service, and wherein the step of encoding an enrollment message is to provide, within said enrollment message, a field encoding said data translating said capacity prior to triggering the transmission of said message by the first communication means. Such a method may comprise a step for comparing the data conveying said capacity with a minimum functional threshold of requirement and for which step 10 for triggering the transmission of the enrollment message is implemented only if the data reflecting said capacity is greater than or equal to said minimum functional requirement threshold.
[0018] According to a second object, the invention relates to a computer program product comprising program instructions which, when they are: - previously stored in a program memory of a communicating electronic device 20 further comprising a processing unit , first communication means ensuring wireless proximity communication with any other electronic device located within communication range, a data memory 25 recording the value of an identifier dedicated to the device and a record to include the current value of a an identifier of a device acting as a cluster head, said memories and said first communication means cooperating with said processing unit; performed or interpreted by said processing unit; cause the implementation of a communication method according to the invention.
[0019] According to a third object, the invention relates to a communicating electronic device comprising a processing unit, a data memory, a program memory, first communication means ensuring wireless proximity communication with any other communicating electronic device. located in communication range, said memories and said first communication means cooperating with said processing unit, the data memory having the value of an identifier dedicated to the communicating electronic device and a record to include the current value of an identifier a device acting as a cluster head. Such a communicating electronic device comprises in the program memory the instructions of a computer program product as described above and in accordance with the invention. According to a fourth object, the invention relates to a system comprising a plurality of communicating electronic devices also in accordance with the present invention. According to a preferred embodiment, such a system may advantageously comprise a plurality of containers of goods, solid, fluid or liquid goods, said containers cooperating respectively with the communicating electronic devices, the latter each comprising a sensor cooperating with the processing unit for measuring and collecting a quantity related to the internal and / or external environments of said containers. Other features and advantages will appear more clearly on reading the following description relating to an exemplary embodiment given by way of indicative and non-limiting example and to the examination of the figures which accompany it, among which: FIG. 1, previously described, illustrates an example of a multi-hop configuration of a wireless communication network; FIG. 2, partially already described, presents the functional architecture of a communicating electronic device according to the prior art and according to the invention when the latter is adapted to implement a method of adhesion to a cluster of devices. communicating with peers via a wireless communication network, said method being in accordance with the invention; FIGS. 3 and 4 respectively describe two situations in which the depth of a cluster can be dynamically regulated according to the invention; FIG. 5 presents a functional description of such an adhesion process according to the invention.
[0020] A communicating electronic device according to the invention is similar to a known device 10, such as that previously described in connection with FIG. 2. As such, a communicating electronic device 25 according to the invention comprises a processing unit 11, consisting of one or more microcontrollers responsible for carrying out processing on data in particular. Said data are advantageously, all or part, recorded on one or more data memories 12, generally electrically erasable and writable. The data memory 12 may advantageously comprise a non-erasable section, physically isolated or simply arranged so that access to write or erase is prohibited. Such access may alternatively require the satisfaction of an authentication procedure. Such an advantageous section of the data memory 12, whose access to modification is restricted, makes it possible to record in particular the value of an identifier ID dedicated to the communicating electronic device. Advantageously but non-obligatorily, a device 10 may further comprise one or more program memories 14 for recording one or more programs P, or more generally one or more sets of program instructions, said program instructions being intelligible. by the processing unit 11. The execution or interpretation of said instructions by said processing unit causes the implementation of a method of data processing or operation of the device 10. The latter also comprises first means communication device 13 providing wireless proximity communication with any other electronic device, such as the device 10i, provided that the latter is within communication range. Through said first communication means 13, the device 10, or more precisely its processing unit 11, can transmit and / or receive messages to or from third-party devices positioned within communication range. Such messages can be of any kind. Among various types of messages, we may mention, in a non-exhaustive manner, MS data messages in connection with a particular service S, MH enrollment messages, MR cluster destruction messages. Some communicating devices can take advantage of the electromagnetic field created by the network, to draw sufficient electrical energy to ensure their operation, if only for a brief period of time. However, in order to ensure continuous operation and / or to implement treatments requiring more energy, a communicating electronic device 10 according to the invention 3034280 25 may advantageously comprise a source of electrical energy 17 of its own, in particular supplying the power unit. treatment 11, or any other element constituting said device that would require it. Such a source 17 generally consists of a battery or a plurality of batteries. Depending on the privileged application context in particular with container tracking, although this particular context can not limit the field of exploitation of the invention, a communicating electronic device 10 may comprise one or more sensors cooperating with the unit. 11. Such a sensor can measure one or more quantities in connection with the internal and / or external environments of said containers and produce data. By way of example, as illustrated in FIG. 2, a sensor 15 can measure the temperature and / or humidity prevailing within a container, the darkness or loss of darkness within the enclosure attesting an unexpected opening of the container, or even shocks. If necessary, the sensor or sensors 20 may cooperate with the processing unit of a device via probes or conductive sheets, in particular in the case where a device 10 is affixed against the outer wall of a container while the it is desired to supervise, by means of said device 10, the internal environment of said container. Such a device 10 may further comprise a clock enabling it to time stamp the collected measurements, said clock not being shown in FIG. 2. According to the service or services that it is desired to operate using communicating electronic devices according to the invention, the latter may comprise additional and optional means. As a preferred and nonlimiting example, a service may consist of: collecting data from the nodes of a network of communicating electronic devices in accordance with the invention, for example in connection with quantities measured by said networks; knots; aggregating said collected data with a plurality of nodes, and then constructing MC messages encoding consolidated service data to a remote entity, such as an RS server. To transmit such messages MC, a device 10 advantageously comprises second long-distance communication means 16 cooperating with the processing unit 11. Such communication can be carried out via an RR network, by GPRS or satellite channels, or even by any other means. another suitable communication channel. The various internal components of the electronic device cooperate with the processing unit 11, advantageously by wired buses or by coupling. The device 10 may comprise a housing housing said components, said housing advantageously comprising fixing means for affixing the device 10 to a support which it is desired to follow, in this case a container according to the preferred application example. To implement the invention, it is required to act on the operation of the processing unit, more specifically on a communication method implemented by said processing unit. Such a method will be described later with reference to FIG. 5. A preferred mode of adaptation consists in providing a program, or more generally mutually arranged program instructions, for implementing said method during the execution or the execution. interpretation of said program instructions by the processing unit. Advantageously, said program P is loaded in the program memory 14 during assembly of said device or, by downloading said program 3034280 27 into the memory 14 after said assembly phase of the device. The invention lies mainly in the implementation of an advantageously multi-hop network, for which each node consists of a communicating electronic device such as the device 10 previously described. A node of such a network is generally adapted or arranged to implement a method of adhesion and / or affiliation to a cluster of devices. The data memory 12 comprises, in addition to the value of the identifier ID dedicated to the communicating electronic device, a record RH intended to include the current value IDHc of an identifier IDH of a communicating electronic device acting as Head, such as that node d2 according to Figure 1. When a device chooses to adhere to a cluster of which one of the nodes acts as Head, this membership is generally exclusive. In other words, a node can not be a member of distinct clusters, i.e. each having separate head nodes, for the same service. This is called non-overlapping clusters. A node adhering to a cluster chooses the "best" head for said service. Such a selection can be made for example according to a particular capacity to provide a particular service. However, a node may also be attached to a plurality of Heads, if said Heads are assigned to the implementation of separate services, such as, for example, a first Head for long distance data transmission (Si service). and a second Head for the implementation of an alarm management service (service Sj) on a site. In this respect, like the LEACH solution previously presented, clusters of communicating electronic devices, such as the clusters C11 of the network N1 described in connection with FIG. 1, comprise a device acting as a head. , such as the node d2 described in connection with Figure 1. The other devices act as members of said cluster, such as, non-exhaustively, the node c2 5 described in connection with Figure 1. The role of a Member consists mainly of collecting information, such as, for example, measurements of environmental quantities, translating them into data, and then encoding said data in the form of an MS service message to a Head in capacity. to provide the determined service. This Head recognizes said MS service messages and then implements the determined service S. For example, such a service may consist of aggregating the data transmitted to Head from multiple Members via MS messages and then implementing a long transmission. distance of said aggregated or even consolidated data in the form of messages MC to a remote entity RS. An MS service message, addressed from a Member 20 of a cluster to a Head, is structured to include: - information characterizing the type of the message; the value of an identifier of the source node, moreover generally a Member node; the value of an identifier of the destination node, in this case a Head, or even an identifier of a relaying Member node in the case of a multi-hop network; Data, for example relating to quantities measured by a sensor of the device; possibly a redundancy code or even a cryptogram or any other control information enabling a node receiving a service message MS to decode it, exploit it or relay it. An MS message, like any other message circulating within the network, may trigger MACK acknowledgment messages, transmitted by the recipient of the message to the source node. At the end of a given period or "timeout" according to English terminology, if no MACK message is received, a new transmission of the message MS is triggered, and this for a limited number of iterations to the user. whose source node considers that the "route" or the communication with the destination node is not available. Such a source node may decide to abandon the cluster and recover a free node status, or even seek to adhere to another cluster. The adhesion of a free node to a node acting as Head is close to that implemented according to the LEACH solution. However, the modalities of electing a Head and the terms of membership of a free node to become a Member of a cluster can be very different, as for example a variant proposed jointly by the applicants. According to this variant, only nodes with a real capacity to provide a particular service are able to self-designate Head. On the other hand, the other nodes are free to referee a competition of Heads and to choose the Head which appears the best candidate to implement the service to which they contribute. Regardless of the mode of election of Heads, a first mode of designing communicating devices may be to continuously maintain them in radio frequency listening to test the presence of messages from even devices. Such an approach can result in a significant energy expenditure and obviate the autonomy of the entire network. A second approach, known in the English Wake On Radio (WOR) terminology, is to plunge the nodes into relative sleep during the vast majority of their respective operations. The radio communication is notably deactivated because it 5 is particularly energy consuming. Such nodes may, however, continue to implement low-energy internal treatments. Cyclically, such nodes wake up to listen for possible messages from peers or to issue enlisting, service, and other messages in their turn. FIG. 5 illustrates a method P100 of communication implemented by a device according to the invention, such as, for example, a device 10 described in connection with FIG. 2. Such a communication method results from the implementation implementation of a first processing 100 by the processing unit 11 of a device 10 in response to the receipt of an enrollment message MH. As shown in FIG. 5, an enrollment message MH comprises a first field MH-1 encoding the identifier IDH of the device elected to act as Head. Such an enrollment message may also include a field MH-3 encoding a data CH translating the capacity of said Head to be able to provide a particular service S. Said message may further comprise an MH-7 field encoding various attributes or additional data AD of which, by way of nonlimiting and optional example, a datum characterizing the service S with which the possible datum CH is associated. In the context of a network, structure or multisault cluster, an enrollment message may be relayed by a Member. When such an enrollment message has already been propagated by a Member (we will study the relay of such a message later in connection especially with 3034280 31 step 106) this means that a new message d Enlistment was developed and issued by a Relay Member. We will note MH 'a relayed enrollment message to differentiate it from the original enrollment message MH issued by a Head. Such a message MH 'may comprise an MH-2 field encoding a Ru data characterizing the ascending route, that is to say at least the ID' ID of the relay member and issuer of said message MH '. Said route Ru may comprise, alternatively, the identifiers of the different upstream relaying members successively separating the receiving node from the message MH 'of the head node which is at the origin of the original enrollment message MH. To control the depth of the cluster that the Head 15 wishes to constitute, the invention provides that such a message MH or MH 'comprises a field MH-4 encoding a TTL data characterizing the ability, in number of jumps, a Member receiving said message MH or MH 'to be able to relay the latter and thus propagate the enrollment message 20 within the network. We will study later in connection with the processing 110 of the P100 process, the development of an enrollment message MH by a device designated Head, such as the device 10 according to Figure 2, according to the invention.
[0021] The TTL data of an MH or MH 'message may advantageously be an integer value. Thus, when a Head transmits an MH message encoding a TTL value equal to one, it means that the maximum desired depth is a maximum jump. A TTL value equal to three means that two distinct members on a downward route could successively relay said enrollment message within the network. A processing 100 according to the invention thus comprises a first step 101 for receiving an enrollment message MH or MH 'produced and transmitted by a communicating electronic device, such as the node d2 or the 3034280 32 node c3, described in connection with with FIG. 1. The processing 100 further comprises a step 102 for decoding said enrollment message MH or MH 'and deducing therefrom the identifier IDH of the Head or the identifier ID' 5 of the relay member (Ru). Step 102 furthermore consists in deducing the TTL data item and decrementing it by one unit. If the message MH or MH 'thus decoded comprises a data item CH expressing the capacity of the Head to be able to provide a given service S, step 102 to decode the said enrollment message MH or MH' deduces therefrom the said data item CH, or even any other data of interest encoded in said message. The processing 100 further comprises a step 103 for updating a record RH, arranged within the data memory 12 of a device, such as the device 10 described in connection with Figure 2. Said record RH is provided to record the value of the identifier IDH as the current IDHc value of identifier of an elected device to act as Head, for example the device d2 illustrated in FIG. 1. When the enrollment message MH ' has a field MH-2, the ascending route Ru, including the identifier ID 'of the device having acted as a relay member, is written in the record RH. Upon update 103 of said RH record, the value of the data CH translating the ability of the transmitting device to provide said service S, can also be written into said RH record. The recorded value is noted CHc, to reflect the current capacity of the Head to service. In a network, such as the network N1 described in connection with FIG. 1, the device 10 that has just implemented such a method P100 becomes a Member of the cluster whose transmitter of the MH message acts as Head. This is the case, for example, for devices 35 acting as nodes C1 to c3, d1, d3 and e1 to e3 of cluster Cl1 described with reference to FIG.
[0022] 3034280 33 The possible storage of the capacity of said Head in the record RH allows, on receipt of a new message MH or MH 'emanating from another transmitter device, to compare the capacity of the current Head 5 with that of a new one. candidate. We will study later the case of the competition between Heads, competition refereed by nodes Members or free. The invention furthermore provides that a node that is already a member of a cluster and / or free may adhere to the cluster of which the node that has sent an MH message is a member. Thus, according to a preferred variant, the step 103 of the processing 100 of the communication method P100, intended to update the record RH, can only be performed if the data CH, representing the capacity of the node wishing to act, as Head, is greater than or equal to a specified minimum threshold. Said processing 100 thus comprises a step 104 for comparing the data representing the capacity deduced in 102 from the message RH to the minimum requirement threshold. Thus, a cluster candidate node may be more demanding or selective than the minimum election criteria for a head. Said minimum requirement threshold is advantageously recorded in the data memory 12, or even constitutes a predefined constant and fixed in the program memory 14. It can be advantageously identical for all the nodes. As mentioned above, MH enrollment messages may be regularly transmitted by one or more communicating devices located in radio communication range, such as the device 10i described in connection with FIG. 2. A device 10, acting as a Member of a cluster, can therefore be in the situation of receiving and decoding an enrollment message MH or MH 'while said device 10 is already Member 35 of a cluster initiated by a Head.
[0023] 3034280 34 Two cases arise then. In a first situation, the device 10 has already exploited an enrollment message MH or MH 'emanating from the same device acting as Head. The value of identifier IDH of the latter is therefore identical to that IDHc stored in the record RH, said record being arranged in the data memory 12 of the device 10. In a second situation, the value of the identifier IDH deduced the message MH or MH 'is distinct from the IDHc value. In this case, the Member device is in a position to arbitrate a competition between two third party devices able to assume the same service. In the case where the network according to the invention provides for generating in the MH or MH 'messages the capacity of a Head to effectively perform its role, the method P100 advantageously comprises a step 105 subsequent to the step for decoding. 102 an enrollment message MH and prior to the step to update 103 the RH record comprising the current value IDHc of the identifier of the device acting as a cluster head. This step 105 may advantageously consist in reading in 1051, within said RH record, said current value IDHc. Then step 105 may consist in comparing in 1052 said current value IDHc to that IDH of the identifier of the device transmitting the enrollment message MH decoded at 102. In the case of the first situation, mentioned above, said IDHc and IDH values are identical (situation symbolized by the link 1052-y in Figure 5). The HR record can thus be updated in step 103. This action makes it possible, in particular, to update the data CH within the HR record. Indeed, according to the evolution of the operating context of the Head, the capacity of the latter to 35 service may have evolved. It may have deteriorated, for example due to a lower energy reserve. It may have improved, because of the disappearance of an obstacle which penalized the power of emission of a signal by way GPRS. On the other hand, in the case where the values IDH and IDHc 5 are distinct (situation symbolized by the link 1052-n described in FIG. 5), a device able to act as Head competes with the one that is, in the Member's eyes, currently the device acting as a cluster head. The invention provides that step 105 may comprise a step 1053 for comparing the data CH, representing the capacity of the device transmitting the enrollment message MH, with the data CHc stored in the record RH, reflecting the capacity to assume this same service S by the device 15 currently acting as Head. According to an advantageous embodiment, if the value of the data CH deduced from the new enrollment message is greater than the value CHc (situation symbolized by the link 1053-y), then step 103 is performed to update 20 HR registration. The value IDHc takes the value of the identifier of the issuer of the enrollment message. The device 10 thus leaves the preceding cluster to adhere to that for which the device transmitting the MH message acts as Head. The service messages 25 developed by the device 10 will now be addressed to the new Head. In the opposite situation, if the value of the data CH deduced from the new enrollment message is less than or equal to the value CHc (situation symbolized by the link 1053-n), then step 103 is not performed, because the issuer of the enrollment message is less efficient than the current cluster head. To limit the frequency of adhesion to different competing Heads and thus preserve the overall energy capacity of the network, especially if the data CH and CHc, reflecting the respective capacities to assume the same service, are very close, the invention 3034280 36 provides for a certain "fidelity", albeit a very relative one, to the benefit of the device currently acting as Head, even though the latter proves to be less efficient than the device entering into competition. Thus, if the IDH and IDHc identifier values are distinct (situation symbolized by the link 1052-n), then the step 103 to update the HR record is only performed if (situation symbolized by the link 1053 -y in Figure 5) a significant difference, equal to a predetermined non-zero constant, exists in favor of the device transmitting the enrollment message. Step 1053 can therefore be adapted so that the update 103 of the record RH is performed only if the data CH representing the capacity of the device transmitting the enrollment message MH is greater than or equal to that stored in FIG. HR record increased by said deviation. In order to be able to relay an MH enrollment message beyond the transmission range of the Head device, the invention thus provides that a method of adhesion P100 may comprise a step 106, subsequent to step 103, to update the RH record of the device implementing said method P100. This additional step 106 consists of encoding and transmitting, via the communication means 13, an enrollment message MH 'comprising, in the field MH-1, the identifier IDH of the device whose value IDHc is written in the record. RH. Advantageously, if a data CHc representing the capacity of said device to be able to provide a particular service S is written in RH, then such a message further encodes, in the field MH-3, a data item translating said capacity CH. The message MH ', produced at 106, further encodes (MH-2 field, Ru) the identifier ID of the device implementing the method P100 acting as a relaying group member of the MH enrollment message 3034280 37 of the device acting as Head. Prior to the possible implementation of such a step 106, the processing 100 includes a step 109 to verify that the device implementing the P100 process is able to relay the message MH or MH 'previously decoded at 102. Such a step 109 consists in comparing the current value of the TTL data with a determined floor value, for example a zero value. Said current TTL value corresponds to the MH-4 field of the message MH or MH 'previously decoded and decremented advantageously in step 102. If the current value of TTL is strictly greater than said floor value (situation represented by the link 109y in Figure 5), the enrollment message can be relayed. Step 106 previously described can then be implemented. In the opposite case (situation represented by the link 109n in FIG. 5) the step 106 is not implemented and the enrollment message is thus not relayed by the device. In order to regulate the cluster depth induced by the reception of an MH or MH 'message encoding TTL data less than that of a previous enrollment message, the invention provides several embodiments. A first embodiment consists of, together with the processing implemented at 109, comparing a duration whose starting point coincides with the update of the HR record in step 103, with a waiting period predetermined maximum during which no other enrollment message was received. Such a duration can be measured for example by triggering a timer or by initializing an incremented counter at each predetermined time unit. If said duration is greater than or equal to said predetermined maximum waiting period, the invention provides that the device is no longer in a position to transmit a service message to the current Head, in view of a silence thereof. . The device then implements a step 107 of recovering a free node status. Such a step consists in particular in erasing within the HR record the data related to the current current Head. Figures 1 and 4 illustrate this first embodiment. In connection with FIG. 1, a first enrollment message MH sent from node d2 has an initial value TTL equal to three. Said original message MH is thus relayed, in the form of messages MH ', by the distant Member nodes at most two jumps of Head d2. The nodes al to a4, distant from three jumps of Head d2, were able to join the Cll cluster under the action of the relaying members respectively bl to b4. FIG. 4 illustrates a situation of the same network N1 subsequent to that illustrated in FIG. 1. Such a situation results from a new transmission of a message MH by the node d2 now encoding a TTL value equal to two. According to the first embodiment according to the invention, said enrollment message MH can be relayed, in the form of messages MH ', only by nodes 25 distant at most one jump Head d2. The nodes al to a4, formerly members of the cluster Cl1, no longer receiving enrollment messages MH 'from the nodes bl to b4 during the predetermined maximum waiting period, cover a status of free nodes. A new cluster C13 whose node d2 acts as Head is created in place of cluster Cl1. Alternatively or additionally, the invention provides a second embodiment of encoding and then transmitting an end-of-message message (MF) message to devices within range of radio communication. Such an MF message is intended for nodes belonging to a downstream route. We will study later, in connection with FIGS. 3 and 5, a processing 130 of a method P100 according to the invention, according to which a Member operates such an end-of-relay message MF to recover a free node status. Such an MF message comprises the identifier, which we will note IDF, of said transmitting device and information characterizing the MF message as an end of relay message. The processing 100 thus comprises a step 107 for encoding and triggering the transmission of said MF message, advantageously in a broadcast mode, by the communication means 13 of the device, under the impetus of the processing unit 11 process P100. Such MF messages are represented in FIG. 3 by a double line arrow. According to this example, the Member c3 thus sends to nodes located within communication range, including nodes b3 and b4 respectively belonging to 20 downward routes of c3. A new cluster C12 is thus created in place of the cluster C11 illustrated in FIG. 1. Thus according to the first and second embodiments described above, the invention offers a first modality for limiting the depth of a cluster by regulating the propagation of such enrollment messages. We can also note that this regulation is perfectly dynamic. Indeed, as already mentioned in connection with FIGS. 3 and 4, a Head can emit a new enrollment message comprising a lower TTL data, if it wishes to reduce the depth of the cluster of which it is the head of the cluster. On the contrary, it can issue a new enrollment message with increased TTL data to increase said depth. We will study later this modality in connection with 3034280 a treatment 110 of a P100 communication method according to the invention. The invention provides a second modality for regulating the depth of a cluster. According to said second modality, the nodes implementing a method P100 according to the invention do not perform the time comparison provided previously in step 109 with regard to a maximum waiting time. To overcome a repetitive management of enlistment message transmissions and thus preserve the energy consumption inherent in the operation of such messages MH or MH 'by the network, the invention provides that a message of MH or MH 'enrollment comprises a first additional MH-5 field encoding TTL-e data explicitly characterizing the maximum depth desired by the transmitter head. Such a datum advantageously consists of an integer value. Thus, a TTL-e value equal to "one" means that the Head does not wish to propagate (or relay) the enrollment message. TTL-e thus describes, in number of jumps, the maximum distance for a node to claim to become a member of the cluster. In other words, the TTL-e value describes, increased by one, the maximum number of relays allowed on the same downstream route by one or more relaying members. The invention provides that, in addition to the MH-5 field, the original MH and / or relayed MH 'enrollment messages comprise a second additional field MH-6. Such a field encodes a datum DST which characterizes the distance, in number of jumps, separating a transmitter from an enrollment message MH or MH 'on a downward route from the Head having elaborated the original enrollment message MH. Thus according to this variant, if an MH message is relayed once, the DST information within the relayed message MH 'is "1". If said enrollment message is relayed three times, the DST information within the enrollment message relayed by the farthest Member takes the value "3". For this, the processing 100 of a communication method P100 according to the invention can be advantageously adapted so that step 102, previously described, consists in deducing from the said decoded MH or MH 'message the values of the data TTL-e and DST. Step 103, also previously described, for updating the HR record associated with the current Head and arranged in the data memory 12 of the device having received the enrollment message MH or MH ', may advantageously consist of registering in addition, within said HR record, the DST data previously incremented by one unit and the value of the TTL-e data. Thus, each device of the network knows, thanks to the content of the record RH, the distance in number of jumps that separates it from a Head on a given ascending Ru route. In order to regulate the depth of the cluster initiated by a Head, the step 109 of a process 100 of a communication method P100 according to the invention consists, like the previous modality, in comparing the current value of the TTL data at a determined floor value, for example a zero value. Said current TTL value 25 corresponds to the MH-4 field of the message MH or MH 'previously decoded and decremented advantageously in step 102. If the current value of TTL is strictly greater than said floor value (situation represented by the link 109y in Figure 5), the enrollment message can be relayed. Step 106 previously described can be implemented. In the opposite case (situation represented by the link 109n in FIG. 5) the step 106 is not implemented and said enrollment message is not relayed by the device. Step 109 now compares the respective values of TTL-e and DST data recorded in record 3034280 42 RH. If the value of the data DST is greater than that of the data TTL-e, it means that the device is no longer in a position to transmit a service message to the current Head, because the latter is too far in number of jumps of the Head with regard to a maximum depth desired by the latter. This case corresponds to a reduction of the depth of a cluster initiated by the current Head. Processing 100 further comprises initiating step 107, previously described, of recovering free node status. Data related to the current current Head within the HR record is deleted. Said step 107 may furthermore comprise encoding and then triggering the transmission of an MF message, advantageously in a broadcast mode, by the communication means 13 of the device, under the impetus of the processing unit 11 the process P100. Such a situation is also described in FIG. 3 according to which a node c3 sends an end of relay message MF.
[0024] We will now describe the actions taken by a communicating electronic device according to the invention which self-designates Head of a cluster. For this purpose, a communication method P100 according to the invention comprises a processing 110. The latter can advantageously, but not necessarily, comprise a first evaluation step 111 of the capacity of the device 10 to provide a determined service S for, if necessary, self-designate or self-elect head 30 of a cluster or head. Such a step 111 may initially consist in estimating, at 1111, one or more operating parameters of the device 10 for testing the ability of the device 10 to correctly perform said service. By way of a preferred example, suppose that said service consists of aggregating data collected and deduced from MS service messages, of consolidating said data, of encoding an MC message and of transmitting the latter by means of communication. long distance 16 to a remote server whose mission is to draw containers cooperating with communicating devices. To provide this service, the device must of course include suitable communication means, such as the means 16. Moreover, such a communication, for example of the GPRS type, mobilizes a large amount of electrical energy, even if than to initiate the link. It is therefore imperative that a device, acting as Head, has a sufficient energy reserve to support such a solicitation. On the other hand, it is also preferable that the transmit power of a GPRS signal is most optimal. Indeed, a low transmission power would cause slowness, therefore an increased emission time and particularly consuming electrical energy, or even new attempts successive emissions in 20 cases of failure or pure and simple losses of messages MC. Step 1111 may also consist of a self-test or self-evaluation step of the device, for example, of the battery level 17, or even the power of transmitting a GPRS signal. Said step 1111 may also make it possible to evaluate other functional parameters of the device, such as, for example, the number of MC message transmissions. For this purpose, a message sending counter MC may be implemented by the processing unit 11, a counter whose value can be stored in the data memory 12. The estimation of the request of the device 10 as Head can thus consist in reading said counter in data memory 12.
[0025] The treatment 110 advantageously comprises a step 1112 for producing a data item CH expressing the capacity 3034280 of said device 10 to be able to provide the determined service S. By way of example, the production of such a data item CH by the processing unit , may consist in the evaluation of a predefined equation or function producing a metric integrating said estimated parameters, possibly respectively weighted to favor one parameter with respect to another. For example, a GPRS transmit power estimate may consist of calculating a ratio corresponding to the estimated transmit power of a test signal, divided by a constant describing a typical maximum power, i.e. , under optimal conditions of emission. In connection with the battery level or more generally of the energy source 17 of the device, step 1112 may constrain the processing unit to calculate a ratio corresponding to the estimated available energy with respect to the fully charged energy. . More generally, such a metric CH 20 characterizing the ability of a device to act as a cluster head can be calculated, in a non-limiting manner, by evaluating an equation such that CH = K1.f1 (p1) + K2.f2 (p2) + Ki.fi (Pi) for which, i being an integer greater than or equal to 1, K1, Ki constitute weights, possibly distinct, fl (), f2 (), -, fi ( ) are possibly distinct calculation functions, for example the elaboration of a ratio, and pi, P2, pi are functional parameters of the device, of which, by way of nonlimiting examples, the level of electrical energy of the source 17, a long distance transmission power, the size of a memory available for recording data, a calculation power, etc. The data CH can thus be related to a real value. It can also be composite, that is to say, be a structured data, comprising each functional parameter of the device or comprising, in place of one of said functional parameters, a determined function of one of said functional parameters. . Where CH is possibly produced at 1112, a method according to the invention comprises a step 112 for comparing said CH data with a minimum functional requirement threshold. In the case where the data CH is structured, it is the same for said threshold. The comparison 112 can then consist of as many independent comparisons of a functional parameter with particular minimum functional thresholds of requirement, to which a combinatorial logic (of the AND, OR, etc. type) would be applied. If step 112 demonstrates that the data CH is greater than or equal to said minimum functional requirement threshold (link referenced 112-y in FIG. 3), the method P100 advantageously comprises a step 113 for encoding and transmitting an enrollment message MH. Prior to such an emission, the invention consists in providing said step 112 to determine the maximum depth of the cluster whose device wishes to be the Head. This determination may follow, like a CH capacity produced at 1112, from a relation taking into account one or more functional parameters of the device, such that Dp = 41.gi (pl) + 42. g2 (p2) + Qi.gi (pi) for which, i being an integer greater than or equal to 1, Q1, Qi constitute weights, possibly distinct, gi (), g2 (), gi () are possible calculation functions for example, the development of a ratio, and pi, p2, ..., p1 are functional parameters of the device. Alternatively, the value of said depth Dp can also be predetermined and stored in the means 12 or result from a parameterization. Like a node of a LEACH type network, a device implementing a communication method P100 according to the invention may however deviate from steps 111 and 112 and be self-defining. even be automatically or arbitrarily designated, Head, regardless of his abilities to effectively perform this role. Nevertheless, unlike the prior art, a head according to the invention controls the depth of the cluster that it initiates via the data item Dp. As previously studied in connection with the nonlimiting example illustrated in FIG. 5 and the processing 100, an enrollment message MH, encoded at 113, comprises a first field MH-1 encoding the identifier of the device, which we refer to as IDH , as the identifier of a device elected to act as Head. It may also comprise an MH-3 field encoding the data CH, which translates the capacity of said device to be able to provide the determined service S if it has been produced in 1112. The message MH may furthermore comprise an MH-7 field encoding various AD additional attributes or data including, by way of non-limiting example and optional, a data characterizing the service S with which the possible data CH is associated. To control the depth Dp of the cluster that the Head wishes to constitute, such an MH message comprises, in a field MH-4, a TTL data characterizing the ability, in number of jumps, of a receiving Member of said message 25. enrollment to be able to relay the latter and thus spread within the network said enrollment message. As mentioned above in connection with the processing 100 described by way of non-limiting example in FIG. 5, such a TTL data item may advantageously consist of an integer value. Thus, when a Head transmits an MH message encoding a TTL value equal to one, it means that the maximum desired depth is a maximum jump. A TTL value equal to three means that two distinct Members on a downward route could successively relay said enrollment message.
[0026] According to the first modality described in connection with said processing 100, the TTL value encoded at 113 in the MH-4 field is initialized to the value Dp. The original MH message produced at 113 is broadcast, for example "broadcasted", by the first communication means 13 of said device under the action of the processing unit 11 implementing said method P100. Any communicating device located within a communication range, such as the device 10i described in FIG. 2, can receive said message MH. In order to respect the predetermined maximum waiting period tested at 109, the processing 110 is implemented iteratively at a periodicity lower than said predetermined maximum waiting period. When the processing 100 advantageously comprises a step 111 for estimating the capacity to provide a given service S, said CH capacity can be revised, encoded and then transmitted in 113. It can be increased to translate a better capacity or decreased in the opposite case. If the comparison 112 attests that the functional parameters of a device do not satisfy the functional minima at 112, there is no transmission of the MH enrollment message. Thus, any electronic device that is not able to provide a given service, even if it theoretically has the hardware or software means to achieve it, may not designate itself Head or constitute a cluster of communicating devices of low amplitude or depth. The same is true for the cluster depth Dp which can be revised upwards or downwards as mentioned above. The TTL data encoded in the MH-4 field of each original MH message transmitted at 113 can thus be initialized to distinct values from one iteration of the processing 110 to another. As mentioned above in connection with the processing 100, the TTL information of the various MH messages is used as a regulator of the maximum depth of the cluster, and consequently of the energy expenditure of the network induced by the processing of the messages exchanged in the network. within said network.
[0027] Processing 110 may include a step 114, optionally joined at step 112, to compare the CH data produced at 1112 to a functional minimum, indicating insufficient capacity to perform the service. Such a minimum threshold may be predetermined and recorded, like the threshold operated in step 112, in the data memory 12. This step 114 and a fortiori a subsequent step 115 may be advantageously subsequent to the transmission 113 of an enrollment message MH. If the comparison 114 confirms (link 114-y in FIG. 5) that the device is no longer capable of providing the service S, the processing 110 of a communication method P100 according to the invention may advantageously comprise a step 115 to encode and transmit an MR cluster destruction message, advantageously broadcasted. This transmission of a message MR can be carried out by the communication means 13 of the device, under the influence of the processing unit 11 implementing the communication method P100. Like an MH enrollment message, an MR cluster destruction message, sent from a device previously acting as Head but no longer in a position to effectively perform a particular service S, has the following characteristics: identifier of said device, denoted IDR. It may also include the CH data characterizing the capability, or in this case, an inability to service. As a variant, such an MR message can simply associate the identifier of the transmitting device with information characterizing the message MR as a cluster destruction message.
[0028] Such an MR message may also consist of an enrollment message MH comprising TTL data equal to zero.
[0029] This step 115 may advantageously be triggered only if the transmitter device previously acted as Head, so as not to unnecessarily send out irrelevant cluster destruction messages and also to prevent any undue exploitation of such messages. by receiving nodes. In order for a device according to the invention to detect that it was previously in a position to assume a role of Head, the processing unit 11 of said device can for example write in the data memory 12 the translated value Dp in the MH-4 (TTL data) field of the last MH message transmitted at 113. Said registration is performed together with the initiation of the transmission of said MH message. A non-zero value of said value Dp written in data memory 12 indicates that the device was acting as Head during the previous iteration of processing 110. Such a value is advantageously reset to zero, or alternatively to any another predetermined value characterizing a zero cluster depth, when encoding and issuing a cluster destruction message at 115. Said processing unit 11 may alternatively or additionally operate a transmission counter of MC messages, as previously discussed, stored in data memory 12. In comparison 114, a value of said counter, greater than its initial value, teaches that said device was acting as Head. At the end of the transmission of an MR message, said counter can be reset to the initial value. However, any other action 30 could be implemented by the processing unit 11 to validate the implementation of step 115, in place of the operation of the message transmission counter MC. By way of nonlimiting example, such an action can result from the reception, by the device 35 acting as Head, of an enrollment message emanating from a third device, acting also as 3034280 that Head and whose data reflecting his ability to provide the same service is superior to his own. In this case, the processing unit 11 of the device implementing the method P100 triggers the step 115, thus being erased before better than it. According to this latter variant, the invention provides for limiting the number of MR cluster destruction message emissions, a direct consequence of a particularly dynamic and oscillating evolution of the nodes' capacities to act as Heads, leading to a very competitive competition. supported between many heads. Such a situation can for example be encountered during a rail transport of a multitude of containers, each cooperating with a communicating device according to the invention and for which, the determined service consists of regularly transmitting information by means of GPRS. link with the contents of the containers. The ability of Heads to transmit long distance can be very changeable. In order to meet this difficulty, the invention provides for integrating into the implementation of step 114 a "competition factor", for example a positive real, greater than "1" whose value can be recorded in FIG. the memories 12 of the different nodes. Thus, a Head, receiving an MH enlistment message from a third party node, does not compare, in step 114, strictly CH data reflecting the respective capabilities to provide the same service. Step 114 consists in comparing the data CH deduced from the enrollment message MH multiplied by the competition factor.
[0030] Thus, if said factor is greater than "1", for example "1.25", then the node, implementing step 114, is penalized by the exploitation of said factor with regard to the competitor. Thus, even if the CH data of said node reflects a better capacity than that of the Head 35 having sent the message MH, the application of the competition factor, virtually improves that of the competitor.
[0031] In this case, the node implements step 115, transmits an MR cluster destruction message, and joins the competitor's cluster as a Member. Such a solution makes it possible to limit the creation and / or the destruction of too many clusters, which reduces the energy capacity of the network. It also makes it possible to limit the number of nodes able to act concomitantly as Heads. Indeed, depending on the S service envisaged, for example with a long-distance transmission, too many nodes acting together as Heads, would draw, for example, too much in the energy reserves of the network. The competition factor can therefore be seen as a parameter for regulating the number of Heads and the dynamics of the adaptability of the network to its environment. To implement the second regulation modality mentioned above in connection with the processing 100 described in connection with FIG. 5, the message encoded at 113 comprises a first additional field MH-5 encoding a TTL-e data item explicitly characterizing the maximum depth. desired cluster by the head transmitter of the enrollment message. Such TTL-e data advantageously consists of an integer value. Thus, a TTL-e value equal to "one" means that the Head does not wish to propagate (or relay) the enrollment message. A value strictly greater than "one" describes, in number of jumps, increased by one unit, the number of relays 30 allowed on the same descending route by one or more relaying members. The invention provides that, in addition to the MH-5 field, an original enrollment message MH has a second additional field MH-6. Such a field encodes a DST data which characterizes the distance, in number of hops, separating a transmitter from an enrollment message MH or MH ', on a descending road 3034280 52 from the Head having elaborated the original enrollment message. MH, of said Head. Thus, according to this variant, if an MH message is relayed once, the DST information within the relayed message MH 'is "one". If said enrollment message is relayed three times, the DST information within the enrollment message relayed by the farthest Member takes a value equal to "three". To implement this second modality, step 113 consists of initializing the TTL-e value, encoded in the MH-5 field, to the value Dp produced at 112. The TTL data item is initialized with the value entered in the memory 12. It corresponds to the maximum depth of the cluster produced upstream of the emission of an enrollment message triggered during the previous iteration 15 of the processing 110. The TTL value is therefore encoded in the MH-4 field. an MH message ready to be transmitted by the device. The DST data encoded in the MH-6 field of said MH message is, in turn, initialized to a zero value or any other predetermined value indicating a zero distance. Indeed, the Head is distant from itself according to a zero distance in number of jumps. At the end of the triggering of the transmission of the message MH, the current value of Dp is updated in the data memory 12. The coexistence of the fields MH-4, MH-5 and MH-6 within an MH message allows the latter, as we have mentioned previously in connection with the processing 100 described in FIG. 5, to propagate said enrollment message by means of relayed messages MH 'within the cluster. Thus, Members receiving such an MH or MH 'message can check whether they are able to relay particular service messages or recover a free node status. The invention thus makes it possible to easily regulate the depth of a cluster under the impulse of its Head. It is thus possible to maintain, increase or reduce said depth by the combination of TTL, TTL-e and DST data.
[0032] The invention also enables a Member of a cluster to be able to regulate his eventual role as a relay member according to his own energy or communication capabilities. While respecting the instructions of the Head, by the implementation of the treatments 100 and 110 according to the first or the second modality, a Member can be restrictive with regard to its function relay to the benefit of other nodes Members or Affiliates belonging to a 10 downhill road. For this, the invention provides that step 109 may, like the possible step 111 and step 112 to respectively produce a capacitor CH to self-designate Head and a depth of cluster Dp, to provide a CR capability for relaying service or other messages for the benefit of third-party devices belonging to a downlink. Such a capacitance CR can advantageously be calculated such that CR = + R2.h2 (p2) + Ri.hi (Pi) for which, i being an integer greater than or equal to 1, R1, Ri20 constitute weights, possibly distinct, hi (), h2 (), ..., hi () are possibly distinct calculation functions, for example the elaboration of a ratio, and pi, P2, pi are functional parameters of the Member device. Depending on the content of CR, and by comparison with one or more predetermined minimum functional thresholds and for example stored in data memory 12, steps 106 or 107 are implemented. Thus, a relaying Member, upon receipt of an MH or MH 'message from the Head of the cluster to which it belongs, may not automatically propagate said enrollment message with respect to CR while the decoded elements at 102 ( TTL, or TTL-e and DST) would have taught him to propagate the enrollment message. Whether the first modality or the second modality mentioned above is preferred, the invention guarantees unparalleled continuity of service by automatically assigning relevant roles to the different nodes of a network of communicating electronic devices. The robustness of such a network according to the invention is increased tenfold.
[0033] In order to route service messages originating from a Member or Affiliate node, the method P100 furthermore comprises a processing 120 triggered, by way of non-limiting examples, upon receipt of a service message sent by a third party device or by reaction to the environmental measurement by the device. Within the HR record, stored in data memory 12, the pair of identifiers of the Cluster Members and Header Cluster (Head) devices constitutes the route information necessary to relay an MS service message to a user. destination of said Head. Indeed, such a processing 120 includes a step 123 for issuing a service message MS to the device acting as Head for a specific service S. Such a step 123 is implemented following a preliminary step to, for example, collect from a sensor 15 a measurement related to the temperature prevailing within a container, against which the device 10 implementing the communication method P100 is affixed. Of course, such a step 123 is also dependent on the presence (step 122 in FIG. 5) of an HR record including the IDHc value of an identifier of a device or node acting as a Head (situation symbolized by the link 122-y in Figure 3). According to whether said HR record includes a direct upward route Ru, i.e., only an identifier value of Head is present in the HR record, or an indirect ascending route, ie that said HR record further includes an ID value of a Relay Member, the MS message is directly transmitted to said Head or Relay Member.
[0034] As mentioned previously, such a transmission 123 of a service message MS can also be triggered by the reception 121 of a service message MS emanating from a Member of the same cluster and addressed to the device 10, which sets said P100 membership process and acts as a relay member. Following receipt of such a service message from a Member of the same cluster, step 121 may therefore include a step for receiving and decoding such an MS message, or even temporarily storing in the data memory 12 the data contained in said decoded MS service message. The relay of said MS message can thus be reflected by a retransmission delayed time.
[0035] A communication method P100 according to the invention further comprises a processing 130 for exploiting a cluster destruction message MR as mentioned previously, sent from a Head and / or for interpreting a relay relay message MF sent since a Member who is no longer in a position to perform his relay function, of his own CR capability or by strict application of a cluster depth reduction request from Head having issued an MH enrollment message according to the invention. Such a process 130 of a communication method P100 in accordance with the invention comprises a first step 131 for receiving an MR cluster destruction message or an end of relay relay MF produced and transmitted by a third-party communicating electronic device, for example a device 10i, having previously had standing to act as Head or Relay Member. As previously discussed in connection with steps 114 and 115, an MR cluster destruction message includes the IDR of the device having issued said MR cluster destruction message. The process 130 therefore includes a step 132 for decoding said MR cluster destruction message and deriving the value of said IDR from the device that transmits the cluster destruction message. The receipt of such an MR message by a device acting as a Member of the cluster concerned by the destruction message, 5 means a strict instruction to abandon the cluster, said member recovering a status of free node. For this, the processing 130 of a method P100 according to the invention advantageously comprises a step 133 to update the record RH having the current value IDHc of the identifier of a device acting as Head, to erase said current value or replace it with a predetermined value representing a lack of device identifier acting as Head. Of course, said updating 133 of the record RH is performed only if (situation symbolized by the link 134-y in connection with FIG. 5) the value of the identifier IDR deduced from the message of destruction of cluster MR is identical to the current value IDHc written in said HR record. The processing 130 thus comprises a step 134, prior to step 133, for implementing said comparison of values of IDR and IDHc identifiers. In the context of the operation of a multisheet network, like an MH enrollment message, an MR cluster destruction message can be advantageously relayed by a Member becoming free by the implementation of the message. step 133, by triggering the transmission of such a message MR relayed to other potential members of the cluster being destroyed. With regard to an end-of-relay message MF, step 131 consists in deducing the identifier, which we will write IDF, from the sending device and detecting the information characterizing the message MF as an end-of-relay message. The reception of such an MF message by a device acting as a member of the same cluster and downstream from the device transmitting the MF message, translates a strict instruction to abandon the cluster, said Member covering a status of free knot. Step 133 then consists in updating the HR record, in data memory 12, in order notably to erase the current value IDHc or to replace it by a predetermined value representing a lack of device identifier acting as a Head. Of course, said update 133 of the HR record is performed (step 134) only if (situation symbolized by the link 134-y in conjunction with FIG. 5) the value of the identifier IDF deduced from the message end of relay MF is included in the ascending route Ru inscribed in said record RH.
[0036] Whatever the configuration of a communication method P100 according to the invention, a preferred mode of adaptation of a communicating electronic device, such as the device 10 described in connection with FIG. 2 implementing such a device. method P100, consists in recording or downloading in program memory 14, a computer program P, comprising a plurality of program instructions which, when they are executed or interpreted by the processing unit 11 of said device 10, cause the implementation of said P100 communication method. The invention has been described by way of an example of a preferred application in connection with the monitoring of 30 containers of goods, solid, fluid or liquid goods, said containers cooperating respectively with communicating electronic devices, such as the devices 10. and 10i according to FIG. 2, implementing a communication method, such as the method P100 illustrated in FIG. 5, said devices each comprising a sensor 15 cooperating with a processing unit 11 for measuring and collecting a quantity in link with the internal and / or external environments of said containers. Such devices could be exploited for any other application different from that for transmitting data collected over a long distance link. They could also, alternatively or in addition, provide one or more other services. For this, as mentioned above, the data memory 12 of each device 10, 10i may comprise, not a single HR record dedicated to a particular service S, but a plurality of records RHn, forming, for example a table respectively dedicated to particular services Sn. The enrollment messages 15 MH or MH ', service MS or even destruction of the MR cluster or the end of relay MF, would include, according to this variant, information to identify the service Sn determined and concerned by each of said messages .
[0037] Furthermore, the invention thus relates to any system comprising a plurality of communicating electronic devices according to the invention. More particularly, the invention relates to any container traceability system on a storage area or a transport platform, said system further comprising a remote entity for collecting and operating MC messages transmitted from one or more of said devices when act as Head. Such a system has performance in terms of energy autonomy, robustness and adaptability to operating conditions unequaled and unmatched compared to those conferred by known solutions, such as, for example , the LEACH process. Indeed, thanks to the invention, the exploitation of Heads, 35 from their elections until the completion of the action or actions concerned by a given service, is optimal, preventing any superfluous or ineffective communication within the network. or to third parties.

权利要求:
Claims (10)
[0001]
REVENDICATIONS1. A method of communication (P100) within a network (N1) comprising a plurality of communicating electronic devices (10, 10i, al, ..., a8, bl, ..., b8, ..., el ,. .., e8), said method (P100) being implemented by a processing unit (11) of a first communicating electronic device (10) among said communicating electronic devices within the network (N1), said first electronic device communicating device further comprising said processing unit (11), a data memory (12), first communication means (13) providing wireless proximity communication with a third electronic device (10i) of the network (N1) within range communication device, said data memory (12) and said first communication means (13) cooperating with said processing unit (11), the data memory (12) having the value of an identifier (ID, ID ', IDH , IDR, IDF) dedicated to said first communicating electronic device (10) e t a record (RH) for storing (IDHc) the current value of an identifier (IDH) of a second communicating electronic device (d2) acting as the head of a cluster (Cl1, C12, C13), said method (P100) comprising: a step (101) for receiving, via the first communication means (13), an enrollment message (MH, MH ') produced and transmitted by a communicating electronic device (10i) within the network ( N1), 3034280 61 said enrollment message encoding the identifier (MH-1, IDH) of the second communicating electronic device (d2) acting as head cluster; A step (102) for decoding said enrollment message (MH, MH ') and deriving therefrom the value of said identifier (MH-1, IDH) of the second communicating electronic device acting as a cluster head (d2) and Where appropriate, the value of the identifier (ID ') of a third communicating electronic device (10i) relaying said enrollment message (MH, MH'); a step (103) for updating the record (RH) so that the latter stores, as a current identifier value (IDHc) of the device acting as a cluster head, said value of the identifier (IDH) of the second device 20 acting as a cluster head deduced from the decoded enrollment message (MH, MH ') and, if appropriate, that said record (RH) also memorizes as an ascending route (Ru ) to said second communicating electronic device acting as a cluster head (d2), the value of the identifier (ID ') of the third communicating electronic device (10i); said method (P100) being characterized in that: - said enrollment message (MH, MH ') further encodes a TTL data (MH-4) translating the ability of a communicating electronic device receiving said message enrollment (MH, MH ') to be able to relay the latter; the step of decoding (102) said enrollment message (MH, MH ') further deduces the value of said TTL data; step (103) for updating the record (RH) is adapted for said record to store the current value of said previously decremented TTL (102) of a unit; and in that said method (P100) comprises: - a step for producing (106) a relayed enrollment message (MH '), said message (MH') comprising: o a first field (MH-1) encoding the current device identifier (IDHc) value (d2) acting as a cluster header inscribed in the record (RH); a second field (MH-2) characterizing an ascending route (Ru) to the second communicating electronic device acting as a cluster head, and encoding the identifier (ID) of the first communicating electronic device (10); a third field (MH-4) encoding the current value of the TTL data item 30 registered in the record (RH); a step (106) for triggering transmission by the first communication means (13) of said relayed message (MH ') if (109y) a prior step (109) of comparing the current value of the entered TTL data in the record (RH) at a determined floor value, attests that said current TTL value is strictly greater than said floor data.
[0002]
2. A communication method (P100) according to the preceding claim, wherein: - the enrollment message (MH, MH ') received comprises a data item (CH) representing the capacity of the second communicating electronic device acting as the head of cluster capable of providing a given service 15 (S); the step of decoding (102) said enrollment message (MH, MH ') further deduces from said enrollment message said data (CH) translating said capacity; The step of updating (103) the recording (RH) furthermore consists in writing in said record (RH) the value (CHc) of said datum (CH) representing the capacity of the device (d2) acting in 25 as a cluster head.
[0003]
3. The communication method (P100) according to the preceding claim, wherein the step (103) for updating the record (RH) and inscribing therein the current value (IDHc) of the communicating electronic device identifier acting as a cluster head is only performed if (104-y) the data (CH) 3034280 64 translating said capacity is greater than or equal to a determined minimum requirement threshold.
[0004]
A communication method (P100) according to any one of the preceding claims, comprising: - a step (131) for receiving an end of relay message (MF) prepared and transmitted by the third communicating electronic device 10 (10i) said end of relay message (MF) comprising the identifier (IDF, ID ') of said third communicating electronic device (10i); a step for decoding (132) said end of relay message (MF) and for deducing therefrom the value of said identifier (IDF, ID '); a step for updating (133) the record (RH) comprising the current value (IDHc) of an identifier of a device acting as a cluster head, to delete said current value (IDHc) or to replace this by a predetermined value reflecting a lack of device identifier acting as a cluster head, said update (133) of the record (RH) being performed only if (134-y) the value of the identifier (10 ', IDF) derived from the end of relay message (MF) is included in the record (RH) as an ascending route (Ru) to said device acting as a cluster head ( d2). 3034280 65
[0005]
The communication method (P100) according to any one of the preceding claims, wherein: - the step (109) of comparing the current value of the TTL data item recorded in the record (RH) with a floor value determined, furthermore, consists in producing a capacity (CR) to relay messages for the benefit of communicating electronic devices, said communicating electronic devices belonging to a downlink from the first communicating electronic device (10), according to a functional parameter of said device , and comparing said produced capacitance (CR) with a predetermined functional minimum threshold; step (106) for triggering transmission by the first communication means (13) of said relayed message (MH ') being implemented only if (109y) said capacity (CR) produced is strictly greater than said predetermined functional minimum threshold. 25
[0006]
The communication method (P100) according to any one of the preceding claims, wherein the step (103) for updating the record (RH) following the decoding (102) of an enrollment message (MH, MH ') furthermore consists in triggering, coincidentally with the update of the recording (RH), means for measuring a duration, said communication method (P100) including a step for comparing said 3034280 66 at a predetermined maximum waiting period and for updating (107) said record (RH) and erasing or replacing the current value (IDHc) of communicating electronic device identifier acting as a cluster head by a predetermined value representing a lack of communicating electronic device identifier acting as a cluster head. 10
[0007]
7. A communication method (P100) according to any preceding claim, wherein: - an enrollment message (MH, MH ') comprises a field (MH-5) encoding a datum TTL-e characterizing the depth desired cluster maximum by the second communicating electronic device (d2) acting as a cluster head and a field (MH-6) encoding a DST data characterizing the distance separating the transmitting electronic communicating device from said enrollment message (MH, MH ') on a descending road from the communicating electronic device acting as a cluster head (d2); step (102) for decoding said enrollment message (MH, MH ') from deducing the values of said data TTL-e and DST; The step (103) for updating the record (RH) is adapted so that said record stores the value of the given data TTL-e and the value, previously incremented by one unit, of the data DST ; said method (P100) further comprising a step of comparing said TTL-e and DST values recorded in the record (RH) and updating (107) said record (RH) and erasing or replacing the current value (IDHc ) communicating electronic device identifier acting as a cluster head 10 by a predetermined value reflecting a lack of device identifier acting as a cluster head.
[0008]
Communication method (P100) according to any one of the preceding claims, comprising: - a step for determining the maximum depth (Dp) of the cluster of which the first communicating electronic device (10) wishes to be cluster head according to 112) an operating parameter of said device (10); a step for encoding an enrollment message (MH) and triggering transmission (113) of said message (MH) by the first communication means (13), said message (MH) comprising a first field (MH-1); ) encoding the identifier (IDH) of said first communicating electronic device and a second field (MH-4) encoding the TTL data whose value is initialized to that of the maximum cluster depth produced. 3034280 68
[0009]
The communication method (P100) according to claim 7, comprising: - a step for determining the maximum depth (Dp) of the cluster whose first communicating electronic device (10) wishes to be cluster head according to (112) a parameter operating said device (10); a step for encoding an enrollment message (MH) and triggering transmission (113) of said message (MH) by the first communication means (13), said message (MH) comprising fields (MH-1, MH-4, MH-5, MH-6) encoding respectively: a. the identifier (IDH) of said device; b. the TTL data whose value is entered in the record (RH); vs. the TTL-e data whose value is initialized to that of the maximum depth (Dp) of the determined cluster; d. the DST data whose value is initialized to a value indicating a zero distance in number of jumps. The communication method (P100) according to claims 8 or 9, including a step for evaluating (111) the ability of the first communicating electronic device (10) to assume a particular service (S), said step (111) of Estimating (1111) an operating parameter of said device (10) and producing (1112) a data (CH) representing the capacity of said device (10) to be able to provide said determined service (S), and for which the step for encoding an enrollment message (MH) consists in providing, within said enrollment message (MH), a field (MH-3) encoding said data item (CH) translating said capacity before the transmission is triggered (113) said message (MH) by the first communication means (13). 11. The communication method (P100) according to the preceding claim, comprising a step for comparing (112) the data item (CH) expressing said capacity with a minimum functional requirement threshold and for which the step (113) for triggering the sending of the enrollment message 15 is implemented only if (112-y) the data translating said capacity is greater than or equal to said minimum functional requirement threshold. 12. Computer program product (P) having program instructions which, when: - previously stored in a program memory (14) of a communicating electronic device (10) further comprising a processing unit (11), first communication means (13) providing wireless proximity communication with any other electronic device (10i) within communication range, a data store (12) recording the value of an identifier ( ID) dedicated to the device and a record (RH) to include the current value of an identifier of a device acting as a cluster head, said memories (12, 14) and said first communication means (13). cooperating with said processing unit (11); 5 - executed or interpreted by said processing unit (11), cause the implementation of a communication method (P100) according to any one of claims 1 to 11.
[0010]
13. Communicating electronic device (10) comprising a processing unit (11), a data memory (12), a program memory (14), first communication means (13) providing wireless proximity communication with any other communicating electronic device (10i) located within communication range, said memories (12, 14) and said first communication means (13) cooperating with said processing unit (11), the data memory (12) comprising the value of an identifier (ID) dedicated to the communicating electronic device (10) and a record (RH) to include the current value of an identifier of a device acting as a cluster head, said communicating electronic device ( 10) being characterized in that it comprises in the program memory (14) the instructions of a computer program product (P) according to the preceding claim. 14. System comprising a plurality of communicating electronic devices (10, 10i) according to the preceding claim. 15. System according to the preceding claim comprising a plurality of containers of goods, solid goods, fluids or liquids, said containers cooperating respectively with the communicating electronic devices (10, 10 10i), the latter each comprising a sensor (15) cooperating with the processing unit (11) for measuring and collecting a quantity related to the internal and / or external environments of said containers.

类似技术:

---

公开号 | 公开日 | 专利标题

---

EP3167631B1|2019-12-18|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

EP3225052B1|2018-11-07|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

EP3275217B1|2019-01-02|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system

---

WO2020114977A1|2020-06-11|Gateway for communicating via radio network with at least one node and via a wired network, by means of a blockchain

---

WO2020016499A1|2020-01-23|Method for coordinating a plurality of device management servers

---

EP3817294A1|2021-05-05|Method and module for a connectivity regulation of connected objects.

---

EP3211841B1|2019-06-26|Method for deciding to relay a copy of a route discovery request in a communication network by broadcast

---

US20200195716A1|2020-06-18|Asset synchronization systems and methods

---

EP3825919A1|2021-05-26|Method for association of user equipment in a cellular network by means of multi-agent reinforcement learning

---

EP3046368B1|2017-11-22|Method for collecting information for routing in an ad-hoc network and method for selecting a route from the collected information

---

Challen2010|Data fidelity and resource management for data-rich sensor networks

---

WO2020115002A1|2020-06-11|Device for communicating in a network of heterogeneous gateways via radio network with at least one node and via a long-distance network, with at least one recipient

---

FR3081665A1|2019-11-29|METHOD FOR EVALUATING THE ENERGY CONSUMPTION OF A SERVICE TRANCHE IN A COMMUNICATIONS NETWORK

---

FR2980939A1|2013-04-05|MULTI-SKIP ROUTING PROTOCOL

---

WO2022053612A1|2022-03-17|Method for updating embedded software

---

Ballester Lafuente2015|A fully decentralized trust management and cooperation incentives framework for wireless user-centric networks

---

EP1729459A1|2006-12-06|Method and system for broadcasting interactive multimedia in a room complex, especially a hotel structure, method for optimization therefore and multimedia receiver equipment for that system

---

FR2918491A1|2009-01-09|Automated aerial or underground parking area managing system for e.g. car, has single beacon controlling range-finders and positioning between parking spaces, and non dedicated management computer exploiting parking space

---

WO2012131280A1|2012-10-04|Data communication in a sensor array

---

FR2903832A1|2008-01-18|Data packet`s intentional loss evaluating method for e.g. mobile telephone, involves counting packets exchanged between node of network and direct neighboring node, and broadcasting values of counting to other nodes based on protocol

同族专利:

---

公开号 | 公开日

---

ES2718938T3|2019-07-05|

---

DK3275217T3|2019-04-23|

---

US10313956B2|2019-06-04|

---

AU2016238619B2|2018-08-02|

---

EP3275217B1|2019-01-02|

---

FR3034280B1|2017-03-24|

---

AU2016238619A1|2017-11-09|

---

MX2017012216A|2018-01-30|

---

JP6464282B2|2019-02-06|

---

IL254487A|2020-02-27|

---

PT3275217T|2019-04-29|

---

BR112017020524A2|2018-07-10|

---

RU2017134306A|2019-04-05|

---

WO2016151259A1|2016-09-29|

---

EP3275217A1|2018-01-31|

---

RU2017134306A3|2019-04-05|

---

CN107873139A|2018-04-03|

---

US20180070287A1|2018-03-08|

---

MA42008A|2018-01-31|

---

RU2690514C2|2019-06-04|

---

CN107873139B|2021-07-16|

---

KR20170130556A|2017-11-28|

---

JP2018511255A|2018-04-19|

---

HK1247024A1|2018-09-14|

---

KR102051984B1|2019-12-04|

---

CA2979477A1|2016-09-29|

---

SG11201707404TA|2017-10-30|

---

IL254487D0|2017-11-30|

---

MX371401B|2020-01-29|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US7483943B2|2004-09-21|2009-01-27|Microsoft Corporation|Reliable messaging using clocks with synchronized rates|

---

EP1805947A1|2004-09-29|2007-07-11|Telefonaktiebolaget LM Ericsson |Installing a new view of a cluster membership|

---

US20060215673A1|2005-03-11|2006-09-28|Interdigital Technology Corporation|Mesh network configured to autonomously commission a network and manage the network topology|

---

JP4503513B2|2005-08-31|2010-07-14|株式会社エヌ・ティ・ティ・ドコモ|Mobile terminal device, topology management device, communication method, and communication network|

---

US8134950B2|2007-04-03|2012-03-13|Harris Corporation|Cluster head election in an ad-hoc network|

---

KR101001559B1|2008-10-09|2010-12-17|아주대학교산학협력단|Hybrid clustering based data aggregation method for multi-target tracking in the wireless sensor network|

---

US9176963B2|2008-10-30|2015-11-03|Hewlett-Packard Development Company, L.P.|Managing counters in a distributed file system|

---

WO2010071882A2|2008-12-19|2010-06-24|Watchguard Technologies, Inc.|Cluster architecture for network security processing|

---

KR101081941B1|2008-12-24|2011-11-10|전자부품연구원|Recording medium recorded node address and routing information structure, method of sensor network organization and method of sensor network routing|

---

JP5839041B2|2011-10-13|2016-01-06|富士通株式会社|Node device and communication method|

---

GB2502775A|2012-05-31|2013-12-11|Toshiba Res Europ Ltd|Selecting routes between nodes in a network based on node processing gain and lifetime|

---

RU122538U1|2012-06-20|2012-11-27|Открытое акционерное общество "СУПЕРТЕЛ"|AUTOMATIC MULTI-CHANNEL PRIMARY COMMUNICATION NETWORK|

---

CN102695220B|2012-06-25|2014-06-18|常熟理工学院|IPv6-based mobile ad hoc network mobile handover realizing method|

---

FR3004309B1|2013-04-08|2017-03-24|Thales Sa|DISTRIBUTED METHOD FOR SELECTING A CONFIGURATION IN MOBILE NETWORKS|

---

CN103237334B|2013-04-12|2015-10-28|太原理工大学|A kind of wireless sensor network clustering routing based on tunnel environment|

---

EP3050365B1|2013-09-27|2018-07-18|Nokia Solutions and Networks Oy|Changes of cluster head|US10506663B2|2016-06-28|2019-12-10|Telefonaktiebolaget Lm Ericsson |Method and device for determining cluster-heads|

---

DK3336782T3|2016-12-13|2020-06-02|Traxens|METHOD OF GEOGRAPHICAL BASED SELECTION OF RADIO FREQUENCY TAPES|

---

WO2019034307A1|2017-08-14|2019-02-21|Sas Inferency|Door to door multimodal track and trace device|

法律状态:
2016-03-29| PLFP| Fee payment|Year of fee payment: 2 |

---

2016-09-30| PLSC| Publication of the preliminary search report|Effective date: 20160930 |

---

2017-03-22| PLFP| Fee payment|Year of fee payment: 3 |

---

2017-07-21| CA| Change of address|Effective date: 20170616 |

---

2017-11-10| RM| Correction of a material error|Effective date: 20171005 |

---

2018-03-23| PLFP| Fee payment|Year of fee payment: 4 |

---

2019-03-22| PLFP| Fee payment|Year of fee payment: 5 |

---

2020-02-28| CA| Change of address|Effective date: 20200121 |

---

2020-02-28| CJ| Change in legal form|Effective date: 20200121 |

---

2020-04-03| CL| Concession to grant licences|Name of requester: TRAXENS, FR Effective date: 20200221 |

---

2020-12-18| ST| Notification of lapse|Effective date: 20201110 |

优先权:

---

申请号 | 申请日 | 专利标题

---

FR1552522A|FR3034280B1|2015-03-25|2015-03-25|METHOD FOR COMMUNICATING IN A DYNAMIC DEPTH CLUSTER OF COMMUNICATING ELECTRONIC DEVICES, ELECTRONIC DEVICE USING SAID METHOD AND SYSTEM THEREOF|FR1552522A| FR3034280B1|2015-03-25|2015-03-25|METHOD FOR COMMUNICATING IN A DYNAMIC DEPTH CLUSTER OF COMMUNICATING ELECTRONIC DEVICES, ELECTRONIC DEVICE USING SAID METHOD AND SYSTEM THEREOF|

---

DK16717985.2T| DK3275217T3|2015-03-25|2016-03-24|COMMUNICATION PROCEDURE IN A DYNAMIC DEPTH CLUSTER OF COMMUNICATING ELECTRONIC DEVICES, COMMUNICATING ELECTRONIC DEVICE IMPLEMENTING THE RELATED PROCEDURE, AND SYSTEM|

---

EP16717985.2A| EP3275217B1|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

ES16717985T| ES2718938T3|2015-03-25|2016-03-24|Communication procedure within a dynamic depth grouping of communicating electronic devices, communicating electronic device that implements said procedure and associated system|

---

PT16717985T| PT3275217T|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

SG11201707404TA| SG11201707404TA|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

MX2017012216A| MX371401B|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system.|

---

RU2017134306A| RU2690514C2|2015-03-25|2016-03-24|Method for communication within a cluster of dynamic depth of electronic devices exchanging data, corresponding to an electronic device communicating with said device, and a corresponding system|

---

BR112017020524-6A| BR112017020524A2|2015-03-25|2016-03-24|method for communication within a dynamic depth cluster of electronic communication devices, electronic communication device implementing said method and associated system|

---

JP2017550215A| JP6464282B2|2015-03-25|2016-03-24|Communication method within a cluster of communication electronic devices with dynamic depth, communication electronic device performing the method, and related system|

---

MA042008A| MA42008A|2015-03-25|2016-03-24|COMMUNICATION PROCESS WITHIN A DYNAMIC DEPTH CLUSTER OF COMMUNICATING ELECTRONIC DEVICES, COMMUNICATING ELECTRONIC DEVICE IMPLEMENTING THIS ASSOCIATED PROCESS AND SYSTEM|

---

KR1020177030655A| KR102051984B1|2015-03-25|2016-03-24|A communication method in a dynamic-depth cluster of communication electronic devices, a communication electronic device implementing the method and a related system|

---

AU2016238619A| AU2016238619B2|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

US15/560,325| US10313956B2|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

CA2979477A| CA2979477A1|2015-03-25|2016-03-24|Communication method and system within a dynamic-depth cluster of electronic devices|

---

CN201680030357.1A| CN107873139B|2015-03-25|2016-03-24|Communication method, electronic communication device and system for dynamic deep cluster of electronic communication device|

---

PCT/FR2016/050670| WO2016151259A1|2015-03-25|2016-03-24|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

IL254487A| IL254487A|2015-03-25|2017-09-13|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system|

---

HK18106489.5A| HK1247024A1|2015-03-25|2018-05-18|Procede de communication au sein d'une grappe de profondeur dynamique de dispositifs electroniques communicants, dispositif electronique communicant mettant en oeuvre ledit procede et systeme associes|