WO2001033721A2 - Transmission de donnees d'un recepteur inactif par moments - Google Patents

Transmission de donnees d'un recepteur inactif par moments Download PDF

Info

Publication number
WO2001033721A2
WO2001033721A2 PCT/DE2000/003811 DE0003811W WO0133721A2 WO 2001033721 A2 WO2001033721 A2 WO 2001033721A2 DE 0003811 W DE0003811 W DE 0003811W WO 0133721 A2 WO0133721 A2 WO 0133721A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
waiting time
time
address
receiver
Prior art date
Application number
PCT/DE2000/003811
Other languages
German (de)
English (en)
Other versions
WO2001033721A3 (fr
Inventor
Dietmar Braeuer
Uwe Altenburg
Hans-Juergen Krieger
Original Assignee
Wincor Nixdorf Gmbh & Co. Kg
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 Wincor Nixdorf Gmbh & Co. Kg filed Critical Wincor Nixdorf Gmbh & Co. Kg
Publication of WO2001033721A2 publication Critical patent/WO2001033721A2/fr
Publication of WO2001033721A3 publication Critical patent/WO2001033721A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the invention relates to the transmission of data from one
  • Transmitter to one or more receivers, the receiving device of which is temporarily inactive, in particular to protect batteries.
  • the object of the invention is therefore to provide a solution in which the receiving circuit can be switched off for the most part and yet any display can be changed simply and reliably at flexibly selectable times.
  • the invention uses the knowledge that a relative waiting time, during which the receiving circuit can be deactivated, can be contained in the data packets both explicitly and implicitly, and it is only necessary that this waiting time can be determined as easily as possible and none during the waiting time of the transmitter sends relevant data.
  • two different solutions are given, which are optimally combined, but can also be used individually.
  • waiting packets are sent in which the time until the time of the next data transmission is encoded. Logically, these times are monotonously falling until the time is reached. A recipient only needs to receive any of these packets and can then deactivate them for the time specified in them.
  • the receiver deactivates its receiving circuit for the remaining time, in which in particular the user data of the group are sent.
  • Fig. 2 shows the structure of a receiver
  • Price labeling ('electronic shelf label', ESL) described.
  • ESL Electronic shelf label', ESL
  • a system as indicated in FIG. 1, consists of a transmitter 10 with an antenna 11.
  • ESL Electronic shelf label'
  • a transmitter 10 with an antenna 11.
  • electromagnetic waves in the range of 868 or 915 MHz released for this are used; other frequencies, including infrared light, can also be used without any problems.
  • FIG. 2 shows the components of a typical price display 20. Visible is the display 21, which is preferably implemented using LCD technology. This includes a display driver 22 which carries out the necessary control and permanently displays the data transmitted via the connection 29. These displays are generally known in versions with low power consumption, in particular from watches. Both are therefore permanently connected to a battery 23; a possibly provided main switch is not shown.
  • a timer 24, which operates a, preferably electronic, switch 25 is also permanently supplied by the battery.
  • the switch switches the power supply for the reception controller 26 and the receiver 27 on and off.
  • the reception controller 26 is preferably a microcontroller, as is generally known in various versions. Relevant microcontrollers typically have one or more power saving modes that are included in the invention can be used appropriately. Versions with built-in time control are also known, which can also be used in energy-saving mode and are then used instead of the time control 24 shown separately in FIG. 2.
  • the timer 24 normally receives a time value from the microcontroller 26. With the transfer of the same, the switch 25 is opened and the time value is loaded into a register which is counted with clock signals. When a predetermined counter reading, in particular zero, is reached, the switch 25 is closed again. The switch is opened and closed in a known manner, which can be found in the data sheets and application descriptions of the microcontrollers, in such a way that the microcontroller is stopped in a defined manner (and then switched off, if necessary) and starts its work again in a defined manner after the set time.
  • a timer 24 is certainly also possible, in which a capacitor is charged to a voltage that can be determined by the microcontroller 26 and thus an adjustable time is reached.
  • Both the receiver 27 and the microcontroller 26 are switched on and off with the switch 25. If necessary, the microcontroller 26 can also be switched off if it is Power consumption compared to that of the recipient is negligible.
  • An antenna 28 shown symbolically in FIG. 2 is connected to the receiver 27.
  • This antenna 28 is to be designed according to the reception area used and according to the state of the art; in the 868 or 915 MHz range, for example as a planar antenna, which can be integrated on printed circuit boards.
  • the first character identifies the type of data block.
  • the character "W" specifies that a waiting time follows, that is, a global waiting package is available.
  • This waiting time is preferably specified in a predetermined unit, for example milliseconds or the period of a 32768 Hz crystal.
  • additional digits before or after time can be used to encode a selection of units, or a logarithmic measure can be used.
  • the time control is expediently designed such that the microcontroller switches on the receiver and manages the logarithmic time coding.
  • the maximum waiting time is 2 seconds.
  • the sender informs the recipients of the relative time of the next data transmission.
  • the sender simultaneously announces that no relevant data blocks have been sent before this point in time.
  • a receiver that receives such a waiting packet can then switch to a power saving mode for the time specified therein and in particular switch off its receiver circuit.
  • This waiting packet is sent repeatedly and preferably in close succession to the transmitter, the waiting times contained in subsequent waiting packets being reduced by the past time. It is therefore irrelevant when a recipient activates to determine the time of the next data transmission. In particular, a newly added recipient can wait at any time determine. By specifying the time as the relative time to the respective time of transmission, an absolute time is not necessary.
  • new waiting packets are sent that contain a new waiting time. This is the case when no user data have to be sent to the recipients. Is the maximum waiting time e.g. 2 sec, but the average time between two changes is one hour, so in the majority of cases a waiting packet will be sent again. Furthermore, all previously active receivers will then go into the inactive state with the first new waiting package, so that the subsequent waiting packages appear to be superfluous. However, it is clear that a high degree of reliability is achieved in this way, especially for new receivers.
  • the waiting time can be set to the maximum codable value and then reduced in each waiting packet, so that all receivers leave the waiting state synchronously and receive a new maximally coded waiting packet until the envisaged total waiting time is exhausted except for a remainder that can be coded.
  • only waiting packets of the maximum codable waiting time can be sent, in which the coded waiting time is not with everyone Package is decreased. If a data transmission is pending, the following waiting packets are sent with a decreasing waiting time until the planned transmission time for data blocks is reached.
  • the transmission time for data blocks is reached, e.g. to transfer a new price for a price display.
  • the transmitter then begins sending data blocks, which are identified, for example, by the letter "D" in the first place.
  • This is followed in a known manner by the recipient address, i.e. the price tag number and the price to be displayed.
  • These data blocks are sent with the respective recipient number concerned as long as price changes are to be entered.
  • the transmission of waiting packets begins again, so that the receivers can go back to the power saving mode.
  • the alternative embodiment of the invention also allows the receiver to recognize that for one of the Recipient easily determinable time no data intended for the recipient are to be expected.
  • the preferred embodiment of this variant of the invention transmits the addresses and data in groups, e.g. consist of sixteen addresses and associated user data.
  • An optimal variant consists in first transferring the addresses and then in the order of the addresses the user data. If the recipient does not find his address in the addresses, he can switch off the recipient for the rest of the group. This is facilitated if, as preferred, the useful data have a fixed length, so that the entire data block of a group of addresses takes a predetermined time.
  • the addresses used in each group are always larger than the addresses in the previous groups. For example, the
  • a closer look reveals that both variants have in common that the waiting time is fixed before the start of the user data associated with the first address. This also applies if variable long user data are used in which the length of the user data is transmitted before the user data, in particular by means of a field for the user data length in the data block. In the case of sorted transmission, the address must also be sent here, which either has a fixed length or is delimited by a closing character. Since the first address must be received in full anyway, an end sign is possible. Before or after, the total length of the group block is transmitted in coded form. The waiting time can be calculated from this using the data rate.
  • a further improvement is possible by alternately using ascending and descending sorting. For example, if addresses 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14 are sent in groups of four, the following groups are sent: 4, 1, 2, 3, 10, 7, 8, 9 14, 11, 12, 13
  • the sorting term is reversed in the next series of data blocks, i.e. The following groups are sent after the next waiting time:
  • the transmitter is useful in any one
  • a common sorting of all data packets within a shipment has the advantage of further improvement. This applies if not all recipients are always addressed, as is usually the case. As soon as, for example, ascending sorting all addresses of a data packet are larger than your own address, all subsequent data packets are of no importance until the next waiting packet. If the second address is the smallest in the package, the recipient needs only evaluate the first two; It is therefore expedient to send all addresses first. In this development, the waiting time until the next broadcast is included in the data packet. The sender, who knows the number of receivers to be addressed, can determine this before sending out the first data packet and can then record the waiting time accordingly in the data packet as an additional field.
  • the maximum waiting time is encoded in the sense of the first embodiment of the invention above; after the expiry, the recipient immediately finds a data packet whose addresses all exceed their own, takes the waiting time and returns to the waiting state. Otherwise, as described above for waiting packets, the maximum codable waiting time can first be sent in the data blocks if this is before the planned end of the transmission of all pending data blocks, and the waiting time is only coded towards the end. In this way, a nesting of both variants is possible, in which two waiting times are usually coded; firstly, until the next data block in a group and secondly, until the end of the transmission of a sequence of data blocks.
  • a previously less attractive variant uses a grouping based on other criteria, for example the last or the first bits of the address, generally by means of a bit mask instead of a full sorting of the addresses.
  • the total length and the selection mask for the group are transmitted after the identifier for the data block of a group.
  • the recipient masks his own address and calculates the waiting time from the total length if the masking shows that its own address is not affected.
  • the selection criterion can be designed to be of any complexity, for example also as regular expressions or a program code (byte code) which is interpreted or executed by the microcontroller. However, this complexity has so far not been required when applied to price tags.
  • sorting is to be understood in this general sense, according to which a sorting determines an order of a predetermined type in the set of addresses. Otherwise, the total length is nothing more than an encoding of the waiting time that the receiver must wait at least before data relevant to him are sent. Instead of the length in bits or bytes, a waiting time can therefore also be explicitly specified in a previously agreed unit or in a unit introduced or added to the number.
  • the receiver determines a waiting time in each case from the data block sent. This can be explicit and can be significantly longer than the transmission time of the data block if there are waiting packets. Or it can correspond to the length of the data block if it does not need to be observed based on a criterion sent at the beginning of the data block.
  • the data record indicator “T” for a waiting packet effectively represents a selection criterion “for all”.
  • the one of the recipient of the data set Selection code which is evaluated as 'waiting' or 'not waiting' and takes a waiting time and waits for the waiting time when the selection code is evaluated as 'waiting', the waiting time, depending on the selection code, if necessary, implicitly, ie predetermined, or can be explicitly coded.
  • the previous description used a transmission method in which whole characters with a fixed number of bits, in particular 8-bit bytes, were always transmitted and therefore the asynchronous method comes into question.
  • the waiting blocks are also distinguished from the data blocks by the first character in order to enable a quick decision.
  • the address zero or another reserved address can serve as an indicator that it is a waiting block.
  • an alternative transmission method is, in particular, phase coding or the HDLC method, which are self-clocking and allow better utilization of the channel capacity.
  • Frame formats are also possible here, in which the data are divided into groups of bits of different widths, and in particular by means of the first bit, after a possibly necessary preamble, a distinction is made between waiting blocks and those with addresses and user data. The selection the transmission method therefore depends essentially on the technical conditions in the transmitter and the receiver and influences the application of the present invention only marginally.

Abstract

L'invention concerne une transmission de données numériques par l'envoi de paquets de données d'un émetteur à au moins un récepteur dont le dispositif de réception est inactif par moments. L'émetteur envoie un paquet de données à partir duquel le récepteur peut déterminer un temps d'attente qui succède immédiatement au paquet de données et pendant lequel aucune donnée le concernant ne peut être envoyée. Le récepteur détermine le temps d'attente à partir du paquet de données et juste après désactive son dispositif de réception pendant la durée de ce temps d'attente.
PCT/DE2000/003811 1999-11-03 2000-10-27 Transmission de donnees d'un recepteur inactif par moments WO2001033721A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19952840A DE19952840A1 (de) 1999-11-03 1999-11-03 Datenübertragung für zeitweise inaktive Empfänger
DE19952840.3 1999-11-03

Publications (2)

Publication Number Publication Date
WO2001033721A2 true WO2001033721A2 (fr) 2001-05-10
WO2001033721A3 WO2001033721A3 (fr) 2001-12-13

Family

ID=7927744

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2000/003811 WO2001033721A2 (fr) 1999-11-03 2000-10-27 Transmission de donnees d'un recepteur inactif par moments

Country Status (2)

Country Link
DE (1) DE19952840A1 (fr)
WO (1) WO2001033721A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2012549A1 (fr) * 2006-04-21 2009-01-07 NTT DoCoMo, Inc. Procede de planification de paquet, station de base et station mobile dans un systeme de communication mobile
US8014748B2 (en) 2004-10-15 2011-09-06 Infineon Technologies Ag Communication system having a communication device

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102009029783B4 (de) * 2009-06-18 2016-02-04 Atmel Corp. Schaltung und Verfahren zum Betrieb eines Knotens in einem Funknetz

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5504475A (en) * 1990-02-16 1996-04-02 Sitour Electronic Systems Pricing display system
EP0921460A2 (fr) * 1997-11-13 1999-06-09 NCR International, Inc. Méthode de réduction de la consommation d'énergie dans une étiquette électronique de prix

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5504475A (en) * 1990-02-16 1996-04-02 Sitour Electronic Systems Pricing display system
EP0921460A2 (fr) * 1997-11-13 1999-06-09 NCR International, Inc. Méthode de réduction de la consommation d'énergie dans une étiquette électronique de prix

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8014748B2 (en) 2004-10-15 2011-09-06 Infineon Technologies Ag Communication system having a communication device
EP2012549A1 (fr) * 2006-04-21 2009-01-07 NTT DoCoMo, Inc. Procede de planification de paquet, station de base et station mobile dans un systeme de communication mobile
EP2012549A4 (fr) * 2006-04-21 2012-12-26 Ntt Docomo Inc Procede de planification de paquet, station de base et station mobile dans un systeme de communication mobile

Also Published As

Publication number Publication date
WO2001033721A3 (fr) 2001-12-13
DE19952840A1 (de) 2001-05-23

Similar Documents

Publication Publication Date Title
DE4439074C2 (de) Anlage zur elektronischen Preisanzeige
DE69334175T2 (de) Multimode-identifizierungssystem
DE4002801C1 (fr)
EP1738297B1 (fr) Procede de selection d'un ou plusieurs transpondeurs
DE3305685C2 (de) Kennmarke für eine Kommunikationsvorrichtung sowie Kommunikationsvorrichtung und Kommunikationssystem
DE60008414T2 (de) Verfahren zur identifikation elektronischen etiketten mit adaptiven runden
EP1376272B1 (fr) Méthode et dispositif pour l'enregistrement de temps lors de grandes manifestations sportives
DE2202865A1 (de) Elektronischer taxameter
DE1474062B2 (de) Datenverarbeitungsanlage mit einer anzahl von pufferspeichern
WO2001043350A2 (fr) Ligne hertzienne et procede d'utilisation
EP1254426B1 (fr) Procede de suivi d'envois
CH705647B1 (de) RFID-Druckproduktidentifikation.
EP0029560A1 (fr) Procédé pour détecter et compter des objets
DD292722A5 (de) Kennzeichnungssystem fuer viehzuchtfarmen
DE60130816T2 (de) RFID-Transponder
DE1813319C3 (de) Vorrichtung zum Erkennen von im Bereich einer Abfrageeinrichtung befindlichen Fahrzeugen
WO2001033721A2 (fr) Transmission de donnees d'un recepteur inactif par moments
DE10221424B4 (de) Sende- und Empfangsanordnung mit kanalorientierter Verbindung
DE60125173T2 (de) Speichereinrichtung
DE2502103A1 (de) Automatische maschine zur ausgabe von ausweisen
EP0905916B1 (fr) Procédé et système pour la transmission de données dans un système de contrôle de pression pour véhicule à moteur
DE2730321C2 (de) Steuersystem für ein Münzspielgerät
DE1499170C3 (de) Datenverarbeitungsanlage
DE102018125202B3 (de) Datenübertragungsverfahren
DE60036455T2 (de) Verfahren und Einrichtung zur Reduzierung der Datenkommunikation in einem RDS TMC System

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): CA CN CZ HU JP KR MX NO RU US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: A3

Designated state(s): CA CN CZ HU JP KR MX NO RU US

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP