NL2020967B1 - Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method. - Google Patents

Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method. Download PDF

Info

Publication number
NL2020967B1
NL2020967B1 NL2020967A NL2020967A NL2020967B1 NL 2020967 B1 NL2020967 B1 NL 2020967B1 NL 2020967 A NL2020967 A NL 2020967A NL 2020967 A NL2020967 A NL 2020967A NL 2020967 B1 NL2020967 B1 NL 2020967B1
Authority
NL
Netherlands
Prior art keywords
packages
information
label
received
labels
Prior art date
Application number
NL2020967A
Other languages
Dutch (nl)
Inventor
Martin Van Dijk Jeroen
Original Assignee
N V Nederlandsche Apparatenfabriek Nedap
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by N V Nederlandsche Apparatenfabriek Nedap filed Critical N V Nederlandsche Apparatenfabriek Nedap
Priority to NL2020967A priority Critical patent/NL2020967B1/en
Application granted granted Critical
Publication of NL2020967B1 publication Critical patent/NL2020967B1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates

Abstract

Method for wirelessly updating a plurality of labels such as smart labels worn by animals, the method comprising the steps of: a. Using at least one transmitter unit, a collection of packets is repeated with the collection being more than one package, wherein each package comprises a unique identification code and wherein the packages are not transmitted over time with each other, the update information for performing an update being spread over a plurality of the packages of the set of packages being recorded; b. each label that receives the collection of packages or a part thereof records information from the packages that have been received, at least as long as all packages of the collection have not yet been fully received by the relevant label; c. each label repeats step b. until all packages of the collection have been received by the relevant label; d. each label extracts the update information from the received package collection.

Description

Θ 2020967 © B1 PATENT (2?) Application number: 2020967 (51) Int. Cl .:

G06F8 / 65 (2018.01) (22) Application submitted: 22 May 2018 (30) Priority:

(4 ^) Application registered: November 28, 2019 (43) Application published:

(47) Patent granted:

November 2019 (45) Patent issued:

November 2019 (73) Patent holder (s):

N.V. Nederlandsche Apparatenfabriek NEDAP in Groenlo (72) Inventor (s):

Jeroen Martin van Dijk in Groenlo (74) Authorized representative:

ir. H.A. Witmans et al. In The Hague

54) Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for carrying out such a method.

57) Method for wirelessly updating a plurality of labels such as smart labels worn by animals, the method comprising the following steps:

a. with the aid of at least one transmitter unit, a set of packets is repeated, the set comprising more than one packet, each packet comprising a unique identification code and wherein the packets are not transmitted in overlapping time, the update information for performing an update spread across a plurality of the packages from the set of packages is included;

b. each label that receives the package of packages or a part thereof records information from the packages that have been received, at least as long as all packages of the collection have not yet been fully received by the relevant label;

c. each label repeats step b. until all packages of the collection have been received by the relevant label;

d. each label extracts the update information from the received package collection.

NL B1 2020967

This patent has been granted regardless of the attached result of the research into the state of the art and written opinion. The patent corresponds to the documents originally submitted.

P115958NL00

Title: Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method.

The invention relates to a method for wirelessly updating a plurality of labels such as smart labels that are worn by animals. The invention also relates to a system for carrying out such a method, provided with at least one transmitter unit and at least one label. Such a method and system are known per se.

The known method and the known system are based on peer to peer communication. With such a software update, one label at a time is provided with new software. This means that the at least one transmitter unit communicates with one label at a time for updating the relevant label. Use is also made here of a receiver for receiving information from the label about whether or not the update has been received in full. This is, if necessary, partly repeated until the label indicates that it has received the update in full. This method and this system is very slow when many labels have to be provided with software.

An example can illustrate this:

Suppose a new update (Software version) SW has a size of 100 KB. Suppose further that the communication speed between a label and the transmitter unit is 100kBit / s. Suppose furthermore that the number of cows / labels that the new SW update needs is 10,000. Broadcasting the update SW is performed by broadcasting a plurality of packets, each of which has a size of 128 Bytes, 28 of which are overhead. This means that 10 ins is required for sending out a package. This package must be processed by the label upon receipt.

The label must then confirm good reception before the next packet can be broadcast. This quickly takes 20 ms, so a total of 30 ms is required for sending, receiving and saving a package in the label. Often 1000 packages per label are needed that must be supplied to a label for an update so that 30 seconds per label is needed for an update. With 10,000 labels it takes at least 300,000 seconds (= 83 hours) before all labels are updated. In practice this will be much longer because not all communication goes well at one time and moreover not all cows are within range of the at least one transmitter unit. In large installations, it may even be that the cows are only near the antenna during milking, making it almost impossible to update such an installation.

It is an object of the invention to improve the process of updating so that a plurality of labels can be updated faster.

The method according to the invention is accordingly characterized in that it comprises the following steps:

a. with the aid of at least one transmitter unit, a collection of packets is repeated, the collection comprising more than one packet, each packet comprising a unique identification code and wherein the packets are not transmitted in overlapping time, the update information for performing an update spread over a plurality of the packages from the set of packages is listed;

b. each label that receives the package of packages or a part thereof records information from the packages that has been received, at least as long as all packages of the collection have not yet been fully received by the relevant label;

c. step b. is repeated until all packages from the collection have been received;

d. the up-date information is extracted from the collection of packages.

The idea behind the invention is that the information transmitted by the transmitter unit can be received by more than one label at a time and used for updating the labels. A multitude of labels can therefore be updated in parallel or partly in parallel. It is no problem here if a number of labels do not receive the update at all or not at all, because the set of packets is broadcast repeatedly. Time is saved compared to systems in which the labels are updated sequentially. For example, if 1000 labels are within range of the sender unit, they can be updated simultaneously or partially at the same time. It can happen that one of these labels is temporarily out of range, but when this label is again within range, it can again, possibly partly, receive the set of packets that is broadcast because the plurality of packets is sent repeatedly. If a packet has not been received before or has not been received in full, the relevant label can still receive information from these packets because the plurality of packets is transmitted repeatedly. This continues until all packages in the collection have been received in full. The complete update can then be extracted from the plurality of received packages. This does not exclude that once a number of, but not all, packages of the plurality of packages have been received, part of the update will already be extracted from the received packages.

Because when sending the collection packages, a plurality of labels can each time retrieve information from the update (all information or part of the information from an update), the labels can be updated much faster. For the 1000 labels mentioned, the total update can, for example, be performed 100-1000 times faster.

In particular, it applies that each label in a step e. transmits a predetermined code when the tag has received all the packets of the plurality of packets. This code can then be received with the help of at least one receiver. In particular, it holds that the transmitter unit stops in a step f. with repeated transmission of the set of packages when a receiver of each label of a predetermined group of labels or of a predetermined number of labels has received a code that has received all packages of the set of packages. In this way, the plurality of packets is not transmitted unnecessarily long and updating the particular group of labels or the predetermined number of labels takes relatively little time. When the transmitter unit is stopped, a complete update of a plurality of labels has been carried out in a relatively short time. Preferably, it holds that the packets are transmitted separately from one another over time, that is to say that there is a time lapse between neighboring packets between the moment when the end of a packet is broadcast and the moment when the beginning of a next packet is broadcast. This makes it easy for a label to recognize a package upon receipt. It increases the certainty for the respective detection of packages.

According to an advanced embodiment, it holds that at least a part of reconstruction information for being able to reconstruct the set of packages in step b. and step c. prior to performing step a. or step b. is known by each label. This information can, for example, be included in the label during production of the label or later sent to the label, for example wirelessly. However, it is also possible that at least a portion of reconstruction information is able to reconstruct the set of packages in step b. and step c. is predetermined and included in the package collection. Upon receipt of packages, the label will then attempt to extract this reconstruction information so that this information can be used to reconstruct the set of packages. It is also possible that part of the reconstruction information is known to the label prior to performing step a. And that, in particular, another part of the reconstruction information is included in the packages. For all three variants, however, the reconstruction information may include: the size of each of the packages, a position of the identification code within each package, a time interval between neighboring packages, a sequence of the packages determining the update information, and / or the number of packages from the collection of packages.

Preferably, in step b. only information from a complete package is recorded in the label. If a package is then not fully received, the information received from the package is not registered. The package is only registered when it is received again later, but then fully. However, this is not necessary. It is also possible that information from a partially received package is registered with the intention that the missing information of the relevant package is registered later, when this missing information is received later when the same package or part thereof again or again later being received.

In particular, it holds that the plurality of packets form a message in which the message is repeated in step a. In particular, the packets have the same order within a message. However, it is also possible for a set of packets to be broadcasted repeatedly, the packets, however, being broadcasted repeatedly in a changing order. Each message can then, for example, comprise the same collection of packages, but in a different order. However, it is also possible that the set of packets that is broadcast repeatedly overlaps with a subsequent set of packets that is broadcast without the packets themselves overlapping with time. Thus, in general, it holds that the packets of the set of packets are broadcast repeatedly, the order in which the packets are repeated being broadcast may vary.

In particular, it holds that each tag attempts to extract the reconstruction information from a received package or from the previously received packages until the reconstruction information has been extracted. Furthermore, it may apply that each label, after it has extracted the reconstruction information, uses this information to reconstruct the set of packages from the already registered information if sufficient information has been received for this, or from newly received information from the packages or from previously received information. of the packages in combination with newly received information from the packages.

The reconstruction information may include, for example, a number comprising the number of packets of the collection packets. As soon as a number of different packages has been received by a label that is equal to the number, the label knows that the collection of packages is complete. In particular, it holds that the information for performing an update is included spread over a plurality of packages from the set of packages, more particularly spread over all packages from the set of packages.

Furthermore, it may in particular be the case that the reconstruction information is also used for performing step d. For example, the reconstruction information may also include information about the order of the packages from the set of packages that must be known to extract the update from the packages.

If the label is provided with the reconstruction information in advance, this information can be used in a similar way. For example, the label can use this information to reconstruct the collection of packages from the already registered information if required

sufficient information has been received. For example, the reconstruction information may include a number that includes the number of packages in the set of packages. As soon as a number of different packages has been received by a label corresponding to the number, the label knows that the collection of packages is complete. It is also possible in that case that the reconstruction information is also used for performing step d. Thus, the reconstruction information may also include information about the order of the packages from the set of packages that must be known to reconstruct the update from the packages. It is of course also possible in such cases that the unique identification codes of the packages determine the order of the packages. This fact must then be known to the labels and can be considered as reconstruction information.

The system for carrying out a method according to the invention is provided with at least one transmitter unit, a control unit connected to the transmitter unit and at least one label, the control unit being arranged to send the set of packages to the transmitter unit. a unit for transmitting the collection packets in step a. and wherein the at least one tag is arranged to include step b., step c. and step d. to execute using a processor.

In particular, it holds here that the label is arranged around step e. to be carried out.

Preferably, it holds that the system is further provided with at least one receiver unit which is communicatively connected to the control unit, the system being arranged to perform a step f. in which the transmitter unit is stopped by the control unit from repeatedly transmitting the message when the receiver unit of each label of a predetermined group of labels or a predetermined number of labels has received a code that reconstructed all packages or received the information of all packages. According to a special embodiment, it holds that the receiver unit and the transmitter unit together form a transceiver. Preferably, it holds that the at least one transmitter unit is part of a reader for reading a label. More generally, it holds that the system is preferably provided with a plurality of the labels. Furthermore, it holds in particular that the system is provided with a plurality of the transmitter units. If the broadcasting units are scattered around, this has the advantage that the chance that a label is in the range of a broadcasting unit is increased. Updating all labels can then be even faster. In that case the system will often still be provided with a central control unit which is communicatively connected to each of the transmitter units. Each transmitter unit can therefore be provided with a receiver unit, wherein all receiver units are communicatively connected to the central control unit. Each transmitter unit can also be part of a reader to read the label. If the system is provided with a single transmitter unit, the control unit can preferably be incorporated in the transmitter unit. The labels can be designed as an RFID label that can be read by a transmitter unit and / or by a separate RFID reader.

The invention will now be further elucidated with reference to the drawing in which:

FIG. 1 shows an embodiment of a system according to the invention for carrying out a method according to the invention.

FIG. 2 shows a possible structure of a message that is repeatedly transmitted by the system of figure 1.

In Fig. 1, reference numeral 1 designates a system according to the invention for carrying out a method according to the invention. The system is provided with a plurality of labels 2.i (i-1, 2, ...., 11) such as smart labels that, in use, are worn by animals. This example concerns so-called eartags. However, it may also be other labels such as labels that are attached to the animal's neck or leg. In this example, each label 2.1 is provided with an RFID unit 4 known per se, which is communicatively connected to a controller

6. The controller 6 comprises a microprocessor known per se and memory means in which software is stored. The RFID unit 4 and the controller 6 are of a known type that can be read wirelessly with an RFID reader. In this example, such an RFID reader is schematically indicated by the reference number 8. The RFID reader 8 generates an electromagnetic field to which a label 2.i responds, for example by modulating the field with an identification code stored in the controller 6. For this purpose, the RFID unit comprises a resonant circuit known per se, with a resonance frequency corresponding to a frequency of the electromagnetic field transmitted by the reader 8. Each label can for instance still be provided with one or more sensors 10 which are communicatively connected to the controller 6. The sensors 10 can for instance comprise a temperature sensor and / or motion sensor. The information obtained with the aid of the sensors is added to the controller 6 for further processing. The controller 6 can optionally send this information in processed form with the aid of an RFID unit 4 to the reader 8 when the label with the RFID unit is brought into the electromagnetic field emitted by the label 8. The electromagnetic field is then modulated with the relevant information by the relevant label.

The controller 6 comprises software that is used to process measurement results from the sensors 10.

The reader can also send 8 commands to a label, which commands can be executed by the controller under the control of the software of the controller of a label. Optionally, the information transmitted by a label and / or received by a label may be encrypted and the software of a controller may be arranged to decode received information, and / or to encrypt information to be transmitted.

It is desirable to be able to update the software that is present in each label. In order to be able to update the labels 2.i (i = 1, 2, ..., n) each, the system is provided with a transmitter unit 12 and a control unit 14 which are communicatively connected to each other. In this example, the control unit 14 comprises information about the new software. This may involve completely new software or a supplement to already installed software. To carry out the updates, a message 16 is repeatedly transmitted using the transmitter unit 12 comprising a collection of packages, the collection of packages comprising a plurality of packages of information.

Figure 2 shows a message 16 which in this example comprises four packets 18.1-18.4 with information. A software update is included in this example spread over the four packages of information 18.1-18.4. The collection of packages also comprises a first part of reconstruction information about the number of packages in the message and the length of each of the packages. In this example, the length of a package is understood to mean the number of bytes included in a package. Furthermore, each package includes a unique identification code. The message 16 is transmitted in such a way that the packets of the message on receipt by a label 2.i can be distinguished from one another by means of an RFID unit 4 of the label 2.1 by the controller 6 of the label 2.i and wherein the additional information from the message can be extracted.

In this example, this is achieved because the distance in time Δ11 between consecutive packages is predetermined and fixed. This distance is known to the controller 6 of each of the labels and is in fact a second part of reconstruction information that is pre-recorded in the labels and thus before an update is performed.

When the message 16 has been transmitted, the message is retransmitted after a time difference Δt2 has elapsed since the transmission of the last packet of a previous message (see Figure 2). So it applies that the set of packets is broadcasted repeatedly, in this example each time in the same order.

In this example, the first part of reconstruction information is included in the package 18.1. Therefore, when any label 2.i receives a package 18.1, the label knows how many packages are included in a message and what the length of each of the packages is. In this example, the unique identification code is a simple package number. The package 18.1 can for instance comprise the number 1 as identification code, the package 18.2 as identification code the number 2, the package 18.3 as identification code the number 3, and the package 18.4 as identification code the number 4. The message 16 comprises a complete update spread over a number of packages. The idea is that the collection of packages is broadcasted repeatedly. In this example, this is achieved by repeatedly transmitting the message 16. Viewed from the label 2.i, it may be that it is out of range of the transmitter unit 12 at any time. This is not in itself a problem because each packet 18.i is transmitted repeatedly and can therefore still be received when the label 2. i can receive the messages sent by the transmitter unit 12. It can also happen that the label 2.i only receives a part of a message. The controller unit 6 can then store that part of the message and wait for it to receive a new message, upon receipt, for example, receiving other parts of the message that can also be stored. In this example, only a complete package 18.i is stored as part of a message. If a package is only partially received, this received information is not stored. This process can be repeated until the label 2.i has received the plurality of packages. In this example, the label therefore knows the order of the packages for extracting the update from the packages. This is determined in this example by the unique identification code of the packages. This code is a number per package where the order of the packages corresponds to the increase of the relevant number. However, it is also possible for the tag to derive the relevant order of the packets from the order in which the packets are received within a message. After all, when the message has been partially or fully received a number of times, the order in which packets are received can also be determined.

Thus, it holds that in a step a. With the aid of at least one transmitter unit, a collection of packages is repeatedly transmitted, the collection comprising more than one package, each package comprising a unique identification code and the packages not overlapping in time are broadcasted. This includes the update information for performing an update spread over a plurality of the packages from the package collection.

Furthermore, in a step b. each label that receives the package of packages or a part thereof records information from the packages that has been received, at least as long as all packages of the collection have not yet been fully received by the relevant label.

In this example it is always about registering a complete package. If, upon receiving a portion of the collection packages, only a portion of a particular package has been received, the information received from that package is not recorded. In other exemplary embodiments, this is possible, as will be discussed later.

The messages are transmitted in such a way that the packages can be distinguished upon receipt. This is achieved in this example in that Atl and Δΐ2 are predetermined and are known to each controller 6 of a label 2.i.

Furthermore, in a step c., Step b. is repeated by each label until all packages of the collection have been received. Furthermore, in a step d. the update information from the package collection is reconstructed by each label.

In this example, reconstructing by a label 2.i goes as follows.

Each tag, after extracting the reconstruction information, uses the reconstruction information to reconstruct the set of packets from the ones already in step b. or steps b. registered information if sufficient information has been received for this. In other words, it may be that once a tag has extracted the reconstruction information, the tag has already received and registered information to completely reconstruct the collection packets based on this information.

It is also possible that the label has not yet registered sufficient information in previous steps b. or a previous step b. to reconstruct the collection of packages based on the information already registered. In that case, in this example, each tag after extracting the reconstruction information (where not enough information has been received and registered to reconstruct all packages) will attempt to reconstruct all packages in a subsequent step b. upon receiving new information from a new message in combination with previously recorded information, each subsequent step b being carried out upon receiving a new message until all packets can be reconstructed and reconstructed from the previously received and registered information and the new information received in a subsequent step b. According to another variant, each label after extracting the reconstruction information in which none of the remaining information received by the label has been stored in the label for reconstructing all packages may attempt to reconstruct all packages in a subsequent step b. upon receiving a new message, wherein each time a next step b. is executed when receiving a new message until all packages can be reconstructed. In this variant, a label only becomes a step b. performed for the first time after the label in question has extracted the reconstruction information.

In this example, the reconstruction information is also used to perform step d., Namely, to determine the relevant order of the packages.

It applies that all labels 2.i perform the same method for reconstructing a complete message. As mentioned, a message includes a software update so that each label, after reconstructing a message, can update its software.

In this example, the distance At1 was predetermined and known for each label 2.i. As a result, the label, together with the reconstruction information, was able to distinguish the packages upon receipt. The reconstruction information can be extracted from a message because it was included in a package and can be recognized as such by the controller.

However, the packages can also be distinguished from each other on receipt than on the basis of a predetermined distance in time Δt between successive packages. It is thus also possible for each package to be provided with at least one recognition code, such that by recognition of the recognition code by the controller 6 of a label 2.i upon receipt of packages, the controller can distinguish the packages from each other. The recognition code may, for example, be included at the beginning of each packet 18.j (j = 1,2,3,4). In particular, the recognition code is equal to a unique code of the package. If a unique code indicates the beginning and a unique code the end of a package, packages can also be registered on the basis of these codes or mutually. In fact, these codes can be seen as reconstruction information.

In this example, it applies that each label in a step d. transmits a predetermined code when the label has reconstructed all packets of the message or has received all information from all packets so that it can reconstruct the complete message. This predetermined code can be received by a receiver unit 16 connected to the controller unit 14. The controller unit 14 in this example is provided with the number of labels that an update must receive.

As soon as the controller unit 14 of n (e.g. n = 1000) labels has received the predetermined code, the controller unit 14 knows that all labels have apparently received an update. In that case, the controller unit 14 causes the transmitter unit in a step e. stops repeating the sending of the message. After all, all labels have received their update. It is also possible that the controller unit 14 has information about for which labels 2.i the update is intended. In that case, each tag 2.i may transmit the predetermined code indicating that the tag in question has reconstructed all packets of the message or has received all information of all packets in association with its identification code. The controller unit 14 can then check which label has received a complete update and if all labels from a predetermined group of labels have received updates in a step e. causing repeated transmission of the message with the aid of the transmitter unit 12 to be stopped. It is noted that the transmitter unit 12, controller unit 14 and the receiver unit 16 can also be designed as a reader 8 for reading a label 2.i in a known manner. In that case, the separately shown reader unit 8 in Figure 1 can be omitted. For convenience, if the transmitter unit 12, the controller unit 14, and the receiver unit 16 are referred to as an update unit 18, it will be appreciated that the system may also be provided with a plurality of update units 18. In Figure 1, a second update unit 18 '. The update unit 18 and the update unit 18 'are communicatively connected to a central controller unit 20. The central controller unit 20 ensures that the update units 18, 18' are each provided with the same repeatable message 18. Also, the central controller unit 20 that the repeated transmission of a message is stopped by both units 18, 18 "when all labels, i.e. the complete number or the complete group, as discussed above have received all the information of a message and thus can update to carry out.

Each update unit 18, 18 "can therefore also be designed as an RFID reader 8 known per se.

In particular, every message is provided with a code that indicates the new version of a software. It can also include a code for which hardware the new software is known for and it can include a code that indicates what the current software is being replaced. In this way, a label may be able to see that a newer update is available so that it can, for example, stop updating the current software to start again with a newer version.

In this example, part of the reconstruction information was included in the first package 2.1, for example. This package also included information, at least part of it, about the update. However, it is also possible that the first package or another of the packages only contains the instruction information. In this example, a message comprises four packets of information. This is just an example. In practice, a message may comprise a much larger number of packages such as, for example, a thousand packages.

In this example, a label first attempts to reconstruct instructional information upon receipt of the message or receipt of messages. This can also only happen when all information of a complete message has been received. Only then can the additional information be extracted and the packages reconstructed. In this example, all packages have the same length. The packages can also have different lengths. The distance between different packages can also be different.

In this example, the message is broadcasted repeatedly. It is also possible that the set of packets is broadcast each time in a different order. Also, messages that are transmitted repeatedly can overlap each other in time without the packets themselves overlapping. Thus, first the first packet can be broadcast twice, then the second packet broadcast twice, then the third packet broadcast twice, and then the fourth packet broadcast twice. After this, this entire cycle can repeat itself.

In this example, only complete packages are registered by a label upon receipt. It is also possible that parts of packages are also registered upon receipt. For example, a first half of a package and a second half of the package where each half is coded so that they can be identified by the label (for example, each half includes a unique code for this).

In this example, the reconstruction information is included in the message. However, this information can also be included in the label (before the update is performed). The reconstruction information may also be distributed over the label and the message. For example, the information to distinguish the packages upon receipt may be included in the label while other reconstruction information such as the number of packages in the collection and / or the length of a package are included in the message. An update can also be performed without reconstruction information. For example, by ensuring that packets are transmitted sufficiently separated from each other in time so that the label can receive the packets separately from each other without knowing what the actual distance in time is between the moment at which the end of a packet is broadcast and the beginning of the next packet is broadcast. That a collection has been received in full can, for example, be assumed by the label because it has received messages during a certain cumulative minimum duration. For example, if the label has received X minutes of messages spread out over time, it is very likely that it has received all packets from the collection. For example, X is in the range of 2-30 minutes, depending on how much continuous time is required to receive the complete set of packages.

Claims (20)

  1. CONCLUSIONS
    A method for wirelessly updating a plurality of labels such as smart labels worn by animals, characterized in that the method comprises the following steps:
    a. with the aid of at least one transmitter unit, a collection of packets is repeated, the collection comprising more than one packet, each packet comprising a unique identification code and wherein the packets are not transmitted in overlapping time, the update information for performing an update spread over a plurality of the packages from the set of packages is listed;
    b. each label that receives the package of packages or a part thereof records information from the packages that have been received, at least as long as all packages of the collection have not yet been fully received by the relevant label;
    c. each label repeats step b. until all packages of the collection have been received by the relevant label;
    d. each label extracts the update information from the received package collection.
  2. Method according to claim 1, characterized in that each label in a step e. broadcasts a predetermined code when the label has reconstructed the set of packages.
  3. Method according to claim 1 or 2, characterized in that the transmitter unit stops in a step f. with repeated transmission of the set of packages when a receiver of each label of a predetermined group of labels or of a predetermined number of labels has received a code that has reconstructed all packages of the set of packages or the information of all packages of received the collection of packages.
  4. Method according to one of the preceding claims, characterized in that the packets are transmitted separately from one another in time.
  5. Method according to claim 4, characterized in that at least a part of reconstruction information for being able to reconstruct the set of packages in step b. and c. and optionally for performing step d. prior to performing step a. or step b. is known by each label.
  6. Method according to claim 4 or 5, characterized in that at least a part of reconstruction information for being able to reconstruct the set of packages in step b. and step c. and optionally for performing step d is predetermined and included in the set of packages.
  7. Method according to claim 5 or 6, characterized in that the reconstruction information comprises: the size of each of the packages, a position of the identification code within each package, an identification code of the package, a time distance between neighboring packages , a sequence of the packages that determines the update information and / or the number of packages in the plurality of packages.
  8. A method according to any one of the preceding claims, characterized in that each label in step b. and in step c. only records information from a complete package.
  9. A method according to any one of the preceding claims, characterized in that the plurality of packets form a message in which the message is repeated in step a.
  10. Method according to at least claim 7, characterized in that each label after receiving at least a part of the set of packages b. attempts to extract the reconstruction information from a received package or from the previously received packages until the reconstruction information has been extracted.
  11. A method according to claim 10, characterized in that:
    each tag, after it has extracted the reconstruction information, uses the reconstruction information to reconstruct the set of packets from the previously in step b. or steps b. registered information if sufficient information has been received for this; and / or each label after it has extracted the reconstruction information in which not enough information has yet been received and registered from the previously performed step b. or steps b. for reconstructing all packages, try to reconstruct all packages in a next step b. upon receiving new information from a new message in combination with previously registered information, wherein each time a next step b. is performed upon receiving a new message until all packets can be reconstructed and reconstructed from the information previously received and the new information received in a subsequent step b .; or each tag after it has extracted the reconstruction information with none of the remaining information received by the tag stored in the tag for reconstructing all packages, trying to reconstruct all packages in a subsequent step b. upon receiving a new message, wherein each time a next step b. is executed upon receiving a new message until all packages can be reconstructed.
  12. Method according to at least claim 5, characterized in that the reconstruction information is also used for performing step d.
  13. A method according to any one of the preceding claims, characterized in that the information for performing an update is included spread over all packages of the set of packages.
  14. A system for performing a method according to any one of the preceding claims, provided with at least one transmitter unit, a control unit connected to the transmitter unit and at least one label, the control unit being arranged to send the set of packages to the transmitter unit for broadcasting the set of packets in step a. and wherein the at least one tag is arranged to include step b., step c. and step d. to execute using a processor.
  15. System according to claim 14, characterized in that the label is arranged to step e. from claim 2.
  16. A system according to claim 15, characterized in that the system is further provided with at least one receiver unit which is communicatively connected to the control unit, the system being arranged to perform a step f. in which the transmitter unit is stopped by the control unit from repeating the sending of the message when the receiver unit of each label of a predetermined group of labels or a predetermined number of labels has received a code that reconstructed all packages or received the information of all packages.
  17. A system according to claim 16, characterized in that the receiver unit and the transmitter unit together form a transceiver.
  18. 18. System as claimed in any of the foregoing claims 14-17, with the
    Characterized in that the at least one transmitter unit forms part of a reader adapted to read a label.
  19. A system according to any one of the preceding claims 14-18, characterized in that the system is provided with a plurality of the labels.
  20. A system according to any one of the preceding claims 14-19, characterized in that the system is provided with a plurality of the transmitter units.
    1/2
    2/2
NL2020967A 2018-05-22 2018-05-22 Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method. NL2020967B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
NL2020967A NL2020967B1 (en) 2018-05-22 2018-05-22 Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method.

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
NL2020967A NL2020967B1 (en) 2018-05-22 2018-05-22 Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method.

Publications (1)

Publication Number Publication Date
NL2020967B1 true NL2020967B1 (en) 2019-11-28

Family

ID=63080432

Family Applications (1)

Application Number Title Priority Date Filing Date
NL2020967A NL2020967B1 (en) 2018-05-22 2018-05-22 Method for wirelessly updating a plurality of labels such as smart labels worn by animals and a system for performing such a method.

Country Status (1)

Country Link
NL (1) NL2020967B1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000072139A2 (en) * 1999-05-20 2000-11-30 Transcept, Inc. Broadcast download technique
EP3076688A1 (en) * 2015-03-31 2016-10-05 Quatro Electronics Limited Wireless broadcasting of configuration data
CN106713047A (en) * 2017-01-12 2017-05-24 泰凌微电子(上海)有限公司 Node upgrading method and system in mesh network
US20180121191A1 (en) * 2016-11-03 2018-05-03 Digi International Inc. System and methods for wireless firmware upgrades using one-way broadcast transmissions

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000072139A2 (en) * 1999-05-20 2000-11-30 Transcept, Inc. Broadcast download technique
EP3076688A1 (en) * 2015-03-31 2016-10-05 Quatro Electronics Limited Wireless broadcasting of configuration data
US20180121191A1 (en) * 2016-11-03 2018-05-03 Digi International Inc. System and methods for wireless firmware upgrades using one-way broadcast transmissions
CN106713047A (en) * 2017-01-12 2017-05-24 泰凌微电子(上海)有限公司 Node upgrading method and system in mesh network
WO2018130071A1 (en) * 2017-01-12 2018-07-19 Telink Semiconductor (Shanghai) Co., Ltd. Node upgrading method and system in mesh network

Similar Documents

Publication Publication Date Title
WO2017126266A1 (en) Methods and device for transmission collision detection and handling in vehicle to everything communication system
EP1851691B1 (en) Radio-frequency identification (rfid) tag employing unique reception window and method therefor
DE60302709T2 (en) Anti-collision method for wireless electronic module
CA2600885C (en) A method and apparatus for determining animal relationships
US6784787B1 (en) Identification system
TWI383636B (en) Bandwidth recovery method for communication system
CA2397235C (en) Collision arbitration method and apparatus for reading multiple radio frequency identification tags
US9479892B2 (en) Method and technical equipment for short range data transmission
EP0522040B1 (en) Locating system
US6231435B1 (en) Electronic method and system for tracking the carcass of a slaughtered animal through a processing plant
EP0285419B1 (en) Access control equipment
DE69531569T2 (en) System for storing and transferring information
USRE41562E1 (en) System and method for electronic tracking of units associated with a batch
US20140310530A1 (en) Message authentication method in communication system and communication system
EP0646313A1 (en) Internal type individual identification apparatus for animals
EP1714547A1 (en) Method and device for providing at least one information on the occupancy of a milking stall in a milking parlor
US20060145815A1 (en) System and method for relaying RFID data
KR20100011711A (en) Methods of identifying rfid tag for preventing rfid tag collision, rfid reader and rfid tag using the same
KR100784256B1 (en) Non contact type integrated circuit card and method for communicating data by multiprotocol
US20050127180A1 (en) Contactless identification tag, data communication system and contactless identification tag control program
JP2006060310A (en) Reader/writer and rfid system
EP1503222B1 (en) Method for selecting one or more transponders
EP1447681B1 (en) System for determining a position of a moving transponder
EP1738297B1 (en) Method for selecting one or several transponders
KR100957900B1 (en) Remote updating system for elevator control programs