US20010043569A1 - Method of addressing messages, method of establishing wireless communications, and communications system - Google Patents
Method of addressing messages, method of establishing wireless communications, and communications system Download PDFInfo
- Publication number
- US20010043569A1 US20010043569A1 US09/773,461 US77346101A US2001043569A1 US 20010043569 A1 US20010043569 A1 US 20010043569A1 US 77346101 A US77346101 A US 77346101A US 2001043569 A1 US2001043569 A1 US 2001043569A1
- Authority
- US
- United States
- Prior art keywords
- devices
- interrogator
- random values
- reply
- specified group
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 67
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000004044 response Effects 0.000 claims description 7
- 230000006870 function Effects 0.000 description 14
- 230000005540 biological transmission Effects 0.000 description 6
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000002184 metal Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/0008—General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
- G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
- G06K7/10039—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot interrogator driven, i.e. synchronous
- G06K7/10049—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot interrogator driven, i.e. synchronous binary tree
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/04—Scheduled access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/005—Discovery of network devices, e.g. terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
Definitions
- This invention relates to communications protocols and to digital data communications. Still more particularly, the invention relates to data communications protocols in mediums such as radio communication or the like. The invention also relates to radio frequency identification devices for inventory control, object monitoring, determining the existence, location or movement of objects, or for remote automated payment.
- Communications protocols are used in various applications. For example, communications protocols can be used in electronic identification systems. As large numbers of objects are moved in inventory, product manufacturing, and merchandising operations, there is a continuous challenge to accurately monitor the location and flow of objects. Additionally, there is a continuing goal to interrogate the location of objects in an inexpensive and streamlined manner. One way of tracking objects is with an electronic identification system.
- an identification device may be provided with a unique identification code in order to distinguish between a number of different devices.
- the devices are entirely passive (have no power supply), which results in a small and portable package.
- identification systems are only capable of operation over a relatively short range, limited by the size of a magnetic field used to supply power to the devices and to communicate with the devices.
- Another wireless electronic identification system utilizes a large active transponder device affixed to an object to be monitored which receives a signal from an interrogator. The device receives the signal, then generates and transmits a responsive signal.
- the interrogation signal and the responsive signal are typically radio-frequency (RF) signals produced by an RF transmitter circuit.
- RF radio-frequency
- Electronic identification systems can also be used for remote payment.
- the toll booth can determine the identity of the radio frequency identification device, and thus of the owner of the device, and debit an account held by the owner for payment of toll or can receive a credit card number against which the toll can be charged.
- remote payment is possible for a variety of other goods or services.
- a communication system typically includes two transponders: a commander station or interrogator, and a responder station or transponder device which replies to the interrogator.
- the interrogator If the interrogator has prior knowledge of the identification number of a device which the interrogator is looking for, it can specify that a response is requested only from the device with that identification number. Sometimes, such information is not available. For example, there are occasions where the interrogator is attempting to determine which of multiple devices are within communication range.
- the interrogator sends a message to a transponder device requesting a reply
- the interrogator sends out a command requesting that all devices within a communications range identify themselves, and gets a large number of simultaneous replies, the interrogator may not be able to interpret any of these replies.
- arbitration schemes are employed to permit communications free of collisions.
- the interrogator sends a command causing each device of a potentially large number of responding devices to select a random number from a known range and use it as that device's arbitration number.
- the interrogator determines the arbitration number of every responder station capable of communicating at the same time. Therefore, the interrogator is able to conduct subsequent uninterrupted communication with devices, one at a time, by addressing only one device.
- Aloha Another arbitration scheme is referred to as the Aloha or slotted Aloha scheme.
- This scheme is discussed in various references relating to communications, such as Digital Communications: Fundamentals and Applications, Bernard Sklar, published January 1988 by Prentice Hall.
- a device will respond to an interrogator using one of many time domain slots selected randomly by the device.
- a problem with the Aloha scheme is that if there are many devices, or potentially many devices in the field (i.e. in communications range, capable of responding) then there must be many available slots or many collisions will occur. Having many available slots slows down replies. If the magnitude of the number of devices in a field is unknown, then many slots are needed. This results in the system slowing down significantly because the reply time equals the number of slots multiplied by the time period required for one reply.
- the invention provides a wireless identification device configured to provide a signal to identify the device in response to an interrogation signal.
- Another aspect of the invention provides a method of establishing wireless communications between an interrogator and individual ones of multiple wireless identification devices.
- a tree search method is utilized to establish communications without collision between the interrogator and individual ones of the multiple wireless identification devices.
- a search tree is defined for the tree search method. The tree has multiple levels representing subgroups of the multiple wireless identification devices. The number of devices in a subgroup in one level is half of the number of devices in the next higher level.
- the tree search method employs level skipping wherein at least one level of the tree is skipped.
- Another aspect of the invention provides a communications system comprising an interrogator, and a plurality of wireless identification devices configured to communicate with the interrogator in a wireless fashion.
- the respective wireless identification devices have a unique identification number.
- the interrogator is configured to employ a tree search technique to determine the unique identification numbers of the different wireless identification devices so as to be able to establish communications between the interrogator and individual ones of the multiple wireless identification devices without collision by multiple wireless identification devices attempting to respond to the interrogator at the same time. Levels of the tree are occasionally skipped.
- One aspect of the invention provides a radio frequency identification device comprising an integrated circuit including a receiver, a transmitter, and a microprocessor.
- the integrated circuit is a monolithic single die single metal layer integrated circuit including the receiver, the transmitter, and the microprocessor.
- the device of this embodiment includes an active transponder, instead of a transponder which relies on magnetic coupling for power, and therefore has a much greater range.
- FIG. 1 is a high level circuit schematic showing an interrogator and a radio frequency identification device embodying the invention.
- FIG. 2 is a front view of a housing, in the form of a badge or card, supporting the circuit of FIG. 1 according to one embodiment the invention.
- FIG. 3 is a front view of a housing supporting the circuit of FIG. 1 according to another embodiment of the invention.
- FIG. 4 is a diagram illustrating a tree splitting sort method for establishing communication with a radio frequency identification device in a field of a plurality of such devices.
- FIG. 5. is a diagram illustrating a modified tree splitting sort method for establishing communication with a radio frequency identification device in a field of a plurality of such devices.
- FIG. 1 illustrates a wireless identification device 12 in accordance with one embodiment of the invention.
- the wireless identification device is a radio frequency data communication device 12 , and includes RFID circuitry 16 .
- the RFID circuitry is defined by an integrated circuit as described in the above-incorporated patent application Ser. No. 08/705,043, filed Aug. 29, 1996. Other embodiments are possible.
- a power source 18 is connected to the integrated circuit 16 to supply power to the integrated circuit 16 .
- the power source 18 comprises a battery.
- the device 12 further includes at least one antenna 14 connected to the circuitry 16 for wireless or radio frequency transmission and reception by the circuitry 16 .
- the device 12 transmits and receives radio frequency communications to and from an interrogator 26 .
- An exemplary interrogator is described in commonly assigned U.S. patent application Ser. No. 08/907,689, filed Aug. 8, 1997 and incorporated herein by reference.
- the interrogator 26 includes an antenna 28 , as well as dedicated transmitting and receiving circuitry, similar to that implemented on the integrated circuit 16 .
- the interrogator 26 transmits an interrogation signal or command 27 via the antenna 28 .
- the device 12 receives the incoming interrogation signal via its antenna 14 .
- the device 12 responds by generating and transmitting a responsive signal or reply 29 .
- the responsive signal 29 typically includes information that uniquely identifies, or labels the particular device 12 that is transmitting, so as to identify any object or person with which the device 12 is associated.
- FIG. 1 Although only one device 12 is shown in FIG. 1, typically there will be multiple devices 12 that correspond with the interrogator 26 , and the particular devices 12 that are in communication with the interrogator 26 will typically change over time. In the illustrated embodiment in FIG. 1, there is no communication between multiple devices 12 . Instead, the devices 12 respectively communicate with the interrogator 26 . Multiple devices 12 can be used in the same field of an interrogator 26 (i.e., within communications range of an interrogator 26 ). Similarly, multiple interrogators 26 can be in proximity to one or more of the devices 12 .
- the radio frequency data communication device 12 can be included in any appropriate housing or packaging. Various methods of manufacturing housings are described in commonly assigned U.S. patent application Ser. No. 08/800,037, filed Feb. 13, 1997, and incorporated herein by reference.
- FIG. 2 shows but one embodiment in the form of a card or badge 19 including the radio frequency data communication device 12 , and a housing 11 including plastic or other suitable material.
- the front face of the badge has visual identification features such as graphics, text, information found on identification or credit cards, etc.
- FIG. 3 illustrates but one alternative housing supporting the device 12 . More particularly, FIG. 3 shows a miniature housing 20 encasing the device 12 to define a tag which can be supported by an object (e.g., hung from an object, affixed to an object, etc.). Although two particular types of housings have been disclosed, the device 12 can be included in any appropriate housing.
- the battery 18 can take any suitable form.
- the battery type will be selected depending on weight, size, and life requirements for a particular application.
- the battery 18 is a thin profile button-type cell forming a small, thin energy cell more commonly utilized in watches and small electronic devices requiring a thin profile.
- a conventional button-type cell has a pair of electrodes, an anode formed by one face and a cathode formed by an opposite face.
- the power source 18 comprises a series connected pair of button type cells.
- any suitable power source can be employed.
- the circuitry 16 further includes a backscatter transmitter and is configured to provide a responsive signal to the interrogator 26 by radio frequency. More particularly, the circuitry 16 includes a transmitter, a receiver, and memory such as is described in U.S. patent application Ser. No. 08/705,043.
- Radio frequency identification has emerged as a viable and affordable alternative to tagging or labeling small to large quantities of items.
- the interrogator 26 communicates with the devices 12 via an RF link, so all transmissions by the interrogator 26 are heard simultaneously by all devices 12 within range.
- the interrogator 26 sends out a command requesting that all devices 12 within range identify themselves, and gets a large number of simultaneous replies, the interrogator 26 may not be able to interpret any of these replies. Therefore, arbitration schemes are provided.
- the interrogator 26 If the interrogator 26 has prior knowledge of the identification number of a device 12 which the interrogator 26 is looking for, it can specify that a response is requested only from the device 12 with that identification number. To target a command at a specific device 12 , (i.e., to initiate point-on-point communication), the interrogator 26 must send a number identifying a specific device 12 along with the command. At start-up, or in a new or changing environment, these identification numbers are not known by the interrogator 26 . Therefore, the interrogator 26 must identify all devices 12 in the field (within communication range) such as by determining the identification numbers of the devices 12 in the field. After this is accomplished, point-to-point communication can proceed as desired by the interrogator 26 .
- RFID systems are a type of multiaccess communication system.
- the distance between the interrogator 26 and devices 12 within the field is typically fairly short (e.g., several meters), so packet transmission time is determined primarily by packet size and baud rate. Propagation delays are negligible.
- RFID systems there is a potential for a large number of transmitting devices 12 and there is a need for the interrogator 26 to work in a changing environment, where different devices 12 are swapped in and out frequently (e.g., as inventory is added or removed).
- the inventors have determined that the use of random access methods work effectively for contention resolution (i.e., for dealing with collisions between devices 12 attempting to respond to the interrogator 26 at the same time).
- RFID systems have some characteristics that are different from other communications systems.
- one characteristic of the illustrated RFID systems is that the devices 12 never communicate without being prompted by the interrogator 26 . This is in contrast to typical multiaccess systems where the transmitting units operate more independently.
- contention for the communication medium is short lived as compared to the ongoing nature of the problem in other multiaccess systems.
- the interrogator can communicate with them in a point-to-point fashion.
- arbitration in a RFID system is a transient rather than steady-state phenomenon.
- the capability of a device 12 is limited by practical restrictions on size, power, and cost. The lifetime of a device 12 can often be measured in terms of number of transmissions before battery power is lost. Therefore, one of the most important measures of system performance in RFID arbitration is total time required to arbitrate a set of devices 12 . Another measure is power consumed by the devices 12 during the process. This is in contrast to the measures of throughput and packet delay in other types of multiaccess systems.
- FIG. 4 illustrates one arbitration scheme that can be employed for communication between the interrogator and devices 12 .
- the interrogator 26 sends a command causing each device 12 of a potentially large number of responding devices 12 to select a random number from a known range and use it as that device's arbitration number.
- the interrogator 26 determines the arbitration number of every responder station capable of communicating at the same time. Therefore, the interrogator 26 is able to conduct subsequent uninterrupted communication with devices 12 , one at a time, by addressing only one device 12 .
- AVALUE arbitration value
- AMASK arbitration mask
- RV random value ID
- the interrogator sends an Identify command (IdentifyCmnd) causing each device of a potentially large number of responding devices to select a random number from a known range and use it as that device's arbitration number.
- the interrogator sends an arbitration value (AVALUE) and an arbitration mask (AMASK) to a set of devices 12 .
- bits are used for AVALUE and AMASK.
- Other numbers of bits can also be employed depending, for example, on the number of devices 12 expected to be encountered in a particular application, on desired cost points, etc.
- the interrogator sets AVALUE to 0000 (or “don't care” for all bits, as indicated by the character “X” in FIG. 4) and AMASK to 0000.
- the interrogator transmits a command to all devices 12 requesting that they identify themselves.
- AMASK is 0000 and anything bitwise ANDed with all zeros results in all zeros, so both the devices 12 in the field respond, and there is a collision.
- the interrogator sets AMASK to 0001 and AVALUE to 0000 and transmits an identify command.
- the left side equals the right side, so the equation is true for the device 12 with the random value of 1100.
- the left side equals the right side, so the equation is true for the device 12 with the random value of 1010. Because the equation is true for both devices 12 in the field, both devices 12 in the field respond, and there is another collision.
- the interrogator next sets AMASK to 0011 with AVALUE still at 0000 and transmits an Identify command.
- the left side equals the right side, so the equation is true for the device 12 with the random value of 1100, so this device 12 responds.
- the left side does not equal the right side, so the equation is false for the device 12 with the random value of 1010, and this device 12 does not respond. Therefore, there is no collision, and the interrogator can determine the identity (e.g., an identification number) for the device 12 that does respond.
- the right side equals the left side, so the equation is true for the device 12 with the random value of 1010. Because there are no other devices 12 in the subtree, a good reply is returned by the device 12 with the random value of 1010. There is no collision, and the interrogator can determine the identity (e.g., an identification number) for the device 12 that does respond.
- identity e.g., an identification number
- recursion what is meant is that a function makes a call to itself. In other words, the function calls itself within the body of the function. After the called function returns, de-recursion takes place and execution continues at the place just after the function call; i.e. at the beginning of the statement after the function call.
- Arbitrate(AMASK, AVALUE) ⁇ collision IdentifyCmnd(AMASK, AVALUE) if (collision) then ⁇ /* recursive call for left side */ Arbitrate((AMASK ⁇ 1)+1, AVALUE) /* recursive call for right side */ Arbitrate((AMASK ⁇ 1)+1, AVALUE +(AMASK+1)) ⁇ /* endif */ ⁇ /* return */
- the routine generates values for AMASK and AVALUE to be used by the interrogator in an identify command “IdentifyCmnd.” Note that the routine calls itself if there is a collision. De-recursion occurs when there is no collision. AVALUE and AMASK would have values such as the following assuming collisions take place all the way down to the bottom of the tree. AVALUE AMASK 0000 0000 0001 0000 0011 0000 0111 0000 1111* 1000 1111* 0100 0111 0100 1111* 1100 1111*
- This method is referred to as a splitting method. It works by splitting groups of colliding devices 12 into subsets that are resolved in turn.
- the splitting method can also be viewed as a type of tree search. Each split moves the method one level deeper in the tree.
- Either depth-first or breadth-first traversals of the tree can be employed. Depth first traversals are performed by using recursion, as is employed in the code listed above. Breadth-first traversals are accomplished by using a queue instead of recursion. The following is an example of code for performing a breadth-first traversal.
- AVALUE and AMASK would have values such as those indicated in the following table for such code.
- FIG. 5 illustrates an embodiment wherein levels in the tree are skipped.
- the inventors have determined that skipping levels in the tree, after a collision caused by multiple devices 12 responding, reduces the number of subsequent collisions without adding significantly to the number of no replies.
- Level skipping reduces the number of collisions, both reducing arbitration time and conserving battery life on a set of devices 12 .
- FIG. 5 illustrates a binary search tree 32 being defined for a tree search method similar to the tree search method described in connection with FIG. 4.
- the tree 32 has multiple levels 34 , 36 , 38 , 40 , and 42 representing subgroups of the multiple devices 12 .
- the number of devices in a subgroup in one level 34 , 36 , 38 , 40 , and 42 is half of the number of devices in the next higher level 34 , 36 , 38 , 40 , and 42 .
- the tree search method illustrated in FIG. 5 employs level skipping wherein at least one level of the tree is skipped.
- a first predetermined number of bits e.g. sixteen or an integer multiple of eight or sixteen bits, are established to be used as unique identification numbers.
- Respective devices 12 are provided with unique identification numbers respectively having the first predetermined number of bits, in addition to their random values RV. For example, such unique identification numbers are stored in memory in the respective devices 12 .
- a second predetermined number of bits are established to be used for the random values RV.
- the devices 12 are caused to select random values, RV. This is done, for example, by the interrogator 26 sending an appropriate command. Respective devices choose random values independently of random values selected by the other devices 12 . Random number generators are known in the art.
- the interrogator transmits a command requesting devices 12 having random values RV within a specified group of random values to respond, using a methodology similar to that described in connection with FIG. 4, except that levels are skipped.
- Four subsets of random values, instead of two, are probed when moving down the tree and skipping a level. This means that instead of eliminating half of the remaining devices 12 and re-trying, after a collision, the interrogator eliminates three quarters of the remaining devices 12 and re-tries (by sending a command). In other words, a new specified group is created that is one quarter of the set of random values of the previous group.
- the reply includes the random value of the replying device 12 and the unique identification number of the device 12 .
- the interrogator determines if a collision occurred between devices that sent a reply and, if so, creates a new, smaller, specified group, by moving down the tree, skipping a level.
- every other level is skipped. In alternative embodiments, more than one level is skipped each time.
- skipping levels reduces the number of collisions, thus saving battery power in the devices 12 . Skipping deeper (skipping more than one level) further reduces the number of collisions. The more levels that are skipped, the greater the reduction in collisions. However, skipping levels results in longer search times because the number of queries (Identify commands) increases. The more levels that are skipped, the longer the search times. The inventors have determined that skipping just one level has an almost negligible effect on search time, but drastically reduces the number of collisions. If more than one level is skipped, search time increases substantially.
- the interrogator 26 can send a command individually addressed to that device by using its now known random value or its now known unique identification number.
- the above described code for depth-first traversal is modified to provide for level skipping by increasing the number of recursive calls as shown below.
- the above described code for depth-first traversal is replaced with code such as the following to provide for depth-first traversal employing level skipping.
- AVALUE and AMASK would have values such as those indicated in the following table for such code.
- the code provided above for breadth-first traversal can be readily modified to employ level skipping. Instead of inserting two items into the queue each time through the loop, four items are inserted into the queue each time through the loop.
- AMASK will be shifted by two bits instead of one, and AVALUE will take on twice as many different values as in the case where level skipping is not employed.
- Aloha Another arbitration method that can be employed is referred to as the “Aloha” method.
- Aloha every time a device 12 is involved in a collision, it waits a random period of time before retransmitting. This method can be improved by dividing time into equally sized slots and forcing transmissions to be aligned with one of these slots. This is referred to as “slotted Aloha.”
- the interrogator asks all devices 12 in the field to transmit their identification numbers in the next time slot. If the response is garbled, the interrogator informs the devices 12 that a collision has occurred, and the slotted Aloha scheme is put into action. This means that each device 12 in the field responds within an arbitrary slot determined by a randomly selected value. In other words, in each successive time slot, the devices 12 decide to transmit their identification number with a certain probability.
- the Aloha method is based on a system operated by the University of Hawaii. In 1971 , the University of Hawaii began operation of a system named Aloha.
- a communication satellite was used to interconnect several university computers by use of a random access protocol.
- the system operates as follows. Users or devices transmit at any time they desire. After transmitting, a user listens for an acknowledgment from the receiver or interrogator. Transmissions from different users will sometimes overlap in time (collide), causing reception errors in the data in each of the contending messages. The errors are detected by the receiver, and the receiver sends a negative acknowledgment to the users. When a negative acknowledgment is received, the messages are retransmitted by the colliding users after a random delay. If the colliding users attempted to retransmit without the random delay, they would collide again. If the user does not receive either an acknowledgment or a negative acknowledgment within a certain amount of time, the user “times out” and retransmits the message.
- slotted Aloha There is a scheme known as slotted Aloha which improves the Aloha scheme by requiring a small amount of coordination among stations.
- a sequence of coordination pulses is broadcast to all stations (devices).
- packet lengths are constant. Messages are required to be sent in a slot time between synchronization pulses, and can be started only at the beginning of a time slot. This reduces the rate of collisions because only messages transmitted in the same slot can interfere with one another.
- the retransmission mode of the pure Aloha scheme is modified for slotted Aloha such that if a negative acknowledgment occurs, the device retransmits after a random delay of an integer number of slot times.
- an Aloha method is combined with level skipping, such as the level skipping shown and described in connection with FIG. 5.
- devices 12 sending a reply to the interrogator 26 do so within a randomly selected time slot of a number of slots.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Physics & Mathematics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Artificial Intelligence (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- This invention relates to communications protocols and to digital data communications. Still more particularly, the invention relates to data communications protocols in mediums such as radio communication or the like. The invention also relates to radio frequency identification devices for inventory control, object monitoring, determining the existence, location or movement of objects, or for remote automated payment.
- Communications protocols are used in various applications. For example, communications protocols can be used in electronic identification systems. As large numbers of objects are moved in inventory, product manufacturing, and merchandising operations, there is a continuous challenge to accurately monitor the location and flow of objects. Additionally, there is a continuing goal to interrogate the location of objects in an inexpensive and streamlined manner. One way of tracking objects is with an electronic identification system.
- One presently available electronic identification system utilizes a magnetic coupling system. In some cases, an identification device may be provided with a unique identification code in order to distinguish between a number of different devices. Typically, the devices are entirely passive (have no power supply), which results in a small and portable package. However, such identification systems are only capable of operation over a relatively short range, limited by the size of a magnetic field used to supply power to the devices and to communicate with the devices.
- Another wireless electronic identification system utilizes a large active transponder device affixed to an object to be monitored which receives a signal from an interrogator. The device receives the signal, then generates and transmits a responsive signal. The interrogation signal and the responsive signal are typically radio-frequency (RF) signals produced by an RF transmitter circuit. Because active devices have their own power sources, and do not need to be in close proximity to an interrogator or reader to receive power via magnetic coupling. Therefore, active transponder devices tend to be more suitable for applications requiring tracking of a tagged device that may not be in close proximity to an interrogator. For example, active transponder devices tend to be more suitable for inventory control or tracking.
- Electronic identification systems can also be used for remote payment. For example, when a radio frequency identification device passes an interrogator at a toll booth, the toll booth can determine the identity of the radio frequency identification device, and thus of the owner of the device, and debit an account held by the owner for payment of toll or can receive a credit card number against which the toll can be charged. Similarly, remote payment is possible for a variety of other goods or services.
- A communication system typically includes two transponders: a commander station or interrogator, and a responder station or transponder device which replies to the interrogator.
- If the interrogator has prior knowledge of the identification number of a device which the interrogator is looking for, it can specify that a response is requested only from the device with that identification number. Sometimes, such information is not available. For example, there are occasions where the interrogator is attempting to determine which of multiple devices are within communication range.
- When the interrogator sends a message to a transponder device requesting a reply, there is a possibility that multiple transponder devices will attempt to respond simultaneously, causing a collision, and thus causing an erroneous message to be received by the interrogator. For example, if the interrogator sends out a command requesting that all devices within a communications range identify themselves, and gets a large number of simultaneous replies, the interrogator may not be able to interpret any of these replies. Thus, arbitration schemes are employed to permit communications free of collisions.
- In one arbitration scheme or system, described in commonly assigned U.S. Pat. Nos. 5,627,544; 5,583,850; 5,500,650; and 5,365,551, all to Snodgrass et al. and all incorporated herein by reference, the interrogator sends a command causing each device of a potentially large number of responding devices to select a random number from a known range and use it as that device's arbitration number. By transmitting requests for identification to various subsets of the full range of arbitration numbers, and checking for an error-free response, the interrogator determines the arbitration number of every responder station capable of communicating at the same time. Therefore, the interrogator is able to conduct subsequent uninterrupted communication with devices, one at a time, by addressing only one device.
- Another arbitration scheme is referred to as the Aloha or slotted Aloha scheme. This scheme is discussed in various references relating to communications, such asDigital Communications: Fundamentals and Applications, Bernard Sklar, published January 1988 by Prentice Hall. In this type of scheme, a device will respond to an interrogator using one of many time domain slots selected randomly by the device. A problem with the Aloha scheme is that if there are many devices, or potentially many devices in the field (i.e. in communications range, capable of responding) then there must be many available slots or many collisions will occur. Having many available slots slows down replies. If the magnitude of the number of devices in a field is unknown, then many slots are needed. This results in the system slowing down significantly because the reply time equals the number of slots multiplied by the time period required for one reply.
- An electronic identification system which can be used as a radio frequency identification device, arbitration schemes, and various applications for such devices are described in detail in commonly assigned U.S. patent application Ser. No. 08/705,043, filed Aug. 29, 1996, and incorporated herein by reference.
- The invention provides a wireless identification device configured to provide a signal to identify the device in response to an interrogation signal.
- Another aspect of the invention provides a method of establishing wireless communications between an interrogator and individual ones of multiple wireless identification devices. A tree search method is utilized to establish communications without collision between the interrogator and individual ones of the multiple wireless identification devices. A search tree is defined for the tree search method. The tree has multiple levels representing subgroups of the multiple wireless identification devices. The number of devices in a subgroup in one level is half of the number of devices in the next higher level. The tree search method employs level skipping wherein at least one level of the tree is skipped.
- Another aspect of the invention provides a communications system comprising an interrogator, and a plurality of wireless identification devices configured to communicate with the interrogator in a wireless fashion. The respective wireless identification devices have a unique identification number. The interrogator is configured to employ a tree search technique to determine the unique identification numbers of the different wireless identification devices so as to be able to establish communications between the interrogator and individual ones of the multiple wireless identification devices without collision by multiple wireless identification devices attempting to respond to the interrogator at the same time. Levels of the tree are occasionally skipped.
- One aspect of the invention provides a radio frequency identification device comprising an integrated circuit including a receiver, a transmitter, and a microprocessor. In one embodiment, the integrated circuit is a monolithic single die single metal layer integrated circuit including the receiver, the transmitter, and the microprocessor. The device of this embodiment includes an active transponder, instead of a transponder which relies on magnetic coupling for power, and therefore has a much greater range.
- Preferred embodiments of the invention are described below with reference to the following accompanying drawings.
- FIG. 1 is a high level circuit schematic showing an interrogator and a radio frequency identification device embodying the invention.
- FIG. 2 is a front view of a housing, in the form of a badge or card, supporting the circuit of FIG. 1 according to one embodiment the invention.
- FIG. 3 is a front view of a housing supporting the circuit of FIG. 1 according to another embodiment of the invention.
- FIG. 4 is a diagram illustrating a tree splitting sort method for establishing communication with a radio frequency identification device in a field of a plurality of such devices.
- FIG. 5. is a diagram illustrating a modified tree splitting sort method for establishing communication with a radio frequency identification device in a field of a plurality of such devices.
- This disclosure of the invention is submitted in furtherance of the constitutional purposes of the U.S. Patent Laws “to promote the progress of science and useful arts” (Article 1, Section 8).
- FIG. 1 illustrates a
wireless identification device 12 in accordance with one embodiment of the invention. In the illustrated embodiment, the wireless identification device is a radio frequencydata communication device 12, and includesRFID circuitry 16. In the illustrated embodiment, the RFID circuitry is defined by an integrated circuit as described in the above-incorporated patent application Ser. No. 08/705,043, filed Aug. 29, 1996. Other embodiments are possible. Apower source 18 is connected to theintegrated circuit 16 to supply power to theintegrated circuit 16. In one embodiment, thepower source 18 comprises a battery. Thedevice 12 further includes at least oneantenna 14 connected to thecircuitry 16 for wireless or radio frequency transmission and reception by thecircuitry 16. - The
device 12 transmits and receives radio frequency communications to and from aninterrogator 26. An exemplary interrogator is described in commonly assigned U.S. patent application Ser. No. 08/907,689, filed Aug. 8, 1997 and incorporated herein by reference. Preferably, theinterrogator 26 includes anantenna 28, as well as dedicated transmitting and receiving circuitry, similar to that implemented on theintegrated circuit 16. - Generally, the
interrogator 26 transmits an interrogation signal orcommand 27 via theantenna 28. Thedevice 12 receives the incoming interrogation signal via itsantenna 14. Upon receiving thesignal 27, thedevice 12 responds by generating and transmitting a responsive signal orreply 29. Theresponsive signal 29 typically includes information that uniquely identifies, or labels theparticular device 12 that is transmitting, so as to identify any object or person with which thedevice 12 is associated. - Although only one
device 12 is shown in FIG. 1, typically there will bemultiple devices 12 that correspond with theinterrogator 26, and theparticular devices 12 that are in communication with theinterrogator 26 will typically change over time. In the illustrated embodiment in FIG. 1, there is no communication betweenmultiple devices 12. Instead, thedevices 12 respectively communicate with theinterrogator 26.Multiple devices 12 can be used in the same field of an interrogator 26 (i.e., within communications range of an interrogator 26). Similarly,multiple interrogators 26 can be in proximity to one or more of thedevices 12. - The radio frequency
data communication device 12 can be included in any appropriate housing or packaging. Various methods of manufacturing housings are described in commonly assigned U.S. patent application Ser. No. 08/800,037, filed Feb. 13, 1997, and incorporated herein by reference. - FIG. 2 shows but one embodiment in the form of a card or
badge 19 including the radio frequencydata communication device 12, and ahousing 11 including plastic or other suitable material. In one embodiment, the front face of the badge has visual identification features such as graphics, text, information found on identification or credit cards, etc. - FIG. 3 illustrates but one alternative housing supporting the
device 12. More particularly, FIG. 3 shows aminiature housing 20 encasing thedevice 12 to define a tag which can be supported by an object (e.g., hung from an object, affixed to an object, etc.). Although two particular types of housings have been disclosed, thedevice 12 can be included in any appropriate housing. - If the
power source 18 is a battery, the battery can take any suitable form. Preferably, the battery type will be selected depending on weight, size, and life requirements for a particular application. In one embodiment, thebattery 18 is a thin profile button-type cell forming a small, thin energy cell more commonly utilized in watches and small electronic devices requiring a thin profile. A conventional button-type cell has a pair of electrodes, an anode formed by one face and a cathode formed by an opposite face. In an alternative embodiment, thepower source 18 comprises a series connected pair of button type cells. Instead of using a battery, any suitable power source can be employed. - The
circuitry 16 further includes a backscatter transmitter and is configured to provide a responsive signal to theinterrogator 26 by radio frequency. More particularly, thecircuitry 16 includes a transmitter, a receiver, and memory such as is described in U.S. patent application Ser. No. 08/705,043. - Radio frequency identification has emerged as a viable and affordable alternative to tagging or labeling small to large quantities of items. The
interrogator 26 communicates with thedevices 12 via an RF link, so all transmissions by theinterrogator 26 are heard simultaneously by alldevices 12 within range. - If the
interrogator 26 sends out a command requesting that alldevices 12 within range identify themselves, and gets a large number of simultaneous replies, theinterrogator 26 may not be able to interpret any of these replies. Therefore, arbitration schemes are provided. - If the
interrogator 26 has prior knowledge of the identification number of adevice 12 which theinterrogator 26 is looking for, it can specify that a response is requested only from thedevice 12 with that identification number. To target a command at aspecific device 12, (i.e., to initiate point-on-point communication), theinterrogator 26 must send a number identifying aspecific device 12 along with the command. At start-up, or in a new or changing environment, these identification numbers are not known by theinterrogator 26. Therefore, theinterrogator 26 must identify alldevices 12 in the field (within communication range) such as by determining the identification numbers of thedevices 12 in the field. After this is accomplished, point-to-point communication can proceed as desired by theinterrogator 26. - Generally speaking, RFID systems are a type of multiaccess communication system. The distance between the
interrogator 26 anddevices 12 within the field is typically fairly short (e.g., several meters), so packet transmission time is determined primarily by packet size and baud rate. Propagation delays are negligible. In RFID systems, there is a potential for a large number of transmittingdevices 12 and there is a need for theinterrogator 26 to work in a changing environment, wheredifferent devices 12 are swapped in and out frequently (e.g., as inventory is added or removed). In such systems, the inventors have determined that the use of random access methods work effectively for contention resolution (i.e., for dealing with collisions betweendevices 12 attempting to respond to theinterrogator 26 at the same time). - RFID systems have some characteristics that are different from other communications systems. For example, one characteristic of the illustrated RFID systems is that the
devices 12 never communicate without being prompted by theinterrogator 26. This is in contrast to typical multiaccess systems where the transmitting units operate more independently. In addition, contention for the communication medium is short lived as compared to the ongoing nature of the problem in other multiaccess systems. For example, in a RFID system, after thedevices 12 have been identified, the interrogator can communicate with them in a point-to-point fashion. Thus, arbitration in a RFID system is a transient rather than steady-state phenomenon. Further, the capability of adevice 12 is limited by practical restrictions on size, power, and cost. The lifetime of adevice 12 can often be measured in terms of number of transmissions before battery power is lost. Therefore, one of the most important measures of system performance in RFID arbitration is total time required to arbitrate a set ofdevices 12. Another measure is power consumed by thedevices 12 during the process. This is in contrast to the measures of throughput and packet delay in other types of multiaccess systems. - FIG. 4 illustrates one arbitration scheme that can be employed for communication between the interrogator and
devices 12. Generally, theinterrogator 26 sends a command causing eachdevice 12 of a potentially large number of respondingdevices 12 to select a random number from a known range and use it as that device's arbitration number. By transmitting requests for identification to various subsets of the full range of arbitration numbers, and checking for an error-free response, theinterrogator 26 determines the arbitration number of every responder station capable of communicating at the same time. Therefore, theinterrogator 26 is able to conduct subsequent uninterrupted communication withdevices 12, one at a time, by addressing only onedevice 12. - Three variables are used: an arbitration value (AVALUE), an arbitration mask (AMASK), and a random value ID (RV). The interrogator sends an Identify command (IdentifyCmnd) causing each device of a potentially large number of responding devices to select a random number from a known range and use it as that device's arbitration number. The interrogator sends an arbitration value (AVALUE) and an arbitration mask (AMASK) to a set of
devices 12. The receivingdevices 12 evaluate the following equation: (AMASK & AVALUE)==(AMASK & RV) wherein “&” is a bitwise AND function, and wherein “==” is an equality function. If the equation evaluates to “1” (TRUE), then thedevice 12 will reply. If the equation evaluates to “0” (FALSE), then thedevice 12 will not reply. By performing this in a structured manner, with the number of bits in the arbitration mask being increased by one each time, eventually adevice 12 will respond with no collisions. Thus, a binary search tree methodology is employed. - An example using actual numbers will now be provided using only four bits, for simplicity, reference being made to FIG. 4. In one embodiment, sixteen bits are used for AVALUE and AMASK. Other numbers of bits can also be employed depending, for example, on the number of
devices 12 expected to be encountered in a particular application, on desired cost points, etc. - Assume, for this example, that there are two
devices 12 in the field, one with a random value (RV) of 1100 (binary), and another with a random value (RV) of 1010 (binary). The interrogator is trying to establish communications without collisions being caused by the twodevices 12 attempting to communicate at the same time. - The interrogator sets AVALUE to 0000 (or “don't care” for all bits, as indicated by the character “X” in FIG. 4) and AMASK to 0000. The interrogator transmits a command to all
devices 12 requesting that they identify themselves. Each of thedevices 12 evaluate (AMASK & AVALUE)==(AMASK & RV) using the random value RV that therespective devices 12 selected. If the equation evaluates to “1” (TRUE), then thedevice 12 will reply. If the equation evaluates to “0” (FALSE), then thedevice 12 will not reply. In the first level of the illustrated tree, AMASK is 0000 and anything bitwise ANDed with all zeros results in all zeros, so both thedevices 12 in the field respond, and there is a collision. - Next, the interrogator sets AMASK to 0001 and AVALUE to 0000 and transmits an identify command. Both
devices 12 in the field have a zero for their least significant bit, and (AMASK & AVALUE)==(AMASK & RV) will be true for bothdevices 12. For thedevice 12 with a random value of 1100, the left side of the equation is evaluated as follows (0001 & 0000)=0000. The right side is evaluated as (0001 & 1100)=0000. The left side equals the right side, so the equation is true for thedevice 12 with the random value of 1100. For thedevice 12 with a random value of 1010, the left side of the equation is evaluated as (0001 & 0000)=0000. The right side is evaluated as (0001 & 1010)=0000. The left side equals the right side, so the equation is true for thedevice 12 with the random value of 1010. Because the equation is true for bothdevices 12 in the field, bothdevices 12 in the field respond, and there is another collision. - Recursively, the interrogator next sets AMASK to 0011 with AVALUE still at 0000 and transmits an Identify command. (AMASK & AVALUE)==(AMASK & RV) is evaluated for both
devices 12. For thedevice 12 with a random value of 1100, the left side of the equation is evaluated as follows (0011 & 0000)=0000. The right side is evaluated as (0011 & 1100)=0000. The left side equals the right side, so the equation is true for thedevice 12 with the random value of 1100, so thisdevice 12 responds. For thedevice 12 with a random value of 1010, the left side of the equation is evaluated as (0011 & 0000)=0000. The right side is evaluated as (0011 & 1010)=0010. The left side does not equal the right side, so the equation is false for thedevice 12 with the random value of 1010, and thisdevice 12 does not respond. Therefore, there is no collision, and the interrogator can determine the identity (e.g., an identification number) for thedevice 12 that does respond. - De-recursion takes place, and the
devices 12 to the right for the same AMASK level are accessed when AVALUE is set at 0010, and AMASK is set to 0011. - The
device 12 with the random value of 1010 receives a command and evaluates the equation (AMASK & AVALUE)==(AMASK & RV). The left side of the equation is evaluated as (0011 & 0010)=0010. The right side of the equation is evaluated as (0011 & 1010)=0010. The right side equals the left side, so the equation is true for thedevice 12 with the random value of 1010. Because there are noother devices 12 in the subtree, a good reply is returned by thedevice 12 with the random value of 1010. There is no collision, and the interrogator can determine the identity (e.g., an identification number) for thedevice 12 that does respond. - By recursion, what is meant is that a function makes a call to itself. In other words, the function calls itself within the body of the function. After the called function returns, de-recursion takes place and execution continues at the place just after the function call; i.e. at the beginning of the statement after the function call.
- For instance, consider a function that has four statements (numbered 1,2,3,4) in it, and the second statement is a recursive call. Assume that the fourth statement is a return statement. The first time through the loop (iteration1) the function executes the statement 2 and (because it is a recursive call) calls itself causing iteration 2 to occur. When iteration 2 gets to statement 2, it calls itself making iteration 3. During execution in iteration 3 of statement 1, assume that the function does a return. The information that was saved on the stack from iteration 2 is loaded and the function resumes execution at statement 3 (in iteration 2), followed by the execution of statement 4 which is also a return statement. Since there are no more statements in the function, the function de-recurses to iteration 1. Iteration 1, had previously recursively called itself in statement 2. Therefore, it now executes statement 3 (in iteration 1). Following that it executes a return at statement 4. Recursion is known in the art.
- Consider the following code which can be used to implement operation of the method shown in FIG. 4 and described above.
- Arbitrate(AMASK, AVALUE)
{ collision=IdentifyCmnd(AMASK, AVALUE) if (collision) then { /* recursive call for left side */ Arbitrate((AMASK<<1)+1, AVALUE) /* recursive call for right side */ Arbitrate((AMASK<<1)+1, AVALUE +(AMASK+1)) }/* endif */ }/* return */ - The symbol “<<” a represents a bitwise left shift. “<<1” means shift left by one place. Thus, 0001<<1 would be 0010. Note, however, that AMASK is originally called with a value of zero, and 0000<<1 is still 0000. Therefore, for the first recursive call, AMASK=(AMASK<<1)+1. So for the first recursive call, the value of AMASK is 0000+0001=0001. For the second call, AMASK=(0001<<1)+1=0010+1=0011. For the third recursive call, AMASK=(0011<<1)+1=0110+1=0111.
- The routine generates values for AMASK and AVALUE to be used by the interrogator in an identify command “IdentifyCmnd.” Note that the routine calls itself if there is a collision. De-recursion occurs when there is no collision. AVALUE and AMASK would have values such as the following assuming collisions take place all the way down to the bottom of the tree.
AVALUE AMASK 0000 0000 0000 0001 0000 0011 0000 0111 0000 1111* 1000 1111* 0100 0111 0100 1111* 1100 1111* - This sequence of AMASK, AVALUE binary numbers assumes that there are collisions all the way down to the bottom of the tree, at which point the Identify command sent by the interrogator is finally successful so that no collision occurs. Rows in the table for which the interrogator is successful in receiving a reply without collision are marked with the symbol “*”. Note that if the Identify command was successful at, for example, the third line in the table then the interrogator would stop going down that branch of the tree and start down another, so the sequence would be as shown in the following table.
AVALUE AMASK 0000 0000 0000 0001 0000 0011* 0010 0011 . . . . . . - This method is referred to as a splitting method. It works by splitting groups of colliding
devices 12 into subsets that are resolved in turn. The splitting method can also be viewed as a type of tree search. Each split moves the method one level deeper in the tree. - Either depth-first or breadth-first traversals of the tree can be employed. Depth first traversals are performed by using recursion, as is employed in the code listed above. Breadth-first traversals are accomplished by using a queue instead of recursion. The following is an example of code for performing a breadth-first traversal.
- Arbitrate(AMASK, AVALUE)
{ enqueue(0,0) while (queue !=empty) (AMASK,AVALUE) =dequeue() collision=IdentifyCmnd(AMASK, AVALUE) if (collision) then { TEMP=AMASK+1 NEW_AMASK=(AMASK<<1)+1 enqueue(NEW_AMASK, AVALUE) enqueue(NEW_AMASK, AVALUE+TEMP) }/* endif */ endwhile }/* return */ - The symbol “!=” means not equal to. AVALUE and AMASK would have values such as those indicated in the following table for such code.
AVALUE AMASK 0000 0000 0000 0001 0001 0001 0000 0011 0010 0011 0001 0011 0011 0011 0000 0111 0100 0111 . . . . . . - Rows in the table for which the interrogator is successful in receiving a reply without collision are marked with the symbol “*”.
- FIG. 5 illustrates an embodiment wherein levels in the tree are skipped. The inventors have determined that skipping levels in the tree, after a collision caused by
multiple devices 12 responding, reduces the number of subsequent collisions without adding significantly to the number of no replies. In real-time systems, it is desirable to have quick arbitration sessions on a set ofdevices 12 whose unique identification numbers are unknown. Level skipping reduces the number of collisions, both reducing arbitration time and conserving battery life on a set ofdevices 12. - Thus, FIG. 5 illustrates a
binary search tree 32 being defined for a tree search method similar to the tree search method described in connection with FIG. 4. Thetree 32 hasmultiple levels multiple devices 12. The number of devices in a subgroup in onelevel higher level - A first predetermined number of bits, e.g. sixteen or an integer multiple of eight or sixteen bits, are established to be used as unique identification numbers.
Respective devices 12 are provided with unique identification numbers respectively having the first predetermined number of bits, in addition to their random values RV. For example, such unique identification numbers are stored in memory in therespective devices 12. - A second predetermined number of bits are established to be used for the random values RV. The
devices 12 are caused to select random values, RV. This is done, for example, by theinterrogator 26 sending an appropriate command. Respective devices choose random values independently of random values selected by theother devices 12. Random number generators are known in the art. - The interrogator transmits a
command requesting devices 12 having random values RV within a specified group of random values to respond, using a methodology similar to that described in connection with FIG. 4, except that levels are skipped. Four subsets of random values, instead of two, are probed when moving down the tree and skipping a level. This means that instead of eliminating half of the remainingdevices 12 and re-trying, after a collision, the interrogator eliminates three quarters of the remainingdevices 12 and re-tries (by sending a command). In other words, a new specified group is created that is one quarter of the set of random values of the previous group. - Each
devices 12 that receives the command determines if its chosen random value falls within the specified group by evaluating the equation (AMASK & AVALUE)==(AMASK & RV) and, if so, sends a reply to the interrogator. The reply includes the random value of the replyingdevice 12 and the unique identification number of thedevice 12. The interrogator determines if a collision occurred between devices that sent a reply and, if so, creates a new, smaller, specified group, by moving down the tree, skipping a level. - In the illustrated embodiment, every other level is skipped. In alternative embodiments, more than one level is skipped each time.
- The trade off that must be considered in determining how many (if any) levels to skip with each decent down the tree is as follows. Skipping levels reduces the number of collisions, thus saving battery power in the
devices 12. Skipping deeper (skipping more than one level) further reduces the number of collisions. The more levels that are skipped, the greater the reduction in collisions. However, skipping levels results in longer search times because the number of queries (Identify commands) increases. The more levels that are skipped, the longer the search times. The inventors have determined that skipping just one level has an almost negligible effect on search time, but drastically reduces the number of collisions. If more than one level is skipped, search time increases substantially. - The inventors have determined that skipping every other level drastically reduces the number of collisions and saves battery power without significantly increasing the number of queries.
- After receiving a reply without collision from a
device 12, theinterrogator 26 can send a command individually addressed to that device by using its now known random value or its now known unique identification number. - The above described code for depth-first traversal is modified to provide for level skipping by increasing the number of recursive calls as shown below. For example, the above described code for depth-first traversal is replaced with code such as the following to provide for depth-first traversal employing level skipping.
- Arbitrate(AMASK, AVALUE)
{ collision=IdentifyCmnd(AMASK, AVALUE) if (collision) then { TEMP=AMASK+1 NEW AMASK=(AMASK<<2)+3 Arbitrate(NEW_AMASK, AVALUE) Arbitrate(NEW_AMASK, AVALUE+TEMP) Arbitrate(NEW_AMASK, AVALUE+2*TEMP) Arbitrate(NEW_AMASK, AVALUE+3*TEMP) }/* endif */ }/* return */ - AVALUE and AMASK would have values such as those indicated in the following table for such code.
AVALUE AMASK 0000 0000 0000 0011 0000 1111* 0100 1111* 1000 1111* 1100 1111* 0001 0011 0001 1111* 0101 1111* 1001 1111* 1101 1111* 0010 0011 0010 1111* 0110 1111* 1010 1111* 1110 1111* - Rows in the table for which the interrogator is successful in receiving a reply without collision are marked with the symbol “*”.
- Similarly, the code provided above for breadth-first traversal can be readily modified to employ level skipping. Instead of inserting two items into the queue each time through the loop, four items are inserted into the queue each time through the loop. For either breadth-first traversal or depth-first traversal, AMASK will be shifted by two bits instead of one, and AVALUE will take on twice as many different values as in the case where level skipping is not employed.
- Another arbitration method that can be employed is referred to as the “Aloha” method. In the Aloha method, every time a
device 12 is involved in a collision, it waits a random period of time before retransmitting. This method can be improved by dividing time into equally sized slots and forcing transmissions to be aligned with one of these slots. This is referred to as “slotted Aloha.” In operation, the interrogator asks alldevices 12 in the field to transmit their identification numbers in the next time slot. If the response is garbled, the interrogator informs thedevices 12 that a collision has occurred, and the slotted Aloha scheme is put into action. This means that eachdevice 12 in the field responds within an arbitrary slot determined by a randomly selected value. In other words, in each successive time slot, thedevices 12 decide to transmit their identification number with a certain probability. - The Aloha method is based on a system operated by the University of Hawaii. In1971, the University of Hawaii began operation of a system named Aloha. A communication satellite was used to interconnect several university computers by use of a random access protocol. The system operates as follows. Users or devices transmit at any time they desire. After transmitting, a user listens for an acknowledgment from the receiver or interrogator. Transmissions from different users will sometimes overlap in time (collide), causing reception errors in the data in each of the contending messages. The errors are detected by the receiver, and the receiver sends a negative acknowledgment to the users. When a negative acknowledgment is received, the messages are retransmitted by the colliding users after a random delay. If the colliding users attempted to retransmit without the random delay, they would collide again. If the user does not receive either an acknowledgment or a negative acknowledgment within a certain amount of time, the user “times out” and retransmits the message.
- There is a scheme known as slotted Aloha which improves the Aloha scheme by requiring a small amount of coordination among stations. In the slotted Aloha scheme, a sequence of coordination pulses is broadcast to all stations (devices). As is the case with the pure Aloha scheme, packet lengths are constant. Messages are required to be sent in a slot time between synchronization pulses, and can be started only at the beginning of a time slot. This reduces the rate of collisions because only messages transmitted in the same slot can interfere with one another. The retransmission mode of the pure Aloha scheme is modified for slotted Aloha such that if a negative acknowledgment occurs, the device retransmits after a random delay of an integer number of slot times.
- Aloha methods are described in a commonly assigned patent application (attorney docket number MI40-089) naming Clifton W. Wood, Jr. as an inventor, titled “Method of Addressing Messages and Communications System,” filed concurrently herewith, and incorporated herein by reference.
- In one alternative embodiment, an Aloha method is combined with level skipping, such as the level skipping shown and described in connection with FIG. 5. For example, in one embodiment,
devices 12 sending a reply to theinterrogator 26 do so within a randomly selected time slot of a number of slots. - In compliance with the statute, the invention has been described in language more or less specific as to structural and methodical features. It is to be understood, however, that the invention is not limited to the specific features shown and described, since the means herein disclosed comprise preferred forms of putting the invention into effect. The invention is, therefore, claimed in any of its forms or modifications within the proper scope of the appended claims appropriately interpreted in accordance with the doctrine of equivalents.
Claims (36)
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/773,461 US6307848B1 (en) | 1998-02-19 | 2001-01-31 | Method of addressing messages, method of establishing wireless communications, and communications system |
US10/693,697 USRE42344E1 (en) | 1998-02-19 | 2003-10-23 | Method and apparatus to manage RFID tags |
US11/865,580 USRE43020E1 (en) | 1998-02-19 | 2007-10-01 | Method of addressing messages, method of establishing wireless communications, and communications system |
US11/865,584 USRE43445E1 (en) | 1998-02-19 | 2007-10-01 | Method and apparatus to manage RFID tags |
US12/641,249 USRE44411E1 (en) | 1998-02-19 | 2009-12-17 | Method of addressing messages, method of establishing wireless communications and communications system |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/026,045 US6072801A (en) | 1998-02-19 | 1998-02-19 | Method of addressing messages, method of establishing wireless communications, and communications system |
US09/551,304 US6226300B1 (en) | 1998-02-19 | 2000-04-18 | Method of addressing messages, and establishing communications using a tree search technique that skips levels |
US09/773,461 US6307848B1 (en) | 1998-02-19 | 2001-01-31 | Method of addressing messages, method of establishing wireless communications, and communications system |
Related Parent Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/551,304 Continuation US6226300B1 (en) | 1998-02-19 | 2000-04-18 | Method of addressing messages, and establishing communications using a tree search technique that skips levels |
US10/693,697 Continuation USRE42344E1 (en) | 1998-02-19 | 2003-10-23 | Method and apparatus to manage RFID tags |
Related Child Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/693,697 Reissue USRE42344E1 (en) | 1998-02-19 | 2003-10-23 | Method and apparatus to manage RFID tags |
US11/865,584 Reissue USRE43445E1 (en) | 1998-02-19 | 2007-10-01 | Method and apparatus to manage RFID tags |
US11/865,580 Reissue USRE43020E1 (en) | 1998-02-19 | 2007-10-01 | Method of addressing messages, method of establishing wireless communications, and communications system |
US12/641,249 Reissue USRE44411E1 (en) | 1998-02-19 | 2009-12-17 | Method of addressing messages, method of establishing wireless communications and communications system |
Publications (2)
Publication Number | Publication Date |
---|---|
US6307848B1 US6307848B1 (en) | 2001-10-23 |
US20010043569A1 true US20010043569A1 (en) | 2001-11-22 |
Family
ID=21829570
Family Applications (7)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/026,045 Expired - Lifetime US6072801A (en) | 1998-02-19 | 1998-02-19 | Method of addressing messages, method of establishing wireless communications, and communications system |
US09/551,304 Expired - Lifetime US6226300B1 (en) | 1998-02-19 | 2000-04-18 | Method of addressing messages, and establishing communications using a tree search technique that skips levels |
US09/773,461 Expired - Lifetime US6307848B1 (en) | 1998-02-19 | 2001-01-31 | Method of addressing messages, method of establishing wireless communications, and communications system |
US10/693,697 Expired - Lifetime USRE42344E1 (en) | 1998-02-19 | 2003-10-23 | Method and apparatus to manage RFID tags |
US11/865,580 Expired - Lifetime USRE43020E1 (en) | 1998-02-19 | 2007-10-01 | Method of addressing messages, method of establishing wireless communications, and communications system |
US11/865,584 Expired - Lifetime USRE43445E1 (en) | 1998-02-19 | 2007-10-01 | Method and apparatus to manage RFID tags |
US12/641,249 Expired - Lifetime USRE44411E1 (en) | 1998-02-19 | 2009-12-17 | Method of addressing messages, method of establishing wireless communications and communications system |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/026,045 Expired - Lifetime US6072801A (en) | 1998-02-19 | 1998-02-19 | Method of addressing messages, method of establishing wireless communications, and communications system |
US09/551,304 Expired - Lifetime US6226300B1 (en) | 1998-02-19 | 2000-04-18 | Method of addressing messages, and establishing communications using a tree search technique that skips levels |
Family Applications After (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/693,697 Expired - Lifetime USRE42344E1 (en) | 1998-02-19 | 2003-10-23 | Method and apparatus to manage RFID tags |
US11/865,580 Expired - Lifetime USRE43020E1 (en) | 1998-02-19 | 2007-10-01 | Method of addressing messages, method of establishing wireless communications, and communications system |
US11/865,584 Expired - Lifetime USRE43445E1 (en) | 1998-02-19 | 2007-10-01 | Method and apparatus to manage RFID tags |
US12/641,249 Expired - Lifetime USRE44411E1 (en) | 1998-02-19 | 2009-12-17 | Method of addressing messages, method of establishing wireless communications and communications system |
Country Status (1)
Country | Link |
---|---|
US (7) | US6072801A (en) |
Cited By (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020000034A1 (en) * | 2000-03-24 | 2002-01-03 | Jenson Mark Lynn | Continuous processing of thin-film batteries and like devices |
EP1422652A2 (en) * | 2002-11-20 | 2004-05-26 | Siemens Aktiengesellschaft | Method for collision-free data exchange between reading/writing device and mobile data carrier, reading/writing device, mobile data carrier and identification system |
US20050095506A1 (en) * | 2003-10-16 | 2005-05-05 | Klaassen Jody J. | Lithium/air batteries with LiPON as separator and protective barrier and method |
US20050242927A1 (en) * | 2004-04-28 | 2005-11-03 | Atmel Co. | Communication method in RFID or remote sensor systems |
WO2006020144A2 (en) * | 2004-07-15 | 2006-02-23 | Mastercard International Incorporated | Collision detection and avoidance scheme for contactless card payment systems |
US20060080410A1 (en) * | 2002-11-15 | 2006-04-13 | Maclarty Glen M | Method and apparatus for forming and maintaining a network of devices |
KR100625675B1 (en) | 2005-09-30 | 2006-09-18 | 에스케이 텔레콤주식회사 | Method for identifying tags using adaptive binary tree splitting technique in rfid system and rfid system therefor |
US7603144B2 (en) * | 2003-01-02 | 2009-10-13 | Cymbet Corporation | Active wireless tagging system on peel and stick substrate |
US7776478B2 (en) | 2005-07-15 | 2010-08-17 | Cymbet Corporation | Thin-film batteries with polymer and LiPON electrolyte layers and method |
US7931989B2 (en) | 2005-07-15 | 2011-04-26 | Cymbet Corporation | Thin-film batteries with soft and hard electrolyte layers and method |
US8443110B2 (en) * | 2011-02-28 | 2013-05-14 | Honeywell International Inc. | Approach for discovering devices on a common bus without direct communication |
US9853325B2 (en) | 2011-06-29 | 2017-12-26 | Space Charge, LLC | Rugged, gel-free, lithium-free, high energy density solid-state electrochemical energy storage devices |
US10601074B2 (en) | 2011-06-29 | 2020-03-24 | Space Charge, LLC | Rugged, gel-free, lithium-free, high energy density solid-state electrochemical energy storage devices |
US10658705B2 (en) | 2018-03-07 | 2020-05-19 | Space Charge, LLC | Thin-film solid-state energy storage devices |
US11527774B2 (en) | 2011-06-29 | 2022-12-13 | Space Charge, LLC | Electrochemical energy storage devices |
US11996517B2 (en) | 2011-06-29 | 2024-05-28 | Space Charge, LLC | Electrochemical energy storage devices |
Families Citing this family (58)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6118789A (en) | 1998-02-19 | 2000-09-12 | Micron Technology, Inc. | Method of addressing messages and communications system |
USRE43382E1 (en) | 1998-02-19 | 2012-05-15 | Round Rock Research, Llc | Method of addressing messages and communications systems |
US6275476B1 (en) | 1998-02-19 | 2001-08-14 | Micron Technology, Inc. | Method of addressing messages and communications system |
US6061344A (en) | 1998-02-19 | 2000-05-09 | Micron Technology, Inc. | Method of addressing messages and communications system |
US6072801A (en) | 1998-02-19 | 2000-06-06 | Micron Technology, Inc. | Method of addressing messages, method of establishing wireless communications, and communications system |
FR2776097B1 (en) * | 1998-03-16 | 2000-08-11 | Sgs Thomson Microelectronics | IMPROVED METHOD FOR IDENTIFYING ELECTRONIC CARDS |
US6263332B1 (en) | 1998-08-14 | 2001-07-17 | Vignette Corporation | System and method for query processing of structured documents |
US8538801B2 (en) | 1999-02-19 | 2013-09-17 | Exxonmobile Research & Engineering Company | System and method for processing financial transactions |
US6944598B1 (en) * | 1999-09-17 | 2005-09-13 | I2 Technologies Us, Inc. | Binary trees for detecting inventory problems in an enterprise model |
US6774766B1 (en) * | 2000-07-21 | 2004-08-10 | E-Tag Systems, Inc. | Method for efficiently querying and identifying multiple items on a communication channel |
US6727803B2 (en) * | 2001-03-16 | 2004-04-27 | E-Tag Systems, Inc. | Method and apparatus for efficiently querying and identifying multiple items on a communication channel |
US20020175806A1 (en) * | 2001-05-25 | 2002-11-28 | Marneweck Willem J. | Electronic tag binary selection method |
US6988667B2 (en) * | 2001-05-31 | 2006-01-24 | Alien Technology Corporation | Methods and apparatuses to identify devices |
US7028024B1 (en) * | 2001-07-20 | 2006-04-11 | Vignette Corporation | Information retrieval from a collection of information objects tagged with hierarchical keywords |
US7193504B2 (en) | 2001-10-09 | 2007-03-20 | Alien Technology Corporation | Methods and apparatuses for identification |
US6972682B2 (en) * | 2002-01-18 | 2005-12-06 | Georgia Tech Research Corporation | Monitoring and tracking of assets by utilizing wireless communications |
DE10204346A1 (en) * | 2002-02-01 | 2003-08-14 | Atmel Germany Gmbh | Procedure for the selection of transponders |
JP3672895B2 (en) * | 2002-07-04 | 2005-07-20 | エル・エス・アイ ジャパン株式会社 | Multiple ID multi-read method |
US20040066752A1 (en) * | 2002-10-02 | 2004-04-08 | Hughes Michael A. | Radio frequency indentification device communications systems, wireless communication devices, wireless communication systems, backscatter communication methods, radio frequency identification device communication methods and a radio frequency identification device |
US7019618B2 (en) | 2002-10-02 | 2006-03-28 | Battelle Memorial Institute | Wireless communications systems, radio frequency identification devices, wireless communications methods, and radio frequency identification device communications methods |
US7760835B2 (en) | 2002-10-02 | 2010-07-20 | Battelle Memorial Institute | Wireless communications devices, methods of processing a wireless communication signal, wireless communication synchronization methods and a radio frequency identification device communication method |
US6914528B2 (en) | 2002-10-02 | 2005-07-05 | Battelle Memorial Institute | Wireless communication systems, radio frequency identification devices, methods of enhancing a communications range of a radio frequency identification device, and wireless communication methods |
US6995655B2 (en) * | 2002-10-02 | 2006-02-07 | Battelle Memorial Institute | Method of simultaneously reading multiple radio frequency tags, RF tags, and RF reader |
US7019617B2 (en) * | 2002-10-02 | 2006-03-28 | Battelle Memorial Institute | Radio frequency identification devices, backscatter communication device wake-up methods, communication device wake-up methods and a radio frequency identification device wake-up method |
US7009526B2 (en) | 2002-10-02 | 2006-03-07 | Battelle Memorial Institute | RFID system and method including tag ID compression |
US7009495B2 (en) * | 2002-10-02 | 2006-03-07 | Battelle Memorial Institute | System and method to identify multiple RFID tags |
US6842106B2 (en) | 2002-10-04 | 2005-01-11 | Battelle Memorial Institute | Challenged-based tag authentication model |
CA2508861A1 (en) * | 2002-10-25 | 2004-05-06 | Symbol Technologies, Inc. | Optimization of a binary tree traversal with secure communications |
US7603371B1 (en) * | 2002-12-17 | 2009-10-13 | Vignette Corporation | Object based system and method for managing information |
DE10336308A1 (en) * | 2003-08-01 | 2005-03-03 | Atmel Germany Gmbh | Method for selecting one or more transponders |
US8102244B2 (en) * | 2003-08-09 | 2012-01-24 | Alien Technology Corporation | Methods and apparatuses to identify devices |
US7119664B2 (en) * | 2003-09-17 | 2006-10-10 | Id Solutions, Inc. | Deep sleep in an RFID tag |
DE10349647B4 (en) * | 2003-10-21 | 2006-08-10 | Atmel Germany Gmbh | Method for selecting one or more transponders |
US7716160B2 (en) * | 2003-11-07 | 2010-05-11 | Alien Technology Corporation | Methods and apparatuses to identify devices |
US7298264B1 (en) | 2004-01-20 | 2007-11-20 | Charles A. Eldering | RFID tag filtering and monitoring |
US7420458B1 (en) | 2004-01-20 | 2008-09-02 | Charles A. Eldering | Secondary card reader |
GB0406094D0 (en) * | 2004-03-17 | 2004-04-21 | Koninkl Philips Electronics Nv | Making time-of-flight measurements in master/slave and ad hoc networks by evesdropping on messages |
US20050237159A1 (en) * | 2004-04-13 | 2005-10-27 | Impinj, Inc. | RFID tag systems, RFID tags and RFID processes with reverse link burst mode |
US20050237157A1 (en) * | 2004-04-13 | 2005-10-27 | Impinj, Inc. | RFID tag systems, RFID tags and RFID processes with branch node indexing |
US20050237158A1 (en) * | 2004-04-13 | 2005-10-27 | Impinj, Inc. | RFID tag systems, RFID tags and RFID processes using N-ary FSK |
US6966734B2 (en) * | 2004-04-23 | 2005-11-22 | Toteff Thomas S | Dual purpose track for holding wheel chocks and strap clips to tie down dirt bikes to trailers |
CN1332512C (en) * | 2004-07-14 | 2007-08-15 | 上海贝岭股份有限公司 | Anti-collision method in radio frequency identification technology |
US7362212B2 (en) * | 2004-09-24 | 2008-04-22 | Battelle Memorial Institute | Communication methods, systems, apparatus, and devices involving RF tag registration |
US7924141B2 (en) * | 2006-12-01 | 2011-04-12 | Round Rock Research, Llc | RFID communication systems and methods, and RFID readers and systems |
US8294554B2 (en) * | 2006-12-18 | 2012-10-23 | Radiofy Llc | RFID location systems and methods |
US7973644B2 (en) | 2007-01-30 | 2011-07-05 | Round Rock Research, Llc | Systems and methods for RFID tag arbitration where RFID tags generate multiple random numbers for different arbitration sessions |
US8270911B2 (en) * | 2007-02-28 | 2012-09-18 | Round Rock Research, Llc | Communications methods, methods of forming a reader, wireless communications readers, and wireless communications systems |
US8134452B2 (en) * | 2007-05-30 | 2012-03-13 | Round Rock Research, Llc | Methods and systems of receiving data payload of RFID tags |
CN101441699B (en) * | 2007-11-20 | 2011-08-10 | 中兴通讯股份有限公司 | Multiple-label anti-collision method for radio frequency recognition |
CN101499122B (en) * | 2008-02-03 | 2011-03-02 | 中兴通讯股份有限公司 | Method for implementing radio frequency access by utilization of anti-collision |
CN101499121B (en) * | 2008-02-03 | 2011-03-02 | 中兴通讯股份有限公司 | Anti-collision method for radio frequency recognition |
CN101685489B (en) * | 2008-09-26 | 2011-11-30 | 中兴通讯股份有限公司 | Label anti-collision method and reader |
US20100156604A1 (en) * | 2008-12-22 | 2010-06-24 | General Electric Company | Rfid tag reading apparatus and method |
TWI410874B (en) * | 2009-01-07 | 2013-10-01 | Mstar Semiconductor Inc | Method for searching a plurality of rfid tags and apparatus thereof |
US9230259B1 (en) | 2009-03-20 | 2016-01-05 | Jpmorgan Chase Bank, N.A. | Systems and methods for mobile ordering and payment |
US20110074555A1 (en) * | 2009-09-29 | 2011-03-31 | Electronics And Telecommunications Research Institute | Mobile rfid device and data communication method thereof |
US9158948B2 (en) | 2012-01-20 | 2015-10-13 | Ruizhang Technology Limited Company | RFID protocols with non-interacting variants |
DE102013014187A1 (en) * | 2013-08-26 | 2015-02-26 | Giesecke & Devrient Gmbh | Method and device for transmitting information |
Family Cites Families (100)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4075632A (en) * | 1974-08-27 | 1978-02-21 | The United States Of America As Represented By The United States Department Of Energy | Interrogation, and detection system |
US7164117B2 (en) * | 1992-05-05 | 2007-01-16 | Automotive Technologies International, Inc. | Vehicular restraint system control system and method using multiple optical imagers |
US5168510A (en) | 1984-03-06 | 1992-12-01 | Comsource Systems | Spread spectrum-time diversity communications systems and transceivers for multidrop area networks |
US4761778A (en) | 1985-04-11 | 1988-08-02 | Massachusetts Institute Of Technology | Coder-packetizer for random accessing in digital communication with multiple accessing |
US4799059A (en) | 1986-03-14 | 1989-01-17 | Enscan, Inc. | Automatic/remote RF instrument monitoring system |
EP0247612B1 (en) * | 1986-05-30 | 1993-08-04 | Sharp Kabushiki Kaisha | Microwave data transmission apparatus |
GB8623763D0 (en) * | 1986-10-03 | 1986-11-05 | Marconi Co Ltd | Communication system |
US4796023A (en) | 1986-12-05 | 1989-01-03 | King Robert E | Stabilized binary tree protocol |
CA1290020C (en) | 1987-02-09 | 1991-10-01 | Steven Messenger | Wireless local area network |
US4845504A (en) | 1987-04-08 | 1989-07-04 | M/A-Com, Inc. | Mobile radio network for nationwide communications |
NL8700861A (en) | 1987-04-13 | 1988-11-01 | Nedap Nv | READING, WRITING SYSTEM WITH MINIATURE INFORMATION CARRIER. |
HU212136B (en) | 1987-10-27 | 1996-03-28 | Cedcom Network Systems Pty Ltd | Communication system |
US4969146A (en) | 1987-11-10 | 1990-11-06 | Echelon Systems Corporation | Protocol for network having a plurality of intelligent cells |
US4955018A (en) | 1987-11-10 | 1990-09-04 | Echelon Systems Corporation | Protocol for network having plurality of intelligent cells |
CA1321649C (en) | 1988-05-19 | 1993-08-24 | Jeffrey R. Austin | Method and system for authentication |
JP2758030B2 (en) | 1988-07-04 | 1998-05-25 | ソニー株式会社 | Thin electronic device and manufacturing method thereof |
NO169983C (en) | 1988-10-27 | 1992-08-26 | Micro Design As | PROCEDURE AND DEVICE FOR INDIVIDUAL IDENTIFICATION |
US5025486A (en) | 1988-12-09 | 1991-06-18 | Dallas Semiconductor Corporation | Wireless communication system with parallel polling |
US5142694A (en) | 1989-07-24 | 1992-08-25 | Motorola, Inc. | Reporting unit |
US5150310A (en) | 1989-08-30 | 1992-09-22 | Consolve, Inc. | Method and apparatus for position detection |
US5124697A (en) | 1989-10-16 | 1992-06-23 | Motorola, Inc. | Acknowledge-back pager |
SE464946B (en) | 1989-11-10 | 1991-07-01 | Philips Norden Ab | TRANSMISSION SYSTEM INCLUDING A QUESTION STATION AND NUMBER OF ANSWERING STATIONS |
GB2238147B (en) | 1989-11-16 | 1993-04-21 | Gen Electric Co Plc | Radio telemetry systems |
US6389010B1 (en) | 1995-10-05 | 2002-05-14 | Intermec Ip Corp. | Hierarchical data collection network supporting packetized voice communications among wireless terminals and telephones |
CA2034878C (en) | 1990-03-08 | 2002-04-02 | Craig S. Hyatt | Programmable controller communication module |
US5640151A (en) | 1990-06-15 | 1997-06-17 | Texas Instruments Incorporated | Communication system for communicating with tags |
US5121407A (en) | 1990-09-27 | 1992-06-09 | Pittway Corporation | Spread spectrum communications system |
US5144668A (en) | 1991-01-25 | 1992-09-01 | Motorola, Inc. | Signal overlap detection in a communication system |
US6714559B1 (en) | 1991-12-04 | 2004-03-30 | Broadcom Corporation | Redundant radio frequency network having a roaming terminal communication protocol |
US5266925A (en) | 1991-09-30 | 1993-11-30 | Westinghouse Electric Corp. | Electronic identification tag interrogation method |
US5461627A (en) | 1991-12-24 | 1995-10-24 | Rypinski; Chandos A. | Access protocol for a common channel wireless network |
US5231646A (en) | 1992-03-16 | 1993-07-27 | Kyros Corporation | Communications system |
US5365551A (en) * | 1992-12-15 | 1994-11-15 | Micron Technology, Inc. | Data communication transceiver using identification protocol |
US5500650A (en) * | 1992-12-15 | 1996-03-19 | Micron Technology, Inc. | Data communication method using identification protocol |
US5539775A (en) | 1993-03-17 | 1996-07-23 | Micron Technology, Inc. | Modulated spread spectrum in RF identification systems method |
US5373503A (en) | 1993-04-30 | 1994-12-13 | Information Technology, Inc. | Group randomly addressed polling method |
US5790946A (en) | 1993-07-15 | 1998-08-04 | Rotzoll; Robert R. | Wake up device for a communications system |
US5479416A (en) * | 1993-09-30 | 1995-12-26 | Micron Technology, Inc. | Apparatus and method for error detection and correction in radio frequency identification device |
US5555286A (en) | 1994-01-31 | 1996-09-10 | Tendler Technologies, Inc. | Cellular phone based automatic emergency vessel/vehicle location system |
US5449296A (en) | 1994-03-07 | 1995-09-12 | Cabel-Con, Inc. Usa | Cable connector apparatus for preventing radiation leakage |
US5471212A (en) * | 1994-04-26 | 1995-11-28 | Texas Instruments Incorporated | Multi-stage transponder wake-up, method and structure |
US5530702A (en) | 1994-05-31 | 1996-06-25 | Ludwig Kipp | System for storage and communication of information |
US5500065A (en) | 1994-06-03 | 1996-03-19 | Bridgestone/Firestone, Inc. | Method for embedding a monitoring device within a tire during manufacture |
US6812852B1 (en) | 1994-09-09 | 2004-11-02 | Intermac Ip Corp. | System and method for selecting a subset of autonomous and independent slave entities |
US5942987A (en) | 1994-09-09 | 1999-08-24 | Intermec Ip Corp. | Radio frequency identification system with write broadcast capability |
US5550547A (en) | 1994-09-12 | 1996-08-27 | International Business Machines Corporation | Multiple item radio frequency tag identification protocol |
US5619648A (en) | 1994-11-30 | 1997-04-08 | Lucent Technologies Inc. | Message filtering techniques |
US5625628A (en) * | 1995-03-15 | 1997-04-29 | Hughes Electronics | Aloha optimization |
US5805586A (en) | 1995-05-02 | 1998-09-08 | Motorola Inc. | Method, device and data communication system for multilink polling |
US7085637B2 (en) | 1997-10-22 | 2006-08-01 | Intelligent Technologies International, Inc. | Method and system for controlling a vehicle |
US5649296A (en) * | 1995-06-19 | 1997-07-15 | Lucent Technologies Inc. | Full duplex modulated backscatter system |
US5606323A (en) | 1995-08-31 | 1997-02-25 | International Business Machines Corporation | Diode modulator for radio frequency transponder |
US6038455A (en) | 1995-09-25 | 2000-03-14 | Cirrus Logic, Inc. | Reverse channel reuse scheme in a time shared cellular communication system |
FR2741979B1 (en) | 1995-12-01 | 1998-01-23 | Raimbault Pierre | METHOD FOR REMOTE QUERYING STATION LABELS AND LABEL FOR IMPLEMENTING SAME |
US5940006A (en) | 1995-12-12 | 1999-08-17 | Lucent Technologies Inc. | Enhanced uplink modulated backscatter system |
US6097292A (en) | 1997-04-01 | 2000-08-01 | Cubic Corporation | Contactless proximity automated data collection system and method |
US6010074A (en) | 1996-04-01 | 2000-01-04 | Cubic Corporation | Contactless proximity automated data collection system and method with collision resolution |
US6130602A (en) | 1996-05-13 | 2000-10-10 | Micron Technology, Inc. | Radio frequency data communications device |
US6157633A (en) | 1996-06-10 | 2000-12-05 | At&T Wireless Sucs. Inc. | Registration of mobile packet data terminals after disaster |
US5943624A (en) | 1996-07-15 | 1999-08-24 | Motorola, Inc. | Contactless smartcard for use in cellular telephone |
US6362737B1 (en) * | 1998-06-02 | 2002-03-26 | Rf Code, Inc. | Object Identification system with adaptive transceivers and methods of operation |
WO1998016849A1 (en) | 1996-10-17 | 1998-04-23 | Pinpoint Corporation | Article tracking system |
US6812824B1 (en) * | 1996-10-17 | 2004-11-02 | Rf Technologies, Inc. | Method and apparatus combining a tracking system and a wireless communication system |
US5999091A (en) * | 1996-11-25 | 1999-12-07 | Highwaymaster Communications, Inc. | Trailer communications system |
JP3540109B2 (en) * | 1996-12-24 | 2004-07-07 | 富士通株式会社 | Data compression method and apparatus |
US6289209B1 (en) | 1996-12-18 | 2001-09-11 | Micron Technology, Inc. | Wireless communication system, radio frequency communications system, wireless communications method, radio frequency communications method |
US6104333A (en) | 1996-12-19 | 2000-08-15 | Micron Technology, Inc. | Methods of processing wireless communication, methods of processing radio frequency communication, and related systems |
US5952922A (en) | 1996-12-31 | 1999-09-14 | Lucent Technologies Inc. | In-building modulated backscatter system |
US6130623A (en) | 1996-12-31 | 2000-10-10 | Lucent Technologies Inc. | Encryption for modulated backscatter systems |
US6243012B1 (en) | 1996-12-31 | 2001-06-05 | Lucent Technologies Inc. | Inexpensive modulated backscatter reflector |
US6570487B1 (en) | 1997-01-24 | 2003-05-27 | Axcess Inc. | Distributed tag reader system and method |
US6415439B1 (en) | 1997-02-04 | 2002-07-02 | Microsoft Corporation | Protocol for a wireless control system |
US5988510A (en) | 1997-02-13 | 1999-11-23 | Micron Communications, Inc. | Tamper resistant smart card and method of protecting data in a smart card |
US5914671A (en) | 1997-02-27 | 1999-06-22 | Micron Communications, Inc. | System and method for locating individuals and equipment, airline reservation system, communication system |
US6288629B1 (en) | 1997-05-23 | 2001-09-11 | Intermec Ip Corp. | Method of using write—ok flag for radio frequency (RF) transponders (RF Tags) |
US6078888A (en) | 1997-07-16 | 2000-06-20 | Gilbarco Inc. | Cryptography security for remote dispenser transactions |
US5986570A (en) | 1997-09-03 | 1999-11-16 | Micron Communications, Inc. | Method for resolving signal collisions between multiple RFID transponders in a field |
US6073840A (en) | 1997-09-26 | 2000-06-13 | Gilbarco Inc. | Fuel dispensing and retail system providing for transponder prepayment |
US6118789A (en) * | 1998-02-19 | 2000-09-12 | Micron Technology, Inc. | Method of addressing messages and communications system |
GB9724183D0 (en) | 1997-11-14 | 1998-01-14 | British Tech Group | Identification system |
US6778096B1 (en) | 1997-11-17 | 2004-08-17 | International Business Machines Corporation | Method and apparatus for deploying and tracking computers |
US6216132B1 (en) | 1997-11-20 | 2001-04-10 | International Business Machines Corporation | Method and system for matching consumers to events |
US5966471A (en) * | 1997-12-23 | 1999-10-12 | United States Of America | Method of codebook generation for an amplitude-adaptive vector quantization system |
US6072801A (en) | 1998-02-19 | 2000-06-06 | Micron Technology, Inc. | Method of addressing messages, method of establishing wireless communications, and communications system |
US6275476B1 (en) | 1998-02-19 | 2001-08-14 | Micron Technology, Inc. | Method of addressing messages and communications system |
US6061344A (en) * | 1998-02-19 | 2000-05-09 | Micron Technology, Inc. | Method of addressing messages and communications system |
US6169474B1 (en) | 1998-04-23 | 2001-01-02 | Micron Technology, Inc. | Method of communications in a backscatter system, interrogator, and backscatter communications system |
US6324211B1 (en) | 1998-04-24 | 2001-11-27 | Micron Technology, Inc. | Interrogators communication systems communication methods and methods of processing a communication signal |
US6459726B1 (en) | 1998-04-24 | 2002-10-01 | Micron Technology, Inc. | Backscatter interrogators, communication systems and backscatter communication methods |
US6075973A (en) | 1998-05-18 | 2000-06-13 | Micron Technology, Inc. | Method of communications in a backscatter system, interrogator, and backscatter communications system |
US6192222B1 (en) | 1998-09-03 | 2001-02-20 | Micron Technology, Inc. | Backscatter communication systems, interrogators, methods of communicating in a backscatter system, and backscatter communication methods |
US6566997B1 (en) | 1999-12-03 | 2003-05-20 | Hid Corporation | Interference control method for RFID systems |
JP3690285B2 (en) | 2001-02-01 | 2005-08-31 | 日本ビクター株式会社 | Color separation / synthesis optical system and projection display device using the same |
US7688764B2 (en) | 2002-06-20 | 2010-03-30 | Motorola, Inc. | Method and apparatus for speaker arbitration in a multi-participant communication session |
US6707376B1 (en) | 2002-08-09 | 2004-03-16 | Sensormatic Electronics Corporation | Pulsed power method for increased read range for a radio frequency identification reader |
US7026935B2 (en) | 2003-11-10 | 2006-04-11 | Impinj, Inc. | Method and apparatus to configure an RFID system to be adaptable to a plurality of environmental conditions |
US7667575B2 (en) | 2004-07-30 | 2010-02-23 | Reva Systems Corporation | Location virtualization in an RFID system |
US7924141B2 (en) | 2006-12-01 | 2011-04-12 | Round Rock Research, Llc | RFID communication systems and methods, and RFID readers and systems |
US7973644B2 (en) | 2007-01-30 | 2011-07-05 | Round Rock Research, Llc | Systems and methods for RFID tag arbitration where RFID tags generate multiple random numbers for different arbitration sessions |
US8134452B2 (en) | 2007-05-30 | 2012-03-13 | Round Rock Research, Llc | Methods and systems of receiving data payload of RFID tags |
-
1998
- 1998-02-19 US US09/026,045 patent/US6072801A/en not_active Expired - Lifetime
-
2000
- 2000-04-18 US US09/551,304 patent/US6226300B1/en not_active Expired - Lifetime
-
2001
- 2001-01-31 US US09/773,461 patent/US6307848B1/en not_active Expired - Lifetime
-
2003
- 2003-10-23 US US10/693,697 patent/USRE42344E1/en not_active Expired - Lifetime
-
2007
- 2007-10-01 US US11/865,580 patent/USRE43020E1/en not_active Expired - Lifetime
- 2007-10-01 US US11/865,584 patent/USRE43445E1/en not_active Expired - Lifetime
-
2009
- 2009-12-17 US US12/641,249 patent/USRE44411E1/en not_active Expired - Lifetime
Cited By (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020000034A1 (en) * | 2000-03-24 | 2002-01-03 | Jenson Mark Lynn | Continuous processing of thin-film batteries and like devices |
US20020037756A1 (en) * | 2000-03-24 | 2002-03-28 | Integrated Power Solutions Inc. | Battery-operated wireless-communication apparatus and method |
US8637349B2 (en) | 2000-03-24 | 2014-01-28 | Cymbet Corporation | Method and apparatus for integrated-circuit battery devices |
US8044508B2 (en) | 2000-03-24 | 2011-10-25 | Cymbet Corporation | Method and apparatus for integrated-circuit battery devices |
US7877120B2 (en) | 2000-03-24 | 2011-01-25 | Cymbet Corporation | Battery-operated wireless-communication apparatus and method |
US20060080410A1 (en) * | 2002-11-15 | 2006-04-13 | Maclarty Glen M | Method and apparatus for forming and maintaining a network of devices |
US8806026B2 (en) * | 2002-11-15 | 2014-08-12 | British Telecommunications Plc | Method and apparatus for forming and maintaining a network of devices |
EP1422652A2 (en) * | 2002-11-20 | 2004-05-26 | Siemens Aktiengesellschaft | Method for collision-free data exchange between reading/writing device and mobile data carrier, reading/writing device, mobile data carrier and identification system |
EP1422652A3 (en) * | 2002-11-20 | 2005-04-27 | Siemens Aktiengesellschaft | Method for collision-free data exchange between reading/writing device and mobile data carrier, reading/writing device, mobile data carrier and identification system |
US7603144B2 (en) * | 2003-01-02 | 2009-10-13 | Cymbet Corporation | Active wireless tagging system on peel and stick substrate |
US20050095506A1 (en) * | 2003-10-16 | 2005-05-05 | Klaassen Jody J. | Lithium/air batteries with LiPON as separator and protective barrier and method |
US8477017B2 (en) | 2004-04-28 | 2013-07-02 | Atmel Corporation | Method, system, and integrated circuit for communication in RFID or remote sensor systems |
US8054162B2 (en) * | 2004-04-28 | 2011-11-08 | Atmel Corporation | Communication method in RFID or remote sensor systems |
US20050242927A1 (en) * | 2004-04-28 | 2005-11-03 | Atmel Co. | Communication method in RFID or remote sensor systems |
WO2006020144A3 (en) * | 2004-07-15 | 2006-04-06 | Mastercard International Inc | Collision detection and avoidance scheme for contactless card payment systems |
WO2006020144A2 (en) * | 2004-07-15 | 2006-02-23 | Mastercard International Incorporated | Collision detection and avoidance scheme for contactless card payment systems |
US7939205B2 (en) | 2005-07-15 | 2011-05-10 | Cymbet Corporation | Thin-film batteries with polymer and LiPON electrolyte layers and method |
US7931989B2 (en) | 2005-07-15 | 2011-04-26 | Cymbet Corporation | Thin-film batteries with soft and hard electrolyte layers and method |
US7776478B2 (en) | 2005-07-15 | 2010-08-17 | Cymbet Corporation | Thin-film batteries with polymer and LiPON electrolyte layers and method |
AU2006292042B2 (en) * | 2005-09-30 | 2011-10-13 | SK Planet Co., Ltd | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefor |
KR100625675B1 (en) | 2005-09-30 | 2006-09-18 | 에스케이 텔레콤주식회사 | Method for identifying tags using adaptive binary tree splitting technique in rfid system and rfid system therefor |
US20090040021A1 (en) * | 2005-09-30 | 2009-02-12 | Sk Telecom Co., Ltd. | Method For Identifying Tags Using Adaptive Binary Tree Splitting Technique In RFID System and RFID System Therefore |
US8477016B2 (en) | 2005-09-30 | 2013-07-02 | Sk Planet Co., Ltd. | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefore |
WO2007037595A1 (en) * | 2005-09-30 | 2007-04-05 | Sk Telecom Co., Ltd. | Method for identifying tags using adafitve binary tree splitting technique in rfid system and rfid system therefor |
AU2006292042B8 (en) * | 2005-09-30 | 2011-10-27 | SK Planet Co., Ltd | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefor |
US8443110B2 (en) * | 2011-02-28 | 2013-05-14 | Honeywell International Inc. | Approach for discovering devices on a common bus without direct communication |
US9853325B2 (en) | 2011-06-29 | 2017-12-26 | Space Charge, LLC | Rugged, gel-free, lithium-free, high energy density solid-state electrochemical energy storage devices |
US10199682B2 (en) | 2011-06-29 | 2019-02-05 | Space Charge, LLC | Rugged, gel-free, lithium-free, high energy density solid-state electrochemical energy storage devices |
US10601074B2 (en) | 2011-06-29 | 2020-03-24 | Space Charge, LLC | Rugged, gel-free, lithium-free, high energy density solid-state electrochemical energy storage devices |
US11527774B2 (en) | 2011-06-29 | 2022-12-13 | Space Charge, LLC | Electrochemical energy storage devices |
US11996517B2 (en) | 2011-06-29 | 2024-05-28 | Space Charge, LLC | Electrochemical energy storage devices |
US10658705B2 (en) | 2018-03-07 | 2020-05-19 | Space Charge, LLC | Thin-film solid-state energy storage devices |
Also Published As
Publication number | Publication date |
---|---|
US6072801A (en) | 2000-06-06 |
USRE42344E1 (en) | 2011-05-10 |
USRE44411E1 (en) | 2013-08-06 |
USRE43445E1 (en) | 2012-06-05 |
USRE43020E1 (en) | 2011-12-13 |
US6307848B1 (en) | 2001-10-23 |
US6226300B1 (en) | 2001-05-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6226300B1 (en) | Method of addressing messages, and establishing communications using a tree search technique that skips levels | |
US6282186B1 (en) | Method of addressing messages and communications system | |
USRE41530E1 (en) | Method and apparatus to select radio frequency identification devices in accordance with an arbitration scheme | |
US6275476B1 (en) | Method of addressing messages and communications system | |
USRE43382E1 (en) | Method of addressing messages and communications systems | |
EP1596544B1 (en) | Method and devices for establishing wireless communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
CC | Certificate of correction | ||
RF | Reissue application filed |
Effective date: 20031023 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: KEYSTONE TECHNOLOGY SOLUTIONS, LLC, IDAHO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:019825/0542 Effective date: 20070628 Owner name: KEYSTONE TECHNOLOGY SOLUTIONS, LLC,IDAHO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:019825/0542 Effective date: 20070628 |
|
RF | Reissue application filed |
Effective date: 20071001 |
|
RF | Reissue application filed |
Effective date: 20071001 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
RF | Reissue application filed |
Effective date: 20091022 |
|
AS | Assignment |
Owner name: ROUND ROCK RESEARCH, LLC,NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:023786/0416 Effective date: 20091223 Owner name: ROUND ROCK RESEARCH, LLC, NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:023786/0416 Effective date: 20091223 |
|
AS | Assignment |
Owner name: MICRON TECHNOLOGY, INC., IDAHO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KEYSTONE TECHNOLOGY SOLUTIONS, LLC;REEL/FRAME:023839/0881 Effective date: 20091222 Owner name: MICRON TECHNOLOGY, INC.,IDAHO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KEYSTONE TECHNOLOGY SOLUTIONS, LLC;REEL/FRAME:023839/0881 Effective date: 20091222 |
|
RF | Reissue application filed |
Effective date: 20091217 |
|
RF | Reissue application filed |
Effective date: 20091217 |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
RF | Reissue application filed |
Effective date: 20130805 |