Patent Application
20150055686
1. Field
This disclosure relates generally to geographic location tracking, and more particularly to wireless geographic location tracking of mobile devices.
2. Description of Related Art
The Naystar Global Positioning System (GPS) or other satellite-based navigation systems (e.g. GLONASS, Galileo, Compass) are referred to in aggregate as Global Navigation Satellite System (GNSS).
In addition, other devices provide geographic location data of a device.
The subject matter of this disclosure reduces the quantity of equipment, the deployment cost of the equipment, and the operating cost of the equipment required to support a large number of beacons used for the transfer of data from the beacon to the network, transfer of data from the network to the beacon and transfer of data comprising of the geographic location of the beacon to the network, allows the use of the network to capture market needs that are currently not being serviced due to the cost of competing services that exceeds the value of the service to the customer and allows the use of the network to capture market needs that are currently being serviced by more costly services.
In one aspect, a computer-accessible medium has processor-executable instructions for wireless communication at a network base station receiver between the network base station receiver and a beacon, the processor-executable instructions capable of directing a processor to perform receiving a here-i-am (HIA) transmission on a first radio frequency channel of 12 radio frequency channels in accordance with a first pseudo-random frequency hopping pattern and a timing of the first pseudo-random frequency hopping pattern, the HIA transmission including information representative of a second radio frequency channel of 42 radio frequency channels in a second pseudo-random frequency hopping pattern and with timing of the second pseudo-random frequency hopping pattern, wherein the HIA transmission is a short transmission that does not include a serial number of the beacon, and receiving a beacon transmission that includes a geographic location, wherein the 12 radio frequency channels and the 42 radio frequency channels are mutually exclusive and have no radio frequency channels in common between the 12 radio frequency channels and the 42 radio frequency channels.
In another aspect, a method of a network base station receiver includes receiving a here-i-am (HIA) transmission in accordance with a first pseudo-random frequency hopping pattern and a timing of the first pseudo-random frequency hopping pattern, as notice that a beacon is in range of the network base station receiver to access the network base station receiver, as an alert to the network base station receiver as to a presence of the beacon and as notice of a second pseudo-random frequency hopping pattern and a timing of the second pseudo-random frequency hopping pattern to receive a registration (REG) transmission that is synchronized to the HIA transmission, receiving the REG transmission on the second pseudo-random frequency hopping pattern and the timing of the second pseudo-random frequency hopping pattern, the REG transmission including a serial number of the beacon and including information representative of a third pseudo-random frequency hopping pattern and a timing of the third pseudo-random frequency hopping pattern, and receiving a short-and-instant telemetry messaging (SIM) transmission on radio frequencies in the plurality of the pseudo-random frequency hopping patterns and in accordance with the timing, the SIM transmission including data, the data including a geographic location of the beacon.
In yet a further aspect, a computer-accessible medium includes a first component of processor-executable instructions to receive a first transmission from a beacon on a first radio frequency channel, the first transmission providing detection by a network base station receiver of the beacon, a second component of processor-executable instructions to receive a second transmission from the beacon on a second radio frequency channel, the second transmission identifying the beacon and including information that is necessary to grant network access by the network base station receiver to the beacon, and a third component of processor-executable instructions to receive a third transmission from the beacon based on the information that is necessary to grant network access, the third transmission including data, the data including a geographic location of the beacon.
Systems, clients, servers, methods, and computer-readable media of varying scope are described herein. In addition to the aspects and advantages described in this summary, further aspects and advantages will become apparent by reference to the drawings and by reading the detailed description that follows.
In the following detailed description, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific implementations which may be practiced. These implementations are described in sufficient detail to enable those skilled in the art to practice the implementations, and it is to be understood that other implementations may be utilized and that logical, mechanical, electrical and other changes may be made without departing from the scope of the implementations. The following detailed description is, therefore, not to be taken in a limiting sense.
The detailed description is divided into six sections. In the first section, a system level overview is described. In the second section, implementations of apparatus are described. In the third section, implementations of methods are described. In the fourth section, hardware and the operating environments in conjunction with which implementations may be practiced are described. In the fifth section, implementations of the protocols are described. In the sixth section, a conclusion of the detailed description is provided.
The beacon 102 calculates a geographic location 116, such as a latitude and longitude, from the GNSS geographic location signals and transmits the geographic location 116 to one or more network base station receivers 118 and 120 that are operable to receive communication via radio frequency channels from the beacon 102. The network base station receivers 118 and 120 send the geographic location 116 through a communications network 122 to a network manager operations center 124. The network manager operations center 124 sends the geographic location 116 to a beacon tracker 126 through the Internet 128. In other implementations not shown, the beacon tracker 126 is a component in the network manager operations center 124. The beacon tracker 126 uses the geographic location 116 to track the beacon. The geographic location 116 being calculated or determined by the beacon 102 and then transmitted to network base station(s) 118 and/or 120 eliminates location-based processing on the network manager operations center 124 and the beacon tracker 126. The geographic location 116 that is estimated, calculated or determined by the beacon 102 is not detrimental to the timeliness of calculating or determining the geographic location 116 because the beacon 102 typically has sufficient processing capability to calculate or determine the geographic location 116 in a timely manner. Therefore, estimating, calculating or determining the geographic location 116 by the beacon 102 is helpful by eliminating the processing burden of estimating, calculating or determining the geographic location 116 on uplink components such as the base station 118, the network manager operations center 124 or the beacon tracker 124. In addition, the bandwidth requirements of sending GNSS information from the beacon 102 to the network manager operations center 124 in order to calculate or determine the geographic location 116 of the beacon 102 is significantly larger than that of the beacon 102 sending the geographic location 116 to the network manager operations center 124. The lower bandwidth requirement results in lower network equipment costs and lower network operating costs to support the number of deployed beacons and also reduce network resource contention of numerous beacons accessing the network. Calculating or determining the geographic location 116 at the beacon 102 eliminates the processing load of calculating or determining the geographic location 116 on the network manager operations center 124 and/or on the beacon tracker 126, furthermore it takes advantage of availability of processor resources on the beacon 102 to calculate or determine the geographic location 116. In some implementations, the beacon 102 is a hybrid beacon that includes both a GPS receiver that generates a location 116 of the GPS receiver and components that are operable to transmit the location 116 in a protocol to a base station receiver.
In other implementations, the geographic location 116 also includes altitude. The altitude is very important for urban areas in which the beacon could be on any one of a number of floors of a building and determining the exact floor of the building is necessary or helpful to either recover or provide geographic location services of the beacon and an object to which the beacon is attached.
In other implementations, the geographic location 116 also includes a velocity and a direction of travel. The velocity and the direction of travel is beneficial in predicting plausible future geographic locations for tracking the beacon and an object to which the beacon is attached, which in turn can be very important in either recovering or providing geographic location services of the object to which the beacon is attached. Furthermore, the velocity and the direction of travel information can be utilized in post-process accuracy refinement of the prior geographic locations provided by the beacon.
Referring to
Apparatus 200 includes a beacon 102 that is capable of transmitting a first message 204 on a first radio frequency channel 206. The first message 204 provides a notice to a network base station receiver 118 or 120 of the beacon 102. The beacon 102 is also capable thereafter of transmitting a second message 210 on a second radio frequency channel 212. The first message 204 provides to the network base station receiver 118 or 120 information that is necessary for the network base station receiver 118 or 120 to grant network access to the beacon 102, such as a pseudo-random frequency hopping pattern 214 and timing 216 of the pseudo-random frequency hopping pattern. The second radio frequency channel 212 is in the pseudo-random frequency hopping pattern 214. In the implementation shown in
In apparatus 200, network access is bifurcated using two different transmissions (i.e. first message 204 and the second message 210) and two different communications channels (i.e. the first radio frequency 206 and the second radio frequency channel 212). The first message 204 provides the network with a means of detection of the beacon 102 that notifies the network of the presence of a beacon 102 and the intention of the beacon 102 to access the network. The second message 210 provides the network with a means to identify the beacon 102 and provide the geographic location 218 of the beacon 102 and to receive additional information that may be necessary to grant network access to the beacon. By transmitting a beacon serial number 202 or other identification and additional network access information in the second message 210 instead of in the first message 204, the protocol permits the duration of the first message 204 to be reduced. In the case where the network is required to provide access to a large number of beacons 102, the short duration of the first message 204 allows the number of radio frequency channels that are used to initiate network access by a beacon 102 to be reduced. The reduction in the number of radio frequency channels used to initiate network access allows the number of network base station receivers 118 or 120 to be reduced resulting in a reduction in network equipment cost and network operating cost.
The first message 204 is a short transmission that does not include a serial number of the beacon 102. A large number of beacons 102 that require infrequent network access can share a small number of network resources and can gain access to the network resources when required. The use of only a small number of network resources is achieved by minimizing the duration of the transmission of the first message 204 by the beacon 102 required to notify the network of the intention of the beacon 102 to access the network. The shorter duration of the transmission of the first message 204 allows a large number of beacons 102 to be supported with a small number of radio frequency channels. With only a small number of radio frequency channels used, the cost to deploy and operate the network is reduced. A large number of beacons 102 that require infrequent access to the network, of which the network base station receiver 118 or 120 is a part, can share a small number of network resources and can gain access to the network resources when required. The use of only a small number of network resources is achieved by minimizing the duration of the transmission of the first message 204 by the beacon 102 that is required to notify the network of the intention of the beacon 102 to access the network. The shorter duration of the transmission of the first message 204 allows a large number of beacons 102 to be supported with a small number of radio frequency channels. With only a small number of radio frequency channels used, the cost to deploy and operate the network base station receiver 118 or 120 and the network to which the network base station receiver 118 or 120 is coupled is reduced.
In some implementations, the first message 204 is transmitted four times on different radio frequency channels by the beacon 102 and the second message 210 is transmitted two times by the beacon 102 in order to ensure receipt of the first message 204 and the second message 210 under circumstances where receipt of the first message 204 and the second message 210 is not known to the beacon 102 because the network base station receiver 118 or 120 does not send an acknowledgement of the first message 204 and the second message 210. The use of acknowledgments on the first message 204 and the second message 210 will limit the capacity of the network due to the synchronization, overhead, latency, and further resource contention incurred when using acknowledgements, which is employed in conventional wireless communication networks. The transmission of the first message 204 four times and the transmission of the second message 210 two times is reasonably calculated to ensure receipt of the first message 204 and the second message 210 by the network base station receiver 118 or 120 without an excessive number of unnecessary transmissions of the first message 204 and the second message 210. The transmission of the first message 204 four times and the transmission of the second message 210 two times provides the network with frequency diversity and time diversity, where frequency and time diversity increase the probability of message reception when fading wireless communication channels are utilized and where the wireless communication channels can be further impaired by RF interference.
In some implementations, the first message 204 is transmitted based on another pseudo-random frequency hopping pattern and timing of the other pseudo-random frequency hopping pattern that are stored in both the beacon 102 and the network base station receiver 118 or 120. In one example the other pseudo-random frequency hopping pattern has twelve radio frequencies.
The first message 204 is also known as a here-i-am (HIA) transmission. The beacon 102 transmits an HIA Burst in the HIA transmission. The HIA Burst includes of four, and only four, HIA mini-bursts. Each of the HIA mini-bursts notifies the network base station receiver 118 or 120 of the presence of the beacon 102 within range of the network base station receiver 118 or 120 and notifies the network base station receiver 118 or 120 that the beacon 102 will soon transmit a REG Burst. A minimum of one network base station receiver (either network base station receiver 118 or network base station receiver 120) is required to receive at least one of the HIA mini-bursts.
The second message 210 is also known as a registration (REG) transmission. The beacon 102 transmits a REG Burst in the REG transmission. The REG Burst includes two, and only two, REG mini-bursts. The REG mini-bursts identifies the beacon 102 by the serial number 202 of the beacon 102 and notifies the network base station receiver 118 or 120 of imminent transmission by the beacon 102 of a series of SIM Bursts or no additional bursts. A minimum of one network base station receiver (either network base station receiver 118 or network base station receiver 120) is required to receive at least one of the REG mini-bursts. The serial number 202 of the beacon 102 is also known as a WIN as discussed in conjunction with
While the apparatus 200 is not limited to any particular beacon 102, a first message 204, a first radio frequency channel 206, receiver 118 or 120, a second message 210, a second radio frequency channel 212 and information 214 and 216 that is necessary for the network base station receiver to grant network access to the beacon 102, for sake of clarity a simplified beacon 102, first message 204, first radio frequency channel 206, receiver 118 or 120, second message 210, second radio frequency channel 212, pseudo-random frequency hopping pattern 214 and timing 216 of the pseudo-random frequency hopping pattern are described. The network base station receiver 118 or 120 is also known as a base station.
Conventional techniques use a single transmission of a longer duration that includes both the detection and identification of the beacon 102, which requires either a larger number of communications channels to support the large number of beacons deployed in the network or restricts the number of beacons which can access the network, resulting in a higher network equipment cost and a higher network operating cost.
The apparatus level overview of the operation of implementations is described above in this section of the detailed description. Some implementations can operate in a multi-processing, multi-threaded operating environment on a computer, such as general computer environment 1200 in
In the disclosure herein, the beacon 102 to the network base station receiver 118 or 120 are asynchronous because there is no synchronization between the beacon 102 and the network base station receiver 118 or 120. However, the transmissions between the beacon 102 and the network base station receiver 118 or 120 can be synchronized. Since there is no synchronization of the beacon 102 to the network base station receiver 208, the timing and frequency synthesis requirements of the beacon 102 allow for a lower bill of materials in the manufacturing of beacons. In addition, the inefficient transmission of downlink synchronization signals is not required by the network.
The third message 302 is transmitted on a third radio frequency channel 310 of the second pseudo-random frequency hopping pattern 306 and the timing 308 of the pseudo-random frequency hopping pattern, and thus the third message 302 is synchronized to the second message 210 that are referenced by both the beacon 102 and the network base station receiver 118 or 120 in the transmission of the third message 302.
The third message 302 includes data 304. In some implementations, the data 304 includes application-specific data such as remote meter reading, smart grid, intelligent traffic signs, automotive, road condition telemetry, vending machine reporting and or/road construction equipment reporting. The third message 302 does not include a serial number of the beacon 102, information representative of the radio frequencies of the pseudo-random frequency hopping patterns 214 and 306 or information representative of the timing 216 and 308 of the frequency hopping patterns 216 and 308, respectively.
Apparatus 300 provides exchange of information (i.e. data 304) from the beacon 102 to the network base station receiver 118 or 120 using a wireless communications channel (i.e. the third radio frequency channel 310) which has no conflict with the radio frequency channels (i.e. the first radio frequency channel 206 and the second radio frequency channel 212) over which communication between the beacon 102 and the network base station receiver 118 or 120 is established. The first message 204, the second message 210 and the third message 302 in the context of the protocol permits the beacon 102 to gain access to the network that the network base station receiver 118 or 120 that allows for the identification of the beacon 102 and allows for the transmission of data 304 from the beacon 102 to the network and from the network to the beacon.
In some implementations, the network base station receiver 118 or 120 is operable to transmit an acknowledgement to the beacon 102 after receiving the third message 302 and the beacon 102 is operable to attempt receipt of an acknowledgement transmission from the network base station receiver 118 or 120 after transmission of the third message 302 and the beacon 102 is operable to retransmit first message 204, the second message 210 and the third message 302 when no acknowledgement transmission by the beacon 102 from the network base station receiver 118 or 120 is received after a period of time.
One example of the third message 302 is a SIM message that is described in at least
In some implementations, the beacon 102 is operable to transmit the first message 204 and the second message 210 without waiting or delaying any further operations for an acknowledgement message from the network base station receiver 118 or 120 of the first message 204 and the second message 210.
In some implementations, the first message 204 includes notice that the network base station receiver 118 or 120 is in range of the beacon 102 and the first message 204 includes a representation of imminent access by the beacon 102.
Apparatus components of the
In the previous section, a system level overview of the operation of an implementation is described. In this section, the particular methods of such an implementation are described by reference to a series of flowcharts. Describing the methods by reference to a flowchart enables one skilled in the art to develop such programs, firmware, or hardware, including such processor-executable instructions to carry out the methods on suitable computers, executing the processor-executable instructions from computer-readable media. Similarly, the methods performed by the server computer programs, firmware, or hardware are also composed of processor-executable instructions. Methods 700-1100 can be performed by a program executing on, or performed by firmware or hardware that is a part of, a computer, such as general computer environment 1200 in
Method 600 includes receiving GNSS information from acquired and tracked GNSS satellites, at block 602. Thereafter, the GNSS information is analyzed to determine if the GNSS information is partial or complete GNSS information, at block 604. Complete GNSS information is adequate to estimate a geographic location of the receiving device. One example of the complete GNSS information is information from at least 3 or 4 GNSS satellites because information from 3 or 4 GNSS satellites is adequate to determine a 2D or a 3D geographic location of the receiving device, respectively. In order to obtain a 3D geographic location solution, the GNSS receiver requires acquisition and tracking of at least 4 satellites. For a 2D geographic location solution, the GNSS receiver requires acquisition and tracking of at least 3 satellites, where if only 3 satellites are being tracked then a prior altitude estimate is required. However, if an altitude estimate is not available for a possible 2D position solution when only 3 satellites are being tracked then the GNSS receiver is unable to determine a geographic location solution.
If the GNSS information is complete GNSS information, thereafter at block 606, geographic location is calculated from the complete GNSS information that was received at block 602. In some embodiments, the geographic location is calculated to a resolution of about 8 meters that requires 28 bits of storage for latitude and longitude. The geographic location 116 in
The geographic location is transmitted in a beacon transmission, at block 608. Examples of the beacon transmission are first message 204, second message 210, third message 302 and the here-i-am (HIA), registration (REG) and short-and-instant telemetry messaging (SIM) transmissions described in
Method 700 includes transmitting a here-i-am (HIA) transmission from a beacon to a network base station receiver, at block 702. The HIA transmission is the first message 204 in
Method 700 includes transmitting the REG transmission that includes a geographic location, at block 704. The REG transmission is transmitted on one of the radio frequency channels in the second pseudo-random frequency hopping pattern, thus the REG transmission is synchronized to the HIA transmission on the second pseudo-random frequency hopping pattern. The REG transmission includes a serial number of beacon and a third pseudo-random frequency hopping pattern, such as 306 in
Method 700 includes transmitting a short-and-instant telemetry messaging (SIM) transmission, at block 706. The SIM transmission is transmitted on one of the radio frequency channels in the third pseudo-random frequency hopping pattern, thus the SIM transmission is synchronized to the REG transmission on the third pseudo-random frequency hopping pattern. The SIM transmission includes data, the data including application-specific data such as remote meter reading, smart grid, intelligent traffic signs, automotive, road condition telemetry, vending machine reporting, road construction equipment reporting, the data not including the serial number of the beacon. The data does not include the information representative of the timing and information representative of any of the pseudo-random frequency hopping patterns.
The radio frequency channels of the first, second and third pseudo-random frequency hopping patterns are mutually exclusive.
Method 800 includes transmitting a here-i-am (HIA) transmission from a beacon to a network base station receiver, at block 702.
Method 800 includes transmitting the registration (REG) transmission that includes a latitude and longitude, at block 704.
Method 900 includes receiving one or more beacon transmission(s) that include complete GNSS information, at block 902. Examples of the beacon transmission(s) are first message 204, second message 210, third message 302 in
Method 900 also includes extracting the complete GNSS information from the one or more beacon transmission(s) as the estimated geographic location when the transmission(s) indicate that complete GNSS information is in the transmission(s), at block 904. Some implementations of method 900 also include storing the beacon geographic location in a memory, at block 906, to be available for use by application programs.
Method 1000 includes receiving a here-i-am (HIA) transmission at a network base station receiver, at block 1002. The HIA transmission is the first message 204 in
Method 1000 includes receiving the REG transmission that includes a geographic location, at block 1004. The REG transmission is received on one of the radio frequency channels in the second pseudo-random frequency hopping pattern, thus the REG transmission is synchronized to the HIA transmission on the second pseudo-random frequency hopping pattern. The REG transmission includes a serial number of beacon and a third pseudo-random frequency hopping pattern, such as 306 in
Method 1000 includes receiving a short-and-instant telemetry messaging (SIM) transmission, at block 1006. The SIM transmission is received on one of the radio frequency channels in the third pseudo-random frequency hopping pattern, thus the SIM transmission is synchronized to the REG transmission on the third pseudo-random frequency hopping pattern. The SIM transmission includes data, the data including application-specific data such as remote meter reading, smart grid, intelligent traffic signs, automotive, road condition telemetry, vending machine reporting, road construction equipment reporting, the data not including the serial number of the beacon. The data does not include the information representative of the timing and information representative of any of the pseudo-random frequency hopping patterns.
The radio frequency channels of the first, second and third pseudo-random frequency hopping patterns are mutually exclusive.
In some implementations, methods 600-1100 are implemented as a computer data signal embodied in a carrier wave, that represents a sequence of processor-executable instructions which, when executed by a processor, such as processing units 1204 in
The illustrated operating environment 1200 is only one example of a suitable operating environment, and the example described with reference to
The computation resource 1202 includes one or more processors or processing units 1204, a system memory 1206, and a bus 1208 that couples various system components including the system memory 1206 to processor(s) 1204 and other elements in the environment 1200. The bus 1208 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port and a processor or local bus using any of a variety of bus architectures, and can be compatible with SCSI (small computer system interconnect), or other conventional bus architectures and protocols.
The system memory 1206 includes nonvolatile read-only memory (ROM) 1210 and random access memory (RAM) 1212, which can or cannot include volatile memory elements. A basic input/output system (BIOS) 1214, containing the elementary routines that help to transfer information between elements within computation resource 1202 and with external items, typically invoked into operating memory during start-up, is stored in ROM 1210.
The computation resource 1202 further can include a non-volatile read/write memory 1216, represented in
The non-volatile read/write memory 1216 and associated computer-readable media provide nonvolatile storage of processor-readable instructions, data structures, program modules and other data for the computation resource 1202. Although the exemplary environment 1200 is described herein as employing a non-volatile read/write memory 1216, a removable magnetic disk 1220 and a removable optical disk 1226, it will be appreciated by those skilled in the art that other types of computer-readable media which can store data that is accessible by a computer, such as magnetic cassettes, FLASH memory cards, random access memories (RAMs), read only memories (ROM), and the like, can also be used in the exemplary operating environment.
A number of program modules can be stored via the non-volatile read/write memory 1216, magnetic disk 1220, optical disk 1226, ROM 1210, or RAM 1212, including an operating system 1230, one or more application programs 1232, other program modules 1234 and program data 1236. Examples of computer operating systems conventionally employed for some types of three-dimensional and/or two-dimensional medical image data include the NUCLEUS® operating system, the LINUX® operating system, and others, for example, providing capability for supporting application programs 1232 using, for example, code modules written in the C++® computer programming language.
A user can enter commands and information into computation resource 1202 through input devices such as input media 1238 (e.g., keyboard/keypad, tactile input or pointing device, mouse, foot-operated switching apparatus, joystick, touchscreen or touchpad, microphone, antenna etc.). Such input devices 1238 are coupled to the processing unit 1204 through a conventional input/output interface 1242 that is, in turn, coupled to the system bus. A monitor 1250 or other type of display device is also coupled to the system bus 1208 via an interface, such as a video adapter 1252.
The computation resource 1202 can include capability for operating in a networked environment using logical connections to one or more remote computers, such as a remote computer 1260. The remote computer 1260 can be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computation resource 1202. In a networked environment, program modules depicted relative to the computation resource 1202, or portions thereof, can be stored in a remote memory storage device such as can be associated with the remote computer 1260. By way of example, remote application programs 1262 reside on a memory device of the remote computer 1260. The logical connections represented in
Such networking environments are commonplace in modern computer systems, and in association with intranets and the Internet. In certain implementations, the computation resource 1202 executes an Internet Web browser program (which can optionally be integrated into the operating system 1230), such as the “Internet Explorer®” Web browser manufactured and distributed by the Microsoft Corporation of Redmond, Wash.
When used in a LAN-coupled environment, the computation resource 1202 communicates with or through the local area network 1272 via a network interface or adapter 1276. When used in a WAN-coupled environment, the computation resource 1202 typically includes interfaces, such as a modem 1278, or other apparatus, for establishing communications with or through the WAN 1274, such as the Internet. The modem 1278, which can be internal or external, is coupled to the system bus 1208 via a serial port interface.
In a networked environment, program modules depicted relative to the computation resource 1202, or portions thereof, can be stored in remote memory apparatus. It will be appreciated that the network connections shown are exemplary, and other means of establishing a communications link between various computer systems and elements can be used.
A user of a computer can operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 1260, which can be a personal computer, a server, a router, a network PC, a peer device or other common network node. Typically, a remote computer 1260 includes many or all of the elements described above relative to the computer 1200 of
The computation resource 1202 typically includes at least some form of computer-readable media. Computer-readable media can be any available media that can be accessed by the computation resource 1202. By way of example, and not limitation, computer-readable media can comprise computer storage media and communication media.
Computer storage media include volatile and nonvolatile, removable and non-removable media, implemented in any method or technology for storage of information, such as processor-readable instructions, data structures, program modules or other data. The term “computer storage media” includes, but is not limited to, RAM, ROM, EEPROM, FLASH memory or other memory technology, CD, DVD, or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other media which can be used to store computer-intelligible information and which can be accessed by the computation resource 1202.
Communication media typically embodies processor-executable instructions, data structures, program modules or other data, represented via, and determinable from, a modulated data signal, such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal in a fashion amenable to computer interpretation.
By way of example, and not limitation, communication media include wired media, such as wired network or direct-wired connections, and wireless media, such as acoustic, RF, infrared and other wireless media. The scope of the term computer-readable media includes combinations of any of the above.
Various implementations of the protocols are described without limiting this disclosure.
Each HIA Burst indicates an upcoming transmission of a REG Burst. Each HIA Burst includes of four HIA mini-bursts. Each HIA mini-burst includes of two parts, a Detection Burst followed by a HIA Data Burst. The Detection Burst is used by the network to detect the beginning of the HIA mini-burst. The HIA Data Burst contains 8 data bits: two bits are used to determine the Type of mini-burst: HIA (00b) while the remaining 6 bits are used to transmit the Channel Sequence number (CSN).
Regardless of the Type of mini-burst that is utilized by the HIA, the selection of the channels is pseudo-random. The HIA channel number in combination with the Channel Sequence Number is used to identify which of the mini-bursts has been received. This information is used to determine the time at which the REG Burst may be received. The Channel Sequence Number is used to determine the REG mini-burst channel hopping pattern.
Each of the four HIA mini-bursts is transmitted sequentially with a 38.0 ms delay measured from the beginning of one HIA mini-burst to the beginning of the next HIA mini-burst. Each HIA mini-burst includes of two parts, a Detection Burst of 16.384 ms duration followed by one HIA Data Burst of 16.384 ms duration. The beginning of the first HIA mini-burst is referred to as HIA Sync Time.
The beacon 102 transmits a REG Burst. The REG Burst includes two REG mini-bursts. Each of the two mini-bursts are transmitted sequentially with a fixed delay measured from the beginning of the first mini-burst to the beginning of the second mini-burst. The selection of the REG channels is pseudo-random.
The network base station receiver 1500 assigns radio receivers, as necessary, to tune to the required registration channel at the required time to receive one or both of the REG mini-bursts. While the REG mini-burst is longer in duration than the HIA mini-burst, the required number of deployed radio receivers is reduced by the fact that the channels are only monitored on an as-needed basis.
Each REG mini-burst includes REG Data Burst that contains the following encoded information:
The beacon 102 Identification Number (WIN) uniquely identifies the transmitting beacon 102. The network base station receiver 118 or 120 uses the WIN to interpret the identity and application of the transmitting beacon 102. No two beacons 102 have the same WIN. The WIN is also known as the beacon serial number 202 in
The Data Message component is used for application specific data and is defined by the application and by the Data Class. The Data Class (4 bit field) defines how the bits in the Data Message are interpreted. Several Data Classes have been developed to support fleet, vehicle recovery and telemetry client applications, according to an implementation.
The SIM uplink transmission is able to carry a telemetry uplink message from the beacon to the network. The data are partitioned into 9-byte non-overlapping blocks for encapsulation into SIM Bursts. If the length of the data, in bytes, is not an integer multiple of 9, then a sufficient number of bytes with a value of 0x00 are appended at the end.
Next, each 9-byte block is Reed-Solomon encoded, to form a SIM Burst. Aggregating all of the SIM Bursts together forms a SIM Packet as shown in
Each SIM Burst includes two SIM mini-bursts.
The transmission sequence and timing for a SIM Packet are described as follows (all delays measured from start of preceding SIM mini-burst to start of next SIM mini-burst). The timing and synchronization reference points of the SIM mini-bursts are shown in
In order to increase the utilization of the bandwidth available in the 2400 MHz ISM band, the HIA, REG and SIM channels are allocated a bandwidth of 62.5 kHz each. The channels are allocated at a minimum channel spacing of 31.25 kHz and carefully chosen to allow the channels to be interleaved. Due to the bandwidth of the HIA, REG, and SIM signals and the allowable variations in carrier frequency the HIA, REG and SIM signals can fall outside of the allocated channels.
Some of the channels located near the 2400 MHz band edge and some of the channels located near the 2483.5 MHz band edge are left unused to serve as a guard band to assist in the compliance with the radio transmitter regulations. Leaving a 937.5 kHz guard band on the lower band edge of the 2400 MHz ISM band and a 1000 kHz guard band on the upper band edge, and designating the lowest possible channel as 1, we have the following center frequencies:
f
RF=2400.9375 MHz+N(0.03125 MHz) Equation 1
Where:
N=[1, . . . , 2639] Equation 2
The distribution of these channels among the different logical channels are as follows:
12 HIA channels,
42 REG channels (paired in groups of two),
84 SIM channels (paired in groups of two),
123 Reserved channels.
The 12 HIA channels have been divided into four groups of three HIA channels each. The groups are known as HIA group A, HIA group B, HIA group C, and HIA group D. The HIA channels are designated HIA channel A1, A2, A3, B1, B2, B3, C1, C2, C3, D1, D2 and D3.
When the beacon 102 transmits the four consecutive HIA mini-bursts, each one of the four HIA mini-bursts are transmitted on a different HIA channel group (either group A, B, C, or D), where the order of the groups and the channel number within the group are pseudo-randomly selected. The network base station receiver 118 or 120 network continuously monitors the HIA channels and receives the HIA mini-bursts. By decoding the Channel Sequence Number within the HIA mini-burst and knowing the channel group on which the HIA mini-burst was received the Network is able to determine which of the four HIA mini-bursts was received (first, second, third or fourth). By knowing the transmission time of the HIA mini-bursts and by knowing which of the four HIA was received (first, second, third or fourth), the time of the Registration Burst can be determined. By decoding the Channel Sequence Number within the HIA mini-burst, the channel number for each of the Registration mini-bursts can be determined.
The HIA channels are used in such a manner that the HIA mini-bursts are uniformly distributed among the 12 HIA channels. The HIA transmission channel sequence conforms to the following requirements.
Each HIA Burst uses one channel from each of the HIA channel groups (i.e. the four HIA mini-bursts uses one channel from group A, one channel from group B, one channel from group C and one channel from group D).
The order in which the channel groups are used are pseudo-randomly selected and change from one HIA Burst to the next.
The channel number within each group follows a pseudo-random sequence based upon the WIN of the beacon 102. Each channel number of each channel group are used in any group of three consecutive REG (i.e. the pattern repeats every 12 HIA transmissions).
The CSN are initialized according to the formula given in Equation 3. The Channel Sequence Number (CSN) is incremented for each HIA Burst by a simple linear congruent generator (LCG), which is of the format CSNi+1=(a×CSNi+b) mod 64. The LCG coefficients “a” and “b” are assigned from the 6 LSBs of the WIN from a predetermined lookup table, and the initial CSN value (i.e. CSN0); or seed, are determined by Equation. 3 on power-up.
CSN0={WINH⊕[(WINL& 0x0FFF)<<1]}mod64 Equation 3
Where {W/NH, WINL} denote the upper and lower 16 bits of the WIN respectively, & denotes the bit-wise and operator, ⊕ denotes the bit-wise exclusive-or operator, and <<n denotes an n-bit shift to the left (i.e. multiplication by 2n)
The beacon 102 can transmit an uplink transmission sequence that allows the beacon to either register with the network manager operations center 124 and/or allow the beacon to transmit a short data message to the network manager operations center 124 without the network requiring the geographic location 116 of the beacon 102 or receiving a SIM telemetry message 302. This uplink message sequence is referred to as a No LOC/No SIM (NLNS) sequence and should not interfere with the timing and synchronization of a current uplink transmission sequence and/or downlink communication activities, therefore, it is assigned its own Channel Sequence Number CSNNLNS. The CSNNLNS are initialized according to the formula given in Equation 3. The CSNNLNS are incremented for each No LOC/No SIM transmission sequence by using the assigned LCG.
The 12 channels reserved for HIA have been carefully chosen so as to minimize the effects of interference and to maximize system availability. The HIA channel numbers and frequencies are as follows in Table 1.
The following relations give the center frequency of the HIA channels based upon the subscript index k.
f
HIA(Ak)=[77125+210×[3(k−1)+└k>>1┘]]×31250
f
HIA(Bk)=[76495+420k]×31250
f
HIA(Ck)=[77965+420k]×31250
f
HIA(Dk)=[77545+210×[4(k−1)−└k>>1┘]]×31250 Equation 4
Where └ ┘ denotes integer truncation; i.e. rounding down to the nearest integer value, and >>n denotes an n-bit shift to the right (i.e. multiplication by 2−n).
When the beacon 102 transmits a REG Burst, the beacon 102 will always transmit two identical mini-bursts. Each of the two REG transmissions are transmitted on a different REG channel. The network base station receiver 118 or 120 uses the timing information and channel information obtained from any one of the four HIA mini-bursts to tune a portion of the Network to the specified channel at the specified time in order to receive one of the two REG mini-bursts. In the event that the Network fails to receive the first REG mini-burst transmission, the Network can repeat the process and attempt to receive the second REG mini-burst. Each REG mini-burst contains the WIN.
The channels used are selected such that a large number of beacons 102 use the REG channels in such a manner that the REG mini-bursts are uniformly distributed among the 42 REG channels. The REG transmission channel sequence conforms to the following requirements.
Each REG mini-burst of a REG Burst uses a different REG channel.
The REG channel patterns are selected based upon the CSN (or CSNNLNS), where the CSN sequence is determined by the assigned LCG.
In Table 2 below, the 42 channels reserved for REG have been carefully chosen so as to minimize the effects of interference and to maximize system availability. The REG channel numbers and frequencies are as follows:
The following equation determines the center frequency for the REG channels based upon the subscript index k of Table 2.
f
REG(Rk)=[76857+60k]×31250 Equation 5
The channels used are selected such that a large number of beacons 102 use the SIM channels in such a manner that the SIM mini-bursts are uniformly distributed among the SIM channels.
There are 84 channels for use by SIM. These channels have been chosen so as to reduce the effects of interference and to improve system availability. The channels used by SIM are listed in Table 3.
The following equation determines the center frequency for the SIM channels based upon the subscript index k of Table 3.
f
SIB(Mk)=[76889+30k]×31250 Equation 6
The sub-channels in the HIA groupings {A, B, C, D} have a period of three, which ensures that each of the frequencies of each individual sub-group is transmitted in any three consecutive REG periods. This restricts the randomness of the selection of sub-channels selected per group in any time interval. i.e. binomial coefficient
per group {A, B, C, D} in the first registration interval, then
for the second interval, and
for the third interval.
For example, for HIA group A, we can start from the set {1, 2, 3}. If 3 is selected for the first interval, then on the next interval we are restricted to the set {1, 2} for HIA A. If 1 is then selected, then for the third interval we must use 2 for HIA A. Thus, the HIA A pattern becomes {A3, A1, A2}.
The HIA grouping pattern based on the CSN conforms to Table 4, which contains the HIA and REG channel sequences for the corresponding Channel Sequence Number.
The HIA sub-channel selection can only generate two possible sequences, i.e. {1, 2, 3, 1, . . . } and {1, 3, 2, 1, . . . }. Therefore, sequence {1, 2, 3, . . . } and {1, 3, 2, . . . }are denoted as HIA sub-sequence 0 and 1 respectively.
For HIA groups {A, B, C, D}, the corresponding sub-sequence are determined by bits {W(9), W(10), W(11), W(12)} of the 32-bit WIN, where W(0) represents the least significant bit (LSB) of the WIN. The HIA sub-sequences can easily be generated in the following manner.
The initial or starting seed for each HIA sequence are determined upon power-up of the beacon 102, where the 8 LSBs are paired in the following method.
For example, let WIN=5695785=0x0056 E929.
The 8 LSBs of the WIN are b#0010 1001, thus, the initial seed of the HIA groups {A, B, C, D} are y0+1={2, 3, 3, 1} respectively. Similarly, {W(9), W(10), W(11), W(12)}={0, 0, 1, 0}. Therefore, HIA groups {A, B, C, D} will use sub-sequences {0, 0, 1, 0} respectively.
Thus, the consecutive sub channel numbering per HIA group upon power-up is then as follows:
Table 5 can be partitioned into two regions, where the REG channel pairs {RX, RY} are easily determined by the following relationships.
For example, if CSN=45, then X=(45-27)=18, and Y=18+13=31.
A linear feedback shift register (LFSR) implementation of a maximum length-sequence, which ensures a uniform selection of all the SIM channels is used. The LFSR uses the generator polynomial
f*(x)=x38+x37+x33+x32+1
to generate the SIM channel hop pattern.
The LFSR are clocked 6 times to generate an index called “SIM Burst channel index” for selecting a pair of SIM channels to be utilized by SIM mini-burst1 and SIM mini-burst2. This index is obtained by only considering the 6 LSBs of the state register of the Galois configuration of the selected generator polynomial, which is well suited for software development of LFSRs.
As an example, let CSN=61=0x3D and WIN=123456789=0x075BCD15.
Therefore, the SIM LFSR state register is preloaded as
LFSR=[00,0001,1101,0110,1111,0011,0100,0101,0111,1101]b,
And the initial seed of the SIM LFSR state register (after 38 clocks) is
Continuing the above example, 32 consecutive SIM Burst channel indices, i.e. k=[1, 2, . . . , 32] are generated, to be used by SIM Bursts which belong to a SIM Packet and are listed in Table 6:
The SIM channels used by the two SIM mini-bursts which belong to the same SIM Burst are separated in frequency to reduce fades and interference. There are 84 SIM channels that are paired in an order such that paired channels are not repeated (i.e. the pair {Mx, My} is only used once in the total possible paired set and the pair {Mx, My} are not used).
The following table is used to generate the SIM mini-burst channels from SIM Burst channel index obtained by the algorithm given by
M
x(k)=Mk+1, and My(k)=Mk+43
where Mi is the ith SIM channel given in Table 7.
In method 2100, a WIN, CSN and #S is received, at block 2102. The WIN is the beacon Identification Number. The CSN is the Channel Sequence number. The #S is the determined number of SIM Bursts that would be needed to transmit the encoded telemetry uplink message. Thereafter, the initial register state of LFSR is set, such as (WIN<<6)⊕CSN, LFSR is updated by 38 cycles, and counter I is set to I=0, at block 2104. Then, if the counter I is I>#S at block 2106, #S being the determined number of SIM Bursts that would be needed to transmit the encoded telemetry uplink message, the method 2100 ends. Otherwise, the LFSR is updated by 6 cycles and 6 LSBs are bit-masked off of the LFSR (i.e. SIM Burst channel index=LFSR & 0x003F), at block 2108. Then, if the channel index is not equal to index [0, . . . , 41] at block 2110, control returns to block 2106. Otherwise, the counter I is incremented by 1, and a valid channel index is used for SIM Transmission, at block 2112, and control is returned to block 2106. In method 2100, the length is #5×9 bytes (which can include 0x00 byte padding to make the length modulo-9 bytes for transmission on the Physical Layer). To determine the length in bits, the length is #5×9 bytes×8 bits/byte. So for the SIM frequency hopping generator shown in method 2100, it is required to generate #S valid SIM Burst channel index values for the #S SIM Bursts. Therefore, the counter value I must span 1≦I≦#S when generating the SIM Burst channel index values.
An implementation of the HIA Burst protocol stack is shown in
In one example, the geographic location is a latitude and longitude and the latitude and longitude is transmitted in a 28 bit “Data Message” portion of the message layer of a REG transmission, and the “Data Class” portion of the message layer of the REG transmission is set to a 4 bit value that represent an indication of complete GNSS information of the latitude and longitude, as shown in
A wireless communication system is described. A technical effect of the wireless communication system is communication of geographic location data in bifurcated transmissions from a beacon. In some implementations, a hybrid beacon includes both a GPS receiver that generates a location of the GPS receiver and components that are operable to transmit the location in protocol to a base station receiver. Although specific implementations have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose can be substituted for the specific implementations shown. This application is intended to cover any adaptations or variations. For example, although described in procedural terms, one of ordinary skill in the art will appreciate that implementations can be made in an object-oriented design environment or any other design environment that provides the required relationships.
In particular, one of skill in the art will readily appreciate that the names of the methods and apparatus are not intended to limit implementations. Furthermore, additional methods and apparatus can be added to the components, functions can be rearranged among the components, and new components to correspond to future enhancements and physical devices used in implementations can be introduced without departing from the scope of implementations. One of skill in the art will readily recognize that implementations are applicable to future communication devices, different file systems, and new data types.
