US 7,301,476 B2Grant
Dynamic self-configuring metering network
Issue Date:2007-11-27
•16 Claims
•11 Drawing Sheets
Abstract
A dynamic self-configuring system for collecting metering data comprises a collector meter. The collector meter scans for meters that are operable to directly communicate with the collector and registers such meters as level one meters. The collector transmits instructions to the level one meters to scan for meters that are operable to directly communicate with the level one meters. The collector registers meters that respond as level two meters.
Metadata
Assignee
- Elster Electricity, LLC
Inventors
- Kenneth C. Shuey
- Rodney C. Hemminger
- Robert T. Mason, Jr.
- Eugene W. Hodges
Application Information
Application Number:US 10/928,781
Filing Date:2004-08-27
Priority Date:2002-06-27
Art Unit:2612
Classifications
IPC:
G08C17/00
Patent Drawings (11 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 10/185,664, filed Jun. 27, 2002, now U.S. Pat. No. 7,119,713 and entitled “Dynamic Self-Configuring Metering Network,” the contents of which are hereby incorporated by reference in their entirety.
Field of the Invention
[0002] The present invention relates to metering systems, and more particularly, to wireless networks for gathering metering data.
Background
[0003] The collection of meter data from electrical energy, water, and gas meters has traditionally been performed by human meter-readers. The meter-reader travels to the meter location, which is frequently on the customer's premises, visually inspects the meter, and records the reading. The meter-reader may be prevented from gaining access to the meter as a result of inclement weather or, where the meter is located within the customer's premises, due to an absentee customer. This methodology of meter data collection is labor intensive, prone to human error, and often results in stale and inflexible metering data.
[0004] Some meters have been enhanced to include a one-way radio transmitter for transmitting metering data to a receiving device. A person collecting meter data that is equipped with an appropriate radio receiver need only come into proximity with a meter to read the meter data and need not visually inspect the meter. Thus, a meter-reader may walk or drive by a meter location to take a meter reading. While this represents an improvement over visiting and visually inspecting each meter, it still requires human involvement in the process.
[0005] An automated means for collecting meter data involves a fixed wireless network. Devices such as, for example, repeaters and gateways are permanently affixed on rooftops and pole-tops and strategically positioned to receive data from enhanced meters fitted with radio-transmitters. Data is transmitted from the meters to the repeaters and gateways and ultimately communicated to a central location. While fixed wireless networks greatly reduce human involvement in the process of meter reading, such systems require the installation and maintenance of a fixed network of repeaters, gateways, and servers. Identifying an acceptable location for a repeater or server and physically placing the device in the desired location on top of a building or utility pole is a tedious and labor-intensive operation. Furthermore, each meter that is installed in the network needs to be manually configured to communicate with a particular portion of the established network. When a portion of the network fails to operate as intended, human intervention is typically required to test the effected components and reconfigure the network to return it to operation. Thus, while existing fixed wireless systems have reduced the need for human involvement in the daily collection of meter data, such systems require substantial human investment in planning, installation, and maintenance and are relatively inflexible and difficult to manage.
Summary
[0006] A dynamic self-configuring system for collecting meter data is disclosed herein. In an illustrative embodiment, a plurality of meter devices, which operate to track usage of a service or commodity such as, for example, electricity, water, and gas, are operable to wirelessly communicate. One of the meter devices, which is referred to as a collector, broadcasts messages to identify one or more of the meters with which it can directly communicate. The meters with which the collector is operable to directly communicate may be referred to as level one meters. Data designating these meters as level one meters is stored on the collector and the level one meters.
[0007] The collector communicates instructions to the level one meters to scan for meters that are operable to directly communicate with the level one meters. Meters that directly communicate with the level one meters may be referred to as level two meters. Data identifying the level two meters and the communication path to the level two meters is stored on the collector and the level two meters.
[0008] The collector continues the process of scanning the last defined level of meters for new meters that communicate with the last defined level. This process gradually provides identification of the meters in the network and the paths by which to communicate with each meter. Additionally, when new meters are added to the network, they are identified via subsequent scans.
Brief Description of the Drawings
[0009] Other features of systems and methods for gathering metering data are further apparent from the following detailed description of exemplary embodiments taken in conjunction with the accompanying drawings, of which:
[0010] FIG. 1 is a diagram of a wireless system for collecting meter data;
[0011] FIG. 2 depicts a flow chart of a process for exception handling;
[0012] FIGS. 3A and 3B depicts a flow chart of a process for registering nodes with a collector;
[0013] FIG. 4 depicts a flow chart of a process for registering a newly added meter;
[0014] FIG. 5 depicts a flow chart of a process for switching the communication path for a registered node to a new collector;
[0015] FIG. 6 depicts a flow chart of a process for reading usage data;
[0016] FIG. 7 depicts a flow chart of a process for reading data from a one-way meter;
[0017] FIG. 8 depicts a block diagram of a meter suitable for use with the disclosed embodiments; and
[0018] FIG. 9 is a diagram of a general purpose computing device.
Detailed Description
[0019] Exemplary systems and methods for gathering meter data are described below with reference to FIGS. 1-9 . It will be appreciated by those of ordinary skill in the art that the description given herein with respect to those figures is for exemplary purposes only and is not intended in any way to limit the scope of potential embodiments.
[0020] Generally, a plurality of meter devices, which operate to track usage of a service or commodity such as, for example, electricity, water, and gas, are operable to wirelessly communicate with each other. A collector meter is operable to automatically identify and register meters for communication with the collector meter. When a meter is installed, the meter becomes registered with the collector that can provide a communication path to the meter. The collectors receive and compile metering data from a plurality of meter devices via wireless communications. A communications server communicates with the collectors to retrieve the compiled meter data.
[0021] FIG. 1 provides a diagram of an exemplary metering system 110. System 110 comprises a plurality of meters 114, which are operable to sense and record usage of a service or commodity such as, for example, electricity, water, or gas. Meters 114 may be located at customer premises such as, for example, a home or place of business. Meters 114 comprise an antenna and are operable to transmit data, including service usage data, wirelessly. Meters 114 may be further operable to receive data wirelessly as well. In an illustrative embodiment, meters 114 may be, for example, a electrical meters manufactured by ABB Incorporated.
[0022] System 110 further comprises collectors 116. Collectors 116 are also meters operable to detect and record usage of a service or commodity such as, for example, electricity, water, or gas. Collectors 116 comprise an antenna and are operable to send and receive data wirelessly. In particular, collectors 116 are operable to send data to and receive data from meters 114. In an illustrative embodiment, meters 114 may be, for example, an electrical meter manufactured by ABB Incorporated.
[0023] A collector 116 and the meters 114 for which it is configured to receive meter data define a subnet 120 of system 110. For each subnet 120, data is collected at collector 116 and periodically transmitted to communication server 122. Communication server 122 stores the data for analysis and preparation of bills. Communication server 122 may be a specially programmed general purpose computing system and may communicate with collectors 116 wirelessly or via a wire line connection such as, for example, a dial-up telephone connection or fixed wire network.
[0024] Thus, each subnet 120 comprises a collector 116 and one or more meters 114, which may be referred to as nodes of the subnet. Typically, collector 116 directly communicates with only a subset of the plurality of meters 114 in the particular subnet. Meters 114 with which collector 116 directly communicates may be referred to as level one meters 114a. The level one meters 114a are said to be one “hop” from the collector 116. Communications between collector 116 and meters 114 other than level one meters 114a are relayed through the level one meters 114a. Thus, the level one meters 114a operate as repeaters for communications between collector 116 and meters 114 located further away in subnet 120.
[0025] Each level one meter 114a directly communicates with only a subset of the remaining meters 114 in the subnet 120. The meters 114 with which the level one meters 114a directly communicate may be referred to as level two meters 114b. Level two meters 114b are one “hop” from level one meters 114a, and therefore two “hops” from collector 116. Level two meters 114b operate as repeaters for communications between the level one meters 114a and meters 114 located further away from collector 116 in the subnet 120.
[0026] While only three levels of meters are shown (collector 114, first level 114a, second level 114b) in FIG. 1 , a subnet 120 may comprise any number of levels of meters 114. For example, a subnet 120 may comprise one level of meters but might also comprise eight or more levels of meters 114. In an embodiment wherein a subnet comprises eight levels of meters 114, as many as 512 meters might be registered with a single collector 116.
[0027] Each meter 114 and collector 116 that is installed in the system 110 has a unique identifier stored thereon that uniquely identifies the device from all other devices in the system 110. Additionally, meters 114 operating in a subnet 120 comprise information including the following: data identifying the collector with which the meter is registered; the level in the subnet at which the meter is located; the repeater meter with which the meter communicates to send and receive data to the collector; an identifier indicating whether the meter is a repeater for other nodes in the subnet; and if the meter operates as a repeater, the identifier that uniquely identifies the repeater within the particular subnet, and the number of meters for which it is a repeater. Collectors 116 have stored thereon all of this same data for all meters 114 that are registered therewith. Thus, collector 116 comprises data identifying all nodes registered therewith as well as data identifying the registered path by which data is communicated with each node.
[0028] Generally, collector 116 and meters 114 communicate with and amongst one another using any one of several robust wireless techniques such as, for example, frequency hopping spread spectrum (FHSS) and direct sequence spread spectrum (DSSS).
[0029] For most network tasks such as, for example, reading data, collector 116 communicates with meters 114 in the subnet 120 using point-to-point transmissions. For example, a message or instruction from collector 116 is routed through a defined set of meter hops to the desired meter 114. Similarly, a meter 114 communicates with collector 117 through the same set of meter hops, but in reverse.
[0030] In some instances, however, collector 117 needs to quickly communicate information to all meters 114 located in its subnet 120. Accordingly, collector 117 may issue a broadcast message that is meant to reach all nodes in the subnet 120. The broadcast message may be referred to as a “flood broadcast message.” A flood broadcast originates at collector 116 and propagates through the entire subnet 120 one level at a time. For example, collector 116 may transmit a flood broadcast to all first level meters 114a. The first level meters 114a that receive the message pick a random time slot and retransmit the broadcast message to second level meters 114b. Any second level meter 114b can accept the broadcast, thereby providing better coverage from the collector out to the end point meters. Similarly, the second level meters 114b that receive the broadcast message pick a random time slot and communicate the broadcast message to third level meters. This process continues out until the end nodes of the subnet. Thus, a broadcast message gradually propagates out the subnet 120.
[0031] The flood broadcast packet header contains information to prevent nodes from repeating the flood broadcast packet more than once per level. For example, within a flood broadcast message, a field might exist that indicates to meters/nodes which receive the message, the level of the subnet the message is located; only nodes at that particular level may re-broadcast the message to the next level. If the collector broadcasts a flood message with a level of 1, only level 1 nodes may respond. Prior to re-broadcasting the flood message, the level 1 nodes increment the field to 2 so that only level 2 nodes respond to the broadcast. Information within the flood broadcast packet header ensures that a flood broadcast will eventually die out.
[0032] Generally, a collector 116 issues a flood broadcast several times, e.g. five times, successively to increase the probability that all meters in the subnet 120 receive the broadcast. A delay is introduced before each new broadcast to allow the previous broadcast packet time to propagate through all levels of the subnet.
[0033] Meters 114 may have a clock formed therein. However, meters 114 often undergo power interruptions that can interfere with the operation of any clock therein. Accordingly, the clocks internal to meters 114 cannot be relied upon to provide an accurate time reading. Having the correct time is necessary, however, when time of use metering is being employed. Indeed, in an embodiment, time of use schedule data may also be comprised in the same broadcast message as the time. Accordingly, collector 116 periodically flood broadcasts the real time to meters 114 in subnet 120. Meters 114 use the time broadcasts to stay synchronized with the rest of the subnet 120. In an illustrative embodiment, collector 116 broadcasts the time every 15 minutes. The broadcasts may be made near the middle of 15 minute clock boundaries that are used in performing load profiling and time of use (TOU) schedules so as to minimize time changes near these boundaries. Maintaining time synchronization is important to the proper operation of the subnet 120. Accordingly, lower priority tasks performed by collector 116 may be delayed while the time broadcasts are performed.
[0034] In an illustrative embodiment, the flood broadcasts transmitting time data may be repeated, for example, five times, so as to increase the probability that all nodes receive the time. Furthermore, where time of use schedule data is communicated in the same transmission as the timing data, the subsequent time transmissions allow a different piece of the time of use schedule to be transmitted to the nodes.
[0035] Exception messages are used in subnet 120 to transmit unexpected events that occur at meters 114 to collector 116. In an embodiment, the first 4 seconds of every 32-second period are allocated as an exception window for meters 114 to transmit exception messages. Meters 114 transmit their exception messages early enough in the exception window so the message has time to propagate to collector 116 before the end of the exception window. Collector 116 may process the exceptions after the 4-second exception window. Generally, a collector 116 acknowledges exception messages, and collector 116 waits until the end of the exception window to send this acknowledgement.
[0036] In an illustrative embodiment, exception messages are configured as one of three different types of exception messages: local exceptions, which are handled directly by the collector 116 without intervention from communication server 122; an immediate exception, which is generally relayed to communication server 122 under an expedited schedule; and a daily exception, which is communicated to the communication server 122 on a regular schedule.
[0037] FIG. 2 presents a flowchart of a process employed by collector 116 for handling these exceptions. At step 210, the exception is received at collector 116. At step 212, collector 116 identifies the type of exception that has been received. If a local exception has been received, at step 214, collector 116 takes an action to remedy the problem. For example, when collector 116 receives an exception requesting a node scan request such as discussed below, collector 116 transmits a command to initiate a scan procedure to the meter 114 from which the exception was received.
[0038] If an immediate exception type has been received, at step 220, collector 116 makes a record of the exception. An immediate exception might identify, for example, that there has been a power outage. Collector 116 may log the receipt of the exception in one or more tables or files. In an illustrative example, a record of receipt of an immediate exception is made in a table referred to as the “Immediate Exception Log Table.”
[0039] At step 222, collector 116 waits a set period of time before taking further action with respect to the immediate exception. For example, collector 116 may wait 64 seconds. This delay period allows the exception to be corrected before communicating the exception to communication server 122. For example, where a power outage was the cause of the immediate exception, collector 116 may wait a set period of time to allow for receipt of a message indicating the power outage has been corrected.
[0040] If at step 224 the exception has not been corrected, at step 226, collector 116 communicates the immediate exception to communication server 122. For example, collector 116 may initiate a dial-up connection with communication server 122 and download the exception data. After reporting an immediate exception to communications server 122, collector 116 may delay reporting any additional immediate exceptions for a period of time such as ten minutes. This is to avoid reporting exceptions from other meters 114 that relate to, or have the same cause as the exception that was just reported.
[0041] If a daily exception was received, at step 230, the exception is recorded in a file or a database table. Generally, daily exceptions are occurrences in the subnet 120 that need to be reported to communication server 122, but are not so urgent that they need to be communicated immediately. For example, when collector 116 registers a new meter 114 in subnet 120, collector 116 records a daily exception identifying that the registration has taken place. In an illustrative embodiment, the exception is recorded in a database table referred to as the “Daily Exception Log Table.” At step 232, collector 116 communicates the daily exceptions to communications server 122. Generally, collector 116 communicates the daily exceptions once every 24 hours.
[0042] According to an aspect of the disclosed system 110, a collector 116 may dynamically identify meters 114 that are operable to communicate with it in a subnet 120 as well as identify more efficient communication paths for previously registered meters. For example, when a collector 116 is initially brought into system 110, it needs to identify and register meters in its subnet 120. A “node scan” refers to a process of communication between connectors 116 and meters 114 whereby a collector may identify and register new nodes in a subnet 120 and allow previously registered nodes to switch paths. A collector 116 can implement a node scan on the entire subnet, referred to as a “full node scan,” or a node scan can be performed on specially identified nodes, referred to as a “node scan retry.”
[0043] A full node scan may be performed, for example, when a collector is first installed. The collector 116 must identify and register nodes from which it will collect usage data. FIGS. 3A and 3B depict a flow chart of a process for performing a “full node scan.” As shown, at step 310, the collector 116 initiates the node scan by broadcasting a request, which may be referred to as a Node Scan Procedure request. Generally, the Node Scan Procedure request directs that all unregistered meters 114 or nodes that receive the request respond to the collector 116. The request may comprise information such as the unique address of the collector that initiated the procedure. The signal by which collector 116 transmits this request may have limited strength and therefore is detected at meters 114 that are in proximity of collector 116. Meters 114 that receive the Node Scan Procedure request respond by transmitting their unique identifier as well as other data.
[0044] Collector 116 receives a response from one of the meters 114 at step 312. At step 313, collector 116 identifies a received signal strength (RSSI) value for the response from meter 114. At step 314, collector 116 stores in memory the meter's 114 unique identifier along with the corresponding RSSI value.
[0045] Preferably, collector 116 attempts to register meters 114 that will have a reliable data communication path. Accordingly, at step 316, collector 116 compares the RSSI value of the node scan response with a selected threshold value. For example, the threshold value may be −60 dBm. RSSI values above this threshold are sufficiently reliable. Collector 116 maintains a list of meters 114 that responded but which do not satisfy the RSSI threshold. For example, a database table referred to as the Straggler table may be employed to store for each meter that responded to a Node Scan Response and did not meet the RSSI value, the meter's unique identifier and the RSSI value of the response. Accordingly, if at step 316 the RSSI value is not greater than the established threshold, at step 318, collector 116 updates its list to include the meter's unique identifier and RSSI value. Thereafter, processing continues at step 326.
[0046] If at step 316, the RSSI value exceeds the threshold, at step 324, collector 116 registers the node. Registering a meter 114 comprises updating a list of the registered nodes at collector 116. For example, the list may be updated to identify the meter's system-wide unique identifier and the communication path to the node. Collector 116 also records the meter's level in the subnet (i.e. whether the meter is a level one node, level two node, etc.), whether the node operates as a repeater, and if so, the number of meters for which it operates as a repeater. Upon initialization, the data indicates the node is not a repeater and the number of meters for which it operates as a repeater is zero. The registration process further comprises transmitting registration information to the meter 114. For example, collector 116 forwards to meter 114 an indication that it is registered, the unique identifier of the collector with which it is registered, the level the meter exists at in the subnet, and the unique identifier of the meter with which it should communicate data. The meter stores this data and begins to operate as part of the subnet by responding to commands from its collector 116.
[0047] At step 326, collector 116 determines if there are additional responses to the node scan request. If so, processing continues at step 314.
[0048] Steps 310 through 326 may be performed several times so as to insure that all meters 114 that may receive the Node Scan Procedure, have an opportunity for their response to be received at collector 116. Accordingly, at step 328, collector 116 determines whether the Node Scan should be implemented again. Generally, this is determined by comparing the number of times the steps have been completed with a predefined limit. If the limit has not been met, processing continues at step 310. If the limit has been met, a first portion of the node scan procedure is complete. It is presumed that all first level meters 114 have been identified and registered at this point in the process. The Straggler list may identify one or more meters 114 that did not satisfy the RSSI threshold. The node scan process continues by performing a similar process as that described above at each of the now registered level one nodes. This process results in the identification and registration of level two nodes. After the level two nodes are identified, a similar node scan process is performed at the level two nodes to identify level three nodes, and so on.
[0049] FIG. 3B is a flow chart of the process for identifying and registering meters located above the level one meters. At step 340, collector 116 transmits a command, which may be referred to as an Initiate Node Scan Procedure, to the first of the meters 114 registered at steps 310 through 328, to initiate a node scan process at the particular meter 114. The request comprises several data items that the receiving meter may use in completing the node scan. For example, the request may comprise the number of timeslots available for responding nodes, the unique address of the collector that initiated the request, and a measure of the reliability of the communications between the target node and the collector. As described below in connection with FIG. 4 , the measure of reliability is employed during a process for identifying more reliable paths for previously registered nodes.
[0050] The meter that receives the Initiate Node Scan Response request responds by performing a node scan process similar to that described above at steps 310 through 328. More specifically, the meter broadcasts a request to which all unregistered nodes respond. The request comprises the number of timeslots available for responding nodes (which is used to set the period for the node to wait for responses), the unique address of the collector that initiated the node scan procedure, a measure of the reliability of the communications between the sending node and the collector (which is used in the process of determining whether a meter's path may be switched as defined below in connection with FIG. 5 ), the level within the subnet of the node sending the request, and an RSSI threshold (which is used in the process of determining whether a registered meter's path may be switched as described below in connection with FIG. 4 ). The meter issuing the node scan request waits for and receives responses. For each response, the meter stores in memory the unique identifier and the RSSI value of the response. At step 342, collector 116 waits while the response are collected at the meter that issued the node scan. At step 344, collector 116 retrieves the node information that has been collected by the meter. At step 346, collector 116 parses the information and selects one of the meters or potential nodes in the list of retrieved data.
[0051] Collector 116 attempts to register meters 114 that will have a reliable data communication path. Accordingly, at step 348, collector 116 compares the RSSI value for the selected meter 114 with a selected threshold value. If the RSSI value is not greater than the threshold value, at step 350, collector 116 determines if the particular meter was previously identified as having responded to a Node Scan Response request but having not met the RSSI threshold. Specifically, collector 116 may refer to its Straggler table or similar file where it maintains a list of meters 114 that meet this criteria. If so, at step 352, collector 116 compares the RSSI value with the previously stored value. If the new RSSI value is greater than the previous value, at step 354, collector updates the Straggler table to identify the new RSSI value and the new communication path. If at step 352, the new RSSI value is not greater than the previous value, processing continues at step 362. If at step 350, it is determined that the particular meter 114 is not in the Straggler table, processing continues at step 354, where the Straggler table is updated to reflect the meter identifier, the communication path to is this meter and the RSSI value. Thereafter, processing continues at step 362.
[0052] If at step 348, the RSSI value exceeded the threshold, at step 360, collector 116 registers the node. Registering a meter 114 comprises updating a list of the registered nodes at collector 116. For example, the list may be updated to identify the meter's unique identifier and the level of the meter in the subnet, i.e. whether the meter is a level one node, level two node, etc. Additionally, the collector's 116 registration information is updated to reflect that the meter 114 from which the scan process was initiated is identified as a repeater for the newly registered node. The registration process further comprises transmitting information to the newly registered meter as well as the meter that will serve as a repeater for the newly added node. For example, the node that issued the node scan response request is updated to identify that it operates as a repeater and, if it was previously registered as a repeater, increments a data item identifying the number of nodes for which it serves as a repeater. Thereafter, collector 116 forwards to the newly registered meter an indication that it is registered, an identification of the collector 116 with which it is registered, the level the meter exists at in the subnet, and the unique identifier of the node with which it communicates to forward information to collector 116.
[0053] At step 362, collector 116 determines if there are additional nodes identified in the information retrieved from the meter 114 that performed the node scan request. If so, processing continues at step 346.
[0054] If at step 362, there are no potential nodes to be evaluated, at step 364, collector 116 determines if there are other registered nodes on the same level that have not been directed to perform a node scan. For example, if level 1 nodes are being scanned for potential level 2 nodes, at step 364 collector 116 determines if there are any level 1 nodes that have not yet performed a node scan procedure. If so, processing continues at step 340 wherein collector requests that a node scan procedure be performed at the node.
[0055] If at step 364, all nodes at the level of the subnet under evaluation have been reviewed, processing continues at step 368, with collector 116 determining if there are registered meters at the next level of the subnet. If so, processing continues at step 340 with node scans being performed at this next level.
[0056] If at step 368 there are no registered nodes at the next higher level, at step 370, collector 116 registers the nodes identified in the list of meters that have responded but did not meet the RSSI threshold. At this point in the process, presumably, the list comprises the best path identified for each of the unregistered meters that responded, even if that path does not meet the desired RSSI threshold. If during operation of the network, a meter registered in this manner fails to perform adequately, it may be assigned a different path or possibly to a different collector as described below.
[0057] As previously mentioned, a full node scan may be performed when a collector 116 is first introduced to a network. At the conclusion of the full node scan, a collector 116 will have registered a set of meters 114 with which it communicates and reads metering data. Full node scans might be periodically performed by an installed collector to identify new meters 114 that have been brought on-line since the last node scan and to allow registered meters to switch to a different path.
[0058] In addition to the full node scan, collector 116 may also perform a process of scanning specific meters 114 in the subnet 120, which is referred to as a “node scan retry.” For example, collector 116 may issue a specific request to a meter 114 to perform a node scan outside of a full node scan when on a previous attempt to scan the node, the collector 116 was unable to confirm that the particular meter 114 received the node scan request. Also, a collector 116 may request a node scan retry of a meter 114 when during the course of a full node scan the collector 116 was unable to read the node scan data from the meter 114. Similarly, a node scan retry will be performed when an exception procedure requesting an immediate node scan is received from a meter 114.
[0059] According to an aspect of the disclosed embodiment, system 110 automatically reconfigures to accommodate a new meter 114 that may be added. More particularly, the system identifies that the new meter has begun operating and identifies a path to a collector 116 that will become responsible for collecting the metering data. A flow chart of a process for adding a new meter is depicted in FIG. 4 . As shown, at step 410, the new meter broadcasts an indication that it is unregistered. In one embodiment, this broadcast might be, for example, embedded in, or relayed as part of a request for an update of the real time as described above. At step 412, the broadcast is received at one of the registered meters 114 in proximity to the meter that is attempting to register. At step 414, the registered meter 114 forwards the time to the meter that is attempting to register. At step 416, the registered node also transmits an exception request to its collector 116 requesting that the collector 116 implement a node scan, which presumably will locate and register the new meter. At step 418, the collector 116 transmits a request that the registered node perform a node scan. At step 420, the registered node performs the node scan during which it requests that all unregistered nodes respond. At step 422, the newly added, unregistered meter responds to the node scan. At step 424, the unique identifier of the newly added node along with the RSSI value of its response are stored on the registered node. At step 426, collector 116 retrieves the response data. If at step 428 the RSSI value of the response from the new meter exceeds the established RSSI threshold, at step 430 collector 116 updates its data files to identify the new meter as being registered and transmits a registration notification to the new meter. If at step 428 the RSSI value does not exceed the threshold, the unique identifier is added to the list of unregistered nodes, at step 432. The newly added meter will continue to broadcast that it is unregistered and ultimately will be registered through a meter with which it satisfies the RSSI threshold.
[0060] A collector 116 periodically retrieves meter data from the meters that are registered with it. For example, meter data may be retrieved from a meter every 4 hours. Where there is a problem with reading the meter data on the regularly scheduled interval, the collector will try to read the data again before the next regularly scheduled interval. Nevertheless, there may be instances wherein the collector 116 is unable to read metering data from a particular meter 114 for a prolonged period of time. The meters 114 store an indication of when they are read by collector 116 and keep track of the time since their data has last been collected by the collector 116. If the length of time since the last reading exceeds a defined threshold such as for example, 18 hours, presumably a problem has arisen in the communication path between the particular meter 114 and the collector 116. Accordingly, the meter 114 changes its status to that of an unregistered meter and attempts to locate a new path to a collector 116 via the process described above in connection with FIG. 3 . Thus, the exemplary system is operable to dynamically reconfigure itself to address inadequacies in the system.
[0061] In some instances, while a collector 116 may be able to retrieve data from a registered meter 114 occasionally, the level of success in reading the meter may be inadequate. For example, if a collector 116 attempts to read meter data from a meter 114 every 4 hours but is able to read the data, for example, only 70 percent of the time or less, it may be desirable to find a more reliable path for reading the data from that particular meter. Where the frequency of reading data from a meter 114 falls below a desired frequency, the collector 116 transmits a message to the meter 114 to respond to node scans going forward. The meter 114 remains registered but will respond to node scans such as are described above in connection with FIG. 3 . If the meter 114 responds to a node scan procedure, the collector 116 recognizes the response as originating from a registered meter. The collector 116 verifies that the RSSI value of the node scan response exceeds the established threshold. If it does not, the potential path is not acceptable. However, if the RSSI threshold is met, the collector 116 initiates a qualification procedure whereby it makes several attempts to reach the meter through the potential path. If the collector is successful in establishing communication with the meter through the potential path more than an acceptable percentage of the time, e.g. 80 percent, then the collector registers the meter in the new path. The registration process comprises updating the collector 116 and meter 114 with data identifying the repeater with which the meter 114 will communicate. Additionally, if the repeater has not previously performed the operation of a repeater, the repeater would need to be updated to identify that it is a repeater. Likewise, the repeater with which the meter previously communicated is updated to identify that it is no longer a repeater for the particular meter 114.
[0062] In some instances, a more reliable communication path for a meter may exist through a collector other than that with which the meter is registered. A meter may automatically recognize the existence of the more reliable communication path, switch collectors, and notify the previous collector that the change has taken place. FIG. 5 provides a flow chart of a method for switching the registration of a meter from a first collector to a second collector. As shown, at step 510, a registered meter 114 receives a node scan request from a collector 116 other than that with which the meter is registered. Typically, a registered meter 114 does not respond to node scan requests. However, if the request is likely to result in a more reliable transmission path, even a registered meter may respond. Accordingly, at step 512, the meter determines if the new collector offers a potentially more reliable transmission path. For example, the meter 114 may determine if the path to the potential new collector 116 comprises fewer hops than the path to the collector with which the meter is registered. If not, the path may not be more reliable and the meter 114 will not respond to the node scan. The meter 114 might also determine if the RSSI of the node scan packet exceeds an RSSI threshold identified in the node scan information. If so, the new collector may offer a more reliable transmission path for meter data. If not, the transmission path is not acceptable and the meter does not respond. Additionally, if the reliability of communication between the potential new collector and the repeater that would service the meter meets a threshold established when the repeater was registered with its existing collector, the communication path to the new collector may be more reliable. If the reliability does not exceed this threshold, however, the meter 114 does not respond to the node scan.
[0063] If at step 512, it is determined that the path to the new collector may be better than the path to its existing collector, at step 514, the meter 114 responds to the node scan. Included in the response is information regarding any nodes for which the particular meter may operate as a repeater. For example, the response might identify the number of nodes for which the meter serves as a repeater.
[0064] At step 516, collector 116 determines if it has the capacity to service the meter and any meters for which it operates as a repeater. If not, the collector 116 does not respond to the meter that is attempting to change collectors. If, however, the collector 116 determines that it has capacity to service the meter 114, at step 518, the collector 116 stores registration information about the meter 114. At step 520, collector 116 transmits a registration command to meter 114. At step 522, the meter 114 updates its registration data to identify that it is now registered with the new collector. At step 524, collector 116 communicates instruction to the meter 114 to initiate a node scan request. Nodes that are unregistered, or that had previously used meter 114 as a repeater respond to the request to identify themselves to collector 116. The collector registers these nodes as is described above in connection with registering new meters/nodes.
[0065] Under some circumstances it may be necessary to change a collector. For example, a collector may be malfunctioning, and need to be taken off-line. Accordingly, a new communication path must be provided for collecting meter data from the meters serviced by the particular collector. The process of replacing a collector is performed by broadcasting a message to unregister, usually from a replacement collector, to all of the meters that are registered with the collector that is being removed from service. According to an aspect of the disclosed embodiment, registered meters may be programmed to only respond to commands from the collector with which they are registered. Accordingly, the command to unregister may comprise the unique identifier of the collector that is being replaced. In response to the command to unregister, the meters begin to operate as unregistered meters and respond to node scan requests. To allow the unregistered command to propagate through the subnet, when a node receives the command it will not unregister immediately, but rather remain registered for a defined period, which may be referred to as the “Time to Live”. During this time to live period, the nodes continue to respond to application layer and immediate retries allowing the unregistration command to propagate to all nodes in the subnet. Ultimately, the meters register with the replacement collector as described above in connection with FIG. 3 .
[0066] One of collector's 116 main responsibilities within subnet 120 is to retrieve metering data from meters 114. The self-configuring and self-healing characteristics of system 110 provide that collectors 116 have improved reliability in reading usage data. Generally, meters 114 store data regarding usage of electricity, gas, water, etc. in memory. Collector 116 periodically retrieves this data from nodes in its subnet 120. In an embodiment, collector 116 has as a goal to obtain at least one successful read of the metering data per day from each node in its subnet. Collector 116 attempts to retrieve the data from all nodes in its subnet 120 at a configurable periodicity. For example, collector 116 may be configured to attempt to retrieve metering data from meters 114 in its subnet 120 once every 4 hours. FIG. 6 depicts a flow chart of a process for retrieving data from meters 114 in a subnet 120. As shown, at step 610, collector 116 identifies one of the meters 114 in its subnet 120. For example, collector 116 reviews a list of registered nodes and identifies one for reading. At step 612, collector 116 communicates a command to the particular meter 114 that it forward its metering data to the collector 116. If at step 614, the meter reading is successful and the data is received at collector 116, at step 616 collector 116 determines if there are other meters that have not been read during the present reading session. If so, processing continues at step 610. However, if all of the meters 114 in subnet 120 have been read, at step 618, collector waits a defined length of time, such as, for example, 4 hours, before attempting another read.
[0067] If at step 614, the meter data was not received at collector 116, at step 620 collector 116 begins a retry procedure wherein it attempts to retry the data read from the particular meter. Collector 116 continues to attempt to read the data from the node until either the data is read or the next subnet reading takes place. In an embodiment, collector 116 attempts to read the data every 60 minutes. Thus, wherein a subnet reading is taken every 4 hours, collector 116 may issue three retries between subnet readings.
[0068] The inability to read metering data may be the result of communication failures that can take place at the packet communication level. For example, if for each hop the probability of successful communications is 95%, a level 8 node requires 16 message hops, which would result in a 44% probability a successful round trip message. If 2 immediate retries are used for each hop, the per hop probability increases from 95% to 99.98% and the probability of a successful round trip message increases to 99.8%. Accordingly, in an embodiment of the disclosed system, with each successive retry to read data from a node, the number of packet level retries increases. For example, if during a normal read attempt one packet level retry is undertaken, when an application level retry to read the data is made by the collector, two or more packet level retries may be implemented. Thus, as the number of application level retries increases, so does the number of packet level retries. Furthermore, the number of packet level retries varies according to the level at which the particular meter 114 exists in the subnet 120. The higher the level, the greater the number of packet level retries. The table below lists exemplary packet level retries for various subnet levels and various numbers of prior application level retry attempts.
[0069]
| Application Layer Attempt | ||||
| 1 | 2 | ≧3 | ||
| Levels 1 and 2 | 1 | 2 | 3 | |
| Levels 3 and 4 | 2 | 3 | 4 | |
| Levels 5–6 | 2 | 3 | 4 | |
| Levels > 6 | 3 | 4 | 5 | |
[0070] In an embodiment of system 120, meters 114 are typically two-way meters—i.e. they are operable to both receive and transmit data. However, one-way meters that are operable only to transmit and not receive data may also be deployed in the system 110. FIG. 7 provides a flow chart of a process for reading data from one-way meters deployed in the system. As shown, at step 710 a one-way meter broadcasts their usage data. At step 712, this data is received at one or more two-way meters that are in proximity to the one-way meter. At step 714, the data is stored on the two-way meter, and designated as having been received from the one-way meter. At step 716, the data from the one-way meter is communicated to the collector with which the two-way meter is registered. For example, when the collector reads the two-way meter data, it recognizes the existence of meter data from the one-way meter and reads it as well. At step 718, after the data from the one-way meter has been read, it is removed from memory.
[0071] A block diagram for an exemplary meter device operable to perform as meter 114 or collector 116 as described above is depicted in FIG. 8 . As shown, meter device 810 comprises metering electronics 812 for physically measuring the amount of a service or commodity that is used, and wireless communications electronics 814 for transmitting and receiving data to other meter devices. Device 810 further comprises memory 816 for storing data and executable instructions for performing methods as described above. Processor 818 is operable to execute the instructions stored in memory 816. Device 810 may further comprise visual display 818 for displaying metering data at device 810. Wire-based communications electronics 820 provides the capability to communicate with device 810 via means other than wirelessly. For example, wire-based communications electronics 820 may comprise a modem for communicating over telephone lines or a network protocol transceiver for communicating over a dedicated local area or wide area network.
[0072] FIG. 9 is a diagram of a generic computing device, which may be operable to perform the steps described above as being performed by communications server 122. As shown in FIG. 9 , communications server 922 includes processor 922, system memory 924, and system bus 926 that couples various system components including system memory 924 to processor 922. System memory 924 may include read-only memory (ROM) and/or random access memory (RAM). Computing device 920 may further include hard-drive 928, which provides storage for computer readable instructions, data structures, program modules, data, and the like. A user (not shown) may enter commands and information into the computing device 920 through input devices such as keyboard 940 or mouse 942. A display device 944, such as a monitor, a flat panel display, or the like is also connected to computing device 920. Communications device 943, which may be a modem, network interface card, or the like, provides for communications over a network. System memory 924 and/or hard-drive 928 may be loaded with any one of several computer operating systems such as WINDOWS NT operating system, WINDOWS 2000 operating system, LINUX operating system, and the like.
[0073] Those skilled in the art understand that processor readable instructions for implementing the above-described processes, such as those described with reference to FIGS. 2 through 7 can be generated and stored in processor-readable memory and processor-readable media such as a magnetic disk or CD-ROM. Further, a computing system such as that described with reference to FIG. 9 may be arranged with metering devices such as that described in FIG. 8 , and the devices loaded with processor-readable instructions for performing the above described processes. Specifically, referring to FIGS. 8 and 9 , processors 922 and 818 may be programmed to operate in accordance with the above-described processes.
[0074] Thus, a dynamic self-configuring system for gathering metering data has been disclosed. This novel system and the methods performed therein provide a reliable and efficient means to collect metering data with minimal human intervention. Furthermore, the system requires minimal human interaction to configure and upgrade efficiencies.
[0075] While systems and methods have been described and illustrated with reference to specific embodiments, those skilled in the art will recognize that modification and variations may be made without departing from the principles described above and set forth in the following claims. For example, while communication server 122 has been described as communicating with collectors 116 via a dial-up connection, the communication may take place wirelessly. Accordingly, reference should be made to the following claims as describing the scope of disclosed embodiments.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. In a network having a collector that receives data from nodes and communicates the data to a communication server, a method of registering said nodes to communicate with said collector, comprising:
initiating a node scan to establish communication between said collector and said nodes;
determining a reliability of a data communication path between said collector and a node that responds to said node scan; and
registering said node if said node has a reliability above a first predetermined threshold;
repeating said node scan at said collector multiple times to insure all first level nodes that are capable of receiving said node scan have responded by comparing the number of nodes scans performed to a predetermined number of scans.
2. The method of claim 1, further comprising:
maintaining a database of nodes that have a reliability below said first predetermined threshold.
3. The method of claim 1, further comprising:
initiating said node scan on a predetermined subset of said nodes.
4. The method of claim 1, further comprising:
determining said reliability in accordance with a received signal strength value for said nodes that respond to said node scan.
5. The method of claim 4, wherein said first predetermined threshold is a received signal strength value of −60 dBm.
6. The method of claim 1, wherein registering a node that has a reliability above a predetermined threshold further comprises:
updating a list of registered nodes at said collector to include said node being registered; and
transmitting registration information to said node.
7. The method of claim 1, wherein updating said list comprises updating at least one of a unique identifier of said node, said data communication path to said node, and a level of said node in a subnet that communicates to said collector.
8. The method of claim 1, wherein transmitting registration information to said node comprises transmitting at least one of a unique identifier of said collector, said data communication path to said collector, a level of said node in a subnet that communicates to said collector, and a second meter with which said meter should communicate.
9. The method of claim 1, further comprising:
performing said node scan at successively higher level nodes beginning with said first level nodes through nth-1 level nodes to register second level nodes through nth level nodes;
updating a list of registered nodes in accordance with responses that are received from said second level nodes through said nth level nodes; and
transmitting registration information to said second level nodes through said nth level nodes.
10. The method of claim 9, wherein said collector requests said successively higher level nodes to perform said node scan, and wherein said request comprises at least one of a number of timeslots available for responding nodes, a unique address of said collector, a level within said subnet of the node sending the request, and said reliability of said data communication path.
11. The method of claim 9, wherein updating said list comprises updating at least one of a unique identifier of said second level nodes through said nth level nodes, said data communication path to said second level nodes through said nth level nodes, and a level of said second level nodes through said nth level nodes in a subnet that communicates to said collector.
12. The method of claim 9, wherein transmitting registration information to said second level nodes through said nth level nodes comprises transmitting at least one of a unique identifier of said collector, said data communication path to said collector, a level of said second level nodes through said nth level nodes in a subnet that communicates to said collector, and a second meter with which said meter should communicate.
13. The method of claim 1, further comprising:
determining a level of success in communicating with said node; and
if said level of success is below a second predetermined threshold, instructing said node to respond to subsequent node scans.
14. The method of claim 13, further comprising:
changing a collector to which said node communicates to a second collector in response to a subsequent node scan;
qualifying said node wherein said second collector makes plural attempts to communicate to said node; and
registering said node to said second collector if a predetermined number of said plural attempts to communicate are successful.
15. A network communication system comprising collectors that receive data from nodes registered with said collectors, and said collectors communicating the received data to a communication server, a method of qualifying communication between said nodes and said collectors, comprising:
maintaining a list of nodes registered with a first collector;
determining a level of success of communication between a first node and said first collector; and
if said level of success is below a predetermined threshold, instructing said first node to respond to subsequent node scans, wherein node scans are initiated by each collector to register nodes that are in communication with said each collector;
changing a collector to which said first node communicates to a second collector in response to a subsequent node scan;
qualifying said node wherein said second collector makes plural attempts to communicate to said node; and
registering said node to said second collector if a predetermined number of said plural attempts to communicate are successful;
organizing said nodes into levels beginning with a first level that communicate directly with said collectors through nth level that communicate directly to an nth-1 level;
performing said subsequent node scans at successively higher levels beginning with first level nodes through nth-1 level nodes to register second level nodes through nth level nodes; and
updating a list of registered nodes in accordance with responses that are received from said second level nodes through said nth level nodes.
16. The method of claim 15, wherein said first node comprises any node among nodes organized in said first level through nth level.
Patent Citations (339)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3445815(A) | 1969-05-01 | Saltzberg et al. | Applicant |
| US3858212(A) | 1974-12-01 | Tompkins et al. | Applicant |
| US3878512(A) | 1975-04-01 | Kobayashi et al. | Applicant |
| US3973240(A) | 1976-08-01 | Fong | Applicant |
| US4031513(A) | 1977-06-01 | Simciak | Applicant |
| US4056107(A) | 1977-11-01 | Todd et al. | Applicant |
| US4066964(A) | 1978-01-01 | Costanza et al. | Applicant |
| US4132981(A) | 1979-01-01 | White | Applicant |
| US4190800(A) | 1980-02-01 | Kelly, Jr. et al. | Applicant |
| US4204195(A) | 1980-05-01 | Bogacki | Applicant |
| US4218737(A) | 1980-08-01 | Buscher et al. | Applicant |
| US4250489(A) | 1981-02-01 | Dudash et al. | Applicant |
| US4254472(A) | 1981-03-01 | Juengel et al. | Applicant |
| US4319358(A) | 1982-03-01 | Sepp | Applicant |
| US4321582(A) | 1982-03-01 | Banghart | Applicant |
| US4322842(A) | 1982-03-01 | Martinez | Applicant |
| US4328581(A) | 1982-05-01 | Harmon et al. | Applicant |
| US4361851(A) | 1982-11-01 | Asip et al. | Applicant |
| US4361890(A) | 1982-11-01 | Green, Jr. et al. | Applicant |
| US4396915(A) | 1983-08-01 | Farnsworth et al. | Applicant |
| US4405829(A) | 1983-09-01 | Rivest et al. | Applicant |
| US4415896(A) | 1983-11-01 | Allgood | Applicant |
| US4466001(A) | 1984-08-01 | Moore et al. | Applicant |
| US4504831(A) | 1985-03-01 | Jahr et al. | Applicant |
| US4506386(A) | 1985-03-01 | Ichikawa et al. | Applicant |
| US4513415(A) | 1985-04-01 | Martinez | Applicant |
| US4525861(A) | 1985-06-01 | Freeburg | Applicant |
| US4600923(A) | 1986-07-01 | Hicks et al. | Applicant |
| US4608699(A) | 1986-08-01 | Batlivala et al. | Applicant |
| US4611333(A) | 1986-09-01 | McCallister et al. | Applicant |
| US4614945(A) | 1986-09-01 | Brunius et al. | Applicant |
| US4617566(A) | 1986-10-01 | Diamond | Applicant |
| US4628313(A) | 1986-12-01 | Gombrich et al. | Applicant |
| US4631538(A) | 1986-12-01 | Carreno | Applicant |
| US4638298(A) | 1987-01-01 | Spiro | Applicant |
| US4644321(A) | 1987-02-01 | Kennon | Applicant |
| US4653076(A) | 1987-03-01 | Jerrim et al. | Applicant |
| US4672555(A) | 1987-06-01 | Hart et al. | Applicant |
| US4680704(A) | 1987-07-01 | Konicek et al. | Applicant |
| US4688038(A) | 1987-08-01 | Giammarese | Applicant |
| US4692761(A) | 1987-09-01 | Robinton | Applicant |
| US4707852(A) | 1987-11-01 | Jahr et al. | Applicant |
| US4713837(A) | 1987-12-01 | Gordon | Applicant |
| US4724435(A) | 1988-02-01 | Moses et al. | Applicant |
| US4728950(A) | 1988-03-01 | Hendrickson et al. | Applicant |
| US4734680(A) | 1988-03-01 | Gehman et al. | Applicant |
| US4749992(A) | 1988-06-01 | Fitzemeyer et al. | Applicant |
| US4757456(A) | 1988-07-01 | Benghiat | Applicant |
| US4769772(A) | 1988-09-01 | Dwyer | Applicant |
| US4783748(A) | 1988-11-01 | Swarztrauber et al. | Applicant |
| US4792946(A) | 1988-12-01 | Mayo | Applicant |
| US4799059(A) | 1989-01-01 | Grindahl et al. | Applicant |
| US4804938(A) | 1989-02-01 | Rouse et al. | Applicant |
| US4804957(A) | 1989-02-01 | Selph et al. | Applicant |
| US4811011(A) | 1989-03-01 | Sollinger | Applicant |
| US4827514(A) | 1989-05-01 | Ziolko et al. | Applicant |
| US4833618(A) | 1989-05-01 | Verma et al. | Applicant |
| US4839645(A) | 1989-06-01 | Lill | Applicant |
| US4841545(A) | 1989-06-01 | Endo et al. | Applicant |
| US4860379(A) | 1989-08-01 | Schoeneberger et al. | Applicant |
| US4862493(A) | 1989-08-01 | Venkataraman et al. | Applicant |
| US4868877(A) | 1989-09-01 | Fischer | Applicant |
| US4884021(A) | 1989-11-01 | Hammond et al. | Applicant |
| US4912722(A) | 1990-03-01 | Carlin | Applicant |
| US4922518(A) | 1990-05-01 | Gordon et al. | Applicant |
| US4939726(A) | 1990-07-01 | Flammer et al. | Applicant |
| US4940974(A) | 1990-07-01 | Sojka | Applicant |
| US4940976(A) | 1990-07-01 | Gastouniotis et al. | Applicant |
| US4958359(A) | 1990-09-01 | Kato | Applicant |
| US4964138(A) | 1990-10-01 | Nease et al. | Applicant |
| US4965533(A) | 1990-10-01 | Gilmore | Applicant |
| US4972507(A) | 1990-11-01 | Lusignan | Applicant |
| US5007052(A) | 1991-04-01 | Flammer | Applicant |
| US5018165(A) | 1991-05-01 | Sohner et al. | Applicant |
| US5022046(A) | 1991-06-01 | Morrow, Jr. | Applicant |
| US5032833(A) | 1991-07-01 | Laporte | Applicant |
| US5053766(A) | 1991-10-01 | Ruiz-del-Portal et al. | Applicant |
| US5053774(A) | 1991-10-01 | Schuermann et al. | Applicant |
| US5056107(A) | 1991-10-01 | Johnson et al. | Applicant |
| US5067136(A) | 1991-11-01 | Arthur et al. | Applicant |
| US5079715(A) | 1992-01-01 | Venkataraman et al. | Applicant |
| US5079768(A) | 1992-01-01 | Flammer | Applicant |
| US5086292(A) | 1992-02-01 | Johnson et al. | Applicant |
| US5086385(A) | 1992-02-01 | Launey | Applicant |
| US5090024(A) | 1992-02-01 | Vander Mey et al. | Applicant |
| US5111479(A) | 1992-05-01 | Akazawa | Applicant |
| US5115433(A) | 1992-05-01 | Baran et al. | Applicant |
| US5115448(A) | 1992-05-01 | Mori | Applicant |
| US5129096(A) | 1992-07-01 | Burns | Applicant |
| US5130987(A) | 1992-07-01 | Flammer | Applicant |
| US5132985(A) | 1992-07-01 | Hashimoto et al. | Applicant |
| US5136614(A) | 1992-08-01 | Hiramatsu et al. | Applicant |
| US5142694(A) | 1992-08-01 | Jackson et al. | Applicant |
| US5151866(A) | 1992-09-01 | Glaser et al. | Applicant |
| US5155481(A) | 1992-10-01 | Brennan, Jr. et al. | Applicant |
| US5160926(A) | 1992-11-01 | Schweitzer, III | Applicant |
| US5166664(A) | 1992-11-01 | Fish | Applicant |
| US5177767(A) | 1993-01-01 | Kato | Applicant |
| US5179376(A) | 1993-01-01 | Pomatto | Applicant |
| US5189694(A) | 1993-02-01 | Garland | Applicant |
| US5194860(A) | 1993-03-01 | Jones et al. | Applicant |
| US5197095(A) | 1993-03-01 | Bonnet | Applicant |
| US5204877(A) | 1993-04-01 | Endo et al. | Applicant |
| US5214587(A) | 1993-05-01 | Green | Applicant |
| US5225994(A) | 1993-07-01 | Arinobu et al. | Applicant |
| US5228029(A) | 1993-07-01 | Kotzin | Applicant |
| US5229996(A) | 1993-07-01 | Bäckström et al. | Applicant |
| US5239575(A) | 1993-08-01 | White et al. | Applicant |
| US5239584(A) | 1993-08-01 | Hershey et al. | Applicant |
| US5243338(A) | 1993-09-01 | Brennan, Jr. et al. | Applicant |
| US5252967(A) | 1993-10-01 | Brennan et al. | Applicant |
| US5260943(A) | 1993-11-01 | Comroe et al. | Applicant |
| US5270704(A) | 1993-12-01 | Sosa Quintana et al. | Applicant |
| US5280498(A) | 1994-01-01 | Tymes et al. | Applicant |
| US5280499(A) | 1994-01-01 | Suzuki | Applicant |
| US5285469(A) | 1994-02-01 | Vanderpool | Applicant |
| US5287287(A) | 1994-02-01 | Chamberlain et al. | Applicant |
| US5289497(A) | 1994-02-01 | Jacobson et al. | Applicant |
| US5295154(A) | 1994-03-01 | Meier et al. | Applicant |
| US5307349(A) | 1994-04-01 | Shloss et al. | Applicant |
| US5311541(A) | 1994-05-01 | Sanderford, Jr. | Applicant |
| US5311542(A) | 1994-05-01 | Eder | Applicant |
| US5315531(A) | 1994-05-01 | Oravetz et al. | Applicant |
| US5319679(A) | 1994-06-01 | Bagby | Applicant |
| US5329547(A) | 1994-07-01 | Ling | Applicant |
| US5345225(A) | 1994-09-01 | Davis | Applicant |
| US5359625(A) | 1994-10-01 | Vander Mey et al. | Applicant |
| US5377222(A) | 1994-12-01 | Sanderford, Jr. | Applicant |
| US5381462(A) | 1995-01-01 | Larson et al. | Applicant |
| US5383134(A) | 1995-01-01 | Wrzesinski | Applicant |
| US5384712(A) | 1995-01-01 | Oravetz et al. | Applicant |
| US5387873(A) | 1995-02-01 | Muller et al. | Applicant |
| US5390360(A) | 1995-02-01 | Scop et al. | Applicant |
| US5406495(A) | 1995-04-01 | Hill | Applicant |
| US5416917(A) | 1995-05-01 | Adair et al. | Applicant |
| US5420799(A) | 1995-05-01 | Peterson et al. | Applicant |
| US5428636(A) | 1995-06-01 | Meier | Applicant |
| US5430759(A) | 1995-07-01 | Yokev et al. | Applicant |
| US5432507(A) | 1995-07-01 | Mussino et al. | Applicant |
| US5432815(A) | 1995-07-01 | Kang et al. | Applicant |
| US5438329(A) | 1995-08-01 | Gastouniotis et al. | Applicant |
| US5448230(A) | 1995-09-01 | Schanker et al. | Applicant |
| US5448570(A) | 1995-09-01 | Toda et al. | Applicant |
| US5450088(A) | 1995-09-01 | Meier et al. | Applicant |
| US5452465(A) | 1995-09-01 | Geller et al. | Applicant |
| US5455533(A) | 1995-10-01 | Köllner | Applicant |
| US5455544(A) | 1995-10-01 | Kechkaylo | Applicant |
| US5455569(A) | 1995-10-01 | Sherman et al. | Applicant |
| US5455822(A) | 1995-10-01 | Dixon et al. | Applicant |
| US5457713(A) | 1995-10-01 | Sanderford, Jr. et al. | Applicant |
| US5461558(A) | 1995-10-01 | Patsiokas et al. | Applicant |
| US5463657(A) | 1995-10-01 | Rice | Applicant |
| US5473322(A) | 1995-12-01 | Carney | Applicant |
| US5475742(A) | 1995-12-01 | Gilbert | Applicant |
| US5475867(A) | 1995-12-01 | Blum | Applicant |
| US5479442(A) | 1995-12-01 | Yamamoto | Applicant |
| US5481259(A) | 1996-01-01 | Bane | Applicant |
| US5488608(A) | 1996-01-01 | Flammer, III | Applicant |
| US5491473(A) | 1996-02-01 | Gilbert | Applicant |
| US5493287(A) | 1996-02-01 | Ane | Applicant |
| US5495239(A) | 1996-02-01 | Ouellette | Applicant |
| US5497424(A) | 1996-03-01 | Vanderpool | Applicant |
| US5499243(A) | 1996-03-01 | Hall | Applicant |
| US5500871(A) | 1996-03-01 | Kato et al. | Applicant |
| US5511188(A) | 1996-04-01 | Pascucci et al. | Applicant |
| US5519388(A) | 1996-05-01 | Adair, Jr. | Applicant |
| US5521910(A) | 1996-05-01 | Matthews | Applicant |
| US5522044(A) | 1996-05-01 | Pascucci et al. | Applicant |
| US4749992(A) | 1996-06-01 | Fitzmeyer et al. | Applicant |
| US5524280(A) | 1996-06-01 | Douthitt et al. | Applicant |
| US5525898(A) | 1996-06-01 | Lee, Jr. et al. | Applicant |
| US5526389(A) | 1996-06-01 | Buell et al. | Applicant |
| US5528507(A) | 1996-06-01 | McNamara et al. | Applicant |
| US5528597(A) | 1996-06-01 | Gerszberg et al. | Applicant |
| US5539775(A) | 1996-07-01 | Tuttle et al. | Applicant |
| US5541589(A) | 1996-07-01 | Delaney | Applicant |
| US5544036(A) | 1996-08-01 | Brown, Jr. et al. | Applicant |
| US5546424(A) | 1996-08-01 | Miyake | Applicant |
| US5548527(A) | 1996-08-01 | Hemminger et al. | Applicant |
| US5548633(A) | 1996-08-01 | Kujawa et al. | Applicant |
| US5553094(A) | 1996-09-01 | Johnson et al. | Applicant |
| US5555508(A) | 1996-09-01 | Munday et al. | Applicant |
| US5559870(A) | 1996-09-01 | Patton et al. | Applicant |
| US5566332(A) | 1996-10-01 | Adair et al. | Applicant |
| US5570084(A) | 1996-10-01 | Ritter et al. | Applicant |
| US5572438(A) | 1996-11-01 | Ehlers et al. | Applicant |
| US5574657(A) | 1996-11-01 | Tofte | Applicant |
| US5590179(A) | 1996-12-01 | Shincovich et al. | Applicant |
| US5592470(A) | 1997-01-01 | Rudrapatna et al. | Applicant |
| US5594740(A) | 1997-01-01 | LaDue | Applicant |
| US5602744(A) | 1997-02-01 | Meek et al. | Applicant |
| US5617084(A) | 1997-04-01 | Sears | Applicant |
| US5619192(A) | 1997-04-01 | Ayala | Applicant |
| US5619685(A) | 1997-04-01 | Schiavone | Applicant |
| US5621629(A) | 1997-04-01 | Hemminer et al. | Applicant |
| US5627759(A) | 1997-05-01 | Bearden et al. | Applicant |
| US5631636(A) | 1997-05-01 | Bane | Applicant |
| US5636216(A) | 1997-06-01 | Fox et al. | Applicant |
| US5640679(A) | 1997-06-01 | Lundqvist et al. | Applicant |
| US5659300(A) | 1997-08-01 | Dresselhuys et al. | Applicant |
| US5668803(A) | 1997-09-01 | Tymes et al. | Applicant |
| US5668828(A) | 1997-09-01 | Sanderford, Jr. et al. | Applicant |
| US5673252(A) | 1997-09-01 | Johnson et al. | Applicant |
| US5684472(A) | 1997-11-01 | Bane | Applicant |
| US5684799(A) | 1997-11-01 | Bigham et al. | Applicant |
| US5691715(A) | 1997-11-01 | Ouellette | Applicant |
| US5692180(A) | 1997-11-01 | Lee | Applicant |
| US5696501(A) | 1997-12-01 | Ouellette et al. | Applicant |
| US5696765(A) | 1997-12-01 | Safadi | Applicant |
| US5696903(A) | 1997-12-01 | Mahany | Examiner |
| US5699276(A) | 1997-12-01 | Roos | Applicant |
| US5714931(A) | 1998-02-01 | Petite et al. | Applicant |
| US5715390(A) | 1998-02-01 | Hoffman et al. | Applicant |
| US5717604(A) | 1998-02-01 | Wiggins | Applicant |
| US5719564(A) | 1998-02-01 | Sears | Applicant |
| US5732078(A) | 1998-03-01 | Arango | Applicant |
| US5745901(A) | 1998-04-01 | Entner et al. | Applicant |
| US5748104(A) | 1998-05-01 | Argyroudis et al. | Applicant |
| US5748619(A) | 1998-05-01 | Meier | Applicant |
| US5751914(A) | 1998-05-01 | Coley et al. | Applicant |
| US5751961(A) | 1998-05-01 | Smyk | Applicant |
| US5754772(A) | 1998-05-01 | Leaf | Applicant |
| US5754830(A) | 1998-05-01 | Butts et al. | Applicant |
| US5757783(A) | 1998-05-01 | Eng et al. | Applicant |
| US5768148(A) | 1998-06-01 | Murphy et al. | Applicant |
| US5778368(A) | 1998-07-01 | Hogan et al. | Applicant |
| US5787437(A) | 1998-07-01 | Potterveld et al. | Applicant |
| US5790789(A) | 1998-08-01 | Suarez | Applicant |
| US5790809(A) | 1998-08-01 | Holmes | Applicant |
| US5801643(A) | 1998-09-01 | Williams et al. | Applicant |
| US5805712(A) | 1998-09-01 | Davis | Applicant |
| US5808558(A) | 1998-09-01 | Meek et al. | Applicant |
| US5809059(A) | 1998-09-01 | Souissi et al. | Applicant |
| US5822521(A) | 1998-10-01 | Gartner et al. | Applicant |
| US5850187(A) | 1998-12-01 | Carrender et al. | Applicant |
| US5862391(A) | 1999-01-01 | Salas et al. | Applicant |
| US5872774(A) | 1999-02-01 | Wheatley, III et al. | Applicant |
| US5874903(A) | 1999-02-01 | Shuey et al. | Applicant |
| US5875183(A) | 1999-02-01 | Nitadori | Applicant |
| US5875402(A) | 1999-02-01 | Yamawaki | Applicant |
| US5884184(A) | 1999-03-01 | Sheffer | Applicant |
| US5892758(A) | 1999-04-01 | Argyroudis | Applicant |
| US5896382(A) | 1999-04-01 | Davis et al. | Applicant |
| US5897607(A) | 1999-04-01 | Jenney et al. | Applicant |
| US5898387(A) | 1999-04-01 | Davis et al. | Applicant |
| US5907491(A) | 1999-05-01 | Canada et al. | Applicant |
| US5907540(A) | 1999-05-01 | Hayashi | Applicant |
| US5910799(A) | 1999-06-01 | Carpenter et al. | Applicant |
| US5923269(A) | 1999-07-01 | Shuey et al. | Applicant |
| US5926103(A) | 1999-07-01 | Petite | Applicant |
| US5926531(A) | 1999-07-01 | Petite | Applicant |
| US5943375(A) | 1999-08-01 | Veintimilla | Applicant |
| US5944842(A) | 1999-08-01 | Propp et al. | Applicant |
| US5953319(A) | 1999-09-01 | Dutta et al. | Applicant |
| US5959550(A) | 1999-09-01 | Giles | Applicant |
| US5960074(A) | 1999-09-01 | Clark | Applicant |
| US5963146(A) | 1999-10-01 | Johnson et al. | Applicant |
| US5974236(A) | 1999-10-01 | Sherman | Applicant |
| US5986574(A) | 1999-11-01 | Colton | Applicant |
| US6000034(A) | 1999-12-01 | Lightbody et al. | Applicant |
| US6028522(A) | 2000-02-01 | Petite | Applicant |
| US6034988(A) | 2000-03-01 | VanderMey et al. | Applicant |
| US6035201(A) | 2000-03-01 | Whitehead | Applicant |
| US6041056(A) | 2000-03-01 | Bigham et al. | Applicant |
| US6061604(A) | 2000-05-01 | Russ et al. | Applicant |
| US6067029(A) | 2000-05-01 | Durston | Applicant |
| US6073169(A) | 2000-06-01 | Shuey et al. | Applicant |
| US6073174(A) | 2000-06-01 | Montgomerie et al. | Applicant |
| US6078251(A) | 2000-06-01 | Landt et al. | Applicant |
| US6078785(A) | 2000-06-01 | Bush | Applicant |
| US6078909(A) | 2000-06-01 | Knutson | Applicant |
| US6088659(A) | 2000-07-01 | Kelley et al. | Applicant |
| US6091758(A) | 2000-07-01 | Ciccone et al. | Applicant |
| US6100817(A) | 2000-08-01 | Mason, Jr. et al. | Applicant |
| US6112192(A) | 2000-08-01 | Capek | Applicant |
| US6124806(A) | 2000-09-01 | Cunningham et al. | Applicant |
| US6128276(A) | 2000-10-01 | Agee | Applicant |
| US6137423(A) | 2000-10-01 | Glorioso et al. | Applicant |
| US6150955(A) | 2000-11-01 | Tracy et al. | Applicant |
| US6154487(A) | 2000-11-01 | Murai et al. | Applicant |
| US6160993(A) | 2000-12-01 | Wilson | Applicant |
| US6172616(B1) | 2001-01-01 | Johnson et al. | Applicant |
| US6195018(B1) | 2001-02-01 | Ragle et al. | Applicant |
| US6199068(B1) | 2001-03-01 | Carpenter | Applicant |
| US6208266(B1) | 2001-03-01 | Lyons et al. | Applicant |
| US6218953(B1) | 2001-04-01 | Petite | Applicant |
| US6233327(B1) | 2001-05-01 | Petite | Applicant |
| US6246677(B1) | 2001-06-01 | Nap et al. | Applicant |
| US6249516(B1) | 2001-06-01 | Brownrigg et al. | Applicant |
| US6333975(B1) | 2001-12-01 | Brunn et al. | Applicant |
| US6363057(B1) | 2002-03-01 | Ardalan et al. | Applicant |
| US6393341(B1) | 2002-05-01 | Lawrence et al. | Applicant |
| US6396839(B1) | 2002-05-01 | Ardalan et al. | Applicant |
| US6421731(B1) | 2002-07-01 | Ciotti, Jr. et al. | Applicant |
| US6430268(B1) | 2002-08-01 | Petite | Applicant |
| US6437692(B1) | 2002-08-01 | Petite et al. | Applicant |
| US6446192(B1) | 2002-09-01 | Narasimhan et al. | Applicant |
| US6643278(B1) | 2003-11-01 | Panasik et al. | Applicant |
| US6657549(B1) | 2003-12-01 | Avery | Applicant |
| US6684245(B1) | 2004-01-01 | Shuey et al. | Applicant |
| US6751563(B2) | 2004-06-01 | Spanier et al. | Applicant |
| US6867707(B1) | 2005-03-01 | Kelley et al. | Applicant |
| US2001/0002210(A1) | 2001-05-01 | Petite | Applicant |
| US2001/0024163(A1) | 2001-09-01 | Petite | Applicant |
| US2002/0012323(A1) | 2002-01-01 | Petite et al. | Applicant |
| US2002/0013679(A1) | 2002-01-01 | Petite | Applicant |
| US2002/0019712(A1) | 2002-02-01 | Petite et al. | Applicant |
| US2002/0019725(A1) | 2002-02-01 | Petite | Applicant |
| US2002/0026957(A1) | 2002-03-01 | Reyman | Applicant |
| US2002/0027504(A1) | 2002-03-01 | Davis et al. | Applicant |
| US2002/0031101(A1) | 2002-03-01 | Petite et al. | Applicant |
| US2002/0094799(A1) | 2002-07-01 | Elliott et al. | Applicant |
| US2002/0125998(A1) | 2002-09-01 | Petite et al. | Applicant |
| US2002/0145537(A1) | 2002-10-01 | Mueller et al. | Applicant |
| US2002/0169643(A1) | 2002-11-01 | Petite et al. | Applicant |
| US2003/0036810(A1) | 2003-02-01 | Petite | Applicant |
| US2003/0036822(A1) | 2003-02-01 | Davis et al. | Applicant |
| US2003/0123442(A1) | 2003-07-01 | Drucker et al. | Applicant |
| US2003/0202512(A1) | 2003-10-01 | Kennedy | Applicant |
| US2004/0113810(A1) | 2004-06-01 | Mason, Jr. et al. | Applicant |
| US2005/0270173(A1) | 2005-12-01 | Boaz | Applicant |
| CH682196(A5) | 1993-07-01 | Applicant | |
| EP395495(A1) | 1990-10-01 | Applicant | |
| EP446979(A1) | 1991-09-01 | Applicant | |
| EP629098(A2) | 1994-12-01 | Applicant | |
| GB2118340(A) | 1983-10-01 | Applicant | |
| GB2157448(A) | 1985-10-01 | Applicant | |
| GB2186404(A) | 1987-08-01 | Applicant | |
| GB2222898(A) | 1990-03-01 | Applicant | |
| GB2237910(A) | 1991-05-01 | Applicant | |
| JP59-229949 | 1984-12-01 | Applicant | |
| JP2-67967(A) | 1990-03-01 | Applicant | |
| JP4290593(A) | 1992-10-01 | Applicant | |
| JP5-260569 | 1993-10-01 | Applicant | |
| JP8194023(A) | 1996-07-01 | Applicant | |
| WO93/02515(A1) | 1993-02-01 | Applicant | |
| WO93/04451(A1) | 1993-03-01 | Applicant | |
| WO95/32595(A1) | 1995-11-01 | Applicant | |
| WO96/10856(A1) | 1996-04-01 | Applicant |
Non-Patent Literature (45)
- Chlamtac, I. et al., “Optimizing the System of Virtual Paths”, IEEE ACM Transactions on Networking, 1994, 2(6), 581-586.Applicant
- Leung, V.C.M., “Internetworking Wireless Terminals to Local Area Networks Via Radio Bridges”, ICWC, 1992, 126-129.Applicant
- Pollini, G.P. et al., “Path Optimization Procedures for Efficient Routing of Information after and Inter-Switch Handover”, IEEE, 1994, 1-5.Applicant
- Rajagopalan, B. et al., “A New Responsive Distributed Shortest-Path Routing Algorithm”, ACM, 1989, 237-246.Applicant
- Desbonnet, Joe et al., “System Architecture and Implementation of CEBus/Internet Gateway”, IEEE, 1997, 1057-1062.Applicant
- Markwalter, Brian et al., “CEBus Network Layer Description”, IEEE, 1989, 571-575.Applicant
- Newtown, Harry, Newton's Telecom Dictionary, Flatiron Publishing, Inc., 10thEd., 1996, LAN (1 of 1): Cebus Overview (1-3): Cebus Industry Council (1 of 1).Applicant
- Newtown, Harry, Newton's Telecom Dictionary, 10th Edition, 1996, 243.Applicant
- International Search Report issued in International Application No. PCT/US98/11170 Date of Mailing: Oct. 7, 1998.Applicant
- International Search Report issued in International Application No. PCT/US98/19034 Date of Mailing: Feb. 1, 1999.Applicant
- Internet Printout, http://www.ram.com BellSouth Wireless Data—Paging, Mobitex, Network, Business, Sep. 23, 1998: —MOBITEX®: The Heart of Every BellSouth Solution—MOBITEX Features and Services: RAM Mobile Data White Paper, Feb. 1997—Narrowband PCS Technologies: What are the Options?: RAM Mobile Data White Paper, Nov. 1997 —The Inherent Security of Data Over Mobitex Wireless Packet Data Networks, A RAM Mobile Data White Paper, Oct. 1995—Comparative Analysis of Coverage and Performance: RAM & Ardis, 1998.Applicant
- Internet Printout, http://www.ardis.com “Ardis Two-Way, Wireless Data Communications,” ARDIS, Sep. 23, 1998.Applicant
- Internet Printout, http://ww.ardis.com/RADIO “An Overview of Radio Coverage,” Sep. 29, 1998 “Radio Propagation,” Sep. 29, 1998 “Factors Affecting ARDIS Coverage,” Sep. 29, 1998 “The ARDIS Network Compared to Other Systems,” Sep. 29, 1998.Applicant
- Internet Printout, http://www.ardis.com/RADIO “Radio Coverage,” Sep. 29, 1998 “Glossary of Terms,” Sep. 29, 1998 “Radio Propagation in Free Space,” Sep. 29, 1998 “Real World Propagation Variations,” Sep. 29, 1998 “Probability of Reception vs. Calculation,” Sep. 29, 1998.Applicant
- “MV-90 Read Only System” UTS Software Solutions For Utility Customers. (No Date). (No Page Numbers or Pages).Applicant
- Rappaport, T. S., “Wireless Communications, Principles and Practice,” Prentice Hall PTR, 1996, pp. 410-413.Applicant
- Brochure: TRF6900 Single-Chip RF Transceiver, Texas Instrument, 2001©.Applicant
- Corcoran, P.M. et al., “CEBus Network Access via the World-Wide-Web”, International Conference on Consumer Electronics, Jun. 5-7, 1996, 236-237, XP-002218722.Applicant
- Corcoran, P.M. et al., “Browser-Style Interfaces to a Home Automation Network”, IEEE Trans. On Consumer Electronics, Nov. 1, 1997, 43(4), 1063-1069, XP-000768559.Applicant
- Norenkov, et al., Telecommunication Technologies and Networks, Moscow Bauman Technical School, 1988, (Signed for publication on Dec. 10, 1997), pp. 116-118, 80-87 [1] English Language Abstract Provided.Applicant
- Brownrigg, E. Ph.D., “Developing the Information Superhighway Issues for Libraries”, Library Perspectives on NREN, The National Research and Education Network, 1990, 55-63.Applicant
- Brownrigg, E.B., “The Internet as an External Economy: The Emergence of the Invisible Hand”, Library Administration and Management, 1991, 95-97.Applicant
- Frankel, M.S., “Packet Radios Provide Link for Distributed, Survivable C3 in Post-Attack Scenarios”, MSN, Jun. 1983, 80-108.Applicant
- Gower, N. et al., “Congestion Control Using Pacing in a Packet Radio Network”, IEEE Military Communications Conference, 1982, 1, 23.1-1, 23-1-6.Applicant
- Johnson, D.B., “Routing in Ad Hoc Networks of Mobile Hosts”, IEEE, 1995, 158-163.Applicant
- Jubin, J., “Current Packet Radio Networks Protocols”, IEEE Infocom Proceedings, 1985, 86-92.Applicant
- Jubin, J. et al., “The DARPA Packet Radio Network Protocols”, Proceedings of the IEEE, 1987, 75(1), 21-32.Applicant
- Kahn, R.E., “The Organization of Computer Resources into a Packet Radio Network”, IEEE Transactions on Communications, 1977, 25(1), 169-178.Applicant
- Kahn, R.E. et al., “Advances in Packet Radio Technology”, proceedings of the IEEE, 1978, 66(11), 1468-1496.Applicant
- Lauer, G. et al., “Survivable Protocols for Large Scale Packet Radio Networks”, IEEE Global Telecommunications Conference, 1984, 468-471.Applicant
- Lynch, C.A. et al., “Electronic Publishing, Electronic Imaging, and Document Delivery”, Electronic Imaging, International Electronic Imaging Exposition &Conference, 1986, 662-667.Applicant
- Lynch, C.A. et al., “The Telecommunications Landscape”, 1986, 7 pages.Applicant
- Lynch, C.A. et al., “Routing, Repeating, Power Control and Directional Techniques”, Packet Radio Networks, Architectures, Protocols, Technologies and Applications, 1987, Ch 5, 105-129, 259-274Applicant
- MacGregor, W. et al., “Multiple Control Stations in Packet Radio Networks”, IEEE Military Communications Conference, 1982, 10.3-1-10.3-5.Applicant
- Shachan, N. et al., “A Packet Radio Network for Library Automation”, IEEE Military Communications Conference, 1987, 2, 21.3-21.3.7.Applicant
- Shacham, N. et al., “Future Directions in Packet Radio Technology”, IEEE Infocom Proceedings, 1985, 93-98.Applicant
- Westcott, J.A., “Issues in Distributed Routing for Mobile Packet Radio Networks”, IEEE, 1982, 233-238.Applicant
- Westcott, J. et al., “A Distributed Routing Design for a Broadcast Environment”, IEEE Military Communications Conference, 1982, 10.4-1-10.4-5.Applicant
- “Packet Radio: Applications for Libraries in Developing Countries”, UDT Series on Data Communication Technologies and Standards for Libraries, 1993, Ch 1-6, 87 pages.Applicant
- In the United States Patent and Trademark Office, Office Action dated May 3, 2005, U.S. Appl. No. 10/185,664, filed Jun. 27, 2002, 14 pages.Applicant
- In the United States Patent and Trademark Office, Reply Pursuant to 37 CFR § 1.111, U.S. Appl. No. 10/185,664, Dated Aug. 3, 2005, 15 pages.Applicant
- In the United States Patent and Trademark Office, Office Action dated Oct. 18, 2005, U.S. Appl. No. 10/185,664, filed Jun. 27, 2002, 24 pages.Applicant
- In the United States Patent and Trademark Office, Reply Pursuat to 37 CFR § 1.116, U.S. Appl. No. 10/185,664, Dated Jan. 18, 2006, 15 pages.Applicant
- In the United States Patent and Trademark Office, Office Action dated Mar. 8, 2006, U.S. Appl. No. 10/185,664, filed Jun. 27, 2002, 3 pages.Applicant
- In the United States Patent and Trademark Office, Request for Continued Examination (RCE) Transmittal Pursuant to 37 CFR § 1.114, U.S. Appl. No. 10/185,664, filed Jun. 27, 2002, 14 pages.Applicant