Wireless network synchronization of cells and client devices on a network

Information

  • Patent Grant
  • 11800502
  • Patent Number
    11,800,502
  • Date Filed
    Thursday, June 30, 2022
    2 years ago
  • Date Issued
    Tuesday, October 24, 2023
    a year ago
  • Inventors
  • Original Assignees
    • Proxense, LL (Bend, OR, US)
  • Examiners
    • Sweet; Lonnie V
    Agents
    • PATENT LAW WORKS LLP
    • Sueoka; Greg T
Abstract
A system and method for wireless synchronization on a network are disclosed. In one embodiment, the wireless device includes a wireless transceiver and processing circuitry. The wireless transceiver wirelessly receives synchronization information including a superframe from a first wireless, reader device, and wirelessly transmits the synchronization information to a second wireless, reader device and a portable wireless device, and to wirelessly detect a presence of a portable wireless device. The processing circuitry communicates synchronization information to the second wireless, reader device and portable wireless device. The superframe is used to synchronize a wireless data exchange between the third wireless, reader device and the portable wireless device.
Description

Applicants hereby notify the USPTO that the claims of the present application are different from those of the aforementioned related applications. Therefore, Applicant rescinds any disclaimer of claim scope made in the parent applications, grandparent applications or any other predecessor applications in relation to the present application. The Examiner is therefore advised that any such disclaimer and the cited reference that it was made to avoid may need to be revisited at this time. Furthermore, the Examiner is also reminded that any disclaimer made in the present application should not be read into or against the parent applications, the grandparent applications or any other related application.


BACKGROUND

Optimizing sales transactions, providing secure access to physical and digital assets, uniquely identifying individuals, and generally improving communications and data exchange are challenges faced by many businesses and organizations. Ensuring that these processes are safe, efficient, reliable, and simple is important to companies, merchants, service providers, users, and consumers. Well-known technologies such as user-specific magnetic cards (e.g., credit and debit cards, employee badges), and more recent developments such as contactless cards designed to allow access or authorization when placed near a compatible reader, are examples of attempts to address the need to instill efficiency and integrity in, for example, the general classes of transactions described above.


SUMMARY

According to at least one aspect of one or more embodiments of the present invention, a system includes: a first wireless device having a first range of wireless coverage; a second wireless device having a second range of wireless coverage; and a synchronization device having a third range of wireless coverage and configured for wireless communication with the first wireless device, the second wireless device and a portable wireless device, the synchronization device configured to wirelessly transmit a superframe that includes system information, where an operation of the first fixed wireless device and an operation of the second fixed wireless device are coordinated based on synchronization information wirelessly broadcast by the synchronization device. The portable wireless device configured for communication with the synchronization device, the portable wireless device configured to locate any of the first wireless device, the second wireless device and the synchronization device to facilitate wireless tracking and enable a user that is associated with the portable wireless device to access at least one of an application, an asset and a service.


According to at least one other aspect of one or more embodiments of the present invention, the first range and the second range of wireless coverage at least partially overlap.


According to at least one other aspect of one or more embodiments of the present invention, an operation of the portable wireless device located in at least one of the first range and the second range is coordinated using the synchronization information.


According to at least one other aspect of one or more embodiments of the present invention, the first wireless device and the second wireless device are arranged to communicate with another wireless device.


According to at least one other aspect of one or more embodiments of the present invention, at least one of the first wireless device and the second wireless device comprises a first wireless transceiver and a second wireless transceiver. The first wireless transceiver arranged to monitor transmission by the synchronization device. The second wireless transceiver arranged to wirelessly communicate with the portable wireless device in proximity to the at least one of the first wireless device and the second wireless device.


According to at least one other aspect of one or more embodiments of the present invention, at least one of the first wireless device and the second wireless device comprises a single transceiver arranged to periodically monitor transmission by the synchronization device and further arranged to wirelessly communicate with the portable wireless device in proximity to the at least one of the first wireless device and the second wireless device.


According to at least one other aspect of one or more embodiments of the present invention, the synchronization device is arranged to transmit a security update. According to at least one other aspect of one or more embodiments of the present invention, the system further comprises a central server configured to gather information from the first wireless device and the second wireless device. According to at least one other aspect of one or more embodiments of the present invention, the central server is operatively connected to at least one of the first wireless device and the second wireless device via a wired connection.


According to at least one other aspect of one or more embodiments of the present invention, a wireless communication in the system is dependent on an IEEE 802.15.4-2003 protocol.


According to at least one other aspect of one or more embodiments of the present invention, use of a service provided by the system is accessible with the portable wireless device, wherein successful access depends at least partially on a security mechanism provided in at least one of the first wireless device and the second wireless device.


According to at least one other aspect of one or more embodiments of the present invention, at least one of the first wireless device and the second wireless device is arranged to simultaneously detect presence of a plurality of portable wireless devices in proximity to the at least one of the first wireless device and the second wireless device.


According to at least one other aspect of one or more embodiments of the present invention, at least one of the first wireless device and the second wireless device is further arranged to differentiate among the plurality of simultaneously detected portable wireless devices.


According to at least one other aspect of one or more embodiments of the present invention, the at least one of the first wireless device and the second wireless device is further arranged to coordinate a plurality of data exchanges with the plurality of simultaneously detected portable wireless devices.


According to at least one other aspect of one or more embodiments of the present invention, the plurality of data exchanges is coordinated based on the synchronization information.


According to at least one other aspect of one or more embodiments of the present invention, the synchronization device is a standalone device.


According to at least one other aspect of one or more embodiments of the present invention, an apparatus includes: a physical, portable key device, wherein the key device including a wireless transceiver adapted to wirelessly receive synchronization information from a network device, and processing circuitry adapted to synchronize its operation based on a superframe that includes system information and a timing of a framing structure, received from any of a first wireless device, a second wireless device and a synchronization device to facilitate wireless tracking and enable a user that is associated with the portable key device to access at least one of an application, an asset and a service.


According to at least one other aspect of one or more embodiments of the present invention, a method for facilitating data exchange includes: receiving, at a first wireless transceiver, a superframe that includes system information and a timing of a framing structure from a network device; receiving, at a second wireless transceiver, the superframe from the network device; coordinating, with the network device, synchronization of the first and second wireless transceivers based on the superframe from the network device; transmitting the superframe to a portable wireless device wherein the portable wireless device synchronizes its operations based on the superframe to facilitate wireless tracking; and locating, with the portable wireless device, any of the first wireless device, the second wireless device and the network device to enable a user to access at least one of an application, an asset and a service.


The features and advantages described herein are not all inclusive, and, in particular, many additional features and advantages will be apparent to those skilled in the art in view of the following description. Moreover, it should be noted that the language used herein has been principally selected for readability and instructional purposes and may not have been selected to circumscribe the present invention.





BRIEF DESCRIPTION OF DRAWINGS


FIG. 1 shows a single wireless cell in which a reader decoder circuit (RDC) and a personal digital key (PDK) are present.



FIG. 2 shows partially overlapping RDC cells.



FIG. 3 shows synchronized partially overlapping RDC cells.



FIG. 4 shows a synchronized multi-cell system in accordance with one or more embodiments of the present invention.



FIG. 5 shows a PDK in accordance with one or more embodiments of the present invention.



FIG. 6 shows a portion of the PDK shown in FIG. 5.



FIG. 7 shows a portion of the PDK shown in FIG. 5.



FIG. 8 shows an RDC in accordance with one or more embodiments of the present invention.



FIG. 9 shows an RDC in accordance with one or more embodiments of the present invention.



FIG. 10 shows an arrangement of a timeslot in accordance with one or more embodiments of the present invention.



FIG. 11 shows a superframe in accordance with one or more embodiments of the present invention.



FIG. 12 shows a coordinator superframe in accordance with one or more embodiments of the present invention.



FIG. 13 shows an overall framing structure in accordance with one or more embodiments of the present invention.



FIG. 14 shows an RDC beacon for use in a single cell system in accordance with one or more embodiments of the present invention.



FIG. 15 shows a single cell system in accordance with one or more embodiments of the present invention.



FIG. 16 shows a PDK-RDC handshake in accordance with one or more embodiments of the present invention.



FIG. 17 shows a coordinator beacon configuration in accordance with one or more embodiments of the present invention.



FIG. 18 shows a PDK transmit timeslot enable operation in accordance with one or more embodiments of the present invention.



FIG. 19 shows a location tracking system configuration in accordance with one or more embodiments of the present invention.



FIG. 20 shows a coordinator RDC (CRDC) location tracking handshake in accordance with one or more embodiments of the present invention.



FIG. 21 shows a configuration in which RDCs and PDKs are coordinated within a CRDC cell in accordance with one or more embodiments of the present invention.



FIG. 22 shows a CRDC framing and PDK timeslot response operation in accordance with one or more embodiments of the present invention.



FIG. 23 shows a CRDC beacon and PDK response handshake in accordance with one or more embodiments of the present invention.



FIG. 24 shows a PDK/RDC association in a CRDC cell in accordance with one or more embodiments of the present invention.



FIG. 25 shows an RDC beacon transmission in accordance with one or more embodiments of the present invention.



FIG. 26 shows a deep sleep state diagram in accordance with one or more embodiments of the present invention.



FIG. 27 shows an authorization denial handshake operation in accordance with one or more embodiments of the present invention.



FIG. 28 shows an authorization grant and association handshake in accordance with one or more embodiments of the present invention.



FIG. 29 shows a single cell with multiple PDK access in accordance with one or more embodiments of the present invention.



FIG. 30 shows multiple single cell RDCs with cell overlap in accordance with one or more embodiments of the present invention.



FIG. 31 shows a floor layout and cell distribution in accordance with one or more embodiments of the present invention.



FIG. 32 shows a gambling table with RDCs in accordance with one or more embodiments of the present invention.



FIG. 33 shows a CRDC beacon to central server flow in accordance with one or more embodiments of the present invention.



FIG. 34 shows a CRDC beacon to central server handshake in accordance with one or more embodiments of the present invention.



FIG. 35 shows a configuration of overlapping CRDC cells in accordance with one or more embodiments of the present invention.



FIG. 36 shows a c-beacon handoff for RDC-PDK communication in accordance with one or more embodiments of the present invention.



FIG. 37 shows a PDK wakeup and response state flow in accordance with one or more embodiments of the present invention.



FIG. 38 shows a configuration of an electronic game with an integrated RDC in accordance with one or more embodiments of the present invention.



FIG. 39 shows an electronic game player tracking and game enable handshake in accordance with one or more embodiments of the present invention.



FIG. 40 shows an electronic game player association handshake in accordance with one or more embodiments of the present invention.



FIG. 41 shows a configuration of an electronic game with an integrated RDC in accordance with one or more embodiments of the present invention.



FIG. 42 shows an electronic game player tracking and game enable handshake in accordance with one or more embodiments of the present invention.



FIG. 43 shows an electronic game player association handshake in accordance with one or more embodiments of the present invention.





Each of the figures referenced above depict an embodiment of the present invention for purposes of illustration only. Those skilled in the art will readily recognize from the following description that one or more other embodiments of the structures, methods, and systems illustrated herein may be used without departing from the principles of the present invention.


DETAILED DESCRIPTION

In the following description of embodiments of the present invention, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without one or more of these specific details. In other instances, well-known features have not been described in detail to avoid unnecessarily complicating the description.


In general, embodiments of the present invention relate to a technique for synchronizing (or “coordinating”) multiple wireless cells, in any one of which an individual (or “user”) can reliably and securely conduct one or more wireless transactions with some device in one or more of the cells. Particularly, in one or more embodiments, wireless cells are synchronized in order to prevent wireless collisions and extend the battery life of individual user units. In addition, embodiments of the present invention relate to a technique for wirelessly communicating with a plurality of client devices without data collision. Particularly, in one or more embodiments, individual client devices are assigned time slots during the client devices may wirelessly communicate. Furthermore, embodiments of the present invention relate to a technique for dynamically varying a cell size in which a secure wireless transaction occurs. Particularly, in one or more embodiments, when a reader device detects the presence of a wireless client device, a cell size of the reader device may be varied in an effort to, for example, add security, to any subsequent transaction between the reader device and the client device.


At perhaps a most basic level, one or more embodiments includes a personal digital key (“PDK”) and a reader decoder circuit (“RDC”). In general, a PDK is a portable wireless device that may be conveniently carried by an individual to facilitate wireless tracking and/or allow the individual to wirelessly access various applications, assets, and/or services. As further described in detail below with reference to FIGS. 5-7, a PDK may be any device that (i) may be worn, placed in a pocket, wallet, or purse of a user, or attached to equipment, (ii) has a bi-directional wireless communications transceiver, and (iii) stores public and/or secret electronic identification numbers, as possibly some set of cryptographic keys. The form factor of the PDK is not limiting, so long as the PDK may be portably, and preferably conveniently and seamlessly, carried by an individual. For example, a PDK may be in the form of a “key fob” or a card, or in certain embodiments, a PDF may actually be integrated with or implemented in another device, such as a watch or mobile computing device (e.g., cellular phone, personal digital assistant (PDA)).


An RDC, as used in one or more embodiments, is a device that can wirelessly interact with a PDK to link the PDK user with various applications, assets, and/or services. The RDC may be a fixed access point serving as a gatekeeper for a PDK requesting access to a particular system. An RDC may be used in various settings and/or applications. For example, an RDC may be physically incorporated into a casino floor itself, an electronic game, a doorway, a pedestrian traffic monitoring point, a personal computer application, an e-commerce device (e.g., an automatic teller machine (ATM)), or any other application requiring a secure transaction or access control.


Further, secure data exchange for various financial and/or retail applications may be facilitated through use of a PDK and RDC in accordance with one or more embodiments. For example, a purchasing system may be implemented whereby a consumer can purchase goods or services using his/her personal “key” (e.g., a PDK) based on the key being in detectable wireless proximity of a reader device (e.g., an RDC). The purchase transaction may then be carried out based on some data exchange between the key and the reader device, where the key stores accessible, and possibly encrypted or encoded, information about the consumer (e.g., name, address, phone number, bank account information, biometric information, credit or debit card information). The validation or authentication of the consumer may occur either on the key itself and/or by the reader device. In the case of “on-key” validation, for example, the reader device may pass some information about the consumer (e.g., a biometric input, such as fingerprint data) to the key, which then matches the data provided by the reader device with permanently stored secure data about the consumer.


Various other applications or uses involving any number of PDK and RDC devices are possible in accordance with one or more embodiments. Accordingly, while examples of scenarios and applications are described herein for purposes of illustration and clarity, the present invention is not limited to any particular application, scenario, setting, or use.


Single Cell Operation of the RDC and PDK


Now referring to FIG. 1, it shows a single cell 10 in which, at some point in time, an RDC 12 and a PDK 14 are present. The RDC 12 may be some fixed device that has a cell radius defined by its wireless coverage boundary. When an individual carrying the PDK 14 comes into proximity of the RDC 12 by entering a coverage area of the RDC 12, a wireless communications session is initiated between the PDK 14 and the RDC 12. If the RDC 12 determines that the PDK 14 is authorized to communicate, information between the PDK 14 and the RDC 12 may be securely exchanged. Information securely obtained from the user's PDK 14 may then be used locally or sent through a back-end communications channel to a central server (not shown). When the transaction completes or when the PDK 14 leaves the coverage area of the RDC 12, wireless communication between the RDC 12 and the PDK 14 ceases. Thereafter, the RDC 12 may remain idle (i.e., be in a “tracking” mode) until a PDK again enters the cell 10.


Unsynchronized Multi-Cell Operation of Multiple RDCs and PDKs


Now referring to FIG. 2, in certain implementations, multiple RDC cells 20, 22, 24 may exist in an area. The RDCs in the multiple cells 20, 22, 24 may or may not be aware of each other, but are able to interact with one or more PDKs. The PDKs, in turn, are capable of interacting with the RDCs. As shown in FIG. 2, there are three partially overlapping RDC cells 20, 22, 24. An RDC 26, 28, 30 in cells 20, 22, 24, respectively, is independent and may not be in association with the other RDCs. Although the cells 20, 22, 24 partially overlap, each RDC 26, 28, 30 is capable of wirelessly communicating with any PDK 29, 31 within its cell boundary.


In one or more embodiments, the RDC 26, 28, 30 is capable of determining if energy is present on any given wireless channel. The RDC 26, 28, 30 may then determine the best channel to operate on and continue to place an identification marker (or “beacon”) out for any PDK 29, 31 that enters its cell boundary.


The PDK 29, 31 itself may be responsible for locating an RDC 26, 28, 30 by searching through available wireless channels, communicating with an RDC 26, 28, 30, and notifying the RDC 26, 28, 30 of its presence. In an implementation where two RDCs can communicate with one another (e.g., RDCs 26, 28 in cells 20, 22 shown in FIG. 2), the RDCs may select different communication frequencies. However, in the case where cells overlap, but each RDC cannot directly communicate with one another (e.g., RDCs 28, 30 in cells 22, 24 shown in FIG. 2), any PDK intending to access an RDC, may have to alert the RDC of possible collisions on the wireless channel on which the RDC is operating.


Synchronized Multi-Cell Operation of Multiple RDCs and PDKs


In certain implementations, multiple RDCs may be placed to allow an overlap of cells between each adjacent RDC within a confined area. This permits each RDC to be aware of its surrounding RDCs, thereby allowing synchronization of each RDC to the other. For example, now referring to FIG. 3, there are shown three partially overlapping RDC cells 40, 42, 44 with RDCs 46, 48, 50. The cell 40, 42, 44 of each respective RDC 46, 48, 50 overlaps the cell of the adjacent RDC 46, 48, 50. In such a manner, each RDC 46, 48, 50 may initiate wireless communication with an adjacent RDC 46, 48, 50. This begins a negotiation process among the RDCs 46, 48, 50 to determine which RDC 46, 48, 50 should be the coordinator and on what channel to communicate.


Although any of the RDCs 46, 48, 50 may be the coordinator, in the example shown in FIG. 3, RDC 48 in cell 42 may be a favorable candidate. Its selection permits ubiquitous coverage of the RDCs 46, 48, 50 shown in FIG. 3, additionally providing multiple transactions and timing alignment through a “daisy chain” whereby RDC 46 synchronizes RDC 48 and RDC 48 synchronizes RDC 50.


Still referring to FIG. 3, each RDC 46, 48, 50 may also share frequency and timeslot information among each other and with one or more PDKs. It is noted that if a PDK is located at an edge of, for example, cell 40, that PDK may still monitor the other channels that adjacent RDCs 48, 50 are operating on, but may not have access to these RDCs. Thus, in a configuration such as that shown in FIG. 3, a PDK may be forced to consume more energy due to the monitoring of multiple channels. Further, it is noted that as cell density increases, more collisions may begin occurring and/or active communication times may increase.


Coordinated Multi-Cell Operation


Now referring to FIG. 4, it shows an exemplar synchronized (or “coordinated”) multi-cell system 60 in accordance with one or more embodiments. As will be apparent from the description below, a synchronized multi-cell system may provide ubiquitous PDK and RDC synchronization as well as PDK battery conservation within the system 60. Further, in addition to ubiquitous synchronization, channel and frequency capacity may both be coordinated, thereby reducing collisions while increasing system throughput.


Turning now to FIG. 4 particularly, a coordinator RDC (“CRDC”) 62 has ubiquitous coverage of a plurality of cells 64, 66, 68 in the system 60. In one or more embodiments, the CRDC 62 provides beacon transmissions, which can be used to synchronize a plurality of devices within the coverage area 76 of the CRDC 62. In other words, by providing wide-area coverage, a plurality of devices, both RDCs 70, 72, 74 and PDKs (shown, but not labeled in FIG. 4), in the coverage area 76 are able to monitor a wireless transmission beacon broadcast by the CRDC 62 and determine how and when to communicate in a coordinated manner. Further, in one or more embodiments, the CRDC 62 may broadcast additional information including, but not limited to, a beacon transmission rate, framing information, channel information, system identification, and/or cluster identification. Moreover, it is noted that although the CRDC 62 may provide timing and certain system related information, RDCs 70, 72, 74 and PDKs may still communicate among themselves.


As described above with reference to FIGS. 1-4, there are at least three different types of devices (or software entities) that may be used, for example, in a synchronized multi-cell system, such as that shown in FIG. 4. A PDK is a trackable device having secure electronic keys and that may be portably carried by a user. An RDC is a device that acts as a gatekeeper controlling access of a PDK to a particular system. A CRDC is a device that is used to synchronize one or more RDCs and PDKs within a particular geographic area formed of either a single cell or multiple cells. A more detailed description of each of these components is now provided below.


PDK


Now referring to FIG. 5, it shows an example PDK 80 in accordance with one or more embodiments. Based on a specific application or use of the PDK 80, the PDK 80 may have different configurations for interacting with the PDK user. For example, the PDK 80 may have no user input mechanism or display, may have a single button input mechanism, may have a multi-button input mechanism, may have a biometric input mechanism, and/or may have an interactive user input mechanism and/or display.


As shown in FIG. 5, the PDK 80 has a wireless radio frequency (RF) media access control (MAC) and physical layer device 82 that facilitates bi-directional communications with external wireless RF devices, such as an RDC (not shown). In one or more embodiments, the wireless RF MAC and physical layer device 82 may communicate according to an IEEE 802.15.4 protocol. However, in one or more other embodiments, the PDK 80 may be capable of communicating according to one or more different wireless protocols.


The PDK 80 also has a service and application layer controller 84 that includes a MAC portion 94 that serves as an interface with the wireless RF MAC and physical layer device 82. Further, the service and application layer controller 84 also includes portions that provide specific functions used to protect electronic keys and services of the PDK 80. Further still, the service and application layer controller 84 may support an optional user interface 86, which if implemented, allows user interaction with the PDK 80. A cryptography engine 88 may also be resident on the PDK 80.


Now also referring to FIG. 6, it shows a non-volatile memory storage 90 and a volatile memory storage 92 of the PDK 80. These two devices 90, 92 are related to security storage. In one or more embodiments, these devices 90, 92 may be accessible by an RDC (not shown) having the appropriate security algorithms and by private service providers having the correct security information. However, in one or more other embodiments, certain secured data may not be wirelessly communicated at all, in which case, validation or authorization occurs on the PDK 80 itself.


Specifically as to the non-volatile memory storage 90, a public serial number may be used to identify the PDK 80 and allow secure look-up of a secure serial number and a cryptography key via a remote server (not shown). The secure serial number may be thought of as being equivalent to, for example, encoded user identification information stored in a magnetic strip of a credit card, whereby such information is not visible to the outside world. The cryptography key may be used to allow decoding of the secure serial number from, for example, an RDC (not shown).


Further, it is noted that in one or more embodiments, the non-volatile memory storage 90 and associated parameter lengths may be dynamically assigned, with overall constraints depending on, for example, available memory in the PDK 80.


Now, specifically as to the volatile memory storage 92, this area may be used for security and may allow a service provider to store a profile containing secret keys and other secure information, such as privilege information. A service provider identification value may be stored to allow the service provider to easily identify the user. In addition, a service provider service identification value may be stored and used to allow that service provider to access that information. The PDK 80 validates that service provider identification value via the service provider secret key before allowing access to that service provider's profile area in the PDK 80. Further, as shown in FIG. 6, the volatile memory storage 92 may have a number of service provider profiles.


Now also referring to FIG. 7, the service provider profile area may be of a variable length and allow a service provider the flexibility to store various parameters. The length may be determined by a byte count following the service provider's secret key in the memory area as shown in FIG. 7.


RDC


Next, turning to a more detailed description of an RDC 100 according to one or more embodiments, reference is made below to FIGS. 8 and 9. In general, an RDC 100, as described above, may be fixed and used to allow a PDK access into a particular system (e.g., gaming/casino system, financial institution, retail system). The RDC 100 may have different configurations to support different types of secure transactions. Some examples of applications and uses of RDCs include, but are not limited to, casino slot machines and gaming consoles, secure entryway control, user/equipment location tracking, personal computers and components thereof (e.g., disk drives), financial institution interactions, and retail purchasing. In the case of a personal computer, or any computer system for that matter, a reader device, such as an RDC, may be used to control access to certain data stored in the computer system. Thus, in such embodiments, an RDC 100 may be thought of as providing a form of digital content management.


In certain cases, the RDC 100 effectively acts as a gatekeeper allowing authorized individuals access to specific information or transactions. In other cases, because an RDC 100 may use proximity detection for determining if a PDK is within a particular geographical area, the RDC 100 may also be used for tracking one or more PDKs within a given area or network. In still other cases, an RDC 100 may be used for both location tracking and secure transaction purposes.



FIG. 8 shows a type of RDC 100 that uses a single wireless RF MAC and physical layer device 102. In RDC 100, communications are passed through the single wireless RF MAC and physical layer device 102. The single wireless RF MAC and physical layer device 102 facilitates bi-directional communication with one or more external RF wireless devices, such as a PDK (not shown). Thus, the single wireless RF MAC and physical layer device 102 may communicate with both PDKs according to assigned time slots (further described below) and one or more CRDCs (described in further detail below). Further, it is noted that in one or more embodiments, the single wireless RF MAC and physical layer device 102 may wirelessly communicate according to an IEEE 802.15.4 protocol. However, in one or more other embodiments, the RDC 100 may be capable of communicating according to one or more different wireless protocols.


The RDC 100 also has a service and application layer controller 104. The service and application layer controller 104 has a MAC portion 106 specific to a wireless protocol of the RDC 100. The service and application layer controller 104 may further provide functions related to associating and tracking PDKs (not shown), as well as providing information back to a service provider.


The service and application layer controller 104 includes system parameters and configuration information 108 that may be used to identify the RDC 100 and define how the RDC 100 operates within a given environment. Further, the system parameters and configuration information 108 may define how the RF link is time slotted and/or how RF frequencies are used in the system. In one or more embodiments, these values may be optimized to reduce power consumption within one or more PDKs (not shown).


Still referring to the RDC 100 shown in FIG. 8, a cryptography engine 110 may also be present. One or more of various storage elements may also exist in the service and application layer controller 104. A secure key storage area 112 may be programmed to define public, secret, and/or cryptography keys for the RDC 100.


Further, in one or more embodiments, the service and application layer controller 104 may have additional memory areas, one or more of which may dynamically change dependent on system changes and wireless PDK connections. A volatile service provider storage 114 may allow a service provider to store semi-static information related to a specific PDK (not shown) or group of PDKs (not shown) for real-time access for those devices. An example might relate to a hotel room door lock. With a hotel room door, service provider information related to a PDK may be stored in the RDC. When a user comes within proximity of the door, the door could unlock. Thus, in this example, the RDC is not required to interface with a back-end server in real-time, thereby reducing bandwidth consumption to the back-end server, while allowing the user immediate access. Moreover, in one or more embodiments, the RDC may have a connection to a network or other infrastructure for receiving control signals as to which PDKs should be allowed to unlock the door.


The service and application layer controller 104 may also have a proximity tracking PDK list 116 that includes PDK identity information, signal quality metrics, and/or time stamps for each PDK (not shown) that is in proximity of the RDC 100. Such information may be used in the RDC 100 to perform an operation and/or may be relayed to a back-end server when, for example, location tracking is desired.


Still referring to FIG. 8, the service and application layer controller 104 may also have an associated PDK parameter storage 118. The associated PDK parameter storage 118 may contain a list of one or more PDKs (not shown) actively performing transactions with the RDC 100. It is noted that in one or more embodiments, although such transactions are performed with the RDC 100, the actual processing result of the RDC 100 to/from PDK transaction may be passed to a back-end server for further processing.


A service provider interface 120 may allow both control and query of the RDC 100. The service provider interface 120 may further provide the transport for keys from a PDK (not shown). In one or more embodiments, the service provider interface 120 may use a universal asynchronous transmitter receiver (UART) interface and may allow some level of control and status of the RDC 100.


An external service provider controller 122 may be attached to the service provider interface 120 with a system stack 124 residing in the external service provider controller 122. The system stack 124 may allow a third party to easily interface with the RDC 100, possibly requiring function calls to the system stack 124. Further, the external service provider controller 122 may provide translation of data. It is still further noted that the external service provider controller 122 and the RDC 100 may reside on the same physical component (e.g., circuit board).


Now referring to FIG. 9, it shows another type of RDC 130, which has an additional wireless RF MAC and physical layer device 132. In this configuration, components having like reference numbers as those reference numbers in FIG. 8 function identically or similarly to the corresponding components in FIG. 8. The additional wireless RF MAC and physical layer device 132 may be used to maintain synchronization with a CRDC (not shown) and pass networking related information, while the other wireless RF MAC and physical layer device 102 may be used to communicate with one or more PDKs (not shown) within a cell of the RDC 130. Further, the service and application layer controller 104 may have an additional MAC portion 134 to interface with the additional wireless RF MAC and physical layer device 132.


Still referring to the RDC 130, the use of dual wireless transceivers 102, 132 may allow for increased throughput and efficient use of the RF spectrum available to the system. Thus, in other words, these multiple wireless links allow simultaneous reception of data from client devices (e.g., PDKs) and of CRDC timing information on separate channels, thereby eliminating the need for back-channel synchronization of the network. Further, the multiple wireless links may allow for the simultaneous proximity sensing of multiple client devices (e.g., PDKs) in a “tracking” mode, along with the association of a client device with one particular cell for wireless application (e.g., secure transaction) purposes. For example, an RDC serving as a wireless player tracking device on a casino floor may, while keeping track of multiple transient players entering and leaving the zone of coverage of that particular tracking device, invite a particular player to begin a gaming session. This session may also include the exchange of player information with, for example, both the game and its back-end server to allow credit for games played and money spent. In another scenario, the system may facilitate another entire suite of applications, such as, for example, unlocking a hotel room door, while simultaneously keeping track of unrelated client devices coming and going within its coverage range.


CRDC


Next, turning to a more detailed description of a CRDC according to one or more embodiments, a CRDC may, for example, be an RDC of either of the types described above with reference to FIGS. 8 and 9. At least one difference, however, between a CRDC and an RDC is that the CRDC has increased RF power output, or more generally, casts a broader range of wireless coverage. Another difference is that, in one or more embodiments, a CRDC may not communicate bi-directionally with a PDK, whereas an RDC of the types described above with reference to FIGS. 8 and 9 may. Moreover, a CRDC may be capable of communicating with another CRDC, and may also be capable of communicating with an RDC. It is noted that CRDC-CRDC communication may allow for frame synchronization and frequency planning without requiring a wired connection between the CRDCs. The same may be true for CRDC-RDC communications. In certain implementations, it may occur that CRDC cell boundaries do not overlap, and thus, the corresponding CRDCs may not be able to directly communicate with another. In this case, an RDC that is between the cells may communicate with both CRDCs and act as a communication bridge to pass frequency and other control information in an effort to coordinate the system.


Still describing the general application and use of a CRDC in accordance with one or more embodiments, the CRDC may serve as a stand-alone wireless beacon that may be used to coordinate the timing and activities of individual, physically separated wireless providers (e.g., RDCs) with defined coverage areas, along with their clients (e.g., PDKs) in an autonomous, wireless proximity sensing and data transfer network. A CRDC may also be used to propagate system-wide information (e.g., periodic changes in cryptographic keys), thereby relieving traffic otherwise loading a wired back-end network linking individual cells to the back-end system. Thus, the CRDC may act as a system-wide master clock across multiple cells that may not be close enough to synchronize with each other directly without a wired connection.


Wireless Protocol


As described above, a system in accordance with one or more embodiments may rely, or at least partly be based, on an IEEE 802.15.4 protocol. In relation to a protocol usable in one or more embodiments, a “timeslot” is defined as a period of time that information is communicated between two devices. FIG. 10 shows an example of portions of a timeslot in accordance with one or more embodiments. The timeslot is divided into a frame (or physical packet data unit (PPDU)) and inter-frame spacing (IFS). The frame includes synchronization information and carries the payload of data. The IFS allows time for a receiving end unit to process the data in the frame and transmitter turn-around time. Both the PPDU and the IFS may be variable in length as determined by an amount of data carried in the frame.


The frame is broken down into a sync header (SHR), a physical header (PHR), and a physical service data unit (PSDU). The SHR may contain a preamble sequence and start-of-frame delimiter (SFD) that allows a receiving device to acquire the RF signal and synchronize to the frame. The PSDU may then be used to carry both 802.15.4 MAC and user data information. Further, it is noted that the PSDU may be of a variable length that is determined by the type of MAC and data information being carried.


Still referring to FIG. 10, the frame may be further divided into symbols, which, in turn, are divided into bits. In one or more embodiments, each symbol may includes 4 bits that are sent least significant bit to most significant bit at the base band level.


Now referring to FIG. 11, a “superframe” is formed of multiple timeslots. The superframe may be used in a beacon-enabled synchronous network where PDKs can find an RDC and/or CRDC fixed device. The superframe may allow a PDK to efficiently determine if an RDC is present on any given frequency.


The superframe may be configured such that timeslot 0 (TS0) is the “beacon timeslot.” Each superframe that is transmitted may start with a beacon timeslot. Further, each timeslot may be equally spaced so that a PDK and RDC can communicate.


Further, it is noted that in one or more embodiments, a superframe may be of a variable length dependent on the resolution to a timeslot. The initial number of timeslots within a superframe may be, for example, 16; but, in one or more other embodiments, a superframe may have a different number of timeslots.


Now referring to FIG. 12, a “coordinator superframe” (c-superframe) may be formed of multiple superframes. In one or more embodiments, a c-superframe may be generated by a CRDC. A c-superframe may provide one or more advantages over a superframe. For example, a c-superframe may provide better battery management for a PDK, as well as provide distributed superframe and timeslots in a high density networking environment.


As shown in FIG. 12, a c-superframe may have multiple superframes. Because each superframe may have a beacon, as described above with reference to FIG. 11, multiple beacons may be transmitted per c-superframe. This may allow a PDK to quickly determine if it is within a system. A c-superframe may also number the superframes, so that both an RDC and a PDK can realize their position within the framing structure.



FIG. 13 shows an overall framing structure of a timeslot as described above with reference to FIG. 10, a superframe as described above with reference to FIG. 11, and a c-superframe as described above with reference to FIG. 12.


Beacons


As discussed above with reference to FIG. 11, a beacon may be sent in every superframe. The beacon is used to alert PDKs (and RDCs when a CRDC is present) of system information and timing of the framing structure employed. In one or more embodiments, such a configuration may be implemented using an IEEE 802.15.4 protocol. However, in one or more other embodiments, communication may occur according to one or more different wireless protocols.


In a single cell configuration in which one RDC is present (shown, for example, in FIG. 1), the beacon may be transmitted in timeslot 0 of a superframe boundary. By transmitting the beacon periodically, a PDK may wake up and find the beacon within a short period of time and realize that it is within some particular network.


In an unsynchronized multi-cell configuration in which multiple RDCs are geographically located near each other, but no synchronization between RDCs is implemented (shown, for example, in FIG. 2), a PDK may still wake up, detect the presence of the RDCs, and synchronize and communicate with each RDC due to the presence of the beacon on each RDC.


In a high density area in which multiple RDCs are present, a CRDC may most likely be present. In such a configuration, the CRDC may transmit the beacon, and all RDCs and PDKs in the coverage area of the CRDC align to the CRDC beacon. The CRDC may send a beacon on each superframe, as well as a c-superframe and other configuration information to the RDCs and PDKs.


Now referring to FIG. 14, in a single cell configuration (shown, for example, in FIG. 1), a beacon is periodically output based on a specific number of timeslots. Further, in one or more embodiments, the beacon may be used in accordance an IEEE 802.15.4 protocol, with additional data attached indicating it is an RDC. At the end of each superframe, there may exist an additional idle period that allows tolerance in an over-the-air protocol.


After a beacon is transmitted, a PDK may immediately respond provided it follows the rules of what is know in the art as “carrier sense multiple access-collision avoidance” (CSMA-CA). If a PDK finds that the channel is busy in the current timeslot, the PDK may back-off and attempt again to access the RDC in another timeslot following the same rules. In the case the PDK is not able to communicate with the RDC, the PDK may wait for the next beacon and attempt again.



FIG. 15 shows a single cell configuration in accordance with one or more embodiments. As shown in FIG. 15, a single fixed RDC 140 may be connected to a back-end server (not shown). The single cell system shown in FIG. 15 includes, for example: a computing controller with an operating system, an application, a back-end server interface, and a system stack; the RDC 140, which is the gateway for a PDK and performs authorization (the system stack and RDC 140 together allow a user who has a PDK to access the application dependent on authorization from the back-end server); and a PDK 142 that includes necessary security information and is within reasonable proximity to wirelessly communicate with the RDC 140.


An example handshake of the PDK 142 with the RDC 140 is shown in FIG. 16. The RDC 140 outputs a periodic beacon based on timeslot 0 of a superframe. Eventually, a user walks within the coverage area of the RDC 140, and the user's PDK 142 detects the beacon from the RDC 140. The PDK 142 determines if it is registered to this RDC 140 (or network), and, if so, responds with a PDK location response. The RDC 140 then detects the PDK location response and performs a link request to the PDK 142. The PDK 142 then accepts the request by replying with a link grant, and the two devices 140, 142 are now in data exchange mode. In data exchange mode, the two devices 140, 142 may transfer specific security information that result in the RDC 140 enabling access to the system through the system stack, computing controller, and/or back-end central server.


Periodically, data may be exchanged between the RDC 140 and the PDK 142 to ensure that the PDK 142 is still within close proximity of the RDC 140. As long as data exchange continues on a periodic basis, the application may remain enabled and the user can continue to access the application.


After some amount of time, the user walks away from the RDC 140 causing the data exchange to cease, in which case, the system stack indicates to the computing controller that the PDK 142 is out of range. The computing controller then disables the application to prevent unauthorized access. Regardless of data exchange, the RDC 140 may continue to transmit periodic beacons to guarantee that other PDKs may gain access to the application.


Now referring to FIG. 17, a configuration of a “coordinator beacon” (c-beacon) is shown. The coordinator beacon may be generated by a CRDC, or RDC behaving like a CRDC. As described above, a CRDC may cover a large geographic area covering a plurality of RDCs and PDKs within that area. The c-beacon may be a standard beacon sent in the first timeslot of each superframe as shown in FIG. 17.


A c-beacon, in accordance with one or more embodiments, may have properties that are different than those associated with an IEEE 802.15.4 standard beacon. For example, the standard c-beacon carries a field indicating the beacon is a c-beacon. Further, a c-beacon, in normal operation, is a unidirectional transmission from a CRDC. Further still, a c-beacon may contain other c-beacon related information: number of slots in a superframe; number of superframes in a c-superframe; the channels on which adjacent CRDCs operate; current superframe number; current c-superframe number; site ID; CRDC ID; PDK superframe mask; and PDK timeslot mask.


Further, it is noted that while beacons may be transmitted from a CRDC on timeslot 0 of each superframe, remaining timeslots of a superframe may be left open for unsynchronized communications between PDKs and RDCs. The term “unsynchronized” is used to describe communications between the PDKs and the RDCs because the RDC and PDK share a common CRDC beacon, but the PDK may not get synchronized directly to an RDC beacon. In this manner, the PDK and RDC may appear to represent a peer-to-peer network.


C-beacon information described above relates to configuration fields that allow the system to operate efficiently when using a CRDC. In the case of, for example, a large scale system, a service provider of the system may have knowledge of RDC coverage relative to the CRDC. The following description provides details of these fields.


A “superframe_len” field may be governed by an IEEE 802.15.4 protocol. The number of slots may be from, for example, 21 to 214. The number of slots in a superframe may be used to define the repetition rate for the beacon.


A “c-superframe_len” field may be used to define a higher layer counter used for extended power savings in a PDK. The c-superframe_len value may also define the number of beacons within a superframe. If the superframe is configured to not have a beacon, then this field may be ignored.















Name
Type
Valid Range
Description







C-Superframe_Len
Integer
0 to 15
Defines the number of





Superframes in a





C-Superframe. Number of





Superframes is





defined as 2C-SuperframeLen









A “CRDC_chan_flags” field may be used to indicate to a PDK what channels are used by adjacent CRDCs.















Name
Type
Bit
Description


















CRDC_Chan_Flags
Binary

When any bit in this field





is set to a 1, an adjacent





CRDC is transmitting





on that frequency.



Binary
0
1 = Channel 0 available





0 = Channel 0 not available



Binary
1
1 = Channel 1 available





0 = Channel 1 not available



Binary
2
1 = Channel 2 available





0 = Channel 2 not available



Binary
3
1 = Channel 3 available





0 = Channel 3 not available



Binary
4
1 = Channel 4 available





0 = Channel 4 not available



Binary
5
1 = Channel 5 available





0 = Channel 5 not available



Binary
6
1 = Channel 6 available





0 = Channel 6 not available



Binary
7
1 = Channel 7 available





0 = Channel 7 not available



Binary
8
1 = Channel 8 available





0 = Channel 8 not available



Binary
9
1 = Channel 9 available





0 = Channel 9 not available



Binary
10
1 = Channel 10 available





0 = Channel 10 not available



Binary
11
1 = Channel 11 available





0 = Channel 11 not available



Binary
12
1 = Channel 12 available





0 = Channel 12 not available



Binary
13
1 = Channel 13 available





0 = Channel 13 not available



Binary
14
1 = Channel 14 available





0 = Channel 14 not available



Binary
15
1 = Channel 15 available





0 = Channel 15 not available









A “superframe_cnt” field may be used to define a current superframe (or beacon) count within a c-superframe. If the superframe is configured to not have a beacon, then this field may not be transmitted.















Name
Type
Valid Range
Description







Superframe_Cnt
Integer
0 to 65535
Defines the current





Superframe count.









A “c-superframe_cnt” field may be used to define a current c-superframe count. If the superframe is configured to not have a beacon, then this field may not be transmitted.















Name
Type
Valid Range
Description







C-Superframe_Cnt
Integer
0 to 65535
Defines the current





C-Superframe count.









A “PDK_sf_ts_msk” field may be used to define the bits of a superframe count and the timeslot count to use for PDK superframe and timeslot sequencing while in a tracking mode. If the superframe is configured to not have a beacon, then this field may not be transmitted.















Name
Type
Valid Range
Description







PDK ®_SF_TS_Msk


Defines which bits are to





be used for determining





PDK ® superframes and





timeslots to communicate





with an RDC during





location tracking.


Superframe Mask
Binary
0000000000000
Defines the Superframe mask




to
1 = enable bit




1111111111111
0 = mask bit


Timeslot Mask
Binary
000 to 111
Defines the Timeslot mask





1 = enable bit





0 = mask bit









The PDK_sf_ts_msk value may be used in conjunction with a portion of the service provider unique PDK identification value and may be used to determine the exact superframe and timeslot the PDK is permitted to transmit a location identifier back to the RDCs. The necessary logic and variables required to perform this operation are illustrated in FIG. 18.


Further, in one or more embodiments, to set the mask value of a particular PDK, a “set_pdk_msk_val” function may be used. The mask may be used over the superframe and timeslot counts and service provider's PDK ID to determine the superframe and timeslot the PDK is active on in the framing structure. In other words, the set_pdk_msk_val function may be used to set a mask for the PDK in an effort to establish at what times the PDK can communicate with an RDC. The function may return a pass or fail indication to indicate whether the mask has been successfully set. Conversely, to obtain the mask value being used by a particular PDK, a “get_pdk_msk_val” function may be used to retrieve the current PDK superframe and timeslot mask parameters.


Using, for example, the masking approach described above, individual client devices (e.g., PDKs) within a given cell (e.g., an RDC's wireless coverage area) may be addressed via real-time re-provisioning on command. Thus, in other words, by reserving time slots for both client device transmission and reception (based on masks established by the network), client transmission and reception time slots may be efficiently coordinated to reduce collision likelihood and allow for tiered client access, assignment of specific classes, and/or targeting an individual user for preferential, non-contended system access. Further, in one or more embodiments, bit masks may be changed to include or exclude specific users (or classes of users). Still further, in one or more embodiments, bit masks may be changed to dynamically alter access to the network by users or classes of users as traffic load on the network changes. Moreover, it is noted that once a specific client exits the network, previously reserved time slots of that client may be reassigned to one or more other client devices in the network.


To provide an example, there may be multiple client devices (e.g., PDKs) in proximity of a particular fixed reader device (e.g., an RDC). Each of these client devices, other than providing a location response, may request some data exchange with the reader device in order carry out a secure transaction. In an effort to reduce collision and coordinate the time slots that each client device “talks” with the reader device, a mask may be communicated to each client device to set the times at which the client device is to communicate with the reader device. Further, certain ones of the client devices may be afforded some level of priority, in which case the masks would be set accordingly. For example, masks may be set according to a class of a user of a PDK or to a class of the PDK itself. To facilitate such differentiation, priority level or tier level data may be present in an RDC or CRDC to be used when setting a mask for a particular client device or group thereof. Thus, in such a manner, there is provided a technique for dynamic real-time tiered client access. Moreover, it is noted that in one or more embodiments, a CSMA-CA mechanism may be implemented as a backup approach to facilitate data exchange.


Further, in one or more embodiments, utilization of a tiered access system to transfer and receive data to/from a specific user or client device anywhere within a wireless network may allow for simultaneously operating network-wide two-way communications without altering the network. Thus, in other words, although one or more embodiments relate to an autonomous wireless proximity sensing and data transfer network, such a network may be used to notify, page, or transfer data possibly unrelated to one or more of the applications which a majority of the client devices on the network are using (or typically use) (such applications being for the purposes of, for example, tracking, access control, and/or digital rights management). In another example, a network device may be able to associate a PDK ID to a particular user and then provide messaging capability based on the identity of the user. Thus, in this case, one or more embodiments may be combined with tiering to provide multiple messaging levels for different users.


The ability to assign tiers to the network may also enable low latency responses from targeted client devices. Accordingly, by integrating features into the client device that may take advantage of a two-way network capability, a system in accordance with one or more embodiments may allow for the simultaneous communication and control of external devices via real-time client command along with a general purpose low data rate two-way network.


Continuing with the description of c-beacon information in accordance with one or more embodiments, a “site_ID” field may carry a value that each CRDC transmits to all PDKs and RDCs within a coverage area of the CRDC. The site_ID value allows a PDK to determine if it can access the current site or if it needs to request permissions to access the site's network.















Name
Type
Valid Range
Description







Site_ID
Integer
0 to 65535
Defines the current sites ID.









A “CRDC_ID” field may carry a value that each CRDC transmits to all PDKs and RDCs within a coverage area of the CRDC. The CRDC_ID may be used, for example, for geographical reference.















Name
Type
Valid Range
Description







CRDC_ID
Integer
0 to 65535
Defines the current CRDC ID.









Now turning to a description of a use of a c-beacon, reference is made to FIGS. 19 and 20. A location tracking example in accordance with one or more embodiments is shown in FIG. 19. There are various different types of devices in the system 150 shown in FIG. 19. First, there is a CRDC 152 that may provide system information and facilitate synchronization for RDCs and PDKs. The system 150 also has RDCs 154, 156, which listen for PDKs and report the status of each PDK found within its respective cell 158, 160. The system 150 further includes a PDK 162 that is mobile and capable of being moving around. Further, the system 150 has a server 164, which is the back-end computer that controls the CRDC 152, acquires information from the RDCs 154, 156, and may provide a graphical representation to monitoring personnel via a computer monitor (not shown).


Accordingly, FIG. 19 shows how location tracking of a PDK is possible and a handshake between different parts of the system 150. A handshake example of PDK location tracking in a CRDC configuration is shown in FIG. 20. The CRDC 152 periodically broadcasts a beacon in timeslot 0 of each superframe. Enabled client devices within the CRDC cell boundary receive the beacon. After the PDK 162 receives the beacon and determines that the beacon is from a system that it is registered to, the PDK 162 broadcasts a PDK location response that is received by the RDCs 154, 156. Both RDC 154 and RDC 156 receive the response, log the PDK ID, the signal quality metrics, and timestamps the information. The packet of information may then be sent to the server 164, where the server 164 processes the data from each RDC 154, 156 and performs a location estimation that may then be presented to an operator. At the beginning of the next superframe, the beacon is again transmitted and the process is repeated until the PDK 162 can no longer be heard due to it being out of range.


Now referring to FIG. 21, it shows a system 170 in which both PDKs and RDCs are coordinated within a CRDC cell boundary. Because, in one or more embodiments, RDCs are stationary devices and may occasionally be relocated, the RDCs may be initially coordinated by manually configuring both timeslots and frequencies they operate on.


As shown in FIG. 21, one CRDC cell 172 and 6 smaller RDC cells 174, 176, 178, 180, 182, 184 exist. The CRDC cell 172 provides ubiquitous coverage to the RDC cells 174, 176, 178, 180, 182, 184. Each RDC cell 174, 176, 178, 180, 182, 184 overlaps its adjacent RDCs in a manner resulting in a high rate of collisions if the RDCs 186, 188, 190, 192, 194, 196 attempt to communicate with a PDK 198 on the same channel. It is envisioned that all the RDCs 186, 188, 190, 192, 194, 196 could be on different frequencies, but then the PDK 198 would be required to access each frequency for some duration, resulting in reduced battery life. To eliminate interference between the RDCs 186, 188, 190, 192, 194, 196 and provide the PDK 198 with an efficient means to conduct secure transactions, the system 170 shown in FIG. 21 may be used.


To optimize the system 170 for battery conservation of the PDK 198, each RDC 186, 188, 190, 192, 194, 196 may be provided with a dual RF physical interface. The primary interface is for monitoring a c-beacon and the PDK 198 located in close proximity, and to signal the PDK 198 to switch to another channel for further communications with that particular RDC. In this case, the CRDC (not shown) may transmit c-beacons, whereby all RDCs and PDKs will gain timing synchronization.


Based on the configuration shown in FIG. 21, the c-beacon fields described above may be configured as follows: superframe_len=4 (24=16 timeslots); c-superframe_len=4 (24=16 superframes); CRDC_chan_flags=b0000000000000010 (most significant bit to least significant bit—CRDC channels); PDK_sf_ts_msk=b000000000011111 (mask all but 2 least significant bits of the superframe count and don't mask any timeslot bits); site_ID=0x1234 (arbitrary site identification); and CRDC_ID=0x0001 (arbitrary CRDC_ID).


Another piece of information that may be inherent to the PDK is a unique service provider PDK ID. The unique service provider PDK ID is located in the PDK and may be compared with the superframe and timeslot count prior to applying the mask, but may not affect the superframe and timeslot counts from a time reference standpoint. In this case, the unique service providers PDK ID for this PDK may be equal to 0x0003.


Using the above described values for the c-beacon, the following system attributes result (the superframe is 16 timeslots long, so once out of every 16 timeslots, a c-beacon is created allowing the PDK to determine if a system with the correct system ID exists): the c-superframe length is set to 16; the CRDC_chan_flags indicate to the PDK the number of CRDC channels available in the system; the PDK_sf_ts_msk indicates which bits to logically AND with the superframe and timeslot count to determine which slots to respond on (in this case, the PDK_sf_ts_msk is a hex value of 0x001F that is ANDed with the superframe and timeslot count resulting in one response timeslot); and the site_ID and CRDC ID are arbitrary values and may be left to the service provider for selecting unique identification values.


Using the above described exemplar system configuration information and having a PDK with a unique service provider ID of 0x0003, FIG. 22 shows how the PDK may operate in a CRDC framing structure. As shown in FIG. 22, the c-superframe_len is set to 16—thus, the superframe count counts from 0 to 15 and then starts over at 0. Each superframe then includes 16 timeslots of which the first timeslot is timeslot 0 and includes the beacon. The superframe_len is also set to 16—thus, there are 16 timeslots for each superframe. Again, the timeslots are numbered from 0 to 15, and restart at 0 for each superframe.


In one or more embodiments, based on the parameters set by the system and the unique service provider PDK ID, the PDK may periodically transmit a PDK location response in timeslot 3 of each superframe on a modulo 4 basis. This causes the PDK to respond in timeslot 3 of superframes 0, 4, 8, and 12 of a c-superframe. It is noted that the PDK may follow the CSMA-CA standard and if the PDK cannot respond in its timeslot, it may wait for its next designated superframe and timeslot to respond.


If an RDC requests to begin communication with a PDK, the RDC may immediately respond on the next even timeslot, which, in this case, is timeslot 4. Any RDC may respond, but RDCs may have to use the CSMA-CA rule prior to responding to the PDK transmission. If an RDC begins communications with a PDK, the following timeslot may be used to instruct the PDK to go to another channel, where bi-directional communications may commence.


Further, in one or more embodiments, an active superframe may occur when unmasked bits in the superframe count equal the corresponding unmasked bits in the unique service providers PDK ID. In this case, the superframe mask is a value of 0x003 and the unique service provider PDK ID is 0x0003.


With this information, the following calculation occurs:









xor




and







b000000000000




b000000000000




b000000000000




b000000000111




b000000000000





nor


all


bits





1








superframe



count

[

15
:
4

]







unique


Service


Provider



PDK
®




ID
[

14
:
3

]







result


of


xor


function






Superframe



Mask

[

11
:
0

]







result


of


AND


function











result


is


true








As shown above, a portion of the superframe count is exclusive-ORed with a portion of the unique service provider PDK ID. The result of the exclusive-OR is all 0's. Then, the superframe mask is ANDed with the result of the exclusive-OR function. The AND operation also results in all 0's. The result of the AND function is then compared to zero by NORing all of the bits together and results in a 1 or “true” output, indicating the bits compared between the superframe count and the unique service provider PDK ID are a match.


An active timeslot occurs when the unmasked bits in the 3 most significant positions of the timeslot count equal the unmasked bits in the unique service provider PDK ID's 3 least significant bits and the timeslot count least significant bit is a 1 (the PDK transmits on odd frames). In this case, the timeslot mask is a value of 0x7 and the unique service providers PDK ID's 3 least significant bits are 0x3.


With this information, the following calculation occurs:









xor




and








b

011






b

011






b

000






b

111






b

000






nor


all


bits





1








timeslot



count

[

3
:
1

]







unique


Service


Provider







PDK
®




ID
[


2
:
0

]







result


of


xor


function






Timeslot


Mask






result


of


AND


function











result


is


true








As shown above, the timeslot count is exclusive-ORed with a portion of the unique service provider PDK ID. The result of the exclusive-OR is all 0's. Then, the timeslot mask is ANDed with the result of the exclusive-OR function. The AND operation also results in all 0's. The result of the AND function is then compared to zero by NORing all of the bits together and result in a 1 or “true” output, indicating the bits compared between the timeslot count and the unique service provider PDK ID are a match.


The last portion of the calculation that needs to be completed (as described above) is to verify the last bit of the slot count is a ‘1,’ indicating an odd slot. If the unmasked superframe and timeslot bits do not match the appropriate unique service provider PDK ID, the results will be “false” and no match will occur. In the examples described above, the superframe mask was set to unmask the 2 least significant bits of the superframe count to show that it is possible to allow a PDK to come up more frequently than the c-superframe count. By increasing the superframe mask to 4 bits, this example would allow the PDK to respond once per c-superframe (because the c-superframe was set to 16) and the modulo for the mask would be 24, or 16.


The timeslot mask may be set to allow all timeslot bits to be correlated to determine the timeslot, allowing the PDK to respond once per superframe. Further, it is noted that it may be possible to mask some of the timeslot bits to increase the number of times a PDK can respond within a superframe.


In one or more embodiments, a PDK may periodically wake up to determine whether it is within a particular system. Upon a periodic wake up, the PDK will detect a c-beacon indicating that the particular system is present, along with system information. The PDK will collect the system information and determine the current superframe count of a c-superframe. The PDK may also put parameters (e.g., PDK_sf_ts_msk) in place to start immediate battery save in the system.


Based on an approximate time, the PDK may awake just prior to where it believes the next superframe is that it should communicate on, and will listen for the beacon and begin responding with the PDK location response message.


As shown in FIG. 23, a CRDC may update its system information on each superframe and output a c-beacon with current information to all PDKs and RDCs. The PDK then waits for its predefined superframe and timeslot and responds. This scenario continues to occur until the PDK leaves the CRDC cell or an RDC responds to the PDK.


As described above, a CRDC may continue to output a c-beacon, and the PDK periodically awakes to re-align to the superframe and respond to the c-beacon. If a RDC is present and wants to communicate with the PDK, the RDC may respond on the even timeslot immediately available after the PDK's transmission. FIG. 24 shows how the communications handshake between the PDK and RDC may occur. Particularly, FIG. 24 depicts one CRDC, one RDC with two active channels (i.e., using two wireless links), and a PDK.


With continued reference to FIG. 24, the CRDC outputs a c-beacon of which the RDC and PDK are aligned. The PDK realizes that the c-beacon's superframe count correlates to its internal predefined active superframe count, and then waits for the appropriate timeslot to respond to the system with its PDK location response. When the PDK responds on the c-beacon channel, the RDC detects the response and determines that it wants to associate with the PDK. The RDC then creates a message including its own RDC ID, the PDK's ID, a command to switch to channel 2, and a predicted superframe and timeslot the PDK should respond on. The PDK, in response, switches to channel 2 and waits for the appropriate superframe and timeslot count and transmits a link request along with its PDK ID and the destination RDC ID. The destination RDC then receives the information and responds back to the PDK with a link grant. Communications may now begin between the two devices exchanging the appropriate information to maintain the PDK-RDC link. To maintain synchronization, the RDC may define the periodic communication frequency with the PDK and will periodically generate a request to the PDK to exchange information. The PDK may then reconfigure its wake parameters to that of the RDC, as the RDC is maintaining superframe synchronization.


It is noted that in one or more embodiments, such as that described immediately above, the RDC may have a dual physical interface, maintaining synchronization with the CRDC on channel 1, while associating with one or more PDKs on channel 2. The physical interface connected to channel 1 provides timing to the physical interface on channel 2.


Further, because the RDC may have intelligence on both channels, the RDC may provide coordination of PDKs that it wants to redirect to channel 2 and PDKs that are on channel 2. More specifically, the RDC may move the superframe and timeslot that a PDK communicates to the RDC on, if another PDK with the same timeslot requirements is present on channel 1 and the RDC wants to associate with it.


CRDC Slot and Channel Coordination


In one or more embodiments, a CRDC may be configured via a remote connection to a server or automatically. Using remote configuration, the server may have knowledge of RDCs located within the CRDC cell boundary and may perform optimum channel and timeslot planning.


When the CRDC is configured automatically, the CRDC may scan all channels and find the channel with the least interference. The CRDC may then begin transmitting a c-beacon.


All RDCs located within a CRDC cell boundary may place the CRDC into its local CRDC database and complete scanning all other channels to determine if other CRDCs are present. In the case multiple CRDCs are found, the RDC may communicate to each CRDC its findings if possible.


Each CRDC may coordinate through that RDC to setup channels and timeslots to prevent interference between CRDCs. In one or more cases, the CRDC may select another channel and disregard the timeslot information because CRDCs may not be required to be timing coordinated. Further, it is noted that any RDC that detects more than one CRDC may select the CRDC with the best signal quality.


Protocol Operation


The following describes a protocol operation in a single cell coordinated system using a CRDC configuration. In one or more embodiments, there may be additional protocol fields required to allow interoperability between single cell and coordinated multi-cell configurations. Such additional protocol fields may provide information to RDCs and PDKs that are located in near proximity to each other, or within a CRDC cell.


A network format field may provide information to RDCs and PDKs related to the specific configuration the single cell or coordinated cells are operating in.















Name
Type
Valid Range
Description







Proxense_NWK_FMT


Defines the network configuration





employed for an RDC or CRDC


Network Type
Integer
0 to 7
Defines the network type





employed.





0 = Single Cell





1 = Multi-Cell coordinated





2 = Multi-Cell coordinated w/CRDC





3-7 = RFU


Beacon Source
Binary
0 or 1
Defines the source of the beacon.





0 = RDC





1 = CRDC


Broadcast Flag
Binary
0 or 1
Defines if this is a broadcast





message.





0 = not broadcast





1 = broadcast


Timeslot Select
Integer
0 to 3
Defines how an RDC and PDK ®





utilize timeslots in a system.





0 = no timeslots assigned





1 = 802.15.4 Beacon enabled





2 = PDK ® uses even timeslots/RDC uses odd timeslots





3 = PDK ® uses odd timeslots/RDC uses even timeslots









A network type value may be used to define a cell network configuration. An RDC receiving this field may determine its operating mode based on this field. If an RDC receives a network type of single cell from another transmitting RDC, the RDC may tune to another channel to avoid collisions with the other RDC. If the RDC receives a network type of coordinated multi-cell, the RDC may join the multi-cell coordinated system. If the RDC receives a network type of coordinated multi-cell with CRDC, the RDC may join the CRDC network if the site ID is the same.


The PDK may also receive this information and adjust its operating mode to comply with the system employed. If the PDK detects the system to be single cell, the PDK may conform to more of an IEEE 802.15.4 protocol, communicating with the RDC in such a manner. The PDK may be aware that it is required to communicate with a specific RDC ID. The PDK may still have the capability to periodically monitor other channels for other RDCs in the local vicinity.


If a PDK detects the system is multi-cell coordinated, the PDK may receive further information indicating the other RDC frequencies in use in the coordinated network and may adjust its system operating parameters appropriately.


If the PDK determines the system is multi-cell CRDC coordinated, the PDK may adjust its operating parameters appropriately. The PDK may acknowledge that a c-beacon is present and may broadcast a PDK location response. The PDK may also understand that an RDC with a different ID other than a CRDC ID may attempt to communication with the PDK.


A “beacon source” field may indicate to all RDCs and PDKs in the general proximity of the type of beacon being generated. This information may be helpful, specifically when in a multi-cell CRDC system, and allows RDCs to distinguish between RDC generated beacons and CRDC generated beacons.


A “broadcast flag” may indicate to all recipients that the information being sent is intentionally being broadcast to all devices that can receive particular protocol information. In some cases, a message that may be sent to a specific PDK may also be broadcast to all PDKs. This flag assists the PDKs in determining how to treat the information.


A timeslot select field may indicate to PDKs and RDCs how the timeslots are configured in the system. This field may further be used to determine if an RDC and PDK are to use even-based or odd-based timeslots for responding.


In order for an RDC or PDK to determine that a network is of a particular type, a network identifier may be used.















Name
Type
Valid Range
Description







Proxense Network
ASCII
Proxense
An 8 byte ASCII value


Identifier


identifying the network





to be a Proxense network










Single Cell Standalone Operation


The following description is based on, for example, an electronic game (such as one that may be found in a casino) operating in a single cell configuration and attached to some central server. However, it is noted that as described above, examples of applications and uses are for purposes of illustration and clarity and do not limit the present invention.


The game has a resident RDC integrated into its hardware and has a system stack that allows access to the game. The RDC may be attached to the game controller, or may use a separate controller containing the system stack and an interface to the central server.


For clarity, any interactions between the RDC and the server will assume that the reader understands that the system stack and server interface application are taken into account in the transactions described.


This description covers the basic initialization of the system and RDC/PDK interactions that occur while associated in the system. The following concept defines how, for example, a casino game in a single cell configuration may be setup with multiple player PDKs. Upon power being applied to the game and RDC, the internal circuits perform an initialization function and the operating system and game load. The game and RDC indicate to the central server that power has been applied. The system stack also loads in the controller and the RDC device is started in a static mode with its transceiver disabled. The RDC may first be configured to operate in a single cell environment and requires some basic setup requirements as will be understood by those skilled in the art.


The server places the game into a particular configuration mode where it can set the RDC for auto-discover mode, or may choose to manually configure parameters related to the RDC's operation. If the server places the RDC into auto-discovery mode, the RDC generates a random value for its RDC ID and its password, which is then passed back to the server.


If the server chooses to manually setup the RDC, the server may supply the RDC ID and password. The server may also send the network topology and preferred channels the RDC will operate on. The central server may then send its site information to the game controller, which is also used by the RDC to allow access to the game. Once the server has configured the RDC, the server will enable the RDC and game.


The configuration information shown in the table immediately below may be used for RDC provisioning.
















Site ID
0x0100
Generic value for a single




cell RDC.


RDC ID
0x1234
Arbitrary value


C-Superframe Length
32 
2.5 second superframe period




for PDK ® wakeup


Superframe Length
16 
16 slots per superframe


Proxense Network
Proxense
Defines system as a Proxense


Identifier

system







Proxense Network Format









Network Type
0
Single Cell


Beacon Source
0
RDC


Broadcast Flag
1
Broadcast


Timeslot Select
1
802.15.4 timeslots









In this configuration of a standalone RDC (without a site identifier): the site ID is set to 0 because this is a single cell RDC and no site information is required; the RDC ID is arbitrarily selected; the c-superframe length is set to 32 superframes indicating to the PDK that it needs to wake up once every 32 superframes in superframe 0 to exchange information with the RDC to remain associated; the superframe length is set to 16, which may be the standard value for a superframe in a particular system; the network identifier allowing a PDK to understand the beacon is from an enabled RDC; and the network format indicates one or more of several parameters (e.g., the network type indicates to the PDK that it is a single cell network—indicating to the PDK no other RDC is associated with this RDC and therefore no other RDC should be attempting access on this channel, the beacon source indicates to the PDK that the beacon is from an RDC and not a CRDC device, the broadcast flag indicates to the PDK that the message is being broadcast from the RDC, the timeslot select field indicates that a PDK should use IEEE 802.15.4 beacon-based handshaking with the RDC). The RDC then scans all channels (or preconfigured channels) to determine if any other IEEE 802.15.4 or client devices are present or if any other interference is found.


With the pre-configured information, the RDC then begins beacon transmission on the least interfered channel with a c-superframe count, superframe count, and the information located in the table immediately described above.


Now, as shown in FIG. 25, in standalone mode, the RDC will continue to transmit beacons on every superframe. The information in the table immediately described above may be transmitted along with the superframe count in every superframe to allow the PDK to configure and synchronize with the system. When the superframe count is the superframe length minus one, the superframe count will start counting from 0 for the next c-superframe.


At the end of each beacon transmission, a frame check sequence (FCS) may be appended as part of the IEEE 802.15.4 physical layer. The FCS provides protection for the data carried in the frame. Because the beacon may not occupy the entire frame (or timeslot), hashed lines are shown indicating additional idle time between the FCS and IFS. The RDC maintains the beacon transmission until the RDC is disabled or power is removed. At this point in the sequence of operations, there are no PDKs registered with the RDC, so no PDK can gain access without registering and receiving authorization from the RDC.


Again referring to the casino game example described above, a player with a PDK that has not yet been registered to the property enters the RDC cell. The PDK is in battery save mode and periodically wakes up looking for a network. As shown in FIG. 26, the PDK starts in a deep sleep state. The wakeup timer eventually expires, causing the PDK to enable and tune its receiver. The PDK then monitors the channel that it tuned to for a period of one 17 timeslots (one superframe plus one slot), or approximately 83 milliseconds. The 17 timeslot limit is based on a superframe of 16 timeslots, and the fact that the PDK, upon initial reception, could miss the beginning of a beacon. The additional slot provides the overlap necessary to guarantee reception of a beacon if one is present.


If no beacon is detected, the channel number is incremented (modulo 16) and the PDK resets its wakeup timer and returns to deep sleep mode. If a beacon is detected, the PDK checks for a network ID and if one is not found, it again increments the channel number, resets its wakeup timer, and returns to deep sleep mode. If the network ID is detected, the PDK attempts to establish a communications link with the RDC. At this point, the PDK has found a single cell network on channel 1 with an RDC ID of 0x1234, and the RDC is in broadcast mode indicating that it is attempting to gain the attention of any PDKs in the local proximity.


Now referring to FIG. 27, in which an authorization denial handshake is shown, the RDC broadcasts its beacon with the information as described above. The PDK detects the beacon in broadcast mode, determines the network configuration and RDC ID and returns a PDK location response with the RDC ID and PDK ID included. The RDC detects the response from the PDK and alerts the central server that a PDK with a public ID of 0x9876 (arbitrary) wants to attach and enable the game for play. In the meantime, the RDC may immediately respond back to the PDK indicating that the PDK should wait for authorization. This keeps the PDK responding to beacons as defined by the fields located in the beacon until the beacon is no longer present (i.e., the PDK is no longer in the RDC cell), or until a response is returned by the RDC.


The central sever, in conjunction with the system stack, may then choose to not recognize a particular PDK's public ID that has not yet been registered to the property. The RDC continues to output its beacon. Upon the next wakeup and PDK location response from the PDK, the RDC detects the PDK ID and, within its database, looks up the authorization parameters for this PDK. It determines that authorization has been denied and sends an “authorization deny” command to the PDK. In the case that a particular PDK is not recognized or not authorized, a notification may sent to a staff member of the property to register a user of the PDK, and/or, in one or more embodiments, one or more machines may be used to prompt the user to register with the property.


The PDK temporarily stores the RDC ID in its local memory with a flag indicating that it shall no longer respond to this RDC ID. The PDK may then go back into battery save mode and periodically scans all channels as previously described above with reference to FIG. 26.


Still referring to FIG. 27, because the PDK may not constantly be aware of its geographical location, the PDK may continue to monitor each channel and decode each beacon. Eventually, the PDK returns to the channel that the RDC is still transmitting beacons on, decodes the beacon information including the RDC ID, and determines that it is not to respond.


Further, the PDK may maintain the RDC ID in its local database until the beacon is no longer present during scanning, at which time the RDC ID is removed from the database. The period of time that the beacon is absent before removing the RDC ID from the database may be determined during prior system testing.


Assuming the RDC beacon is absent for a given period of time indicates to the PDK that the PDK has left the RDC cell. Upon the next detection of that RDC beacon, the PDK may again attempt to gain access to the RDC as shown in FIG. 27. The difference this time is the PDK ID is in the RDC's local database and the RDC may deny authorization without alerting the host system. The PDK may then operate as previously described after authorization has been denied.


In one or more embodiments, once a host system grants authorization for the PDK to operate within the property, then one or more different scenarios may exist. In one scenario, the RDC may transmit the PDK ID as part of the beacon transmission, alerting the PDK that the RDC wants to communicate, and the PDK may then respond with a PDK location response. In another scenario, the PDK returns to the RDC cell, and after detection of the beacon (with or without the PDK ID), it returns the PDK location response. In either case, after the RDC detects the PDK location response with the PDK's public ID, the RDC then issues a link request attempting to initiate a link between the RDC and PDK. FIG. 28, for example, shows a handshake between the RDC and PDK for a PDK authorization grant.


As shown in FIG. 28, the RDC may broadcast the beacon on every superframe. Although not shown, the superframe counter value is also included, which the PDK may use for battery conservation. The beacon may be broadcast in one of more different methods. The system may have just authorized a PDK and the beacon includes the PDK's public ID for a period of time or, in another method, the beacon may be transmitted without the PDK's public ID. As described above, if the PDK is in the RDC cell and has deactivated its response, when the PDK detects its ID in the beacon, it may reactivate its response to the RDC and transmit both the RDC ID and PDK public ID in its PDK location response.


If the PDK has just re-entered the RDC cell and detects the RDC beacon (with or without the PDK's public ID), the PDK may again respond with the RDC ID and its own PDK public ID. The RDC may then detect its RDC ID and the PDK public ID and immediately sends a link request to the PDK with both its RDC ID and the PDK's public ID indicating it wants to initiate a link with the PDK. The PDK may detect the request and respond with a link grant with both IDs included. The RDC and PDK may enter into association mode and then provide data exchange on a periodic basis insuring the PDK remains in range of the RDC. This periodic data exchange may occur based on parameters previously described above. Interleaved between the data exchange may be beacons that other PDKs may use to access the RDC. Eventually, the RDC may terminate the data exchange based on inactivity, as determined by the server, or as based on the PDK leaving the RDC cell, in which case the RDC realizes the PDK is no longer in range.


Further, it is noted that due to radio interference issues that might occur in wireless systems, the RDC and PDK may not relinquish the link based on the lack of a single data exchange. Because the RDC is not necessarily battery limited, the RDC may continue to monitor all timeslots in a superframe with the exception of those frames it transmits on. In contrast, it is noted that a PDK is likely battery limited and therefore may need to intelligently choose when to receive and transmit.


In the case the RDC and PDK lose communications during the predefined period they are attempting to communicate, both devices may have equal knowledge of such an event. Because the PDK is battery limited, the PDK may try on the next available timeslot to regain synchronization with the RDC. After a period of time in the RDC, or a predefined number of attempts by the PDK, the link may be considered lost.


Referring again to the casino game example, in one or more embodiments, an enabled single cell game facilitates multi-player access via the central server. Individual players may consecutively play the game provided they have the appropriate PDK, or in some instances, multiple players may be able to simultaneously play the game. The RDC allows for simultaneous multi-player access, so long as the central server supports and authorizes such play.


In the case where multiple PDKs may simultaneously access an RDC, the RDC may provide superframe coordination information to the PDKs to interleave them in a manner to avoid contention between RDC and PDK communications. For example, as shown in FIG. 29, the RDC may assign a superframe and timeslot count to each PDK accessing the RDC. Through link setup and data exchange, the RDC may direct the PDK to use a specific superframe and timeslot (or multiple superframes and timeslots) for periodic data exchange. By using such a technique, the RDC may alter the wakeup superframe for each PDK and may efficiently distribute them so as to reduce contention between the PDKs. Because the PDKs are given a specific superframe and timeslot (or superframes and timeslots), the PDK is required to wake up during that superframe(s) and timeslot(s) to communicate with the RDC. This technique, in turn, may greatly extend PDK battery life.


Now referring to FIG. 30, it shows a configuration in which multiple games operating as single cell RDCs are co-located in close proximity with overlapping RDC cell coverage. In such a configuration, each RDC 200, 202 may not be aware of the presence of the other RDC 200, 202 but a PDK 204 that resides in the area of overlapping coverage may detect the presence of both RDCs 200, 202. A technique of restricting or allowing PDK access to one or more of the RDCs 200, 202, and the technique of enabling game play may depend on the system stack for that specific configuration.


In a configuration where multiple RDCs are co-located without the knowledge of each other, and where a PDK is registered to both RDCs, a technique of determining and gaining access to each RDC may be enforced. There are one or more possible scenarios that may occur. For example, in one case, a player may desire simultaneous access to a game and another device, such as a drink or food purchase device, with both being physically located near each other and without disrupting the game play. In another case, a player may be registered to multiple RDCs, but wants to associate with one RDC at any given time.


In addition to an RDC granting permission to the PDK for access, the RDC may also dictate to the PDK the number of simultaneous associations allowed. The purpose of defining the number of associations permitted may reduce the possibilities that the PDK can simultaneously associate with and enable two or more RDCs within close proximity of each other. This may prevent unauthorized use of a player's PDK on adjacent enabled devices, thereby disallowing a player from using another player's identity. The capability of configuring the number of associations for a particular RDC may be implemented in a system stack and controlled by the attached controller's application.


Referring again to the case where a player desires simultaneous access to a game and another device, a PDK may be capable of associating to multiple RDCs based on the physical limitation of the maximum number of simultaneous connections the PDK can handle and based on the number of associations the RDC permits.


Further, it is noted that under the conditions the PDK is associated with more than one RDC, the PDK may relay information back to each RDC indicating its timing relative to the other RDC. This information may be important in the event a single PDK is associated with more than one RDC because the clock frequency error between the RDCs may cause eventual timing drift that will eventually cause timeslot and superframe overlap and prevent the PDK from communicating with both units on a periodic basis. This situation is also noted: where two PDKs are associated with the same RDC and each PDK is also associated with a different second RDC. Additionally, each of the second RDCs may also have other PDKs associated with them that are also associated with even different RDCs. Eventually, such an uncoordinated system may appearing like a mesh network. A system of such complexity may require a CRDC to be used to address synchronization issues.


As to the case where a player may be registered to multiple RDCs, but wants to associate with one RDC at any given time, there may one or more techniques that may be employed to control how a PDK associates with a specific RDC. In one way, a PDK is associated with a single RDC. Using this technique, the PDK may attempt to associate to other RDCs, but the other RDCs will deny association through the back-end central server, causing the PDK to ignore the other RDCs as previously described above. It is noted that such a technique may eliminate a cell size issue, where the cell must be constrained to prevent other RDCs the PDK is registered to from accessing the PDK.


In another technique for directing a PDK to communicate to one RDC in a configuration where multiple RDCs exist of which the PDK is registered to, by significantly reducing the RF power level from the RDC and providing this information along with a request for the PDK to reduce its RF power, a close proximity communications channel may be created. The close proximity communications channel may then operate as if a single cell network exists. More particularly, if the RDC is configured to have a reduced RF power output, the RDC's cell boundary shrinks causing the PDK to have to be within closer proximity of the RDC to receive a beacon from that RDC. If, in turn, the RDC indicates in the beacon that it is at reduced RF power, the PDK is aware that the RDC is in extremely close proximity. In addition, if the beacon includes a command to instruct the PDK to reduce RF power, the chance of surrounding RDCs receiving a response or interference from the PDK may be minimized. When the communications channel is terminated and the PDK no longer sees the beacon from that RDC, the PDK may readjust its RF power level to normal levels for a larger cell coverage area. Such dynamic RF power level adjustment may be implemented in the system stack.


Thus, in one or more embodiments, there exists a scheme to dynamically adjust a transmission power and/or reception sensitivity of a wireless reader device along with an ability to command a client device to do likewise to permit both cell coverage and client device response area programmability. This may enable the dynamic tracking of transient client devices within and through the cell's extended or default coverage area with full power and sensitivity at both ends, while concurrently allowing the association of a particular client device in close proximity to the reader device for command and control of an application or service during a session. Those skilled in the art will note that by dynamically varying a size of a cell in which a secure transaction takes place between a PDK and an RDC (or in which a PDK accesses an application via an RDC), at least some level of security may be achieved in that eavesdropping may be prevented. Moreover, unnecessary and potentially unsafe propagation of a wireless signals beyond a certain distance may be avoided.


For example, a plurality of PDKs may be located in a default wireless coverage range of an RDC. This default wireless coverage range may represent a cell of the RDC at full power. As the plurality of PDKs enter and exit the RDC's cell, the RDC reports corresponding location tracking information back to, for example, a central server. When one of the PDKs requests access to an application secured by the RDC, the RDC may follow by reducing its RF power and commanding the requesting PDK to also lower its RF power, thereby in effect requiring that the requesting PDK be “drawn in” to the RDC in order for the PDK to access the application. It is noted that while the RDC may communicate with the requesting PDK via low power RF signals, the RDC may continue to maintain its default wireless coverage range for tracking other PDKs. When the requesting PDK is moved away from the RDC or the session is otherwise terminated, both ends return to their default full RF power settings.


As described above, reception sensitivity of the RDC and/or PDK may be changed as part of a cell size variation technique in accordance with one or more embodiments. Reception sensitivity may be adjusted using an RF attenuator (e.g., a step, variable, or programmable RF attenuator) that is either specific to a receive path or common to both receive and transmit paths. It is noted that even if the attenuator is common to both receive and transmit paths, transmit power may be independently controlled. Further, in one or more embodiments, a separate attenuator may be used to allow for independent control of transmission power and reception sensitivity.


To determine how much to adjust the size of a wireless cell without severing a wireless connection between an RDC and a PDK, one or more of various metrics may be used. For example, in one or more embodiments, a signal strength of the PDK may be monitored to determine by how much to power down a transmission power of the RDC and/or the PDK. If the signal strength is determined to be relatively strong, then the RDC may cause a reduction in transmission power that is greater than if the signal strength were detected as being weak. Conversely, if the signal strength is detected as being weak, the RDC may lower transmission power by a small amount or not at all. Instead of or in addition to relying on signal strength, a bit error rate may be assessed to determine by how much to power down the transmission power. For example, if the bit error rate of communications between the RDC and PDK is determined to be low, then the RDC may lower transmission power by an amount greater than if the bit error rate was determined to be relatively high.


Further, as described above, the transmission power and/or reception sensitivity of either or both of an RDC and a PDK may be adjusted. In one or more embodiments, only a transmission power of the PDK may be adjusted. This may done to, for example, “bring in” the PDK and reduce the likelihood of that PDK interfering with other RDCs. In one or more other embodiments, the transmission power of both the RDC and the PDK may be adjusted in an effort to draw in the PDK to the RDC. In still one or more other embodiments, in addition to or instead of adjusting transmission power, reception sensitivity of either or both of the RDC and the PDK may be changed.


Moreover, in one or more embodiments, an RDC may have multiple wireless transceivers, whereby at least one of the transceivers is at full power for PDK location tracking purposes, while one or more of the other transceivers are used to establish adjustable wireless cells for particular associations with PDKs. For example, in the case of an ATM machine having an RDC, the RDC may carry out a secure transaction with a PDK in an adjusted wireless cell, while at the same time, casting a broader wireless cell to monitor and identify one or more PDKs around the transacting PDK. In such a manner, for example, a security measure may be implemented by which the RDC can identify individuals behind a transacting user. Further, as an added or alternative security measure, transmission power may be adjusted dependent on a sensitivity of the type of data requested to be exchanged in a particular transaction. Such data sensitive transactions may be conducted at low power with additional security measures such as password entry or biometric input.


Application Utilizing Multi-Cell Coordination


The following describes a system architecture and operation of a system within, for example, a casino application. Referring to FIG. 31, a CRDC (not shown) and multiple RDCs (shown, but not individually labeled) are distributed throughout a casino floor. In such embodiments, a single CRDC generates a cell 210 that provides ubiquitous coverage of the entire floor. On the left side of FIG. 31, multiple RDCs (shown, but not labeled) provide overlapping cell coverage and blanket the casino floor and gaming table area 212 all the way to an entrance of the casino with continuous wireless service coverage. These RDCs may be dedicated to PDK location tracking, allowing the casino operator to know where a player carrying his/her PDK is geographically located on the floor. These RDCs may be mounted in the floor or ceiling, creating, for example, relatively symmetrical cells.


Another set of RDC cells (shown, but not labeled) are shown to exist in the right side of FIG. 31 and are integrated in gaming machines (shown, but not labeled) within an electronic gaming area 214. The cell orientation for these RDCs is more oblong and focused at players that are within close proximity and in front of the electronic gaming machines, noting that cell orientation and shape may be set according to antenna position and/or configuration. The cells extend outward towards the center of the isle to detect the presence of a player that may be walking by. Toward the lower right part of FIG. 31 is a registration cell 216 that sits at a registration desk (shown, but not labeled) where a player may register and acquire a PDK the first time the player enters the casino. The registration cell 216 may be smaller in size to enable local communications between the RDC and PDK without allowing external RF monitoring devices to capture and record the interaction between the devices.


It is noted that in FIG. 31, a PDK 218 that is currently out of the range of all RDCs, but still in range of the CRDC. This represents a PDK carried by a player, which is being used to track the player's position and provide additional services. Such services are further described below.


Further, still referring to FIG. 31, there is a central server 220. The central server 220 may contain a player's financial information (credit card numbers, gambling limits, and other information related to a player). In addition, the central server 220 may be physically wired (not shown) to all RDCs and/or CRDCs located throughout the casino.


Although not shown in FIG. 31, within the PDK location tracking system, RDCs may be gambling tables that also have RDCs embedded within the table itself. A representative gambling table is shown in FIG. 32.


As shown in FIG. 32, a gambling table 230 has RDCs 232, 234, 236, 238, 240, 242, 244, 246 embedded within it. RDC 246 may be a dealer RDC that has a cell geometry covering the dealer's area, allowing the dealer to freely move around in this area. There are an additional RDCs 232, 234, 236, 238, 240, 242, 244 that are located at each player position. Each of these RDC cell's coverage areas are oblong and are directed to where the player would be sitting/standing. It is noted that each player position's RDC 232, 234, 236, 238, 240, 242, 244 allows for some coverage of the region directly behind each player position, allowing the RDC 232, 234, 236, 238, 240, 242, 244 to report back through the system the presence and identity of anyone behind the player. The RDC cell's coverage areas may be minimized to cover the area where a dealer or player may be located relative to the table. Those skilled in the art will note that the actual cell footprints may vary from those shown in FIG. 32. Utilizing distributed RDCs with directional, highly attenuated, antennas allows the casino operator to know the location of both dealers and players, and the amount of time they remained at the table.


The CRDC, PDK location tracking RDCs, and gambling table RDCs, may interoperate in a system such as that shown in FIG. 33. FIG. 33 shows a graphical representation of the sequence of events that may occur when a c-beacon is transmitted in, for example, a casino application. As shown in FIG. 33, first, a CRDC 250 transmits the c-beacon to all RDCs and PDKs (shown, but not labeled) within the CRDC's cell radius. All of the RDCs and PDKs setup and synchronize their timing to the beacon. Next, each PDK, in its appropriate timeslot, transmits a PDK location response ID. Any RDC that is in the vicinity of the PDK's response receives the PDK location response ID and logs specific information related to the reception. Then, each RDC packetizes the information received from the PDK and, through a wired back channel, relays the information to a central server 252. The central server 252 may then utilize this information to indicate to an operator, by either graphical or text format, the geographic location of each player.


Representing the flow in a different manner, the interactions for a single PDK is shown in FIG. 34. In addition to providing location tracking information, when the PDK outputs a PDK location response ID, certain events may occur from an RDC based device. In the event the RDC based device is an electronic game, via the central server, the electronic game may entice the player over to it by flashing information on the screen related to that specific player. In one example, an electronic gaming machine may offer the player a free game, gaining the player's attention and ultimately enticing the player to play the game. In order to identify the player, further steps may be taken between the PDK and the RDC that are described below.


In the event the RDC device is used for location tracking, it may perform further interrogation of the PDK to determine whether the PDK is legitimate. A more detailed description of such interrogation is provided below.


Now referring to FIG. 35, it shows two CRDCs with overlapping cell coverage, but not to the point where each CRDC can see the other CRDC. As shown in FIG. 35, the CRDC cells are non-uniform in nature due to obstructions blocking the transmit radio path. The CRDC cell overlap may cause a number of RDCs to be in each CRDC cell. It is envisioned that other CRDCs may overlap in the same region if they are placed above and below the RDC micro-cellular structure. In this case, for example, up to 4 channels may be occupied just for CRDC beacon transmission.


Due to the possibility of interferers in the coverage area of the CRDC, the central server may manually configure the CRDC, or the central server may also instead or additionally have the capability to auto-configure. In the case the central server performs manual configuration, upon initial installation, power up, and provisioning, the CRDC is configured to remain in a dormant state until the central server interacts with the device and instructs it to perform specific tasks. The central server may first instruct the CRDC to enable the receiver, scan all channels, and report back the findings of each channel. When the CRDC scans each channel, it collects signal quality metrics and any IEEE 802.15.4 radio transmissions. The operator of the central server may then analyze all of the signal quality metric information and any IEEE 802.15.4 framing information to determine the best channel the CRDC should transmit its beacon on. Once determined, the operator at the central server may command the CRDC to store the specific channel that it will transmit on and enable it to begin transmitting. The operator may then select the next CRDC and perform the same operations, until all CRDCs have been configured in the network.


In an automatic configuration mode, the CRDC scans each channel and collects signal quality metrics and determines if other IEEE 802.15.4 devices (including another CRDC) are present. The CRDC may then select the quietest channel to begin its beacon transmission on. Further, it is noted that it may be recommend that initial auto-configuration of a CRDC occur when there is a single CRDC present. This recommendation is based on the fact that the CRDC may have overlapping coverage with another CRDC as shown in FIG. 35, but the CRDC is not aware of the overlap, causing two CRDCs to transmit their beacons on the same channel. Eventually, due to potential timing inaccuracies in the CRDCs, they may overlap and become direct interferers to RDCs and PDKs in the overlapping area. An exception to this recommendation is when the system is configured to allow the CRDC to report back the channel that it occupies (or intends to occupy) to the central server, and the server can then analyze the CRDC channel lineup on all CRDCs and reassign a channel for any given CRDC.


Once a channel has been assigned and stored in a local non-volatile memory of the CRDC, upon next power up, the CRDC scans all channels again and return to their last assigned channel provided that it is not occupied by an interferer or by another CRDC beacon. In such a case, the CRDC may have to again go through the initialization process.


Although a synchronized system may lead to higher throughput and may possibly lead to better battery life, in one or more embodiments, it may not be necessary for CRDCs to be synchronized. Because each CRDC operates on a separate channel, there may be no timing-specific consideration that needs to be addressed between CRDCs. Instead, a concern may relate to how the PDK aligns to multiple unsynchronized CRDCs. From a PDK location-tracking standpoint, the PDK may be required to lock to a single CRDC beacon. The CRDC beacon will indicate to PDKs what other channels a CRDC may be located on. The PDK may not need to attempt receiving from any other CRDC, provided the signal quality metrics for the current CRDC it is monitoring has sufficient signal quality to receive error free data. In the case the signal quality degrades, the PDK may then periodically switch to other channel(s) to determine if a better signal quality can be obtained. If a better signal quality is determined to be on an alternate channel, the PDK may then immediately switch to the alternate channel, provided it is not in association with an RDC at that instance in time. If the PDK has begun association to an RDC, the PDK may have to attempt to finish the association before switching to the alternate channel. It is noted that once a PDK is in association with a RDC, the PDK is no longer required to monitor the CRDC beacon, until the association ends between the devices by releasing the link or by the PDK leaving the RDC cell.


When an RDC is powered up for the first time, the RDC may not be aware of the network it belongs to or its configuration within the network. The RDC may default to a single cell configuration. For this reason, RDCs placed in a CRDC cell configuration may by default remain in a dormant state upon its first initial power up in the network. This may allow the central server to configure any specific information related to the network into the RDC prior to operation. Some of this information may include, for example, the site ID, a local RDC ID, and other parameters related to the wireless transmission protocol. The site ID is important, because the property owner may not want their RDCs to become associated with another property; thus, the RDC should synchronize to beacons transmitted with that site's ID. The RDC ID is used in communication between a PDK and RDC; hence, there should be one RDC ID per RDC device in the network. Other application-dependent parameters may include how the unit operates when associated with a PDK and whether the RDC sends data back to the server when data is ready, or if the server must poll the RDC for the information. The central server may then command the RDC to enable its receiver and scan all channels to determine the signal quality of each channel and which CRDCs may be received by the RDC. The operator of the central server may allow the RDC to automatically select which CRDC Beacon to lock to, or can command the RDC to select a specific CRDC beacon. After reviewing the channel list for signal quality, the system may then command which channels the RDC can use for alternate channels for RDC-PDK communications, or the system may command the RDC to automatically select the alternate channels. The system may then place the RDC in operation mode, and the RDC then tunes to the selected CRDC beacon channel and remains there listening for CRDC beacons and any PDK that sends a PDK location response ID. While receiving the c-beacon, the RDC may configure its timeslot information similar to that described above. This defines the superframe structure as well as defining which timeslots (odd or even) the RDC is permitted to communicate with a PDK on the beacon channel.


In the background, on the alternate wireless link described above with reference to FIG. 9, the RDC may continue to scan the alternate channels, updating its list of clear channels. This updated list may then be used when a RDC determines it wants to extend its communication with a PDK in association mode and selects which channel that communication will occur on. The RDC, in operational mode, may perform frame and slot alignment to the CRDC and listen for a PDK location tracking response. On a periodic basis, the RDC may send information back to the central server indicating that it is still operational and indicating the status of the communications channels (e.g., CRDC beacon, alternate channels).


In one or more embodiments, a registration RDC may be used to initially enable and to configure a PDK. The registration RDC may have a small cell coverage area by design, measured, for example, in inches. This may require that the unregistered PDK must be in extremely close proximity, e.g., placed on the registration RDC housing, to communicate with the registration RDC, reducing the likelihood of RF eavesdroppers gaining access to PDK setup information.


The registration RDC may be directly connected to a central server. In addition to specific security features, the registration RDC installs and configures service provider information located on the central server (described above with reference to FIGS. 6 and 7). Such information may include the service provider ID, secret key, and other parameters that the service provider wants to designate for access within their network. These other parameters may vary in size in the PDK and may be defined by the host system to meet the needs of the property. Information transferred to a PDK may include, for example, the service provider site ID, the service provider's assigned PDK ID, the service provider's secret service ID, the service provider's secret key, and service provider specific access information.


Now describing an example of an operation in accordance with one or more embodiments, once a system has been installed and properly provisioned, a rated player may walk into the casino. They are greeted by a host and walked over to the registration desk, where the player's information, already in the central server, is linked to a PDK that is given to the player and assigned with specific privileges. The player places the PDK in their pocket and begins to walk throughout the casino. Once the PDK leaves the registration cell, the PDK enters discovery mode and scans the channels for a c-Beacon. If the PDK does not locate the c-beacon, it continues to scan for an undetermined period of time until it either goes into battery save mode or finds a c-beacon.


Once the PDK finds a c-Beacon, the PDK determines if the c-beacon is a particular type of network and the site ID is in its local service provider database. If the site ID is not in the database, the PDK ignores that c-beacon and keeps looking for other c-beacons on other channels until one is found that is in its local database. Once a valid c-beacon containing a site ID that is in the PDK's local database is found, the PDK extracts the CRDC channel availability flags and checks the other channels in the CRDC channel availability list. The PDK then determines which CRDC has the best signal quality metrics. The PDK switches to that channel and begins receiving c-beacons. The PDK extracts the CRDC and network configuration information as described above. This information may define the framing structure and how the PDK should operate within the network. The PDK then applies the c-beacon parameters to its radio transceiver parameters, configuring the sleep interval and response superframe and timeslot information. Because the PDK has just received a c-beacon, the PDK is now aware of the current superframe count. The PDK then configures its timer to wake up just prior to the expected superframe count that it may communicate on.


Now also referring to FIG. 36, when the sleep timer expires, the PDK may wake up, listen for a specific c-beacon, and verify the superframe count. It then waits a predetermined period of time for its slot to be available and performs CSMA-CA, and if no other device is attempting to respond, it responds with its PDK location tracking response. If another device was detected on the channel, the PDK may then reset its timers and wait for the next predefined superframe and timeslot to wake up and attempt again.


It is noted that a PDK in accordance with one or more embodiments may be powered by an internal battery of, for example, a type commonly used to power small electronic devices such as watches, calculators, and mobile computing devices. The power of such a client device battery is consumed when the PDK is active. In an effort to reduce and/or minimize battery consumption, in one or more embodiments, the active time of a PDK as a percentage of total time may be reduced by management of transmission and reception times. For example, as described above, a network in accordance with one or more embodiments may be designed to configure time slots (e.g., frames), groups of time slots (e.g., superframes), and/or coordinating beacon superframes (e.g., c-superframes) in a manner such that a client device is caused to both listen and respond within specific time slots. Because these time slots are configured by the network, they may be precisely predicted, thereby allowing the client device to set a timer, return to sleep mode, and waken when a specific, time-slotted interaction is expected or required of the client device. Further, in one or more embodiments, because a network in accordance with one or more embodiments may implement programmable c-superframe lengths, an operator or system may individually tailor performance to maximize (or at least improve) battery life and/or minimize (or at least reduce) system inter-message latency without requiring access of the client device itself or physical alteration of the client device.


When the PDK responds with a PDK location tracking response, every RDC within local proximity that can receive the response may log the response message in its database along with signal quality metrics and a timestamp. They will then send the information back to the central server. The response may be sent by the server polling the RDC or by the RDC if it has data to send. Once the central server receives the PDK information from one or multiple RDCs, the server may then determine if any further communication with the PDK is necessary. If, for example, the system wants to validate the PDK, it can perform a validation. The server may then send a command to a specific RDC to set up communications with a specific PDK and wait for a response from that RDC. Because the communication between the RDC and the central server may not be instantaneous, the RDC may have to wait for the next PDK location tracking response. After performing CSMA-CA, it may immediately instruct the PDK to switch to the alternate channel. If, during the CSMA-CA, the RDC detected another device on the channel, the RDC may wait for the next PDK location tracking response from that PDK and then re-attempt PDK channel reassignment. The PDK may then switch to the alternate channel, perform CSMA-CA, and send a link request to that specific RDC ID with its own ID included. The RDC, looking for the link request with its specific ID and a particular PDK ID, detects the request and then responds with a link grant. Further, the RDC may alert the central server of the link, and a data exchange occurs with information the server is interested in collecting by interrogating that PDK. After the data exchange occurs, the central server commands the RDC to terminate the link. The RDC may then terminate the link, and the PDK may returns to the c-Beacon channel, re-synchronizing to the beacon, and begin monitoring for its timeslot. The PDK may then continue to send responses back to all RDCs in its immediate vicinity when its specific superframe count and timeslot are valid.


It is noted that the foregoing description detailing a process of PDK validation and interrogation relates to one or more embodiments. However, in one or more other embodiments, the central server may have also altered the service provider information within the PDK.


If, during the switch to the alternate channel for RDC to PDK communications, the PDK determines the channel is occupied or the PDK does not receive a link grant back from the RDC, the PDK may perform one or more additional attempts. If after all attempts, the PDK does not receive a response from an RDC, that PDK may return to the c-beacon channel, realign to the beacon, and then begin sending its PDK location tracking ID.


If the RDC was unable to receive the link request from the PDK on the alternate channel, for a predefined period of time, the RDC may flag the error and continue listening on the channel. If the same RDC is again instructed to establish communications with the same PDK, the RDC may choose to use a different alternate channel and redirect the PDK to the new alternate channel for communications.


Now referring to FIG. 37, it shows a PDK wakeup and response flow in a CRDC coordinated system. For purposes of describing FIG. 37, it is assumed that the PDK has acquired system synchronization and has gone into the sleep mode after setting its timers to wake up on the next predefined superframe. The PDK remains in sleep mode until the wakeup timer expires and wakes up the PDK. The PDK then enables and tunes its receiver to the c-beacon channel and listens for the beacon for a predefined period of time. If no beacon is detected, the PDK checks for other CRDC channel available flags in its local memory. It then reassesses signal quality and beacons on the alternate CRDC channels.


After the PDK assesses the other CRDC channels and no beacon is found, the PDK goes back into rediscovery mode scanning all channels looking for a c-beacon. If no c-Beacon is found, the PDK then starts its deep sleep mode. In the event that other CRDC channels are present, the PDK assesses the signal quality of each channel and selects the best channel. The PDK then selects that channel and tunes to it listening for the CRDC beacon.


When the PDK receives the beacon, it checks all of the parameters associated with it including the superframe count. If the PDK determines the superframe count is not the correct one for it to wake up and respond on, it sets its internal sleep timer to wake up just before the next expected superframe it should respond to and returns to sleep mode. If the PDK determines that the beacon is on the PDK's expected superframe count, the PDK then stays awake, but stops listening until just before its expected timeslot. The PDK may then perform CSMA-CA to determine if the channel is busy. If the PDK determines the channel is busy, the PDK may again set its internal sleep timer for the next expected superframe and return to the sleep mode.


If the PDK finds the channel to be available, the PDK then transmits its location tracking response and waits for one additional timeslot for a response from an RDC. If the PDK receives a response from an RDC, it then performs the command sent by the RDC (e.g., to switch to the alternate communications channel). If the PDK does not receive a response from an RDC, the PDK may again set its internal sleep timer to wake up just before the next expected superframe it should respond to and then return to sleep mode.


As described above with reference to FIG. 31, in one or more embodiments, an RDC may be located within an electronic game on an electronic gaming floor. Each game may have an integrated dual wireless link RDC, such as that described above with reference to FIG. 9. The RDC may be used for PDK location tracking and PDK association. There are various approaches in integrating an RDC into an electronic game or other equipment housing. In one approach, shown in FIG. 38, the integration of the RDC is from a physical perspective; no electrical connections exist between the RDC and the game. In this configuration, the RDC and electronic game need not even reside within the same enclosure; they coexist as two physically close, but separate, devices. They may not be connected in any way other than physical proximity. The purpose of placing them in close physical proximity is to allow the RDC to perform proximity detection for any player carrying a PDK that may be positioned near the front of the machine. In this configuration, each device (RDC and electronic game) may have separate connections to a central server (or an external data concentrator) used to connect both devices to a single wired connection back to the server. It is noted that the game may operate autonomously, with the possible exception of responses to any commands sent to it by the server. In this case, the RDC may provide both proximity detection and association with PDKs.


Now also referring to FIG. 39, it shows an example of a handshake that may take place from the time a player carrying a PDK is detected to the time the game is enabled for that player. For purposes of clarity, the CRDC is not shown in FIG. 39. The handshake starts by the PDK detecting a c-beacon. Each time the c-beacon is detected on the expected superframe and timeslot, the PDK may send out a PDK location tracking response.


The RDC near the game detects the response and sends the PDK's information back to the central server. The server realizes the user is close to the game and may send a command back to the game instructing it to display a message for the player in an effort to entice the player to play. In this example, the player may see the message and sit down at the game and press a button to commence play. In turn, the game sends a message back to the server indicating that the button has been pressed. The server then requests the RDC to make a connection with the player's PDK. Upon the next c-beacon, the player's PDK responds and the RDC receives the response. The RDC then transmits back to the PDK to change to another channel for association mode to begin. It is noted that up until this time, the PDK was in tracking mode. The PDK then switches to the alternate channel indicated by the RDC and sends out a PDK link request with both the PDK ID and the RDC ID. The RDC detects the request and sends back a PDK link grant. The PDK and the RDC then exchange secure information to establish trust, prior to establishing a secure link for validation of the PDK. The RDC may also lower its RF power and instruct the PDK to lower its RF power in order to enforce close proximity. Periodic data exchange may continue to between the RDC and PDK.


After the secure link is established, the RDC may report back to the central server that the link is established between the RDC and PDK. The central server may then send a command to the game to display a message, which the game then displays. The player may see the message on the screen and presses his PDK's button causing it to transmit this event over the secure link to the RDC. The RDC relays this information back to the server. When the central Server receives the button press message, it can enable the game so that the player may begin playing.


The handshake continues as shown in FIG. 40. After the game has been enabled for the player to play, the server may then send a command to the RDC to start polling the player's PDK. The RDC then periodically polls the PDK and may have returned the responses of each poll back to the server, as shown in FIG. 40.


Still referring to the example being described with reference to FIGS. 39 and 40, the player may continue to play the game for a while, then finishes and decides to leave. When the player exits the coverage area of the RDC near the game, the communications link is broken. The RDC attempts to poll the PDK, but receives no response. The RDC continues a few more times with no response. The RDC then reports back to the central server that the link was lost and the PDK is out of range. The central server then sends a message to the game to return it to an idle state so that another player can play, then requests the game to send back the player's game play information (if not already obtained), which the server logs.


As described above with reference to FIGS. 39 and 40, a central server may be the communications medium linking an RDC to a game. It communicates with the game, tying the PDK to that game. If either device loses connection to the central server, game play may stay enabled.


Now referring to FIG. 41, it shows an electronic game with an integrated RDC, internally connected to communicate directly with the game. Thus, all power and communication for the RDC may go through the electronic game. In this configuration, both the RDC and game reside within the same game enclosure where they jointly coexist. All information exchanged between the RDC and Bally Central Server must flow through the electronic game's controller and network interface. The purpose of placing them in the same enclosure allows the RDC to perform proximity detection for any player carrying a PDK® that may be positioned near the front of the machine.


At least one difference in the configuration shown in FIG. 41 relative to the configuration shown in FIG. 38 is that the game's internal controller may act to reduce the traffic loading on the back-end network and perform more local verification of the communications link between the PDK and the RDC. To illustrate a difference in interaction between these two configurations, reference is made to the handshake diagram shown in FIG. 42. More particularly, FIG. 42 shows a handshake that may take place from the time a player carrying a PDK is detected to the time the game is enabled for that player. For purposes of clarity, the CRDC is not shown in FIG. 42. The handshake starts by the PDK detecting a c-beacon. Each time the c-beacon is detected on the expected superframe and timeslot, the PDK sends out a PDK location tracking response. The RDC within the game detects the response and sends the PDK information back to a central server via the game's internal controller. The server is made aware that the user is close to the game and sends a command back to the game controller instructing the game to, for example, give the user a free game along with optionally displaying the user's name. The game then displays a message for the player in an effort to entice the player to play. The player may then see the message, sit down at the game, and press a button to commence game play. In turn, the game controller detects the button press and requests the RDC to make a connection with the player's PDK. Upon the next c-beacon, the PDK responds and the RDC receives the response. The RDC may then transmit back to the PDK a command to change to an alternate channel for association. The player's PDK then switches to the alternate channel indicated by the RDC and sends out a PDK link request with both the PDK ID and the RDC ID. The RDC detects the request and sends back a PDK link grant. The PDK and the RDC may then exchange secure information to establish trust, prior to establishing a secure link for validation of the PDK. The RDC may also lower its RF power and instruct the PDK to lower its RF power in order to enforce close proximity. Periodic data exchange may then continue between the RDC and PDK.


After the secure link is established, the RDC reports back to the game controller that the link is established between the RDC and PDK. The game may then display an instructional message for game play. The player may see the message on the screen and presses the player's PDK button, causing the PDK to transmit this event over the secure link to the RDC. The RDC may then send this information back to the game controller. When the game controller receives the button press message, it can enable the game so that the player can begin playing.


The handshake continues as shown in FIG. 43. After the game was enabled for the player to play, the game controller sends a command to the RDC to start polling the player's PDK. The RDC then periodically polled his PDK and had the option of returning the responses of each poll back to the controller, as shown in FIG. 43.


Returning to the example described above with reference to FIGS. 42 and 43, the player may continue to play the game for a while, then finishes and decides to leave. When the player exits the coverage area of the RDC near the game, the communications link is broken. The RDC attempts to poll the PDK, but receives no response. The RDC may continue a few more times, with no response. The RDC then reports back to the game controller that the link was lost and the PDK is out of range. The game controller returns itself to an idle state so that another player can play and indicates back to the central server that the PDK is out of range. The server may then request the game to send the player's game play information (if not already received), which is then logged.


As described above with reference to FIGS. 42 and 43, in one or more embodiments, the game controller may become more involved in the RDC to PDK association, thereby potentially reducing the back-end system network's traffic loading relative to that experienced with the configuration where an RDC is electrically separate from the game controller. The game controller may also react faster to the user walking out of range and may not require any response from the server in order to maintain the link. It is further noted that a broken link between the central server, game controller, and RDC may not result in any loss of any interaction between the RDC and the game controller.


While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of the above description, will appreciate that other embodiments may be devised which do not depart from the scope of the present invention as described herein. Accordingly, the scope of the present invention should be limited only by the appended claims.

Claims
  • 1. A system, comprising: an apparatus, the apparatus comprising: a wireless transceiver having an active mode in which power is consumed, and a sleep mode in which power is conserved;a timer operatively coupled to the wireless transceiver, the timer being used to indicate when to switch the wireless transceiver from sleep mode to active mode based on time slot information; andprocessing circuitry operatively coupled to the wireless transceiver and the timer, the processing circuitry arranged to receive an input from the timer indicating when to switch the wireless transceiver from the sleep mode to the active mode and switch the wireless transceiver from the sleep mode to the active mode in response to the input from the timer, the processing circuitry arranged to tune the wireless transceiver to a first channel during a first active mode for monitoring communication on the first channel, and the processing circuitry arranged to increase a channel number to a second channel, reset the timer, and tune the wireless transceiver to the second channel during a second active mode subsequent to an absence of communication on the first channel, wherein the wireless transceiver transmits identity information associated with the apparatus on one or more of the first channel and the second channel.
  • 2. The system of claim 1, wherein the time slot information is received wirelessly by the apparatus.
  • 3. The system of claim 1, wherein the apparatus has a known physical location.
  • 4. The system of claim 1, wherein the apparatus has a known physical location that is a fixed physical location.
  • 5. The system of claim 1, wherein the identity information associated with the apparatus uniquely identifies the apparatus.
  • 6. The system of claim 1, wherein the apparatus wirelessly transmits data that completes a secure transaction.
  • 7. The system of claim 1, comprising a server configured to receive data from a portable wireless electronic device when the portable wireless electronic device is in proximity to the apparatus.
  • 8. The system of claim 7, wherein the server is further configured to track a location of the portable wireless electronic device based on a periodic wireless communication between the portable wireless electronic device and the apparatus.
  • 9. The system of claim 8, wherein the location of the portable wireless electronic device is based on determining that the portable wireless electronic device is within a wireless coverage range of the apparatus.
  • 10. The system of claim 1, wherein the apparatus enables a user of a portable wireless electronic device to access at least one of an application, an asset, and a service when the apparatus and the portable wireless electronic device are within proximity of one another.
  • 11. A method comprising: switching a wireless transceiver of a device from a sleep mode in which power is conserved to an active mode in which power is consumed responsive to an expiration of a timer, the timer indicating when to switch the wireless transceiver from sleep mode to active mode based on time slot information;tuning the wireless transceiver to a first channel during a first active mode;monitoring communication on the first channel during the first active mode;responsive to an absence of communication on the first channel, resetting the timer and increasing a channel number to a second channel;subsequent to increasing the channel number to the second channel, tuning the wireless transceiver to the second channel during a second active mode; andresponsive to a presence of communication on the second channel, transmitting identity information associated with the device on the second channel during the second active mode.
  • 12. The method of claim 11, wherein the time slot information is received wirelessly by the device.
  • 13. The method of claim 11, wherein the device has a known physical location.
  • 14. The method of claim 11, wherein the device has a known physical location that is a fixed physical location.
  • 15. The method of claim 11, wherein the identity information associated with the device uniquely identifies the device.
  • 16. The method of claim 11, wherein the device wirelessly transmits data that completes a secure transaction.
  • 17. The method of claim 11, further comprising receiving data, at a server, from a portable wireless electronic device when the portable wireless electronic device is in proximity to the device.
  • 18. The method of claim 17, further comprising tracking a location of the portable wireless electronic device based on a periodic wireless communication between the portable wireless electronic device and the device.
  • 19. The method of claim 18, wherein the location of the portable wireless electronic device is based on determining that the portable wireless electronic device is within a wireless coverage range of the device.
  • 20. The method of claim 11, further comprises enabling access to at least one of an application, an asset, and a service when the device and a portable wireless electronic device of a user are within proximity of one another.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 16/657,879 filed Oct. 18, 2019, titled “Wireless Network Synchronization of Cells and Client Devices on a Network,” which is a continuation U.S. patent application Ser. No. 16/366,010, filed Mar. 27, 2019, titled “Wireless Network Synchronization of Cells and Client Devices on a Network,” which is a continuation of U.S. patent application Ser. No. 14/675,433, filed Mar. 31, 2015, titled “Wireless Network Synchronization of Cells and Client Devices on a Network,” which is a continuation of U.S. patent application Ser. No. 13/686,673, filed Nov. 27, 2012, and titled “Wireless Network Synchronization of Cells and Client Devices on a Network,” which is a continuation of U.S. patent application Ser. No. 11/620,581, filed Jan. 5, 2007, and titled “Wireless Network Synchronization of Cells and Client Devices on a Network,” which claims the benefit under 35 U.S.C. § 119 of U.S. Provisional Patent Application No. 60/760,362, filed Jan. 6, 2006, and titled “Securing Transactions Between an Electric Key and Lock Within Proximity of Each Other,” the entireties of which are hereby incorporated by reference. U.S. patent application Ser. No. 14/675,433 is also a continuation of U.S. patent application Ser. No. 13/875,895, filed May 2, 2013, and titled “Dynamic Real-Time Tiered Client Access,” which is a continuation of U.S. application Ser. No. 13/491,417, filed Jun. 7, 2012, and titled “Dynamic Real-Time Tiered Client Access,” which is a continuation of U.S. application Ser. No. 11/620,577, filed Jan. 5, 2007, and titled “Dynamic Real-Time Tiered Client Access,” which claims the benefit under 35 U.S.C. § 119 of U.S. Provisional Patent Application No. 60/760,362, filed Jan. 6, 2006, and titled “Securing Transactions Between an Electric Key and Lock Within Proximity of Each Other,” the entireties of which are hereby incorporated by reference. U.S. patent application Ser. No. 14/675,433 is further a continuation of U.S. patent application Ser. No. 11/620,600, filed Jan. 5, 2007, and titled “Dynamic Cell Size Variation Via Wireless Link Parameter Adjustment,” which claims priority under 35 U.S.C. § 119 of U.S. Provisional Patent Application No. 60/760,362, filed Jan. 6, 2006, and titled “Securing Transactions Between an Electric Key and Lock Within Proximity of Each Other,” the entireties of which are hereby incorporated by reference.

US Referenced Citations (1162)
Number Name Date Kind
3665313 Trent May 1972 A
3739329 Lester Jun 1973 A
3761883 Alvarez et al. Sep 1973 A
3906166 Cooper et al. Sep 1975 A
4101873 Anderson et al. Jul 1978 A
4430705 Cannavino et al. Feb 1984 A
4476469 Lander Oct 1984 A
4598272 Cox Jul 1986 A
4661821 Smith Apr 1987 A
4759060 Hayashi et al. Jul 1988 A
4814742 Morita et al. Mar 1989 A
4871997 Adriaenssens et al. Oct 1989 A
4993068 Piosenka et al. Feb 1991 A
5043702 Kuo Aug 1991 A
5052049 Andros et al. Sep 1991 A
5187352 Blair et al. Feb 1993 A
5224164 Elsner Jun 1993 A
5296641 Stelzel Mar 1994 A
5307349 Shloss et al. Apr 1994 A
5317572 Satoh May 1994 A
5325285 Araki Jun 1994 A
5392287 Tiedemann et al. Feb 1995 A
5392433 Hammersley et al. Feb 1995 A
5410588 Ito Apr 1995 A
5416780 Patel May 1995 A
5422632 Bucholtz et al. Jun 1995 A
5428684 Akiyama et al. Jun 1995 A
5450489 Ostrover et al. Sep 1995 A
5473690 Grimonprez et al. Dec 1995 A
5481265 Russell Jan 1996 A
5506863 Meidan et al. Apr 1996 A
5517502 Bestler et al. May 1996 A
5541583 Mandelbaum Jul 1996 A
5544321 Theimer et al. Aug 1996 A
5552776 Wade et al. Sep 1996 A
5563947 Kikinis Oct 1996 A
5589838 McEwan Dec 1996 A
5594227 Deo Jan 1997 A
5598474 Johnson Jan 1997 A
5611050 Theimer et al. Mar 1997 A
5615277 Hoffman Mar 1997 A
5619251 Kuroiwa et al. Apr 1997 A
5623552 Lane Apr 1997 A
5629980 Stefik et al. May 1997 A
5644354 Thompson et al. Jul 1997 A
5666412 Handelman et al. Sep 1997 A
5689529 Johnson Nov 1997 A
5692049 Johnson et al. Nov 1997 A
5719387 Fujioka Feb 1998 A
5729237 Webb Mar 1998 A
5760705 Glessner et al. Jun 1998 A
5760744 Sauer Jun 1998 A
5773954 Vanhorn Jun 1998 A
5784464 Akiyama et al. Jul 1998 A
5799085 Shona Aug 1998 A
5821854 Dorinski et al. Oct 1998 A
5825876 Peterson, Jr. Oct 1998 A
5835595 Fraser et al. Nov 1998 A
5838306 O'Connor et al. Nov 1998 A
5854891 Postlewaite et al. Dec 1998 A
5857020 Peterson, Jr. Jan 1999 A
5886634 Muhme Mar 1999 A
5892825 Mages et al. Apr 1999 A
5892900 Ginter et al. Apr 1999 A
5894551 Huggins et al. Apr 1999 A
5898880 Ryu Apr 1999 A
5910776 Black Jun 1999 A
5917913 Wang Jun 1999 A
5923757 Hocker et al. Jul 1999 A
5928327 Wang et al. Jul 1999 A
5942985 Chin Aug 1999 A
5991399 Graunke et al. Nov 1999 A
5991749 Morrill, Jr. Nov 1999 A
6016476 Maes et al. Jan 2000 A
6018739 McCoy et al. Jan 2000 A
6025780 Bowers et al. Feb 2000 A
6035038 Campinos et al. Mar 2000 A
6035329 Mages et al. Mar 2000 A
6038334 Hamid Mar 2000 A
6038549 Davis et al. Mar 2000 A
6038666 Hsu et al. Mar 2000 A
6040786 Fujioka Mar 2000 A
6041410 Hsu et al. Mar 2000 A
6042006 Van Tilburg et al. Mar 2000 A
6045039 Stinson et al. Apr 2000 A
6055314 Spies et al. Apr 2000 A
6068184 Barnett May 2000 A
6069647 Sullivan et al. May 2000 A
6070796 Sirbu Jun 2000 A
6076164 Tanaka et al. Jun 2000 A
6088450 Davis et al. Jul 2000 A
6088730 Kato et al. Jul 2000 A
6104290 Naguleswaran Aug 2000 A
6104334 Allport Aug 2000 A
6110041 Walker et al. Aug 2000 A
6121544 Petsinger Sep 2000 A
6134283 Sands et al. Oct 2000 A
6137480 Shintani Oct 2000 A
6138010 Rabe et al. Oct 2000 A
6148142 Anderson Nov 2000 A
6148210 Elwin et al. Nov 2000 A
6161179 Seidel Dec 2000 A
6175921 Rosen Jan 2001 B1
6177887 Jerome Jan 2001 B1
6185316 Buffam Feb 2001 B1
6189105 Lopes Feb 2001 B1
6209089 Selitrennikoff et al. Mar 2001 B1
6219109 Raynesford et al. Apr 2001 B1
6219439 Burger Apr 2001 B1
6219553 Panasik Apr 2001 B1
6237848 Everett May 2001 B1
6240076 Kanerva et al. May 2001 B1
6247130 Fritsch Jun 2001 B1
6249869 Drupsteen et al. Jun 2001 B1
6256737 Bianco et al. Jul 2001 B1
6266415 Campinos et al. Jul 2001 B1
6270011 Gottfried Aug 2001 B1
6279111 Jensenworth et al. Aug 2001 B1
6279146 Evans et al. Aug 2001 B1
6295057 Rosin et al. Sep 2001 B1
6307471 Xydis Oct 2001 B1
6325285 Baratelli Dec 2001 B1
6336121 Lyson et al. Jan 2002 B1
6336142 Kato et al. Jan 2002 B1
6343280 Clark Jan 2002 B2
6345347 Biran Feb 2002 B1
6363485 Adams et al. Mar 2002 B1
6367019 Ansell et al. Apr 2002 B1
6369693 Gibson Apr 2002 B1
6370376 Sheath Apr 2002 B1
6381029 Tipirneni Apr 2002 B1
6381747 Wonfor et al. Apr 2002 B1
6385596 Wiser et al. May 2002 B1
6392664 White et al. May 2002 B1
6397387 Rosin et al. May 2002 B1
6401059 Shen et al. Jun 2002 B1
6411307 Rosin et al. Jun 2002 B1
6424249 Houvener Jul 2002 B1
6424715 Saito Jul 2002 B1
6425084 Rallis et al. Jul 2002 B1
6434403 Ausems et al. Aug 2002 B1
6434535 Kupka et al. Aug 2002 B1
6446004 Cao et al. Sep 2002 B1
6446130 Grapes Sep 2002 B1
6456958 Xydis Sep 2002 B1
6463534 Geiger et al. Oct 2002 B1
6480101 Kelly et al. Nov 2002 B1
6480188 Horsley Nov 2002 B1
6484182 Dunphy et al. Nov 2002 B1
6484260 Scott et al. Nov 2002 B1
6484946 Matsumoto et al. Nov 2002 B2
6487663 Jaisimha et al. Nov 2002 B1
6490443 Freeny, Jr. Dec 2002 B1
6510350 Steen et al. Jan 2003 B1
6522253 Saltus Feb 2003 B1
6523113 Wehrenberg Feb 2003 B1
6529949 Getsin et al. Mar 2003 B1
6546418 Schena et al. Apr 2003 B2
6550011 Sims, III Apr 2003 B1
6563465 Frecska May 2003 B2
6563805 Ma et al. May 2003 B1
6564380 Murphy May 2003 B1
6577238 Whitesmith et al. Jun 2003 B1
6593887 Luk et al. Jul 2003 B2
6597680 Lindskog et al. Jul 2003 B1
6607136 Atsmon et al. Aug 2003 B1
6621528 Kessler Sep 2003 B1
6624752 Klitsgaard et al. Sep 2003 B2
6628302 White et al. Sep 2003 B2
6632992 Hasegawa Oct 2003 B2
6633981 Davis Oct 2003 B1
6645077 Rowe Nov 2003 B2
6647417 Hunter et al. Nov 2003 B1
6657538 Ritter Dec 2003 B1
6658566 Hazard Dec 2003 B1
6667684 Waggamon et al. Dec 2003 B1
6669096 Saphar et al. Dec 2003 B1
6671808 Abbott et al. Dec 2003 B1
6683954 Searle Jan 2004 B1
6697944 Jones et al. Feb 2004 B1
6709333 Bradford et al. Mar 2004 B1
6711464 Yap et al. Mar 2004 B1
6714168 Berenbaum Mar 2004 B2
6715246 Frecska et al. Apr 2004 B1
6728397 McNeal Apr 2004 B2
6737955 Ghabra et al. May 2004 B2
6758394 Maskatiya et al. Jul 2004 B2
6771969 Chinoy et al. Aug 2004 B1
6775655 Peinado et al. Aug 2004 B1
6785474 Hirt et al. Aug 2004 B2
6788640 Celeste Sep 2004 B2
6788924 Knutson et al. Sep 2004 B1
6795425 Raith Sep 2004 B1
6804825 White et al. Oct 2004 B1
6806887 Chernock et al. Oct 2004 B2
6819219 Bolle et al. Nov 2004 B1
6839542 Sibecas et al. Jan 2005 B2
6850147 Prokoski et al. Feb 2005 B2
6853988 Dickinson et al. Feb 2005 B1
6859812 Poynor Feb 2005 B1
6861980 Rowitch et al. Mar 2005 B1
6873975 Hatakeyama et al. Mar 2005 B1
6879567 Callaway et al. Apr 2005 B2
6879966 Lapsley et al. Apr 2005 B1
6886741 Salveson May 2005 B1
6889067 Willey May 2005 B2
6891822 Gubbi et al. May 2005 B1
6892307 Wood et al. May 2005 B1
6930643 Byrne et al. Aug 2005 B2
6947003 Huor Sep 2005 B2
6950941 Lee et al. Sep 2005 B1
6957086 Bahl et al. Oct 2005 B2
6961858 Fransdonk Nov 2005 B2
6963270 Gallagher et al. Nov 2005 B1
6963971 Bush et al. Nov 2005 B1
6973576 Giobbi Dec 2005 B2
6975202 Rodriguez et al. Dec 2005 B1
6980087 Zukowski Dec 2005 B2
6983882 Cassone Jan 2006 B2
6999032 Pakray et al. Feb 2006 B2
7012503 Nielsen Mar 2006 B2
7020635 Hamilton et al. Mar 2006 B2
7031945 Donner Apr 2006 B1
7049963 Waterhouse et al. May 2006 B2
7055171 Martin et al. May 2006 B1
7058806 Smeets et al. Jun 2006 B2
7061380 Orlando et al. Jun 2006 B1
7068623 Barany et al. Jun 2006 B1
7072900 Sweitzer et al. Jul 2006 B2
7079079 Jo et al. Jul 2006 B2
7080049 Truitt et al. Jul 2006 B2
7082415 Robinson et al. Jul 2006 B1
7090126 Kelly et al. Aug 2006 B2
7090128 Farley et al. Aug 2006 B2
7100053 Brown et al. Aug 2006 B1
7107455 Merkin Sep 2006 B1
7107462 Fransdonk Sep 2006 B2
7111789 Rajasekaran et al. Sep 2006 B2
7112138 Hedrick et al. Sep 2006 B2
7119659 Bonalle et al. Oct 2006 B2
7123149 Nowak et al. Oct 2006 B2
7130668 Chang et al. Oct 2006 B2
7131139 Meier Oct 2006 B1
7137008 Hamid et al. Nov 2006 B1
7137012 Kamibayashi et al. Nov 2006 B1
7139914 Arnouse Nov 2006 B2
7150045 Koelle et al. Dec 2006 B2
7155416 Shatford Dec 2006 B2
7159114 Zajkowski et al. Jan 2007 B1
7159765 Frerking Jan 2007 B2
7167987 Angelo Jan 2007 B2
7168089 Nguyen et al. Jan 2007 B2
7176797 Zai et al. Feb 2007 B2
7185363 Narin et al. Feb 2007 B1
7188110 Ludtke et al. Mar 2007 B1
7191466 Hamid et al. Mar 2007 B1
7194438 Sovio et al. Mar 2007 B2
7209955 Major et al. Apr 2007 B1
7218944 Cromer et al. May 2007 B2
7225161 Lam et al. May 2007 B2
7230908 Vanderaar et al. Jun 2007 B2
7231068 Tibor Jun 2007 B2
7231451 Law et al. Jun 2007 B2
7239226 Berardi et al. Jul 2007 B2
7242923 Perera et al. Jul 2007 B2
7249177 Miller Jul 2007 B1
7272723 Abbott et al. Sep 2007 B1
7277737 Vollmer et al. Oct 2007 B1
7278025 Saito et al. Oct 2007 B2
7283650 Sharma et al. Oct 2007 B1
7295119 Rappaport et al. Nov 2007 B2
7305560 Giobbi Dec 2007 B2
7310042 Seifert Dec 2007 B2
7314164 Bonalle et al. Jan 2008 B2
7317799 Hammersmith et al. Jan 2008 B2
7319395 Puzio et al. Jan 2008 B2
7330108 Thomas Feb 2008 B2
7333002 Bixler et al. Feb 2008 B2
7333615 Jarboe et al. Feb 2008 B1
7336181 Nowak et al. Feb 2008 B2
7336182 Baranowski et al. Feb 2008 B1
7337326 Palmer et al. Feb 2008 B2
7341181 Bonalle et al. Mar 2008 B2
7342503 Light et al. Mar 2008 B1
7349557 Tibor Mar 2008 B2
7356393 Schlatre et al. Apr 2008 B1
7356706 Scheurich Apr 2008 B2
7361919 Setlak Apr 2008 B2
7363494 Brainard et al. Apr 2008 B2
7370366 Lacan et al. May 2008 B2
7378939 Sengupta et al. May 2008 B2
7380202 Lindhorst et al. May 2008 B1
7382799 Young et al. Jun 2008 B1
7387235 Gilbert et al. Jun 2008 B2
7401731 Pletz et al. Jul 2008 B1
7404088 Giobbi Jul 2008 B2
7408799 Kang Aug 2008 B1
7424134 Chou Sep 2008 B2
7437330 Robinson et al. Oct 2008 B1
7447911 Chou et al. Nov 2008 B2
7448087 Ohmori et al. Nov 2008 B2
7458510 Zhou Dec 2008 B1
7460836 Smith et al. Dec 2008 B2
7461444 Deaett et al. Dec 2008 B2
7464053 Pylant Dec 2008 B1
7464059 Robinson et al. Dec 2008 B1
7466232 Neuwirth Dec 2008 B2
7472280 Giobbi Dec 2008 B2
7477285 Johnson Jan 2009 B1
7512806 Lemke Mar 2009 B2
7525413 Jung et al. Apr 2009 B2
7529944 Hamid May 2009 B2
7533809 Robinson et al. May 2009 B1
7545312 Kiang et al. Jun 2009 B2
7565329 Lapsley et al. Jul 2009 B2
7573382 Choubey et al. Aug 2009 B2
7573841 Lee et al. Aug 2009 B2
7574734 Fedronic et al. Aug 2009 B2
7578442 Knowles et al. Aug 2009 B2
7583238 Cassen et al. Sep 2009 B2
7583643 Smith et al. Sep 2009 B2
7587502 Crawford et al. Sep 2009 B2
7587611 Johnson et al. Sep 2009 B2
7594611 Arrington, III Sep 2009 B1
7595765 Hirsch et al. Sep 2009 B1
7603564 Adachi Oct 2009 B2
7606733 Shmueli et al. Oct 2009 B2
7617523 Das et al. Nov 2009 B2
7620184 Marque Pucheu Nov 2009 B2
7624073 Robinson et al. Nov 2009 B1
7624417 Dua Nov 2009 B2
7640273 Wallmeier et al. Dec 2009 B2
7644443 Matsuyama et al. Jan 2010 B2
7646307 Plocher et al. Jan 2010 B2
7652892 Shiu et al. Jan 2010 B2
7676380 Graves et al. Mar 2010 B2
7689005 Wang et al. Mar 2010 B2
7701858 Werb et al. Apr 2010 B2
7706896 Music et al. Apr 2010 B2
7711152 Davida et al. May 2010 B1
7711586 Aggarwal et al. May 2010 B2
7715593 Adams et al. May 2010 B1
7724713 Del Prado Pavon et al. May 2010 B2
7724717 Porras et al. May 2010 B2
7724720 Korpela et al. May 2010 B2
7764236 Hill et al. Jul 2010 B2
7765164 Robinson et al. Jul 2010 B1
7765181 Thomas et al. Jul 2010 B2
7768960 Barratt Aug 2010 B1
7773754 Buer et al. Aug 2010 B2
7774613 Lemke Aug 2010 B2
7780082 Handa et al. Aug 2010 B2
7796551 Machiraju et al. Sep 2010 B1
7813822 Hoffberg Oct 2010 B1
7865448 Pizarro Jan 2011 B2
7865937 White et al. Jan 2011 B1
7883003 Giobbi et al. Feb 2011 B2
7883417 Bruzzese et al. Feb 2011 B2
7904718 Giobbi et al. Mar 2011 B2
7943868 Anders et al. May 2011 B2
7957536 Nolte Jun 2011 B2
7961078 Reynolds et al. Jun 2011 B1
7984064 Fusari Jul 2011 B2
7996514 Baumert et al. Aug 2011 B2
8026821 Reeder et al. Sep 2011 B2
8036152 Brown Oct 2011 B2
8049594 Baranowski Nov 2011 B1
8077041 Stern et al. Dec 2011 B2
8081215 Kuo et al. Dec 2011 B2
8082160 Collins et al. Dec 2011 B2
8089354 Perkins Jan 2012 B2
8112066 Ben Ayed Feb 2012 B2
8125624 Jones et al. Feb 2012 B2
8135624 Ramalingam et al. Mar 2012 B1
8171528 Brown May 2012 B1
8193923 Rork et al. Jun 2012 B2
8200980 Robinson et al. Jun 2012 B1
8215552 Rambadt Jul 2012 B1
8219129 Brown et al. Jul 2012 B2
8248263 Shervey et al. Aug 2012 B2
8258942 Lanzone et al. Sep 2012 B1
8294554 Shoarinejad et al. Oct 2012 B2
8296573 Bolle et al. Oct 2012 B2
8307414 Zerfos et al. Nov 2012 B2
8325011 Butler et al. Dec 2012 B2
8340672 Brown et al. Dec 2012 B2
8352730 Giobbi Jan 2013 B2
8373562 Heinze et al. Feb 2013 B1
8387124 Smetters et al. Feb 2013 B2
8390456 Puleston et al. Mar 2013 B2
8395484 Fullerton Mar 2013 B2
8410906 Dacus et al. Apr 2013 B1
8412949 Giobbi et al. Apr 2013 B2
8421606 Collins et al. Apr 2013 B2
8424079 Adams et al. Apr 2013 B2
8432262 Talty et al. Apr 2013 B2
8433919 Giobbi et al. Apr 2013 B2
8448858 Kundu et al. May 2013 B1
8457672 Brown et al. Jun 2013 B2
8473748 Sampas Jun 2013 B2
8484696 Gatto et al. Jul 2013 B2
8494576 Bye et al. Jul 2013 B1
8508336 Giobbi et al. Aug 2013 B2
8511555 Babcock et al. Aug 2013 B2
8519823 Rinkes Aug 2013 B2
8522019 Michaelis Aug 2013 B2
8558699 Butler et al. Oct 2013 B2
8572391 Golan et al. Oct 2013 B2
8577091 Ivanov et al. Nov 2013 B2
8646042 Brown Feb 2014 B1
8659427 Brown et al. Feb 2014 B2
8678273 McNeal Mar 2014 B2
8717346 Claessen May 2014 B2
8738925 Park et al. May 2014 B1
8799574 Corda Aug 2014 B2
8838993 Giobbi et al. Sep 2014 B2
8856539 Weiss Oct 2014 B2
8857716 Giobbi et al. Oct 2014 B1
8886954 Giobbi Nov 2014 B1
8907861 Hirt Dec 2014 B2
8914477 Gammon Dec 2014 B2
8918854 Giobbi Dec 2014 B1
8931698 Ishikawa et al. Jan 2015 B2
8979646 Moser et al. Mar 2015 B2
9020854 Giobbi Apr 2015 B2
9037140 Brown May 2015 B1
9042819 Dua May 2015 B2
9049188 Brown Jun 2015 B1
9113464 Brown et al. Aug 2015 B2
9165233 Testanero Oct 2015 B2
9189788 Robinson et al. Nov 2015 B1
9230399 Yacenda Jan 2016 B2
9235700 Brown Jan 2016 B1
9251326 Giobbi et al. Feb 2016 B2
9251332 Giobbi Feb 2016 B2
9265043 Brown et al. Feb 2016 B2
9265450 Giobbi Feb 2016 B1
9269221 Brown et al. Feb 2016 B2
9276914 Woodward et al. Mar 2016 B2
9298905 Giobbi Mar 2016 B1
9305312 Kountotsis et al. Apr 2016 B2
9322974 Giobbi Apr 2016 B1
9405898 Giobbi Aug 2016 B2
9418205 Giobbi Aug 2016 B2
9430624 Mortensen et al. Aug 2016 B1
9450956 Giobbi Sep 2016 B1
9542542 Giobbi et al. Jan 2017 B2
9613483 Giobbi Apr 2017 B2
9679289 Brown Jun 2017 B1
9728080 Giobbi et al. Aug 2017 B1
9807091 Giobbi Oct 2017 B2
9830504 Masood et al. Nov 2017 B2
9892250 Giobbi Feb 2018 B2
9898662 Tsuda et al. Feb 2018 B2
9904816 Giobbi et al. Feb 2018 B1
9990628 Giobbi Jun 2018 B2
10026253 Giobbi Jul 2018 B2
10073960 Brown Sep 2018 B1
10110385 Rush et al. Oct 2018 B1
10171460 Giobbi Jan 2019 B2
10217339 Giobbi Feb 2019 B1
10229294 Giobbi et al. Mar 2019 B1
10313336 Giobbi Jun 2019 B2
10334541 Brown Jun 2019 B1
10362483 Frusina Jul 2019 B2
10374795 Giobbi et al. Aug 2019 B1
10383112 Brown et al. Aug 2019 B2
10403128 Giobbi et al. Sep 2019 B2
10437976 Giobbi Oct 2019 B2
10455533 Brown Oct 2019 B2
10469456 Giobbi Nov 2019 B1
10567965 Boettcher et al. Feb 2020 B2
10698989 Giobbi Jun 2020 B2
10764044 Giobbi et al. Sep 2020 B1
10769939 Brown et al. Sep 2020 B2
10817964 Guillama et al. Oct 2020 B2
10909229 Giobbi Feb 2021 B2
10943471 Giobbi et al. Mar 2021 B1
11086979 Giobbi Aug 2021 B1
11212797 Brown Dec 2021 B2
11219022 Brown Jan 2022 B2
11562644 Brown et al. Jan 2023 B2
20010000535 Lapsley et al. Apr 2001 A1
20010021950 Hawley et al. Sep 2001 A1
20010024428 Onouchi Sep 2001 A1
20010026619 Howard et al. Oct 2001 A1
20010027121 Boesen Oct 2001 A1
20010027439 Holtzman et al. Oct 2001 A1
20010044337 Rowe et al. Nov 2001 A1
20020004783 Paltenghe et al. Jan 2002 A1
20020007456 Peinado et al. Jan 2002 A1
20020010679 Felsher Jan 2002 A1
20020013772 Peinado Jan 2002 A1
20020014954 Fitzgibbon et al. Feb 2002 A1
20020015008 Kishida et al. Feb 2002 A1
20020015494 Nagai et al. Feb 2002 A1
20020019811 Lapsley et al. Feb 2002 A1
20020022455 Salokannel et al. Feb 2002 A1
20020023032 Pearson et al. Feb 2002 A1
20020023217 Wheeler et al. Feb 2002 A1
20020026424 Akashi Feb 2002 A1
20020037732 Gous et al. Mar 2002 A1
20020052193 Chetty May 2002 A1
20020055908 Di Giorgio et al. May 2002 A1
20020056043 Glass May 2002 A1
20020059114 Cockrill et al. May 2002 A1
20020062249 Iannacci May 2002 A1
20020065778 Bouet et al. May 2002 A1
20020068605 Stanley Jun 2002 A1
20020069364 Dosch Jun 2002 A1
20020071559 Christensen et al. Jun 2002 A1
20020073042 Maritzen et al. Jun 2002 A1
20020076051 Nii Jun 2002 A1
20020080969 Giobbi Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020083318 Larose Jun 2002 A1
20020086690 Takahashi et al. Jul 2002 A1
20020089890 Fibranz et al. Jul 2002 A1
20020091646 Lake et al. Jul 2002 A1
20020095586 Doyle et al. Jul 2002 A1
20020095587 Doyle et al. Jul 2002 A1
20020097876 Harrison Jul 2002 A1
20020098888 Rowe et al. Jul 2002 A1
20020100798 Farrugia et al. Aug 2002 A1
20020103027 Rowe et al. Aug 2002 A1
20020103881 Granade et al. Aug 2002 A1
20020104006 Boate et al. Aug 2002 A1
20020104019 Chatani et al. Aug 2002 A1
20020105918 Yamada et al. Aug 2002 A1
20020108049 Xu et al. Aug 2002 A1
20020109580 Shreve et al. Aug 2002 A1
20020111919 Weller et al. Aug 2002 A1
20020112183 Baird et al. Aug 2002 A1
20020116615 Nguyen et al. Aug 2002 A1
20020124251 Hunter et al. Sep 2002 A1
20020128017 Virtanen Sep 2002 A1
20020128057 Walker et al. Sep 2002 A1
20020129262 Kutaragi et al. Sep 2002 A1
20020138438 Bardwell Sep 2002 A1
20020138445 Laage et al. Sep 2002 A1
20020138767 Hamid et al. Sep 2002 A1
20020140542 Prokoski et al. Oct 2002 A1
20020141586 Margalit et al. Oct 2002 A1
20020143623 Dayley Oct 2002 A1
20020143655 Elston et al. Oct 2002 A1
20020144116 Giobbi Oct 2002 A1
20020144117 Faigle Oct 2002 A1
20020147653 Shmueli et al. Oct 2002 A1
20020148892 Bardwell Oct 2002 A1
20020150282 Kinsella Oct 2002 A1
20020152391 Willins et al. Oct 2002 A1
20020153996 Chan et al. Oct 2002 A1
20020158121 Stanford-Clark Oct 2002 A1
20020158750 Almalik Oct 2002 A1
20020158765 Pape et al. Oct 2002 A1
20020160820 Winkler Oct 2002 A1
20020174348 Ting Nov 2002 A1
20020177460 Beasley et al. Nov 2002 A1
20020178063 Gravelle et al. Nov 2002 A1
20020184208 Kato Dec 2002 A1
20020187746 Cheng et al. Dec 2002 A1
20020191816 Maritzen et al. Dec 2002 A1
20020196963 Bardwell Dec 2002 A1
20020199120 Schmidt Dec 2002 A1
20030001016 Fraier et al. Jan 2003 A1
20030022701 Gupta Jan 2003 A1
20030024975 Rajasekharan Feb 2003 A1
20030034877 Miller et al. Feb 2003 A1
20030036416 Pattabiraman et al. Feb 2003 A1
20030036425 Kaminkow et al. Feb 2003 A1
20030046228 Berney Mar 2003 A1
20030046237 Uberti Mar 2003 A1
20030046552 Hamid Mar 2003 A1
20030048174 Stevens et al. Mar 2003 A1
20030051173 Krueger Mar 2003 A1
20030054868 Paulsen et al. Mar 2003 A1
20030054881 Hedrick et al. Mar 2003 A1
20030055689 Block et al. Mar 2003 A1
20030055792 Kinoshita et al. Mar 2003 A1
20030061172 Robinson Mar 2003 A1
20030063619 Montano et al. Apr 2003 A1
20030079133 Breiter et al. Apr 2003 A1
20030087601 Agam et al. May 2003 A1
20030088441 McNerney May 2003 A1
20030105719 Berger et al. Jun 2003 A1
20030109274 Budka et al. Jun 2003 A1
20030115351 Giobbi Jun 2003 A1
20030115474 Khan et al. Jun 2003 A1
20030117969 Koo et al. Jun 2003 A1
20030117980 Kim et al. Jun 2003 A1
20030120934 Ortiz Jun 2003 A1
20030127511 Kelly et al. Jul 2003 A1
20030128866 McNeal Jul 2003 A1
20030137404 Bonneau et al. Jul 2003 A1
20030139190 Steelberg et al. Jul 2003 A1
20030142041 Barlow et al. Jul 2003 A1
20030146835 Carter Aug 2003 A1
20030149744 Bierre et al. Aug 2003 A1
20030156742 Witt et al. Aug 2003 A1
20030159040 Hashimoto et al. Aug 2003 A1
20030163388 Beane Aug 2003 A1
20030167207 Berardi et al. Sep 2003 A1
20030169697 Suzuki et al. Sep 2003 A1
20030172028 Abell et al. Sep 2003 A1
20030172037 Jung et al. Sep 2003 A1
20030174839 Yamagata et al. Sep 2003 A1
20030176218 Lemay et al. Sep 2003 A1
20030177102 Robinson Sep 2003 A1
20030186739 Paulsen et al. Oct 2003 A1
20030187787 Freund Oct 2003 A1
20030195842 Reece Oct 2003 A1
20030196084 Okereke et al. Oct 2003 A1
20030199267 Iwasa et al. Oct 2003 A1
20030204526 Salehi-Had Oct 2003 A1
20030204721 Barrus et al. Oct 2003 A1
20030213840 Livingston et al. Nov 2003 A1
20030223394 Parantainen et al. Dec 2003 A1
20030225703 Angel Dec 2003 A1
20030226031 Proudler et al. Dec 2003 A1
20030233458 Kwon et al. Dec 2003 A1
20040002347 Hoctor et al. Jan 2004 A1
20040015403 Moskowitz et al. Jan 2004 A1
20040021552 Koo Feb 2004 A1
20040022384 Flores et al. Feb 2004 A1
20040029620 Karaoguz Feb 2004 A1
20040029635 Giobbi Feb 2004 A1
20040030764 Birk et al. Feb 2004 A1
20040030894 Labrou et al. Feb 2004 A1
20040035644 Ford et al. Feb 2004 A1
20040039909 Cheng Feb 2004 A1
20040044627 Russell et al. Mar 2004 A1
20040048570 Oba et al. Mar 2004 A1
20040048609 Kosaka Mar 2004 A1
20040059682 Hasumi et al. Mar 2004 A1
20040059912 Zizzi Mar 2004 A1
20040064728 Scheurich Apr 2004 A1
20040068656 Lu Apr 2004 A1
20040073792 Noble et al. Apr 2004 A1
20040081127 Gardner et al. Apr 2004 A1
20040082385 Silva et al. Apr 2004 A1
20040088558 Candelore May 2004 A1
20040090345 Hitt May 2004 A1
20040098597 Giobbi May 2004 A1
20040103064 Howard et al. May 2004 A1
20040114563 Shvodian Jun 2004 A1
20040117644 Colvin Jun 2004 A1
20040123106 D'Angelo et al. Jun 2004 A1
20040123127 Teicher et al. Jun 2004 A1
20040127277 Walker et al. Jul 2004 A1
20040128162 Schlotterbeck et al. Jul 2004 A1
20040128389 Kopchik Jul 2004 A1
20040128500 Cihula et al. Jul 2004 A1
20040128508 Wheeler et al. Jul 2004 A1
20040128519 Klinger et al. Jul 2004 A1
20040129787 Saito et al. Jul 2004 A1
20040132432 Moores et al. Jul 2004 A1
20040137912 Lin Jul 2004 A1
20040153649 Rhoads et al. Aug 2004 A1
20040158746 Hu et al. Aug 2004 A1
20040166875 Jenkins et al. Aug 2004 A1
20040167465 Mihai et al. Aug 2004 A1
20040181695 Walker Sep 2004 A1
20040193925 Safriel Sep 2004 A1
20040194133 Ikeda et al. Sep 2004 A1
20040201755 Norskog Oct 2004 A1
20040203566 Leung Oct 2004 A1
20040203923 Mullen Oct 2004 A1
20040208139 Iwamura Oct 2004 A1
20040209690 Bruzzese et al. Oct 2004 A1
20040209692 Schober et al. Oct 2004 A1
20040214582 Lan et al. Oct 2004 A1
20040215615 Larsson et al. Oct 2004 A1
20040217859 Pucci et al. Nov 2004 A1
20040218581 Cattaneo Nov 2004 A1
20040222877 Teramura et al. Nov 2004 A1
20040230488 Beenau et al. Nov 2004 A1
20040230809 Lowensohn et al. Nov 2004 A1
20040234117 Tibor Nov 2004 A1
20040243519 Perttila et al. Dec 2004 A1
20040246103 Zukowski Dec 2004 A1
20040246950 Parker et al. Dec 2004 A1
20040250074 Kilian-Kehr Dec 2004 A1
20040252012 Beenau et al. Dec 2004 A1
20040252659 Yun et al. Dec 2004 A1
20040253996 Chen et al. Dec 2004 A1
20040254837 Roshkoff Dec 2004 A1
20040255139 Giobbi Dec 2004 A1
20040255145 Chow Dec 2004 A1
20050001028 Zuili Jan 2005 A1
20050002028 Kasapi et al. Jan 2005 A1
20050005136 Chen et al. Jan 2005 A1
20050006452 Aupperle et al. Jan 2005 A1
20050009517 Maes Jan 2005 A1
20050020322 Ruuska et al. Jan 2005 A1
20050021369 Cohen et al. Jan 2005 A1
20050021561 Noonan Jan 2005 A1
20050025093 Yun et al. Feb 2005 A1
20050028168 Marcjan Feb 2005 A1
20050035897 Perl et al. Feb 2005 A1
20050039027 Shapiro Feb 2005 A1
20050040961 Tuttle Feb 2005 A1
20050044372 Aull et al. Feb 2005 A1
20050044387 Ozolins Feb 2005 A1
20050047386 Yi Mar 2005 A1
20050049013 Chang et al. Mar 2005 A1
20050050208 Chatani Mar 2005 A1
20050050324 Corbett et al. Mar 2005 A1
20050054431 Walker et al. Mar 2005 A1
20050055242 Bello et al. Mar 2005 A1
20050055244 Mullan et al. Mar 2005 A1
20050058292 Diorio et al. Mar 2005 A1
20050074126 Stanko Apr 2005 A1
20050076242 Breuer Apr 2005 A1
20050081040 Johnson et al. Apr 2005 A1
20050084137 Kim et al. Apr 2005 A1
20050086115 Pearson Apr 2005 A1
20050086501 Woo et al. Apr 2005 A1
20050086515 Paris Apr 2005 A1
20050089000 Bae et al. Apr 2005 A1
20050090200 Karaoguz et al. Apr 2005 A1
20050091338 De La Huerga Apr 2005 A1
20050091553 Chien et al. Apr 2005 A1
20050094657 Sung et al. May 2005 A1
20050096053 Liu et al. May 2005 A1
20050097037 Tibor May 2005 A1
20050105600 Culum et al. May 2005 A1
20050105734 Buer et al. May 2005 A1
20050108164 Salafi et al. May 2005 A1
20050109836 Ben-Aissa May 2005 A1
20050109841 Ryan et al. May 2005 A1
20050113070 Okabe May 2005 A1
20050114149 Rodriguez et al. May 2005 A1
20050114150 Franklin May 2005 A1
20050116020 Smolucha et al. Jun 2005 A1
20050117530 Abraham et al. Jun 2005 A1
20050119979 Murashita et al. Jun 2005 A1
20050124294 Wentink Jun 2005 A1
20050125258 Yellin et al. Jun 2005 A1
20050136947 Llombart-Juan et al. Jun 2005 A1
20050137827 Takamiya Jun 2005 A1
20050137977 Wankmueller Jun 2005 A1
20050138390 Adams et al. Jun 2005 A1
20050138576 Baumert et al. Jun 2005 A1
20050139656 Arnouse Jun 2005 A1
20050141451 Yoon et al. Jun 2005 A1
20050152394 Cho Jul 2005 A1
20050154897 Holloway et al. Jul 2005 A1
20050161503 Remery et al. Jul 2005 A1
20050165684 Jensen et al. Jul 2005 A1
20050166063 Huang Jul 2005 A1
20050167482 Ramachandran et al. Aug 2005 A1
20050169292 Young Aug 2005 A1
20050177716 Ginter et al. Aug 2005 A1
20050180385 Jeong et al. Aug 2005 A1
20050182661 Allard et al. Aug 2005 A1
20050182975 Guo et al. Aug 2005 A1
20050187792 Harper Aug 2005 A1
20050192748 Andric et al. Sep 2005 A1
20050195975 Kawakita Sep 2005 A1
20050198208 Nystrom Sep 2005 A1
20050200453 Turner et al. Sep 2005 A1
20050201389 Shimanuki et al. Sep 2005 A1
20050203682 Omino et al. Sep 2005 A1
20050203844 Ferguson et al. Sep 2005 A1
20050210270 Rohatgi et al. Sep 2005 A1
20050212657 Simon Sep 2005 A1
20050215233 Perera et al. Sep 2005 A1
20050216313 Claud et al. Sep 2005 A1
20050216639 Sparer et al. Sep 2005 A1
20050218215 Lauden Oct 2005 A1
20050220046 Falck et al. Oct 2005 A1
20050221869 Liu et al. Oct 2005 A1
20050229007 Bolle et al. Oct 2005 A1
20050229240 Nanba Oct 2005 A1
20050231328 Castle et al. Oct 2005 A1
20050235364 Wilson Oct 2005 A1
20050242921 Zimmerman et al. Nov 2005 A1
20050243787 Hong et al. Nov 2005 A1
20050249385 Kondo et al. Nov 2005 A1
20050251688 Nanavati et al. Nov 2005 A1
20050253683 Lowe Nov 2005 A1
20050256878 Brown et al. Nov 2005 A1
20050257102 Moyer et al. Nov 2005 A1
20050264416 Maurer Dec 2005 A1
20050268111 Markham Dec 2005 A1
20050269401 Spitzer et al. Dec 2005 A1
20050272403 Ryu et al. Dec 2005 A1
20050277385 Daum Dec 2005 A1
20050281215 Budampati et al. Dec 2005 A1
20050281320 Neugebauer Dec 2005 A1
20050282558 Choi et al. Dec 2005 A1
20050284932 Sukeda et al. Dec 2005 A1
20050287985 Balfanz et al. Dec 2005 A1
20050288015 Azizi et al. Dec 2005 A1
20050288069 Arunan et al. Dec 2005 A1
20050289473 Gustafson et al. Dec 2005 A1
20060001525 Nitzan et al. Jan 2006 A1
20060009216 Welnick et al. Jan 2006 A1
20060014430 Liang et al. Jan 2006 A1
20060022042 Smets et al. Feb 2006 A1
20060022046 Iwamura Feb 2006 A1
20060022800 Krishna et al. Feb 2006 A1
20060025180 Rajkotia et al. Feb 2006 A1
20060026673 Tsuchida Feb 2006 A1
20060030279 Leabman Feb 2006 A1
20060030353 Jun Feb 2006 A1
20060034250 Kim et al. Feb 2006 A1
20060041746 Kirkup et al. Feb 2006 A1
20060046664 Paradiso et al. Mar 2006 A1
20060058102 Nguyen et al. Mar 2006 A1
20060063575 Gatto et al. Mar 2006 A1
20060064605 Giobbi Mar 2006 A1
20060066441 Knadle, Jr. Mar 2006 A1
20060069814 Abraham et al. Mar 2006 A1
20060072586 Callaway et al. Apr 2006 A1
20060074713 Conry et al. Apr 2006 A1
20060076401 Frerking Apr 2006 A1
20060078176 Abiko et al. Apr 2006 A1
20060087407 Stewart et al. Apr 2006 A1
20060089138 Smith et al. Apr 2006 A1
20060097949 Luebke et al. May 2006 A1
20060110012 Ritter May 2006 A1
20060111955 Winter et al. May 2006 A1
20060113381 Hochstein et al. Jun 2006 A1
20060116935 Evans Jun 2006 A1
20060117013 Wada Jun 2006 A1
20060120287 Foti et al. Jun 2006 A1
20060129838 Chen et al. Jun 2006 A1
20060136728 Gentry et al. Jun 2006 A1
20060136742 Giobbi Jun 2006 A1
20060143441 Giobbi Jun 2006 A1
20060144943 Kim Jul 2006 A1
20060156027 Blake Jul 2006 A1
20060158308 McMullen et al. Jul 2006 A1
20060163349 Neugebauer Jul 2006 A1
20060163350 Melton Jul 2006 A1
20060165060 Dua Jul 2006 A1
20060169771 Brookner Aug 2006 A1
20060170530 Nwosu et al. Aug 2006 A1
20060170565 Husak et al. Aug 2006 A1
20060172700 Wu Aug 2006 A1
20060173846 Omae et al. Aug 2006 A1
20060173991 Piikivi Aug 2006 A1
20060183426 Graves et al. Aug 2006 A1
20060183462 Kolehmainen Aug 2006 A1
20060184531 Russlies Aug 2006 A1
20060184795 Doradla et al. Aug 2006 A1
20060185005 Graves et al. Aug 2006 A1
20060187029 Thomas Aug 2006 A1
20060190348 Ofer et al. Aug 2006 A1
20060190413 Harper Aug 2006 A1
20060194598 Kim et al. Aug 2006 A1
20060195576 Rinne et al. Aug 2006 A1
20060198337 Hoang et al. Sep 2006 A1
20060200467 Ohmori et al. Sep 2006 A1
20060205408 Nakagawa et al. Sep 2006 A1
20060208066 Finn et al. Sep 2006 A1
20060208853 Kung et al. Sep 2006 A1
20060222042 Teramura et al. Oct 2006 A1
20060226950 Kanou et al. Oct 2006 A1
20060229909 Kaila et al. Oct 2006 A1
20060236373 Graves et al. Oct 2006 A1
20060237528 Bishop et al. Oct 2006 A1
20060238305 Loving et al. Oct 2006 A1
20060268891 Heidari-Bateni et al. Nov 2006 A1
20060273176 Audebert et al. Dec 2006 A1
20060274711 Nelson et al. Dec 2006 A1
20060279412 Holland et al. Dec 2006 A1
20060286969 Talmor et al. Dec 2006 A1
20060288095 Torok et al. Dec 2006 A1
20060288233 Kozlay Dec 2006 A1
20060290473 Mahasenan Dec 2006 A1
20060290580 Noro et al. Dec 2006 A1
20060292986 Bitran et al. Dec 2006 A1
20060293925 Flom Dec 2006 A1
20060294388 Abraham et al. Dec 2006 A1
20070003111 Awatsu et al. Jan 2007 A1
20070005403 Kennedy et al. Jan 2007 A1
20070007331 Jasper et al. Jan 2007 A1
20070008070 Friedrich Jan 2007 A1
20070008916 Haugli et al. Jan 2007 A1
20070011724 Gonzalez et al. Jan 2007 A1
20070016800 Spottswood et al. Jan 2007 A1
20070019845 Kato Jan 2007 A1
20070029381 Braiman Feb 2007 A1
20070032225 Konicek et al. Feb 2007 A1
20070032288 Nelson et al. Feb 2007 A1
20070033072 Bildirici Feb 2007 A1
20070033150 Nwosu Feb 2007 A1
20070036396 Sugita et al. Feb 2007 A1
20070038751 Jorgensen Feb 2007 A1
20070043594 Lavergne Feb 2007 A1
20070050259 Wesley Mar 2007 A1
20070050398 Mochizuki Mar 2007 A1
20070050845 Das et al. Mar 2007 A1
20070051794 Glanz et al. Mar 2007 A1
20070051798 Kawai et al. Mar 2007 A1
20070055630 Gauthier et al. Mar 2007 A1
20070060095 Subrahmanya et al. Mar 2007 A1
20070060319 Block et al. Mar 2007 A1
20070064742 Shvodian Mar 2007 A1
20070069852 Mo et al. Mar 2007 A1
20070070040 Chen et al. Mar 2007 A1
20070072636 Worfolk et al. Mar 2007 A1
20070073553 Flinn et al. Mar 2007 A1
20070084523 McLean et al. Apr 2007 A1
20070084913 Weston Apr 2007 A1
20070087682 DaCosta Apr 2007 A1
20070087834 Moser et al. Apr 2007 A1
20070100507 Simon May 2007 A1
20070100939 Bagley et al. May 2007 A1
20070109117 Heitzmann et al. May 2007 A1
20070112676 Kontio et al. May 2007 A1
20070118891 Buer May 2007 A1
20070120643 Lee May 2007 A1
20070120651 Kobayashi et al. May 2007 A1
20070132586 Plocher et al. Jun 2007 A1
20070133478 Armbruster et al. Jun 2007 A1
20070136407 Rudelic Jun 2007 A1
20070142032 Balsillie Jun 2007 A1
20070143626 Okuda Jun 2007 A1
20070147332 Lappetelainen et al. Jun 2007 A1
20070152826 August et al. Jul 2007 A1
20070156850 Corrion Jul 2007 A1
20070157249 Cordray et al. Jul 2007 A1
20070158411 Krieg, Jr. Jul 2007 A1
20070159301 Hirt et al. Jul 2007 A1
20070159994 Brown et al. Jul 2007 A1
20070164847 Crawford et al. Jul 2007 A1
20070169121 Hunt et al. Jul 2007 A1
20070174809 Brown et al. Jul 2007 A1
20070176756 Friedrich Aug 2007 A1
20070176778 Ando et al. Aug 2007 A1
20070180047 Dong et al. Aug 2007 A1
20070187266 Porter et al. Aug 2007 A1
20070192601 Spain et al. Aug 2007 A1
20070194882 Yokota et al. Aug 2007 A1
20070197261 Humbel Aug 2007 A1
20070198436 Weiss Aug 2007 A1
20070204078 Boccon-Gibod et al. Aug 2007 A1
20070205860 Jones et al. Sep 2007 A1
20070205861 Nair et al. Sep 2007 A1
20070207750 Brown et al. Sep 2007 A1
20070213048 Trauberg Sep 2007 A1
20070214492 Gopi et al. Sep 2007 A1
20070218921 Lee et al. Sep 2007 A1
20070219926 Korn Sep 2007 A1
20070220272 Campisi et al. Sep 2007 A1
20070229268 Swan et al. Oct 2007 A1
20070245157 Giobbi et al. Oct 2007 A1
20070245158 Giobbi et al. Oct 2007 A1
20070247366 Smith et al. Oct 2007 A1
20070258626 Reiner Nov 2007 A1
20070260883 Giobbi et al. Nov 2007 A1
20070260888 Giobbi et al. Nov 2007 A1
20070266257 Camaisa et al. Nov 2007 A1
20070268862 Singh et al. Nov 2007 A1
20070271194 Walker et al. Nov 2007 A1
20070271433 Takemura Nov 2007 A1
20070277044 Graf et al. Nov 2007 A1
20070280509 Owen et al. Dec 2007 A1
20070285212 Rotzoll Dec 2007 A1
20070285238 Batra Dec 2007 A1
20070288263 Rodgers Dec 2007 A1
20070288752 Chan Dec 2007 A1
20070293155 Liao et al. Dec 2007 A1
20070294755 Dadhia et al. Dec 2007 A1
20070296544 Beenau et al. Dec 2007 A1
20080001783 Cargonja et al. Jan 2008 A1
20080005432 Kagawa Jan 2008 A1
20080008359 Beenau et al. Jan 2008 A1
20080011842 Curry et al. Jan 2008 A1
20080012685 Friedrich et al. Jan 2008 A1
20080012767 Caliri et al. Jan 2008 A1
20080016004 Kurasaki et al. Jan 2008 A1
20080019578 Saito et al. Jan 2008 A1
20080028227 Sakurai Jan 2008 A1
20080028453 Nguyen et al. Jan 2008 A1
20080040609 Giobbi Feb 2008 A1
20080046366 Bemmel et al. Feb 2008 A1
20080046715 Balazs et al. Feb 2008 A1
20080049700 Shah et al. Feb 2008 A1
20080061941 Fischer et al. Mar 2008 A1
20080071577 Highley Mar 2008 A1
20080072063 Takahashi et al. Mar 2008 A1
20080088475 Martin Apr 2008 A1
20080090548 Ramalingam Apr 2008 A1
20080095359 Schreyer et al. Apr 2008 A1
20080107089 Larsson et al. May 2008 A1
20080109895 Janevski May 2008 A1
20080111752 Lindackers et al. May 2008 A1
20080127176 Lee et al. May 2008 A1
20080129450 Riegebauer Jun 2008 A1
20080129463 Tuttle Jun 2008 A1
20080142588 Blum Jun 2008 A1
20080148351 Bhatia et al. Jun 2008 A1
20080149705 Giobbi et al. Jun 2008 A1
20080150678 Giobbi et al. Jun 2008 A1
20080156866 McNeal Jul 2008 A1
20080164997 Aritsuka et al. Jul 2008 A1
20080169909 Park et al. Jul 2008 A1
20080180213 Flax Jul 2008 A1
20080186166 Zhou et al. Aug 2008 A1
20080188308 Shepherd et al. Aug 2008 A1
20080195863 Kennedy Aug 2008 A1
20080201768 Koo et al. Aug 2008 A1
20080203107 Conley et al. Aug 2008 A1
20080208016 Hughes et al. Aug 2008 A1
20080209571 Bhaskar et al. Aug 2008 A1
20080218416 Handy et al. Sep 2008 A1
20080222701 Saaranen et al. Sep 2008 A1
20080223918 Williams et al. Sep 2008 A1
20080228524 Brown Sep 2008 A1
20080235144 Phillips Sep 2008 A1
20080238625 Rofougaran et al. Oct 2008 A1
20080250388 Meyer et al. Oct 2008 A1
20080251579 Larsen Oct 2008 A1
20080278325 Zimman et al. Nov 2008 A1
20080289030 Poplett Nov 2008 A1
20080289032 Aoki et al. Nov 2008 A1
20080303637 Gelbman et al. Dec 2008 A1
20080313728 Pandrangi et al. Dec 2008 A1
20080314971 Faith et al. Dec 2008 A1
20080316045 Sriharto et al. Dec 2008 A1
20090002134 McAllister Jan 2009 A1
20090013191 Popowski Jan 2009 A1
20090016573 McAfee et al. Jan 2009 A1
20090024584 Dharap et al. Jan 2009 A1
20090033464 Friedrich Feb 2009 A1
20090033485 Naeve et al. Feb 2009 A1
20090036164 Rowley Feb 2009 A1
20090041309 Kim et al. Feb 2009 A1
20090045916 Nitzan et al. Feb 2009 A1
20090052389 Qin et al. Feb 2009 A1
20090070146 Haider et al. Mar 2009 A1
20090076849 Diller Mar 2009 A1
20090081996 Duggal et al. Mar 2009 A1
20090085724 Naressi et al. Apr 2009 A1
20090094681 Sadler et al. Apr 2009 A1
20090096580 Paananen Apr 2009 A1
20090121890 Brown et al. May 2009 A1
20090125401 Beenau et al. May 2009 A1
20090140045 Evans Jun 2009 A1
20090157512 King Jun 2009 A1
20090165123 Giobbi Jun 2009 A1
20090176566 Kelly Jul 2009 A1
20090177495 Abousy et al. Jul 2009 A1
20090195461 Hirt Aug 2009 A1
20090199206 Finkenzeller et al. Aug 2009 A1
20090206992 Giobbi et al. Aug 2009 A1
20090232362 Otsubo et al. Sep 2009 A1
20090237245 Brinton et al. Sep 2009 A1
20090237253 Neuwirth Sep 2009 A1
20090239667 Rowe et al. Sep 2009 A1
20090253516 Hartmann et al. Oct 2009 A1
20090254448 Giobbi Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090264712 Baldus et al. Oct 2009 A1
20090310514 Jeon et al. Dec 2009 A1
20090313689 Nystroem et al. Dec 2009 A1
20090319788 Zick et al. Dec 2009 A1
20090320118 Mueller et al. Dec 2009 A1
20090322510 Berger et al. Dec 2009 A1
20090328182 Malakapalli et al. Dec 2009 A1
20100005526 Tsuji et al. Jan 2010 A1
20100007498 Jackson Jan 2010 A1
20100022308 Hartmann et al. Jan 2010 A1
20100023074 Powers et al. Jan 2010 A1
20100037255 Sheehan et al. Feb 2010 A1
20100062743 Jonsson Mar 2010 A1
20100077214 Jogand-Coulomb et al. Mar 2010 A1
20100091987 Takahashi et al. Apr 2010 A1
20100117794 Adams et al. May 2010 A1
20100134257 Puleston et al. Jun 2010 A1
20100169442 Liu et al. Jul 2010 A1
20100169964 Liu et al. Jul 2010 A1
20100172567 Prokoski Jul 2010 A1
20100174911 Isshiki Jul 2010 A1
20100188226 Seder et al. Jul 2010 A1
20100214100 Page Aug 2010 A1
20100277283 Burkart et al. Nov 2010 A1
20100277286 Burkart et al. Nov 2010 A1
20100291896 Corda Nov 2010 A1
20100305843 Yan et al. Dec 2010 A1
20100328033 Kamei Dec 2010 A1
20110072034 Sly et al. Mar 2011 A1
20110072132 Shafer et al. Mar 2011 A1
20110082735 Kannan et al. Apr 2011 A1
20110085287 Ebrom et al. Apr 2011 A1
20110091136 Danch et al. Apr 2011 A1
20110116358 Li et al. May 2011 A9
20110126188 Bernstein et al. May 2011 A1
20110221568 Giobbi Sep 2011 A1
20110227740 Wohltjen Sep 2011 A1
20110238517 Ramalingam et al. Sep 2011 A1
20110246790 Koh et al. Oct 2011 A1
20110266348 Denniston, Jr. Nov 2011 A1
20110307599 Saretto et al. Dec 2011 A1
20120028609 Hruska Feb 2012 A1
20120030006 Yoder et al. Feb 2012 A1
20120069776 Caldwell et al. Mar 2012 A1
20120086571 Scalisi et al. Apr 2012 A1
20120182123 Butler et al. Jul 2012 A1
20120212322 Idsoee Aug 2012 A1
20120226451 Bacot et al. Sep 2012 A1
20120226565 Drozd Sep 2012 A1
20120226907 Hohberger et al. Sep 2012 A1
20120238287 Scherzer Sep 2012 A1
20120278188 Attar et al. Nov 2012 A1
20120300753 Brown et al. Nov 2012 A1
20120310720 Balsan et al. Dec 2012 A1
20130019295 Park et al. Jan 2013 A1
20130019323 Arvidsson et al. Jan 2013 A1
20130044111 Vangilder et al. Feb 2013 A1
20130111543 Brown et al. May 2013 A1
20130135082 Xian et al. May 2013 A1
20130179201 Fuerstenberg et al. Jul 2013 A1
20130219186 Giobbi et al. Aug 2013 A1
20130276140 Coffing et al. Oct 2013 A1
20130277425 Sharma et al. Oct 2013 A1
20130297514 Giobbi Nov 2013 A1
20130312082 Izu et al. Nov 2013 A1
20130315210 Brown et al. Nov 2013 A1
20130331063 Cormier et al. Dec 2013 A1
20140074696 Glaser Mar 2014 A1
20140147018 Argue et al. May 2014 A1
20140256511 Smith Sep 2014 A1
20140266604 Masood et al. Sep 2014 A1
20140266713 Sehgal et al. Sep 2014 A1
20140337920 Giobbi Nov 2014 A1
20150026480 Giobbi et al. Jan 2015 A1
20150039451 Bonfiglio Feb 2015 A1
20150138330 Krishnamoorthi May 2015 A1
20150294293 Signarsson Oct 2015 A1
20150310385 King et al. Oct 2015 A1
20150310440 Hynes et al. Oct 2015 A1
20160005020 Fernando et al. Jan 2016 A1
20160093081 Kim et al. Mar 2016 A1
20160133123 Giobbi et al. May 2016 A1
20160171200 Giobbi Jun 2016 A1
20160203349 Giobbi Jul 2016 A1
20160205682 Brown et al. Jul 2016 A1
20160210614 Hall Jul 2016 A1
20160300236 Wiley et al. Oct 2016 A1
20160306956 Giobbi Oct 2016 A1
20170041315 Giobbi Feb 2017 A1
20170085564 Giobbi et al. Mar 2017 A1
20170091548 Agrawal et al. Mar 2017 A1
20170270738 Giobbi Sep 2017 A1
20170309165 Brown et al. Oct 2017 A1
20170353500 Jacobsen et al. Dec 2017 A1
20180019998 Giobbi Jan 2018 A1
20180129799 Giobbi May 2018 A1
20180322718 Qian et al. Nov 2018 A1
20180357475 Honda et al. Dec 2018 A1
20190065721 Giobbi Feb 2019 A1
20190172281 Einberg et al. Jun 2019 A1
20190260724 Hefetz et al. Aug 2019 A1
20190289562 Brown Sep 2019 A1
20200351873 Brown et al. Nov 2020 A1
20210219869 Ryu et al. Jul 2021 A1
20220210643 Hynds et al. Jun 2022 A1
Foreign Referenced Citations (16)
Number Date Country
1536306 Jun 2005 EP
2937805 Oct 2015 EP
10-049604 Feb 1998 JP
9956429 Nov 1999 WO
0062505 Oct 2000 WO
0122724 Mar 2001 WO
0135334 May 2001 WO
0148714 Jul 2001 WO
0175876 Oct 2001 WO
0177790 Oct 2001 WO
2004010774 Feb 2004 WO
2004038563 May 2004 WO
2005031663 Apr 2005 WO
2005050450 Jun 2005 WO
2005086802 Sep 2005 WO
2007087558 Aug 2007 WO
Non-Patent Literature Citations (164)
Entry
Petition for Inter Partes Review of U.S. Pat. No. 10,698,989, Aug. 26, 2021, 3356 pgs.
Petition for Inter Partes Review of U.S. Pat. No. 8,352,730, Aug. 26, 2021, 2450 pgs.
Petition for Inter Partes Review of U.S. Pat. No. 9,298,905, Aug. 26, 2021, 1941 pgs.
Adams, “Designing with 802.15.4 and Zigbee,” presented at Industrial Wireless Applications Summit, San Diego, California, Mar. 9, 2004, 22 pgs.
Adams, “Meet the ZigBee Standard,” Sensors Online, Jun. 2003, 7 pgs., archived at https://web.archive.org/web/20031008191032/http:/sensorsmag.com/articles/0603/14/pf_main.shtml.
Adams, “Zigbee vital in industrial applications,” EE Times, Jul. 29, 2003, 3 pgs., archived at https://web.archive.org/web/20031013062940/http:/www.eetimes.com/story/OEG20030727S0002.
Anonymous, “Applying Biometrics to Door Access,” Security Magazine, Sep. 26, 2002, retrieved from http://www.securitymagazine.com/CDA/Articles/Technologies/3ae610eaa34d8010VgnVCM100000f932a8cO on Jan. 7, 2007, 5 pgs.
Anonymous, “Firecrest Shows How Truly Commercially-Minded Companies Will Exploit the Internet,” Computergram International, Jan. 18, 1996, 2 pgs.
Anonymous, “IEEE 802.15.4-2006—Wikipedia, the free encyclopedia,” Wikipedia, last modified Mar. 21, 2009, retrieved from http://en.wikipedia.org/wiki/IEEE_802.15.4-2006 on Apr. 30, 2009, 5 pgs.
Antonoff, “Visiting Video Valley,” Sound & Vision, Nov. 2001, pp. 116, 118-119.
Apple et al., “Smart Card Setup Guide,” 2006, downloaded from http://manuals.info.apple.com/en_US/Smart_Card_Setup_Guide.pdf on or before May 3, 2012, 16 pgs.
Balanis, “Antenna Theory: A Review,” Jan. 1992, Proceedings of the IEEE, vol. 80, No. 1, p. 13.
Beaufour, “Personal Servers as Digital Keys,” Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications (PERCOM'04), Mar. 14-17, 2004, pp. 319-328.
Biopay, LLC, “Frequently Asked Questions (FAQs) About BioPay,” retrieved from http://www.biopay.com/faqs-lowes.asp on Jan. 7, 2007, 5 pgs.
Blip Systems, “Mar. 8, 2004—Bluetooth at the office?” at least as early as Oct. 11, 2004, archived at https://web.archive.org/web/20041011094320/http:/www.blipsystems.com/Default.asp?ID=16&M=News&PID=25&NewsID=9.
Blip Systems, “BlipManager,” at least as early as May 17, 2004, 1 pg., archived at https://web.archive.org/web/20040517050728/http:/www.blipsystems.com/Default.asp?ID=11.
Blip Systems, “BlipMobility,” at least as early as Apr. 7, 2004, archived at https://web.archive.org/web/20040407212934/http:/www.blipsystems.com/Default.asp?ID=118.
Blip Systems, “BlipNet API,” at least as early as May 18, 2004, 1 pg., archived at https://web.archive.org/web/20040518060132/http:/www.blipsystems.com/Default.asp?ID=92.
Blip Systems, “BlipNet Explore a wireless world . . . of great opportunities,” brochure available Sep. 2002, 6 pgs., availabe online at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “BlipNet Technical Overview,” Mar. 2003, 30 pgs., archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “BlipNode,” at least as early as May 16, 2004, 1 pg., archived at https://web.archive.org/web/20040516001554/http:/www.blipsystems.com/Default.asp?ID=10.
Blip Systems, “BlipServer,” at least as early as May 17, 2004, 1 pg., archived at https://web.archive.org/web/20040517044955/http:/www.blipsystems.com/Default.asp?ID=9.
Blip Systems, “Bluetooth Networks: Products: Bluetooth infracture,” product description, at least as early as Oct. 2003, archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “Product Information—BlipNet—Presentation of BlipNet 1.0—A Bluetooth Access System,” Aug. 2002, 2 pgs., archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
BlueProximity, “BlueProximity—Leave it—it's locked, come back, it's back too . . . ” Aug. 26, 2007, retrieved from http://blueproximity.sourceforge.net/viahttp://www.archive.org/ on or before Oct. 11, 2011, 1 pg.
Bluetooth SIG, Inc. “Specification of the Bluetooth System,” Version 1.2, Nov. 5, 2003, 82 pgs., archived at https://web.archive.org/web/20031119092849/http:/www.bluetooth.com/dev/spec.v12.asp.
Bluetooth SIG, Inc., “Bluetooth,” www.bluetooth.com, Jun. 1, 2000, 8 pgs.
Bluetooth SIG, Inc., “Say Hello to Bluetooth,” retrieved from www.bluetooth.com, at least as early as Jan. 14, 2005, 4 pgs.
Blum, “Digital Rights Management May Solve the Napster ‘Problem,’” Technology Investor, Oct. 2000, pp. 24-27.
Bohrsatom et al., “Automatically unlock PC when entering proximity,” Dec. 7, 2005, retrieved from http://salling.com/forums/viewtopic.php?t=3190 on or before Oct. 11, 2011, 3 pgs.
Brown, “Techniques for Privacy and Authentication in Personal Communication Systems,” Personal Communications, IEEE, Aug. 1995, vol. 2, No. 4, pp. 6-10.
Callaway, “Wireless Sensor Networks: Architectures and Protocols,” book description, Motorola Labs, Auerbach Publications, Aug. 26, 2003, 3 pgs., archived at https://web.archive.org/web/20031023101953/http:/www.crcpress.com/shopping_cart/products/product_detail.asp?sku=AU1823.
Callaway, Wireless Sensor Networks: Architectures and Protocols, Jan. 1, 2004, Auerbach Publications, 366 pgs.
Chen et al.“On Enhancing Biometric Authentication with Data Protection.” KES2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No. 00TH8516), vol. 1, Aug. 1, 2000, pp. 249-252.
Chi et al., “Industrial Wireless Sensor Networking: A Market Dynamics Study,” ON World, Jun. 28, 2004, 5 pgs., archived at https://web.archive.org/web/20040710182216/http:/onworld.com:80/html/industrialwirelesssensor.htm.
Cisco Systems, Inc., “Antenna Patterns and Their Meaning,” 1992-2007, p. 10.
Costa, “Imation USB 2.0 Micro Hard Drive,” Nov. 22, 2005, retrieved from http://www.pcmag.com/article2/0,2817,1892209,00.asp on or before Oct. 11, 2011, 2 pgs.
Dagan, “Power over Ethernet (PoE) Midspan—The Smart Path to Providign Power for IP Telephony,” Product Manager, Systems, Aug. 2005, Power Dsine Inc., 28 pgs.
Dai et al., “Toward Blockchain-Based Accounting and Assurance,” Journal of Information Systems, vol. 31, No. 3, Fall 2017, pp. 5-21.
David et al., Security Issues for Contactless Smart Cards, Sep. 1, 1997, conference paper, available online at https://link.springer.com/chapter/10.1007/BFb0054029, 6 pgs.
Debow, “Credit/Debit Debuts in Midwest Smart Card Test,” Computers in Banking, vol. 6, No. 11, Nov. 1989, pp. 10-13.
Dennis, “Digital Passports Need Not Infringe Civil Liberties,” Newsbytes, NA, Dec. 2, 1999, 2 pgs.
Derfler, “How Networks Work,” Bestseller Edition, 1996, Ziff-Davis Press, Emeryville, CA, all pages.
Disclosed Anonymously (Method and Apparatus for Mobile Identity Authentication)., An IP.com Prior Art Database Technical IP.com No. IPCOM000194545D., IP.com Electronic Publication Date: Mar. 29, 2010 (Year: 2010).
Duflot et al., “A Formal Analysis of Bluetooth Device Discovery,” presented at the 1st International Symposium on Leveraging Applications of Formal Methods (ISOLA'04), Oct. 30-Nov. 2, 2004, Paphos, Cyprus, and published in the International Journal on Software Tools for Technology Transfer 8, pp. 621-632, 16 pgs., https://doi.org/10.1007/s10009-006-0014-x.
Dvorak, IEEE 802.15.4 and Zigbee Overview, Sep. 27, 2005, Motorola, 26 pgs.
Eshed, “Bluetooth Wireless Technology Application for the Retail Market,” published at www.tadlys.com on May 2001, 8 pgs.
Farouk et al., “Authentication Mechanisms in Grid Computing Environment: Comparative Study,” IEEE, Oct. 2012, p. 1-6.
Fasca, “S3, Via Formalize Agreement,” Electronic News, The Circuit, 45(45, Nov. 8, 1999), p. 20.
Freescale Semicondcutor, Inc., “Freescale Events,” see ZigBee Open House Event, Aug. 18, 2004, 6 pgs., archived at https://web.archive.org/web/20040909082726/https://www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQ7JgbBqJQ#zigbee_openhouse_04.
Freescale Semiconductor, Inc., “Overview,” ZigBee General Information, at least as early as Aug. 17, 2004, 1 pg., archived at https://web.archive.org/web/20040817210006/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB37087725.
Freescale Semiconductor, Inc., “ZigBeeTM,” Freescale Semiconductor Wireless Standards, at least as early as Aug. 18, 2004, 2 pgs., archived at https://web.archive.org/web/20040818075046/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB.
Freescale Semiconductor, Inc., “ZigBeeTM,” Freescale Semiconductor Wireless Standards, at least as early as Jun. 11, 2004, 2 pgs., archived at https://web.archive.org/web/20040611051834/http:/e-www.motorola.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB.
Yoshida, “Content Protection Plan Targets Wireless Home Networks,” EE Times, Jan. 11, 2002, retrieved from www.eetimes.com/story/OEG20020111S0060 on Mar. 4, 2002, 2 pgs.
Zhang et al., “A User-Centric M-Payment Solution,” The ISG-Smart Card Centre and the Information Security Group, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, UK, 2005, 8 pgs.
ZigBee Alliance, “Welcome to the ZigBeeTM Alliance,” exemplary web page, at least as early as Sep. 24, 2004, 2 pgs., archived at https://web.archive.org/web/20040924045517/http://zigbee.org/.
ZigBee Alliance, “ZigBee Specification,” ZigBee Document 053474r06, Version 1.0, Dec. 14, 2004, 378 pgs.
ZigBee Alliance, “The ZigBeeTM Buzz Is Growing: New Low-Power Wireless Standard Opens Powerful Possibilities,” Electronic Design, Jan. 12, 2004, 12 pgs., archived at https://web.archive.org/web/20040411172015/http:/www.elecdesign.com/Files/29/7186/7186_01.pdf.
ZigBee Alliance, “ZigBeeTM Positioned to Drive Wireless Networking in Building Automation, Industrial and Residential Control and Sensors Markets in 2004,” press release, Feb. 17, 2004, 3 pgs., archived at https://web.archive.org/web/20040423220244/http/www.zigbee.org/documents/04036r5ZB_MWG-Momentum-Release_FINAL.pdf.
Freescale Semiconductor, Inc., “Freescale's ZigBeeTM-ready Platform Wins Sensors Magazine Best of Sensors Expo Award,” Freescale Semiconductor Wireless, at least as early as Aug. 17, 2004, 1 pg., archived at https://web.archive.org/web/20040817203409mp_/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQ6988.
Freescale Semiconductor, Inc., “ZigBee Alliance Successfully Concludes First Multi-node Network Test,” press release, Jul. 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040717113733/http:/www.zigbee.org/documents/First-Multi-Node_Testing_FINAL_000.pdf.
Freescale Semiconductor, Inc., “ZigBeeTM Technology from Freescale,” Freescale Semiconductor, Inc. white paper, 2004, 4 pgs., archived at https://web.archive.org/web/20050513024652/http:/www.freescale.com/files/wireless_comm/doc/brochure/BRZIGBEETECH.pdf.
Freescale Semiconductor, Inc., “ZRP-1 : ZigBee-ready Platform,” at least as early as Oct. 19, 2005, 6 pgs., archived at https://web.archive.org/web/20051019122919/http://www.freescale.com/webapp/sps/site/prod_summary.jsp?code=ZRP-1&nodeId=02XPgQhCQ6m6cy7103.
Freescale Semiconductor, Inc., M68HC08 microcontroller ordering web page, at least as early as Aug. 17, 2004, 5 pgs., archived at https://web.archive.org/web/20040817014804/http:/www.freescale.com/webapp/sps/site/taxonomy.jsp?nodeId=01624684498634.
Giobbi, Specification of U.S. Appl. No. 60/824,758, filed Sep. 6, 2006, all pages.
Govindan et al. “Real Time Security Management Using RFID, Biometric and Smart Messages.” 2009 3rd International Conference on Anti-Counterfeiting, Security, and Identification in Communication, Aug. 20, 2009, pp. 282-285.
Gralla, “How the Internet works,” Millennium Edition, 1999, Que Corporation, Indianapolis, IN, all pages.
Hendron, “File Security, Keychains, Encryptioin, and More with Mac OS X (10.3+)” Apr. 4, 2005, downloaded from http://www.johnhendron.net/documents/OSX_Security.pdf on or before May 3, 2012, 30 pgs.
Hendron, “File Security, Keychains, Encryption, and More with Mac OS X (10.3+)” Apr. 4, 2005, downloaded from http://www.johnhendron.net/documents/OSX_Security.pdf on or before May 3, 2012, 30 pgs.
Hester et al., “neuRFon(TM) Netform: A Self-Organizing Wireless Sensor Network”, Oct. 14, 2002, Proceedings of the Eleventh International Conference on Computer Communications and Networks, pp. 364-369.
Honkanen et al., “Low End Extension for Bluetooth”, Sep. 19, 2004, Proceedings of the 2004 IEEE Radio and Wireless Conference, Atlanta, GA, pp. 199-202.
IBM Corporation, “Tadlys' Bluetooth Wireless Local Network for Corporate,” Wireless e-business, at least as early as May 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040621130525/http://www.tadlys.com/media/downloads/Corporate%20PVDEE01005-3.pdf.
IBM Corporation, “Tadlys' Bluetooth Wireless Local Network for Hotspots,” Wireless e-business, at least as early as May 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040508123915/http://www.tadlys.com/media/downloads/Hotspots%20PVDEE01006-3.pdf.
IEEE Computer Society, “IEEE Std 802.15.4 (Trade Mark)—Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs),” The Institute of electrical and Electronics Engineers, Inc., New York, NY, Oct. 1, 2003, 679 pgs.
IEEE, “IEEE 802.15 WPANTM Task Group 4 (TG4)” exemplary web page, Aug. 24, 2004, 2 pgs., archived at https://web.archive.org/web/20040824085452/http:/www.ieee802.org/15/pub/TG4.html.
International Search Report and Written Opinion for International Application No. PCT/US04/38124, dated Apr. 7, 2005, 10 pgs.
International Search Report and Written Opinion for International Application No. PCT/US05/00349, dated Mar. 19, 2008, 10 pgs.
International Search Report and Written Opinion for International Application No. PCT/US05/07535, dated Dec. 6, 2005, 6 pgs.
International Search Report and Written Opinion for International Application No. PCT/US05/43447, dated Feb. 22, 2007, 7 pgs.
International Search Report and Written Opinion for International Application No. PCT/US05/46843, dated Mar. 1, 2007, 10 pgs.
International Search Report and Written Opinion for International Application No. PCT/US07/11102, dated Oct. 3, 2008, 11 pgs.
International Search Report and Written Opinion for International Application No. PCT/US07/11103, dated Apr. 23, 2008, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US07/11104, dated Jun. 26, 2008, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US07/11105, dated Oct. 20, 2008, 10 pgs.
International Search Report and Written Opinion for International Application No. PCT/US08/83060, dated Dec. 29, 2008, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US08/87835, dated Feb. 11, 2009, 8 pgs.
International Search Report and Written Opinion for International Application No. PCT/US09/34095, dated Mar. 25, 2009, 11 pgs.
International Search Report and Written Opinion for International Application No. PCT/US2009/039943, dated Jun. 1, 2009, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US2014/037609, dated Dec. 9, 2014, 13 pgs.
International Search Report for International Application No. PCT/US2001/049916, dated Apr. 25, 2002, 1 pg.
International Search Report received for PCT Patent Application No. PCT/US2001/049916, dated Apr. 25, 2002, 1 page.
Jeyaprakash et al., “Secured Smart Card Using Palm Vein Biometric On-Card-Process,” 2008 International Conference on Convergence and Hybrid Information Technology, 2008, pp. 548-551.
Jonker et al., “Digital rights management in consumer electronics products,” IEEE Signal Processing Magazine, vol. 21, No. 2, pp. 82-91, Mar. 2004, doi: 10.1109/MSP.2004.1276116.
Katz et al., “Smart Cards and Biometrics in Privacy-Sensitive Secure Personal Identification System,” May 2002, Smart Card Alliance, p. 1-29.
Kontzer, “Thomson Bets On Smart Cards For Video Encryption,” www.informationweek.com, Jun. 7, 2001, 1 pg.
Korzeniowski, “First Intelligent, Wireless Consumer Devices About To Hit Market,” TechNewsWorld, Jul. 28, 2004, 3 pgs., archived at https://web.archive.org/web/20040821061130/http:/www.technewsworld.com/story/35376.html%20com/.
Kuhn et al., Introduction to Public Key Technology and the Federal PKI Infrastructure, Feb. 26, 2001, National Institute of Standards and Technology, 54 pgs.
Lake, “Downloading for Dollars: Who said buying music off the Net would be easy?” Sound & Vision, Nov. 2000, pp. 137-138.
Lee et al., “Effects of dielectric superstrates on a two-layer electromagnetically coupled patch antenna,” Digest on Antennas and Propagation Society International Symposium, 1989, pp. 620-623 vol. 2, doi: 10.1109/APS.1989.134763.
Lewis, “Sony and Visa in On-Line Entertainment Venture,” New York Times, vol. 145, Thurs. Ed., Nov. 16, 1995, 1 pg.
Liu et al., “A Practical Guide to Biometric Security Technology,” IT Pro, vol. 3, No. 1, Jan./Feb. 2001, pp. 27-32.
Malan, “Here come Wireless Sensors,” Machine Design, Jun. 10, 2004, 3 pgs., archived at https://web.archive.org/web/20040610131354/http:/www.machinedesign.com/ASP/viewSelectedArticle.asp?strArticleId=56796&strSite=MDSite&Screen=CURRENTISSUE.
Mciver et al., “Identification and Verification Working Together,” Bioscrypt, White Paper: Identification and Verification Working Together, Aug. 27, 2004, retrieved from www.ibia.org/membersadmin/whitepapers/pdf/15/Identification%20and%20Verification%20Working%20Together.pdf on Jan. 7, 2007, 5 pgs.
Micronas, “Micronas and Thomson Multimedia Showcase a New Copy Protection System that Will Drive the Future of Digital Television,” www.micronas.com: Jan. 8, 2002, 3 pgs.
MIT Computer Science and Artificial Intelligence Laboratory, “Cricket v2 User Manual,” Cricket Project, MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, Jan. 2005, 57 pgs., available online at https://web.archive.org/web/20041206144922/http:/cricket.csail.mit.edu/v2man.html.
MIT Computer Science and Artificial Intelligence Laboratory, “The Cricket Indoor Location System,” at least as early as Nov. 19, 2004, 6 pgs., archived at https://web.archive.org/web/20041119183049/http://cricket.csail.mit.edu/.
Motorola, Inc., “Motorola First to Demonstrate ZigBee 2.4 GHz Wireless Networking Technology,” press release, Mar. 27, 2003, 2 pgs., archived at https://web.archive.org/web/20050205053308/http:/www.motorola.com/mediacenter/news/detail/0,1958,2743_2228_23,00.html.
Muller, “Desktop Encyclopedia of the Internet,” 1999, Artech House Inc., Norwood, MA, all pages.
National Criminal Justice Reference Service, “Antenna Types,” Dec. 11, 2006, online at http://ncjrs.gov/pdrffiles1/nij/185030b.pdf, retrieved from http://web.archive.erg/web/*/http://www.ncjrs.gov/pdffiles1/nij/185030b.pdf on Jan. 12, 2011, 1 pg.
Nel et al., “Generation of Keys for use with the Digital Signature Standard (DSS),” Communications and Signal Processing, Proceedings of the 1993 IEEE South African Symposium, Aug. 6, 1993, pp. 6-11.
Nerd Vitiles, “magicJack: Could It Be the Asterisk Killer?” Aug. 1, 2007, retrieved from http://nerdvittles.com/index.php?p=187 on or before Oct. 11, 2011, 2 pgs.
Nilsson et al., “Match-on-Card for Java Cards,” Precise Biometrics, white paper, Apr. 2004, retrieved from www.ibia.org/membersadmin/whitepapers/pdf/17/Precise%20Match-on-Card%20for%20Java%20Cards.pdf on Jan. 7, 2007, 5 pgs.
Noore, “Highly Robust Biometric Smart Card Design.” IEEE Transactions on Consumer Electronics, vol. 46, No. 4, Nov. 2000, pp. 1059-1063.
Nordin, “Match-on-Card Technology,” Precise Biometrics, white paper, Apr. 2004, retrieved from www.ibia.org/membersadmin/whitepapers/pdf/17/Precise%20Match-on-Card%20technology.pdf on Jan. 7, 2007, 7 pgs.
Paget, “The Security Behind Secure Extranets,” Enterprise Systems Journal, vol. 14, No. 12, Dec. 1999, 4 pgs.
Pash, “Automate proximity and location-based computer actions,” Jun. 5, 2007, retrieved from http://lifehacker.com/265822/automate-proximity-and-location+based-computer-actionson or before Oct. 11, 2011, 3 pgs.
Petition for Inter Partes Review of U.S. Pat. No. 9,049,188, Aug. 26, 2021, 800 pgs.
Petition for Inter Partes Review of U.S. Pat. No. 9,235,700, Aug. 26, 2021, 466 pgs.
Pope et al., “Oasis Digital Signature Services: Digital Signing without the Headaches,” IEEE Internet Computing, vol. 10, Sep./Oct. 2006, pp. 81-84.
Priyantha, “The Cricket Indoor Location System,” Ph.D. thesis submitted to Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Jun. 2005, 199 pgs.
Request for Ex Parte Reexamination of U.S. Pat. No. 10,698,989, Jun. 8, 2022, 1505 pgs.
Request for Ex Parte Reexamination of U.S. Pat. No. 8,352,730, Jun. 8, 2022, 1401 pgs.
Request for Ex Parte Reexamination of U.S. Pat. No. 9,298,905, Jun. 8, 2022, 1123 pgs.
Rodriguez et al., “In-building location using Bluetooth,” Proceedings of the International Workshop on Wireless Ad-Hoc Networks (IWWAN 2005), May 23-26, 2005, London, England, 7 pgs.
Saflink Corporation, “SAFModule (Trademark): A Look Into Strong Authentication,” white paper, retrieved from www.ibia.org/membersadmin/whilepapers/pdf/6/SAFmod_WP.pdf on Jan. 7, 2007, 8 pgs.
Sapsford, “E-Business: Sound Waves Could Help Ease Web-Fraud Woes,” Wall Street Journal, Aug. 14, 2000, p. B1.
Schneier, Applied Cryptography, Second Edition: Protocols, Algorithms, and Source Doe in C, Jan. 1, 1996, John Wiley & Sons, Inc., 1027 pgs.
Singh et al. “A Constraint-Based Biometric Scheme on ATM and Swiping Machine.” 2016 International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT), Mar. 11, 2016, pp. 74-79.
Smart Card Alliance, “Alliance Activities: Publications: Identity: Identity Management Systems, Smart Cards and Privacy,” 1997-2007, retrieved from www.smartcardalliance.org/pages/publications-identity on Jan. 7, 2007, 3 pgs.
Smart Card Alliance, “Contactless Technology for Secure Physical Access: Technology and Standards Choices,” Smart Card Alliance, Oct. 2002, pp. 1-48.
Smart Card Alliance, “Smart Cards and Biometrics White Paper: Smart Card Alliance,” May 2002, retrieved from http://www.securitymanagement.com/library/smartcard faqtech0802.pdf on Jan. 7, 2007, 7 pgs.
Smart Card Alliance, Contactless Payment and the Retail Point of Sale: Applications, Technologies and Transaction Models, Mar. 1, 2003, a Smart Card Alliance Report, 50 pgs.
Smart Card Alliance, Smart Card Alliance—The Alliance, Jan. 22, 2001, http://www.smartcardalliance.org, 1 pg.
SplashID, “SplashID—Secure Password Manager for PDA's and Smartphones,” Mar. 8, 2007, retrieved from http://www.splashdata/com/splashid/ via http://www.archive.org/ on or before Oct. 11, 2011, 2 pgs.
Srivastava, “Is internet security a major issue with respect to the slow acceptance rate of digital signatures,” Jan. 2, 2005, Computer Law & Security Report, pp. 392-404.
Tadlys Ltd., “‘Hotspot’ Gaming Arcade,” at least as early as Dec. 9, 2004, 2 pgs., archived at https://web.archive.org/web/20041209234518/http://www.tadlys.com/media/downloads/Tadlys_gaming_arcade.pdf.
Tadlys Ltd., “About Tadlys,” at least as early as Apr. 5, 2001, 1 pg., archived at https://web.archive.org/web/20010405044249/http:/www.tadlys.com/about.html.
Tadlys Ltd., “An Advertisers' Dream—From direct marketing to sales,” Nov. 2004, 2 pgs., archived at https://web.archive.org/web/20041101092944/http://www.tadlys.com/media/downloads/m-commerce_app.pdf.
Tadlys Ltd., “Bluetooth Glossary,” at least as early as Jun. 2004, 12 pgs., archived at https://web.archive.org/web/20040531082349/http://www.tadlys.com/pages/Downloads_content.asp?intGlobalId=1.
Tadlys Ltd., “First Demo of Distribution and Redemption of e-Coupons over Bluetooth,” Tadlys Company News and Events, Jun. 5, 2001, 1 pg., archived at https://web.archive.org/web/20040601051516/http://tadlys.com/Pages/news_content.asp?iGlobalID=17.
Tadlys Ltd., “Indoor Location Networks,” at least as early as Apr. 3, 2004, 1 pg., archived at https://web.archive.org/web/20040403200221/http:/www.tadlys.com/Pages/Product_content.asp?iGlobalId=2.
Tadlys Ltd., “Operator Systems,” at least as early as Nov. 1, 2004, 2 pgs., archived at https://web.archive.org/web/20041101101402/http://www.tadlys.com/media/downloads/operator_network.pdf.
Tadlys Ltd., “Tadlys Announces Range of Bluetooth Access Network Solutions,” Tadlys Company News and Events, Jan. 22, 2001, 1 pg., archived at https://web.archive.org/web/20040624122319/http://www.tadlys.com/Pages/news_content.asp?iGlobalID=16.
Tadlys Ltd., “Tadlys' Wire free networking solutions,” Feb. 2001, 2 pgs., archived at https://web.archive.org/web/20010204012700/http:/www.tadlys.com/solutions.html.
Tadlys Ltd., “Wireless hospital network,” at least as early as Jul. 1, 2004, 2 pgs., archived at https://web.archive.org/web/20040701105046/http://www.tadlys.com/media/downloads/tadlys_hospital_wireless_network.pdf.
Tadlys Ltd., “Wireless Museum Information,” at least as early as Dec. 12, 2005, 2 pgs., archived at https://web.archive.org/web/20051212162456/http://www.tadlys.com/media/downloads/Tadlys_wireless_museum_network.pdf.
Tadlys Ltd., “Corporate Systems,” at least as early as Nov. 1, 2004, 2 pgs., archived at https://web.archive.org/web/20041101095441/http://www.tadlys.com/media/downloads/Corporate_network.pdf.
Thomson Multimedia, “Thomson multimedia unveils copy protection proposal designed to provide additional layer of digital content security,” retrieved from www.thompson-multimedia.com/gb/06/c01/010530.htm on Mar. 4, 2002, May 30, 2001, 2 pgs.
Thongthammachart et al., “Bluetooth Enables In-door Mobile Location Services,” Proceedings of the 57th IEEE Semiannual Vehicular Technology Conference, Apr. 22-25, 2003, 5 pgs.
University of Birmingham, “PRISM: Probabilistic Symbolic Model Checker,” at least as early as Aug. 3, 2004, 3 pgs., archived at https://web.archive.org/web/20040803193058/http://www.cs.bham.ac.uk/˜dxp/prism/casestudies/index.html.
Unixhelp, “What is a file?” Apr. 30, 1998, retrieved from unixhelp.ed.ac.uk/editors/whatisafile.html accessed Mar. 11, 2010 via http://waybackmachine.org/19980615000000*/http://unixhelp.ed.ac.uk/editors/whatisafile.html on Mar. 11, 2011, 1 pg.
Vainio, “Bluetooth Security,” Helsinki University of Technology, May 25, 2000, 17 pgs.
Van Winkle, “Bluetooth: The King of Connectivity,” Laptop Buyer's Guide and Handbook, Jan. 2000, pp. 148-153.
Wade, “Using Fingerprints to Make Payments at POS Slowly Gaining Popularity,” Credit Union Journal, International Biometric Group, Apr. 21, 2003, retrieved from http://www.biometricgroup.com/in_the_news/04.21.03.html on Jan. 7, 2007, 3 pgs.
Wallace, “The Internet Unplugged,” InformationWeek, vol. 765, No. 22, Dec. 13, 1999, pp. 22-24.
Weber, “In the Age of Napster, Protecting Copyright is a Digital Arms Race,” Wall Street Journal, Eastern ed., Jul. 24, 2000, p. B1.
Weissman, “Indoor Location,” Tadlys Ltd. white paper, at least as early as Oct. 31, 2004, 15 pgs., archived at https://web.archive.org/web/20041031125859/http:/www.tadlys.com/media/downloads/Indoors_Location_Systems.pdf.
White, “How computers Work,” Millennium Edition, 1999, Que Corporation, Indianapolis, IN, all pages.
Agourare et al., “Authentication and location control via RFID analysis,”2009 IEEE Conference on Emerging Technologies & Factory Automation, Sep. 1, 2009, 8 pgs.
Labrou et al., “Wireless Wallet,” Proceedings of the First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services (MobiQuitos '04), IEEE, Aug. 22-26, 2004, 10 pgs.
Serrao et al., “Protecting Digital Music Delivery and Consumption using the OCCAMM Project Framework,” Proceedings of the Second International Conference on Web Delivering of Music, 2002, pp. 38-45, doi: 10.1109/WDM.2002.1176192.
Anonymous, “BluePayz: A Seamless Payment Method Using Bluetooth-Enabled Mobile Phones,” IP.com Publication Date 2003—Jun. 20, 2003, https://priorart.ip.com/1 PCOM/000015495 (Year: 2003).
Feng Bao, et al., “Design of portable mobile devices based e-payment system and e-ticketing system with digital signature,” 2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01 EX479), Beijing, China, 2001, pp. 7-12 vol.6, doi:10.1109/ICII.2001.982996. (Year: 2001).
Y. Labrou, J. Agre, L. Ji, J. Molina and W . . —1. Chen, “Wireless wallet,” The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004., Boston, MA, USA, 2004, pp. 32-41, doi: 10.1109/MOBIQ.2004.1331708. (Year: 2004).
Related Publications (1)
Number Date Country
20220338194 A1 Oct 2022 US
Provisional Applications (1)
Number Date Country
60760362 Jan 2006 US
Continuations (9)
Number Date Country
Parent 16657879 Oct 2019 US
Child 17854838 US
Parent 16366010 Mar 2019 US
Child 16657879 US
Parent 14675433 Mar 2015 US
Child 16366010 US
Parent 13875895 May 2013 US
Child 14675433 US
Parent 13686673 Nov 2012 US
Child 13875895 US
Parent 13491417 Jun 2012 US
Child 13875895 US
Parent 11620600 Jan 2007 US
Child 14675433 US
Parent 11620577 Jan 2007 US
Child 13491417 US
Parent 11620581 Jan 2007 US
Child 13686673 US