System and method for interference free operation of co-located transceivers

Information

  • Patent Grant
  • 9084120
  • Patent Number
    9,084,120
  • Date Filed
    Friday, August 26, 2011
    13 years ago
  • Date Issued
    Tuesday, July 14, 2015
    9 years ago
Abstract
Systems and methods for co-locating a plurality of transceivers capable of operating on the same frequency without interference are provided. The transmissions and/or receptions of the transceivers are coordinated in the time domain such that conflicting sectors are not utilized simultaneously, allowing for the transceivers to be physically located in close proximity without significant intra-system interference. The coordinating programs described herein allow for enhanced efficiency of spectral utilization as well as enhanced quality of service (QoS) through latency controls, rate control and traffic prioritization.
Description
FIELD OF THE INVENTION

The present invention is directed to a system and method for co-locating a plurality of transceivers that can operate on the same frequency without interference. More specifically, the invention is directed to a system and method for coordinating communications of multiple, co-located transceivers, to allow the transceivers to be physically located in close proximity without causing significant intra-system interference.


BACKGROUND OF THE INVENTION

As consumer appetite for multimedia content continues to grow, internet service providers are struggling to provide sufficient bandwidth. Although wired solutions, such as T1 lines, digital subscriber lines (DSL), and cable modems, are becoming ubiquitous in urban environments, these systems are presently not available to a significant portion of the population. Moreover, acquisition and installation costs associated with these systems make them less appealing


One system that provides a fixed wireless solution with bandwidth comparable to DSL and cable modem technologies is a mesh network architecture. As described in, for example, commonly owned U.S. patent application Ser. Nos. 12/554,135 and 12/275,282, each of which are incorporated herein by reference in their entirety, a mesh network comprises a plurality of wirelessly connected nodes that communicate data traffic across a wide area. The nodes of a mesh network communicate with one another using radio or microwave communications signals


One of the most effective tools to improve wireless links, such as connections between nodes in a mesh network, is the use of directional antennas. The benefits of directional antennas include higher modulation and longer range; decreased interference susceptibility from external sources; decreased interference to other systems; and increased power due to point-to-point regulations in many countries. Despite these advantages, directional antennas are difficult to employ because they must be precisely aligned with a complementary antenna and/or many mesh networks require 360° coverage.


In those mesh networks where it is desirable to have 360° omnidirectional coverage, a plurality of directional antennas must be employed. Unfortunately, the use of multiple directional antennas in close proximity is difficult to implement, as such systems experience debilitating intra-system interference. Thus, co-located wireless directional antennas are normally assigned to different non-interfering frequencies, or are installed with sufficient physical or spatial isolation to avoid interference. Both of these situations negatively impact performance and/or impose installation challenges.


It would therefore be desirable to design a system comprising multiple, co-located directional antennas that operate on a single frequency without significant intra-system interference.


SUMMARY OF THE INVENTION

In order to maximize bandwidth capacity at a single location, and to allow easier installation, the exemplary embodiments described herein employ multiple panel devices along with processor implemented scheduling software to coordinate communications to and from each panel. This allows multiple co-located panels to dynamically use their sectors in an interference free manner, while being able to operate on a single frequency.


In one aspect of the invention, a panel system is provided. The panel system includes a first panel device having a processor, a transmitter, and a receiver. The first panel device transmits and/or receives a first beam along a first sector chosen from a plurality of first sectors defining a first beam arc. The panel system also includes a second panel device co-located with the first panel device (e.g., located adjacent to the first panel device). The second panel device typically includes a processor, a transmitter, and a receiver such that the second panel device is capable of transmitting and/or receiving a second beam along a second sector chosen from a plurality of second sectors defining a second beam arc. Typically, the first sector is located such that the transmitting and/or receiving of the first beam by the first panel device along the first sector would interfere with the transmitting and/or receiving of the second beam by the second panel device along the second sector. However, such interference is prevented, as the first panel device and second panel device are coordinated in the time domain to prevent the transmitting and/or receiving of the second beam along the second sector when the first panel device is transmitting and/or receiving the first beam along the first sector.


The second panel device of the multi-panel system is typically not prevented from transmitting and/or receiving along any of the plurality of second sectors that do not interfere with the first sector. The first panel device and/or second panel device of the system may include an array of antenna elements. Moreover, the first panel device and/or second panel device of the system may be a directional antenna.


These and other aspects of the invention will be better understood by reading the following detailed description and appended claims.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 shows a panel device configuration which may be used in accordance with embodiments described herein;



FIG. 2 illustrates an exemplary system comprising multiple, co-located panels in accordance with an embodiment described herein;



FIG. 3 illustrates an exemplary network configuration including a panel system of the invention in connection with NAN mesh networks;



FIG. 4 is an exemplary overall system configuration including a panel system of the invention in communication with broadband antennas; and



FIG. 5 is an exemplary overall system configuration including a panel system of the invention in communication with connectors for enabling wireless connectivity.





DETAILED DESCRIPTION OF INVENTION

As described below, the methods and systems of the invention employ multiple panel devices along with processor implemented coordinating software to schedule communications (e.g., transmissions and/or receptions) in the time domain to and from each panel. This allows multiple co-located panels to dynamically send and receive data, without debilitating interference, and despite close proximity. The coordinating programs described herein allow for enhanced efficiency of spectral utilization as well as enhanced quality of service (QoS) through latency controls, rate control and traffic prioritization.


As used throughout, the terms “panel” and “transceiver” are employed interchangeably. Typically, the panels of the invention are capable of transmitting and/or receiving analog and/or digital signals. Moreover, the panels described herein typically comprise a transmitter, a receiver, a memory, a power circuit, and a processor. It is an object of the invention to allow multiple panels to be co-located and interconnected, while preventing interference. For example, multiple panels may be mounted on rooftops, walls, or windows, in such a geometry as to allow for 360° omnidirectional coverage. The panels may be adapted to communicate with any mesh node that is within line-of-sight to the mounting location.


The term “time slot” or “communication slot,” as described herein, refers to a given amount of time during which a panel will send or receive a signal. Although the invention is described in terms of coordinating panel sectors in the time domain, it will be understood that other types of communication spaces may be used, including without limitation, codes, channels, and the like.


Referring to FIG. 1, an exemplary panel 100 which may be used in the embodiments described herein is shown. The panel 100 comprises an array of individual antenna elements (e.g., 120), as shown and described in detail in commonly owned U.S. Pat. No. 7,053,853, the entire contents of which are incorporated herein by reference. The panel 100 may produce a single, directional beam that may be switched in a multitude of directions to connect to various nodes.


In one embodiment, the panel 100 comprises an RF feed circuit, a processor, a transmitter, a receiver, and/or a power circuit. For example, the RF feed circuit of a panel may allow for a beam having the maximum allowable FCC output power of 1 Watt to be produced at 23 dBi of gain. The panel typically operates (i.e., receives and/or transmits) at approximately 5.8 GHz (e.g., frequencies within the UNII band). Moreover, each panel typically includes a processor to facilitate coordination calculations and scheduling information transfer between multiple panel devices as described herein.


One skilled in the art recognizes that the coordinating techniques described herein may be employed with panels having any number of differently configured panels. For example, the particular panel configuration shown in FIG. 1 produces a beam having a horizontal width of about 15 degrees and a vertical width of about 6 degrees. The beam may be steerable across a 90 degree coverage arc by changing the phase of the signal at a panel and the panel design supports a very fine level of granularity in horizontal steering (e.g., a minimum of an about 3° increment).


The exemplary panel of FIG. 1 comprises an M×N array of individual antenna elements (e.g., radiating patches), wherein M=8 and N=5. In other embodiments, the panel device may include antenna elements in arrays of M=1 to 10 by N=1 to 10. In any event, the number of antenna elements in each column typically determines the vertical beam width of the antenna, and the columns are typically spaced one half wavelength apart to provide for optimum side-lobe levels. It will be appreciated that panels comprising any type of radiating elements may be employed in the invention, such as but not limited to those that comprise slots, dipoles or other apertures.


In exemplary panels described in U.S. Pat. No. 7,053,853, an RF signal is fed through a power divider, then phase shifters (to control the beam shape), then an amplifier and T/R (transmit/receive) switch for each of eight element arrays. The output power of the device is equal to the combined output power of the eight elements, which allows for better steering and lower distortion while increasing the delivered output power to the maximum allowable.


Referring to FIG. 2, an exemplary panel system 200 is illustrated comprising four co-located panel devices (A-D), such as the panels shown and described with respect to FIG. 1. As shown, the panels are each able to steer a beam over a 90 degree arc, which is divided into any number of sectors having a given width. For example, the arcs shown in FIG. 2 are divided into eight sectors (0-7), each spanning about 15 degrees in width. Accordingly, when a panel produces a beam having approximately the same width of a sector, the panel may be said to “use” that sector when it transmits or receives a beam along that sector. In the illustrated exemplary embodiment, the panel (e.g., Panel A) produces a 15 degree wide beam, which may be directed along any of sectors 0-7.


It will be recognized that, although eight sectors are shown, the invention is not so limited. Typically, the number of sectors will relate to the width of the beam produced by a panel and the total arc used by the panel. For example, if a panel produces a 30 degree wide beam and is capable of steering the beam across a 90 degree arc, the arc may be split into three sectors, each spanning about 30 degrees.


In any event, as shown, each of the panel devices (A-D) are physically independent from one another, but are located in close proximity. In fact, the coordination methods of the invention allow for multiple panels to be separated by less than 10 ft., less than 5 ft., less than 2 ft., or even less than a 1 ft, without the need for significant RF isolation or the need for each panel to operate on a different frequency (although either or both may be implemented in exemplary systems). One skilled in the art recognizes that, while four panels are co-located in the present example, the co-location of fewer or greater individual panel devices is possible.


Typically, the panels (A-D) are employed in a geometry that allows for the transmittal and/or reception of beams by a first panel that have the potential to interfere with adjacent panels. For example, in the illustrated embodiment, signals emitted along sector 7 of Panel A (A7) and sector 0 of Panel B (B0) are capable of interfering with each other because of their close proximity. By contrast, signals emitted and/or received along sectors A7 and B3 would not typically interfere with each other, because of the distance and direction of these sectors.


Accordingly, the panels must be coordinated as to prevent the panels from transmitting and/or receiving along conflicting sectors at the same time. The programs of the invention coordinate operation of the panel system 200, including the individual panel devices therein (A-D), to prevent this type of interfering operation. In one embodiment, usage of each sectors is only allowed during a scheduled time slot. For instance, when Panel A communicates on its sector A7, Panel B would be prevented from using its sector B0, but would be allowed to transmit or receive a signal on a non-interfering sector such as, for example, sector B3.


In order to properly coordinate the multiple panels of a system, certain panel geometries are typically implemented. First, the panels (A-D) are positioned such that a sector only interferes with one or more sectors of a single other panel. Stated another way, a single sector will not interfere with sectors of multiple panels. As an example, if sector A7 interferes with B0, then sector A7 should not interfere with any sectors of Panel C or Panel D.


The panels are also positioned such that not every sector of a first panel interferes with every sector of an adjacent panel. Therefore, the panel systems will comprise adjacently located panels having one or more interference-free sectors. As an example, Panel B will comprise at least one sector (e.g., B3) that does not interfere with at least one sector of Panel A (e.g., A7). Moreover, because adjacent sectors on different panels (e.g, B0 and A7) are capable of operating at similar or identical frequencies, each panel is typically coordinated with at least two other panels. For example, Panel B will be coordinated with at least Panels A and C.


In order to carry out effective coordinating via time slot scheduling (described in detail below), each of the coordinated panels will typically share a synchronized clock. It will be appreciated that such synchronization is required to accurately schedule emission/transmission for each panel during a particular time slot.


In addition to the above panel geometries, the coordination of panels is typically determined according to a number of simplifying assumptions. For example, the system may assume that interference caused by additive signals (i.e., a signal comprising two or more signals from different source panels) is negligible. Accordingly, in one embodiment, the system does not account for additive signals when coordinating panels. For example, an additive signal comprising noise from sectors 7 of Panel B and sector 0 of Panel D would not be taken into account when coordinating sector 3 of Panel C. Although it is preferred to employ such a simplifying assumption to reduce processing power requirements and processing time, in some embodiments, any additive signals may, in fact, be considered when coordinating panels.


In one embodiment, each of the above panel geometries and simplifying assumptions may be tested prior to deployment. The panels of the system are typically able to test each other in order to determine if they are sufficiently isolated, and this testing is determined through either an automatic sequence test or a manual configuration.


Messaging


In order to coordinate the transmission and/or emission along sectors of multiple panels, the panels (A-D) are generally capable of communicating and exchanging data with each other. In one embodiment, the panel system 200 initiates a data exchange process when the system is powered up, wherein each individual panel device (A-D) discovers the existence, location, and/or other panel information of the other panel devices in the system through frame exchanges. The data exchange process is typically automatically initiated upon power-up of the system 200, before transmissions to non-co-located panels are made, but may alternatively or additionally be initiated manually or as part of the normal operation of the panel data exchanges.


During the data exchange processes, the panel devices (A-D) exchange panel information, such as but not limited to which sectors (0-7) are being utilized, whether the sectors interfere with those of adjacent panels, and the utilization rate desired or required for each sector. Moreover, the signal quality between each of the panels (A-D) may be determined and communicated.


In certain embodiments, the data exchange is performed among panels using broadcast messages, but in a preferred embodiment, a three-way handshake adjacent panels is employed. Of course, there are many implementations for executing data exchanges between multiple panels, and in one embodiment, a two-way handshake could alternatively be used.


An exemplary three-way handshake is described in detail below, where a first panel (Panel 1) negotiates the parameters of the network TCP socket connection before beginning communication with a second panel (Panel 2). The three-way handshake includes a Demand Info Tx from Panel 1 to Panel 2 desiring to use the same sector. For purposes of orientation and coordination, as between two panels, the initiating panel may be determined based on left-right location (i.e., the panel to the right is always Panel 1). Alternatively, the panel with the lowest MAC address may be designated Panel 1.


The Demand Info Tx includes, but is not limited to, the data show in Table 1 from Panel 1, and is typically in the form of an XML message:









TABLE 1







Demand Info Tx








Variable
Explanation





IDM
Message identifier. Typically incremented by an



integer value (e.g., 1) in accordance with a



panel-specific, randomly generated sequence number.


Demand1
Normalized number of interfering sectors required by



Panel 1


Local Sectors1
Interfering sectors of Panel 1 required to send the



Message. The sectors are typically numbered



right-to-left from 0-7, where the right-most sector is 0


Remote Sectors1
Interfering sectors of Panel 2. The sectors are



typically numbered right-to-left from 0-7,



where the right-most sector is 0









In response to a received Demand Info Tx from Panel A, Panel B responds with a Demand Info Rx that includes, but is not limited to, the data shown in Table 2.









TABLE 2







Demand Info Rx








Variable
Explanation





IDM
The same Message Identifier as the Demand Info Tx


Demand2
Normalized number of interfering sectors required by



Panel 2


Local Sectors2
Interfering sectors of Panel 2 required to send the



Message. The sectors are typically numbered



right-to-left from 0-7, where the right-most sector is 0


Remote Sectors2
Interfering sectors of Panel 1. The sectors are typically



numbered right-to-left from 0-7, where the right-most



sector is 0









Once Panel 1 receives the Demand Info Rx from Panel 2, Panel 1 sends an Acknowledgement Message. In one embodiment, the Acknowledgement Message may simply contain the IDM.


Importantly, the Local and Remote Sector interference information seen by Panel 1 may not be the same as the Local and Remote Sector interference information seen by Panel 2. If this is the case, the coordination program may take the maximum interference and coordinate based on this information.


In a preferred implementation, an explicit start time is not included in the messages, because it is implied that start time will always be the next To after the acknowledgement is received. However, in an alternative embodiment, an explicit start time may be communicated and set in the Demand Info Rx or Tx as the next integer second (or some set number of seconds, e.g., 5 seconds) based on, for example, the global GPS second system.


Once communication is established, and interfering sectors are identified (e.g., A7 and B0), the desired sector utilization rate for the panels (e.g., Panel A and Panel B) competing for the time slots on the interfering sectors is exchanged between the panels. For example, if Panel A and Panel B each desire to transmit data along sector A7 and B7, respectively, the two panels will exchange data (e.g., an integer value) corresponding to the demand for that sector.


Coordination


The processor implemented coordinating programs described herein schedule data transmission and/or reception (including phase selection) within time slots to avoid the contention of data, which enables the operation of more than one panel device in a panel system at a given frequency, without interference. As described above, the panels exchange each of their demands for the conflicting sectors, indicating how much time they need to use the conflicting sectors. Using the exchanged time-based demands, the processors of the respective panels may run the coordinating programs of the invention to dynamically adjust sector usage without requiring transaction by transaction negotiation. The pseudo-real-time demand information exchange between panels thus allows for real-time adjustments based on sector demand.


In one embodiment, the sharing or coordination of time slots within conflicting sectors is scheduled based on “ time on the air.” This means that if, for example, two panels have equal demands on the conflicting sectors, they will evenly share time regardless of modulation. For instance, if two panels have an equal time demand, then a panel with 6 mbps links on the correlated sectors will get 3 mbps and a panel with 18 mbps links will get 9 mbps. Alternatively, the coordination can account for modulation and data transmission.


A more preferred embodiment is now discussed and is further described in Equations 1 and 2, below. As shown, each panel (Panel A and Panel B) determines a rate at which integer boundaries are crossed, and transmits and/or receives at calculated time slots. The calculation is typically based on an integer counter (i), which is first multiplied by a first panels' time demand value (“TA(i.e., the time Panel A needs to use the conflicting sector). This value is then divided by the sum of the time demands of the first panel (“TA ”) and second panel (“TB ”). The second panel (Panel B) performs the same calculation, and the panels employ the computed counter values that do not cross an integer boundary.

Panel A transmits and/or receives when: the intger value of (TA*i)/(TA+TB) is not equal to the integer value of (TA*(i−1))/(TA+TB)); where i=0, 1, 2, 3, etc.   Equation 1
Panel B transmits and/or receives when: the intger value of (TA*i)/(TA+TB) is equal to the integer value of (TA*(i−1))/(TA+TB); where i=0, 1, 2, 3, etc.   Equation 2


Generally, the time demand values (TA and TB) are normalized (e.g., percent of total time required*100, or number of slots needed out of 100). For instance, a panel with only traffic on a conflicting sector, but that only has 50% load, could send data during 50 out of 100 time slots (i.e., normalized over 100), while another panel with 100% utilization but only 25% on the conflicting sector would send data along that sector during 25 out of the 100 possible time slots.


In one particular example, if Panel A requires sector A7 25% of the time, and Panel B requires sector B0 50% of the time, Panel A would have opportunities to use time slots 1, 3, 6, 9, 12, etc., while Panel B would be able to use time slots 2, 4, 5, 7, 8, 10, 11, etc. To fairly distribute the time, multiple slot beats will count as multiple uses (e.g., a 1600 μs transmission would count twice as much as a 800 μs transmission).


The coordinating programs described herein may be used to assign time slots based solely on demand, without regard to fairness. However, in alternative embodiments, fairness may be considered. For instance, if one panel needs a conflicting sector 100% of the time, and another panel needs the corresponding conflicting sector 50% of the time, the results of the program may assign ⅔ of the time slots to the first panel and ⅓ of the time slots to the second panel, rather than ½ and ½. While this may seem unfair, the panels are assumed to be part of the same system, so there is no reason why traffic on a lightly utilized panel should be preferred over traffic on a highly utilized panel.


In one embodiment, the coordinating program enables the panels to grant recurring time slots, which means that panels can be granted extended rights to communicate using a given sector during certain time slots. This is useful for providing higher classes of service for applications like Voice over IP (VoIP).


While the coordinating process described above is performed in a distributed fashion, the invention is not so limited. Alternatively, systems are envisioned wherein a single processor on a panel is designated as the master and performs scheduling for all panels in the panel system. And in a further embodiment, a wholly separate processor may be employed to perform the coordinating processes.


Referring to FIG. 3, a schematic illustrates an exemplary implementation of a panel system 350 within a larger wide area network (WAN) system 330. The panel system 350 communicates with multiple mesh networks (301, 311, 321), also called neighborhood area networks (NANs). As shown with respect to mesh network A 301, each of the NANs comprises multiple nodes, such as but not limited to, meters (302-307) and at least one mesh gate 308. Mesh networks B 311 and C 321 are also shown in communication with the WAN system 330 through their respective mesh gates (312, 322).


It will be appreciated that the mesh gates (308, 312, 322) are the access points to the meters (e.g. 302-307) within their individual mesh networks and bridge their individual mesh networks to the WAN 330. A mesh gate may also be referred to as an access point or a Neighborhood Area Network to Wide Area Network (NAN-WAN) gate. The mesh gate may perform anyone or more of many different functions including, for example, but not limited to, one or any combination of: relaying information from a server (such as to a back end server 340) to the mesh network nodes, routing information, aggregating information from the nodes within any sub-network that may be configured for transmission to a server (such as to the back end server), acting as a home area network (HAN) sometimes also referred to as a premise area network (PAN) coordinator, acting as a NAN-WAN gate, transmitting firmware upgrades, and/or multicasting messages. The mesh gate may also be referred to as a collector because it collects information from the NAN-associated nodes or other nodes in its subnetwork. A mesh gate may include a mesh radio to communicate with mesh devices over the mesh network and a WAN communication interface to communicate with the Panel System 350.


The mesh gate may provide a gateway between the mesh network A and a server 340. The server 340 can also act as a back end. The server 340 can provide services to mesh devices, such as commissioning devices, providing software updates, providing metering pricing updates, receiving metering information, etc. The mesh gate may aggregate information from mesh devices (e.g., meters) within the mesh network and transmit the information to the server 340. The mesh gate may further forward messages from the mesh devices to the server 340, for example, status reports and meter readings. The mesh gate may further forward messages from the server 340 to the mesh devices, for example, instructions and queries. The server 340 may be a computing device configured to receive information, such as meter readings, from a plurality of mesh networks and meters. The server 340 may also be configured to transmit instructions to the mesh networks, mesh gates, and meters. It will be appreciated that while only one server is depicted, any number of servers may be used. For example, servers may be distributed by geographical location. Redundant servers may provide backup and failover capabilities in the AMI system.


The extenders 360, in combination with the panel system 350, extend the reach of the mesh gates (308, 312, 322) and relay information to/from the NANs (301, 312, 322) through the WAN 320 to the back-end server(s) 340. The extenders 360 may demand slots from panel system 350.


While FIG. 3 illustrates three mesh networks (301, 311, 321), each with a single mesh gate (308, 312, 322) communicating with a respective one of extenders (361, 362, 363), the invention is not so limited, and there need not be such a 1:1 ratio of mesh gates to extenders. Rather, multiple mesh gates (308, 312, 322) may communicate with a single extender 360. Similarly, information from a single mesh gate (308, 312, 322) may hop across multiple extenders (361, 362, 363) before reaching the panel system 350. Further still, the WAN 330 may comprise any number of panel systems 350. In one embodiment, the nodes that make up the WAN 330 may communicate using IEEE 802.11 b, g, and/or n physical and link layer standards.


Referring to FIG. 4, an exemplary use for the panel system 450 is illustrated. As shown, a WAN 430 comprises a panel system 450 in communication with multiple extenders 460. The WAN 430 is in communication with a broadband provider 490, which provides broadband internet service to customers. The broadband provider 490 communicates with broadband antennas 480 located at individual customer premises through the WAN 430. Specifically, the panel system 450 may is employed to transmit and/or receive data to/from each of the broadband antennas 480.


Referring to FIG. 5, another exemplary use for the panel system 550 is illustrated. As shown, a plurality of directional connectors 590 are disposed around the panel system 550 to provide internet capabilities to consumers. In one embodiment, the multiple directional connectors 590 may be coordinated such that they may provide 360 degree omnidirectional transmission and/or reception capabilities without substantial intra-system interference.


In certain embodiments, panels having conflicting sectors will divide time slot usage regardless of whether the sector is needed for upstream or downstream communications. In these embodiments, the panel to extender (FIGS. 3 and 4) and panel to coordinator (FIG. 5) communications protocol is typically limited to bi-directional data exchanges, meaning there is no ability to share time slots based on Tx/Tx or Rx/Rx due to the lack of unidirectional sectors in the MAC layer. Of course, the invention is not so limited. For systems wherein the communications protocol is unidirectional (i.e., certain sectors are designated for transmitting or receiving only), the sectors may be shared such that separate data packets may be transmitted simultaneously along the same Tx sector, essentially sharing the sector, and similarly, separate data packets may be received simultaneously from the same Rx sector, essentially sharing the sector.


Further, in certain embodiments, the panel systems and/or children thereto (e.g., extenders, connectors, etc.) may be programmed in various ways in order to implement a preferred panel process, wherein if the specified panel is available, a child will connect through it. Otherwise, the child will connect via the best route, according to its normal frequency and domain algorithm to a next best panel. Identification of the preferred panel may be by its MAC address. Further still, information regarding the level of sector interference and/or sector availability may be shared between panel systems and/or children such that there is efficient use of sectors and minimization of interference, where possible. For example, in a specific scenario, individual panels may recognize sector availability and implement a process for initiating communication with a child that might otherwise be communicating via an interfering sector of the panel in a shared configuration.


Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, can refer to the action and processes of a data processing system, or similar electronic device, that manipulates and transforms data represented as physical (electronic) quantities within the system's registers and memories into other data similarly represented as physical quantities within the system's memories or registers or other such information storage, transmission or display devices.


The exemplary embodiments can relate to an apparatus for performing one or more of the functions described herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a machine (e.g. computer) readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs and magnetic-optical disks, read only memories (ROMs), random access memories (RAMs) erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a bus.


Some exemplary embodiments described herein are described as software executed on at least one computer, though it is understood that embodiments can be configured in other ways and retain functionality. The embodiments can be implemented on known devices such as a server, a personal computer, a special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element(s), and ASIC or other integrated circuit, a digital signal processor, a hard-wired electronic or logic circuit such as a discrete element circuit, or the like. In general, any device capable of implementing the processes described herein can be used to implement the systems and techniques according to this invention.


It is to be appreciated that the various components of the technology can be located at distant portions of a distributed network and/or the internet, or within a dedicated secure, unsecured and/or encrypted system. Thus, it should be appreciated that the components of the system can be combined into one or more devices or co-located on a particular node of a distributed network, such as a telecommunications network. As will be appreciated from the description, and for reasons of computational efficiency, the components of the system can be arranged at any location within a distributed network without affecting the operation of the system. Moreover, the components could be embedded in a dedicated machine.


Furthermore, it should be appreciated that the various links connecting the elements can be wired or wireless links, or any combination thereof, or any other known or later developed element(s) that is capable of supplying and/or communicating data to and from the connected elements. The terms determine, calculate and compute, and variations thereof, as used herein are used interchangeably and include any type of methodology, process, mathematical operation or technique.


The invention described and claimed herein is not to be limited in scope by the specific embodiments herein disclosed since these embodiments are intended as illustrations of several aspects of the invention. Any equivalent embodiments are intended to be within the scope of this invention. Indeed, various modifications of the invention in addition to those shown and described herein will become apparent to those skilled in the art from the foregoing description. Such modifications are also intended to fall within the scope of the appended claims. All publications cited herein are incorporated by reference in their entirety.

Claims
  • 1. A panel system comprising: a first panel device comprising a first processor, a transmitter, and a receiver, the first panel device capable of transmitting and/or receiving a first beam along a first sector chosen from a plurality of first sectors defining a first beam arc; anda second panel device co-located with the first panel device comprising a second processor, a transmitter, and a receiver, the second panel device capable of transmitting and/or receiving a second beam along a second sector chosen from a plurality of second sectors defining a second beam arc;wherein the first sector is located such that the transmitting and/or receiving of the first beam by the first panel device along the first sector would interfere with the transmitting and/or receiving of the second beam by the second panel device along the second sector; andwherein the first processor and the second processor are configured to communicate with each other via the first panel device and the second panel device, respectively to exchange time-based demand requirements of signal transmission or reception for at least one of the transmitter and receiver of each of the first panel device and second panel device, and in response to processing of the demand requirements, determine a schedule in the time domain for a plurality of future time slots to be available for the exclusive use by a respective one of the first and second panel devices for the at least one of future transmitting or receiving, said schedule being determined by a ratio (TA)/(TA+TB), where, TA and TB are the exchanged time-based demand requirements of the first and second panel devices, respectively, so as to prevent the future transmitting and/or receiving of the second beam along the second sector when the first panel device is transmitting and/or receiving the first beam along the first sector.
  • 2. A system according to claim 1, wherein the second panel device is not prevented from transmitting and/or receiving along any of the plurality of second sectors that do not interfere with the first sector.
  • 3. A system according to claim 1, wherein the first panel device and/or second panel device comprises an array of antenna elements.
  • 4. A system according to claim 1, wherein the first panel device and/or second panel device is a directional antenna.
  • 5. A system according to claim 1, wherein the plurality of future time slots are coordinated in an interleaved manner, so that time slots for at least one of signal transmission or reception in the first sector are interleaved in time with time slots for at least one of signal transmission or reception in the second sector.
  • 6. A system according to claim 1 further comprising a third panel device located adjacent to the first panel device comprising a third processor, a transmitter, and a receiver, the third panel device capable of transmitting and/or receiving a third beam along a third sector chosen from a plurality of third sectors defining a third beam arc; wherein a different first sector among the plurality of first sectors is located such that the transmitting and/or receiving of a different first beam by the first panel device along the different first sector would interfere with the transmitting and/or receiving of the third beam by the third panel device along the third sector; andwherein the first panel device and third panel device are coordinated by at least one of the first processor and the third processor in the time domain according to the ratio (TA)/(TA+TC), where, TA and TC are exchanged time-based demand requirements of the first and third panel devices, respectively, to prevent the transmitting and/or receiving of the third beam along the third sector by the third panel device when the first panel device is transmitting and/or receiving the different first beam along the different first sector.
  • 7. A system according to claim 6, wherein the third panel device is not prevented from transmitting and/or receiving along any of the plurality of third sectors that do not interfere with the different first sector.
  • 8. A system according to claim 6 further comprising a fourth panel device located adjacent to the second panel device and the third panel device comprising a fourth processor, a transmitter, and a receiver, the fourth panel device capable of transmitting and/or receiving a fourth beam along a fourth sector chosen from a plurality of fourth sectors defining a fourth beam arc; wherein a different second sector among the plurality of second sectors is located such that the transmitting and/or receiving of a different second beam by the second panel device along the different second sector would interfere with the transmitting and/or receiving of the fourth beam by the fourth panel device along the fourth sector; andwherein the second panel device and fourth panel device are coordinated by at least one of the second processor and the fourth processor in the time domain according to the ratio (TB)/(TB−TD), where, TB and TD are exchanged time-based demand requirements of the second and fourth panel devices, respectively, to prevent the transmitting and/or receiving of the fourth beam along the fourth sector by the fourth panel device when the second panel device is transmitting and/or receiving the different second beam along the different second sector.
  • 9. A system according to claim 8, wherein the fourth panel device is not prevented from transmitting and/or receiving along any of the plurality of fourth sectors that do not interfere with the different second sector.
  • 10. A system according to claim 8, wherein the first sector does not interfere with any of the third plurality of sectors or any of the fourth plurality of sectors, and wherein the different first sector does not interfere with any of the second plurality of sectors or fourth plurality of sectors.
  • 11. A system according to claim 1, wherein at least one of the plurality of first sectors does not interfere with at least one of the plurality of second sectors.
  • 12. A system according to claim 8, further comprising a synchronized clock shared by the first, second, third and fourth panel devices.
  • 13. A system according to claim 1 wherein the plurality of future time slots are scheduled so that pre-determined recurring time slots are reserved for use by a given panel device.
  • 14. The system according to claim 1, wherein: the first panel device is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA +TB), where i is an integer, is not equal to the integer value of the calculation of (TA*(i-1))/(TA+TB), andthe second panel device is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA+TB), where i is an integer, is equal to the integer value of the calculation of (TA*(i-1))/(TA+TB).
  • 15. A transceiver system comprising: multiple co-located transceiver devices, each transceiver device including an M×N matrix of elements as part of a panel device, where M and N represent a number of columns and rows, respectively, such that the M×N matrix of elements defines a predetermined number of individual sectors of an array antenna, where signal transmission or reception in a first sector of the predetermined number of individual sectors by a first transceiver device of the multiple co-located transceiver devices would interfere with signal transmission or reception in a second sector by a second transceiver device of the multiple co-located transceiver devices; andat least one processor of each of the first and second transceiver devices are programmed to communicate with each other via a respective one of a first and second panel device, to exchange signal transmission or reception time-based demand requirements for the at least first and second sectors, and in response to processing of the demand requirements, schedule in the time domain a plurality of future time slots using a ratio (TA)/(TA +TB), where, TA and TB are the exchanged time-based demand requirements of the first and second panel devices, respectively, for at least one of future signal transmission and/or reception in the first and second sectors, in order to avoid signal interference of use in the time domain.
  • 16. The transceiver system according to claim 15, further comprising a synchronized clock shared by the multiple co-located transceiver devices.
  • 17. The transceiver system according to claim 15, wherein the at least one processor of each of the first and second transceiver devices schedules the plurality of future time slots so as to interleave time slots for at least one of signal transmission or reception in the first sector with time slots for at least one of signal transmission or reception in the second sector.
  • 18. The transceiver system according to claim 15 wherein the plurality of future time slots are scheduled so that pre-determined recurring time slots are reserved for use by a given transceiver device.
  • 19. The transceiver system according to claim 15, wherein: the first panel device is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA+TB), where i is an integer, is not equal to the integer value of the calculation of (TA*(i-1))/(TA+TB), andthe second panel device is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA+TB), where i is an integer, is equal to the integer value of the calculation of (TA*(i-1))/(TA+TB).
  • 20. A process for scheduling sector use across multiple antenna panels comprising: receiving by at least a first processor of a first antenna panel, an indication that reception and/or transmission of a first communication signal at a first sector of the first antenna panel would interfere with reception and/or transmission of a second communication signal at a second sector of a second antenna panel; andreceiving by at least a second processor of the second antenna panel, an indication that reception and/or transmission of the second communication signal at the second sector of the second antenna panel would interfere with reception and/or transmission of the first communication signal at the first sector of the first antenna panel; andcoordinating by and between the at least a first and second processors to exchange signal transmission and/or reception time-based demand requirements, and in response to such exchange, determining a schedule in the time domain of a plurality of future time slots for the transmission and/or reception of the first and second communication signals at the first and second sectors, said schedule being determined by a ratio (TA)/(TA+TB ),where, TA and TB are the exchanged time-based demand requirements of the first and second antenna panels, respectively, so as to avoid signal interference therebetween.
  • 21. The process according to claim 20, wherein coordinating comprises exchanging between the first and second processors use data for the first and second sectors.
  • 22. The process according to claim 20 wherein the plurality of future time slots are scheduled so that pre-determined recurring time slots are reserved for use by a given antenna panel.
  • 23. The process according to claim 20, wherein: the first antenna panel is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA+TB), where i is an integer, is not equal to the integer value of the calculation of (TA*(i-1))/(TA+TB), andthe second antenna panel is scheduled to at least one of future transmit or receive when the integer value of the calculation of (TA*i)/(TA+TB), where i is an integer, is equal to the integer value of the calculation of (TA*(i-1))/(TA+TB).
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims benefit of similarly titled U.S. provisional patent application Ser. No. 61/377,548 filed Aug. 27, 2010, which is incorporated herein by reference in its entirety.

US Referenced Citations (586)
Number Name Date Kind
4132981 White Jan 1979 A
4190800 Kelly, Jr. et al. Feb 1980 A
4204195 Bogacki May 1980 A
4254472 Juengel et al. Mar 1981 A
4322842 Martinez Mar 1982 A
4396915 Farnsworth et al. Aug 1983 A
4425628 Bedard et al. Jan 1984 A
4638314 Keller Jan 1987 A
4644320 Carr et al. Feb 1987 A
4749992 Fitzemeyer et al. Jun 1988 A
4792946 Mayo Dec 1988 A
4939726 Flammer et al. Jul 1990 A
5007052 Flammer Apr 1991 A
5056107 Johnson et al. Oct 1991 A
5077753 Grau, Jr. et al. Dec 1991 A
5079768 Flammer Jan 1992 A
5115433 Baran et al. May 1992 A
5117422 Hauptschein et al. May 1992 A
5130987 Flammer Jul 1992 A
5138615 Lamport et al. Aug 1992 A
5159592 Perkins Oct 1992 A
5216623 Barrett et al. Jun 1993 A
5276680 Messenger Jan 1994 A
5311581 Merriam et al. May 1994 A
5400338 Flammer, III Mar 1995 A
5430729 Rahnema Jul 1995 A
5432507 Mussino et al. Jul 1995 A
5453977 Flammer, III et al. Sep 1995 A
5459727 Vannucci Oct 1995 A
5463777 Bialkowski et al. Oct 1995 A
5465398 Flammer Nov 1995 A
5467345 Cutler, Jr. et al. Nov 1995 A
5471469 Flammer, III et al. Nov 1995 A
5479400 Dilworth et al. Dec 1995 A
5488608 Flammer, III Jan 1996 A
5515369 Flammer, III et al. May 1996 A
5515509 Rom May 1996 A
5528507 McNamara et al. Jun 1996 A
5544036 Brown, Jr. et al. Aug 1996 A
5553094 Johnson et al. Sep 1996 A
5570084 Ritter et al. Oct 1996 A
5572438 Ehlers et al. Nov 1996 A
5572528 Shuen Nov 1996 A
5596722 Rahnema Jan 1997 A
5608721 Natarajan et al. Mar 1997 A
5608780 Gerszberg et al. Mar 1997 A
5623495 Eng et al. Apr 1997 A
5659300 Dresselhuys et al. Aug 1997 A
5673252 Johnson et al. Sep 1997 A
5684710 Ehlers et al. Nov 1997 A
5696501 Ouellette et al. Dec 1997 A
5696695 Ehlers et al. Dec 1997 A
5717718 Rowsell et al. Feb 1998 A
5719564 Sears Feb 1998 A
5726644 Jednacz et al. Mar 1998 A
5727057 Emery et al. Mar 1998 A
5737318 Melnik Apr 1998 A
5740366 Mahany et al. Apr 1998 A
5748104 Argyroudis et al. May 1998 A
5757783 Eng et al. May 1998 A
5758331 Johnson May 1998 A
5761083 Brown, Jr. et al. Jun 1998 A
5767790 Jovellana Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5812531 Cheung et al. Sep 1998 A
5822309 Ayanoglu et al. Oct 1998 A
5844893 Gollnick et al. Dec 1998 A
5874903 Shuey et al. Feb 1999 A
5880677 Lestician Mar 1999 A
5892758 Argyroudis Apr 1999 A
5894422 Chasek Apr 1999 A
5896097 Cardozo Apr 1999 A
5896566 Averbuch et al. Apr 1999 A
5898387 Davis et al. Apr 1999 A
5898826 Pierce et al. Apr 1999 A
5901067 Kao et al. May 1999 A
5903566 Flammer, III May 1999 A
5914672 Glorioso et al. Jun 1999 A
5914673 Jennings et al. Jun 1999 A
5919247 Van Hoff et al. Jul 1999 A
5920697 Masters et al. Jul 1999 A
5926531 Petite Jul 1999 A
5933092 Ouellette et al. Aug 1999 A
5953371 Rowsell et al. Sep 1999 A
5963146 Johnson et al. Oct 1999 A
5963457 Kanoi et al. Oct 1999 A
5974236 Sherman Oct 1999 A
5986574 Colton Nov 1999 A
5987011 Toh Nov 1999 A
5991806 McHann, Jr. Nov 1999 A
6014089 Tracy et al. Jan 2000 A
6018659 Ayyagari et al. Jan 2000 A
6026133 Sokoler Feb 2000 A
6028522 Petite Feb 2000 A
6044062 Brownrigg et al. Mar 2000 A
6058355 Ahmed et al. May 2000 A
6061609 Kanoi et al. May 2000 A
6073169 Shuey et al. Jun 2000 A
6075777 Agrawal et al. Jun 2000 A
6078785 Bush Jun 2000 A
6084867 Meier Jul 2000 A
6088659 Kelley et al. Jul 2000 A
6097703 Larsen et al. Aug 2000 A
6108699 Moiin Aug 2000 A
6118269 Davis Sep 2000 A
6122603 Budike, Jr. Sep 2000 A
6124806 Cunningham et al. Sep 2000 A
6134587 Okanoue Oct 2000 A
6137423 Glorioso et al. Oct 2000 A
6150955 Tracy et al. Nov 2000 A
6169979 Johnson Jan 2001 B1
6172616 Johnson et al. Jan 2001 B1
6195018 Ragle et al. Feb 2001 B1
6218953 Petite Apr 2001 B1
6233327 Petite May 2001 B1
6239722 Colton et al. May 2001 B1
6240080 Okanoue et al. May 2001 B1
6246677 Nap et al. Jun 2001 B1
6246689 Shavitt Jun 2001 B1
6249516 Brownrigg et al. Jun 2001 B1
6298053 Flammer, III et al. Oct 2001 B1
6300881 Yee et al. Oct 2001 B1
6304556 Haas Oct 2001 B1
6311105 Budike, Jr. Oct 2001 B1
6338087 Okanoue Jan 2002 B1
6362745 Davis Mar 2002 B1
6363057 Ardalan et al. Mar 2002 B1
6366217 Cunningham et al. Apr 2002 B1
6369719 Tracy et al. Apr 2002 B1
6369769 Nap et al. Apr 2002 B1
6373399 Johnson et al. Apr 2002 B1
6396839 Ardalan et al. May 2002 B1
6400949 Bielefeld et al. Jun 2002 B1
6407991 Meier Jun 2002 B1
6415330 Okanoue Jul 2002 B1
6430268 Petite Aug 2002 B1
6437692 Petite et al. Aug 2002 B1
6457054 Bakshi Sep 2002 B1
6480497 Flammer, III et al. Nov 2002 B1
6480505 Johansson et al. Nov 2002 B1
6492910 Ragle et al. Dec 2002 B1
6509841 Colton et al. Jan 2003 B1
6522974 Sitton Feb 2003 B2
6535498 Larsson et al. Mar 2003 B1
6538577 Ehrke et al. Mar 2003 B1
6553355 Arnoux et al. Apr 2003 B1
6556830 Lenzo Apr 2003 B1
6577671 Vimpari Jun 2003 B1
6606708 Devine et al. Aug 2003 B1
6618578 Petite Sep 2003 B1
6618772 Kao et al. Sep 2003 B1
6628764 Petite Sep 2003 B1
6633823 Bartone et al. Oct 2003 B2
6636894 Short et al. Oct 2003 B1
6650249 Meyer et al. Nov 2003 B2
6653945 Johnson et al. Nov 2003 B2
6657552 Belski et al. Dec 2003 B2
6665620 Burns et al. Dec 2003 B1
6671635 Forth et al. Dec 2003 B1
6681110 Crookham et al. Jan 2004 B1
6681154 Nierlich et al. Jan 2004 B2
6684245 Shuey et al. Jan 2004 B1
6687901 Imamatsu Feb 2004 B1
6691173 Morris et al. Feb 2004 B2
6697331 Riihinen et al. Feb 2004 B1
6710721 Holowick Mar 2004 B1
6711166 Amir et al. Mar 2004 B1
6711409 Zavgren, Jr. et al. Mar 2004 B1
6711512 Noh Mar 2004 B2
6714787 Reed et al. Mar 2004 B2
6718137 Chin Apr 2004 B1
6725281 Zintel et al. Apr 2004 B1
6728514 Bandeira et al. Apr 2004 B2
6747557 Petite et al. Jun 2004 B1
6747981 Ardalan et al. Jun 2004 B2
6751445 Kasperkovitz et al. Jun 2004 B2
6751455 Acampora Jun 2004 B1
6751672 Khalil et al. Jun 2004 B1
6772052 Amundsen et al. Aug 2004 B1
6775258 van Valkenburg et al. Aug 2004 B1
6778099 Meyer et al. Aug 2004 B1
6785592 Smith et al. Aug 2004 B1
6798352 Holowick Sep 2004 B2
6801865 Gilgenbach et al. Oct 2004 B2
6826620 Mawhinney et al. Nov 2004 B1
6829216 Nakata Dec 2004 B1
6829347 Odiaka Dec 2004 B1
6831921 Higgins Dec 2004 B2
6836737 Petite et al. Dec 2004 B2
6839775 Kao et al. Jan 2005 B1
6842706 Baraty Jan 2005 B1
6845091 Ogier et al. Jan 2005 B2
6859186 Lizalek et al. Feb 2005 B2
6865185 Patel et al. Mar 2005 B1
6882635 Eitan et al. Apr 2005 B2
6885309 Van Heteren Apr 2005 B1
6891838 Petite et al. May 2005 B1
6900738 Crichlow May 2005 B2
6904025 Madour et al. Jun 2005 B1
6904385 Budike, Jr. Jun 2005 B1
6909705 Lee et al. Jun 2005 B1
6914533 Petite Jul 2005 B2
6914893 Petite Jul 2005 B2
6946972 Mueller et al. Sep 2005 B2
6954814 Leach Oct 2005 B1
6963285 Fischer et al. Nov 2005 B2
6967452 Aiso et al. Nov 2005 B2
6970434 Mahany et al. Nov 2005 B1
6970771 Preiss et al. Nov 2005 B1
6975613 Johansson Dec 2005 B1
6980973 Karpenko Dec 2005 B1
6982651 Fischer Jan 2006 B2
6985087 Soliman Jan 2006 B2
6995666 Luttrell Feb 2006 B1
6999441 Flammer, III et al. Feb 2006 B2
7009379 Ramirez Mar 2006 B2
7009493 Howard et al. Mar 2006 B2
7010363 Donnelly et al. Mar 2006 B2
7016336 Sorensen Mar 2006 B2
7020701 Gelvin et al. Mar 2006 B1
7042368 Patterson et al. May 2006 B2
7046682 Carpenter et al. May 2006 B2
7053767 Petite et al. May 2006 B2
7053853 Merenda et al. May 2006 B2
7054271 Brownrigg et al. May 2006 B2
7062361 Lane Jun 2006 B1
7064679 Ehrke et al. Jun 2006 B2
7072945 Nieminen et al. Jul 2006 B1
7079810 Petite et al. Jul 2006 B2
7089089 Cumming et al. Aug 2006 B2
7102533 Kim Sep 2006 B2
7103086 Steed et al. Sep 2006 B2
7103511 Petite Sep 2006 B2
7106044 Lee, Jr. et al. Sep 2006 B1
7119713 Shuey et al. Oct 2006 B2
7126494 Ardalan et al. Oct 2006 B2
7135850 Ramirez Nov 2006 B2
7135956 Bartone et al. Nov 2006 B2
7137550 Petite Nov 2006 B1
7143204 Kao et al. Nov 2006 B1
7145474 Shuey et al. Dec 2006 B2
7170425 Christopher et al. Jan 2007 B2
7174260 Tuff et al. Feb 2007 B2
7185131 Leach Feb 2007 B2
7188003 Ransom et al. Mar 2007 B2
7197046 Hariharasubrahmanian Mar 2007 B1
7200633 Sekiguchi et al. Apr 2007 B2
7209840 Petite et al. Apr 2007 B2
7215926 Corbett et al. May 2007 B2
7222111 Budike, Jr. May 2007 B1
7230544 Van Heteren Jun 2007 B2
7230931 Struhsaker Jun 2007 B2
7231482 Leach Jun 2007 B2
7245938 Sobczak et al. Jul 2007 B2
7248181 Patterson et al. Jul 2007 B2
7248861 Lazaridis et al. Jul 2007 B2
7250874 Mueller et al. Jul 2007 B2
7251570 Hancock et al. Jul 2007 B2
7263073 Petite et al. Aug 2007 B2
7271735 Rogai Sep 2007 B2
7274305 Luttrell Sep 2007 B1
7274975 Miller Sep 2007 B2
7277027 Ehrke et al. Oct 2007 B2
7277967 Kao et al. Oct 2007 B2
7289887 Rodgers Oct 2007 B2
7295128 Petite Nov 2007 B2
7301476 Shuey et al. Nov 2007 B2
7304587 Boaz Dec 2007 B2
7308370 Mason, Jr. et al. Dec 2007 B2
7312721 Mason, Jr. et al. Dec 2007 B2
7315257 Patterson et al. Jan 2008 B2
7317404 Cumeralto et al. Jan 2008 B2
7321316 Hancock et al. Jan 2008 B2
7324453 Wu et al. Jan 2008 B2
7327998 Kumar et al. Feb 2008 B2
7346463 Petite et al. Mar 2008 B2
7348769 Ramirez Mar 2008 B2
7349766 Rodgers Mar 2008 B2
7362709 Hui et al. Apr 2008 B1
7366113 Chandra et al. Apr 2008 B1
7366191 Higashiyama Apr 2008 B2
7379981 Elliott et al. May 2008 B2
7397907 Petite Jul 2008 B2
7406298 Luglio et al. Jul 2008 B2
7411964 Suemura Aug 2008 B2
7427927 Borleske et al. Sep 2008 B2
7451019 Rodgers Nov 2008 B2
7457273 Nakanishi et al. Nov 2008 B2
7468661 Petite et al. Dec 2008 B2
7487282 Leach Feb 2009 B2
7495578 Borleske Feb 2009 B2
7498873 Opshaug et al. Mar 2009 B2
7505453 Carpenter et al. Mar 2009 B2
7512234 McDonnell et al. Mar 2009 B2
7515571 Kwon et al. Apr 2009 B2
7516106 Ehlers et al. Apr 2009 B2
7522540 Maufer Apr 2009 B1
7522639 Katz Apr 2009 B1
7539151 Demirhan et al. May 2009 B2
7545285 Shuey et al. Jun 2009 B2
7546595 Wickham et al. Jun 2009 B1
7548826 Witter et al. Jun 2009 B2
7548907 Wall et al. Jun 2009 B2
7554941 Ratiu et al. Jun 2009 B2
7562024 Brooks et al. Jul 2009 B2
7571865 Nicodem et al. Aug 2009 B2
7586420 Fischer et al. Sep 2009 B2
7599665 Sinivaara Oct 2009 B2
7602747 Maksymczuk et al. Oct 2009 B2
7609673 Bergenlid et al. Oct 2009 B2
7613147 Bergenlid et al. Nov 2009 B2
7623043 Mizra et al. Nov 2009 B2
7626967 Yarvis et al. Dec 2009 B2
7650425 Davis et al. Jan 2010 B2
7676231 Demirhan et al. Mar 2010 B2
7680041 Johansen Mar 2010 B2
7729496 Hacigumus Jun 2010 B2
7733224 Tran Jun 2010 B2
7743224 Wang Jun 2010 B2
7756538 Bonta et al. Jul 2010 B2
7788491 Dawson Aug 2010 B1
7802245 Sonnier et al. Sep 2010 B2
7814322 Gurevich et al. Oct 2010 B2
7818758 de Bonet et al. Oct 2010 B2
7847706 Ross et al. Dec 2010 B1
8051415 Suzuki Nov 2011 B2
20010005368 Rune Jun 2001 A1
20010010032 Ehlers et al. Jul 2001 A1
20010038342 Foote Nov 2001 A1
20010046879 Schramm et al. Nov 2001 A1
20020012358 Sato Jan 2002 A1
20020013679 Petite Jan 2002 A1
20020031101 Petite et al. Mar 2002 A1
20020051269 Margalit et al. May 2002 A1
20020066095 Yu May 2002 A1
20020110118 Foley Aug 2002 A1
20020114303 Crosbie et al. Aug 2002 A1
20020120569 Day Aug 2002 A1
20020174354 Bel et al. Nov 2002 A1
20020176381 Hammel et al. Nov 2002 A1
20020186619 Reeves et al. Dec 2002 A1
20030001640 Lao et al. Jan 2003 A1
20030001754 Johnson et al. Jan 2003 A1
20030014633 Gruber Jan 2003 A1
20030033394 Stine Feb 2003 A1
20030037268 Kistler Feb 2003 A1
20030050737 Osann Mar 2003 A1
20030112822 Hong et al. Jun 2003 A1
20030117966 Chen Jun 2003 A1
20030122686 Ehrke et al. Jul 2003 A1
20030123481 Neale et al. Jul 2003 A1
20030156715 Reeds, III et al. Aug 2003 A1
20030207697 Shpak Nov 2003 A1
20030229900 Reisman Dec 2003 A1
20030233201 Horst et al. Dec 2003 A1
20040008663 Srikrishna et al. Jan 2004 A1
20040031030 Kidder et al. Feb 2004 A1
20040034773 Balabine et al. Feb 2004 A1
20040039817 Lee et al. Feb 2004 A1
20040056775 Crookham et al. Mar 2004 A1
20040066310 Ehrke et al. Apr 2004 A1
20040077341 Chandranmenon et al. Apr 2004 A1
20040081086 Hippelainen et al. Apr 2004 A1
20040082203 Logvinov et al. Apr 2004 A1
20040100953 Chen et al. May 2004 A1
20040113810 Mason, Jr. et al. Jun 2004 A1
20040117788 Karaoguz et al. Jun 2004 A1
20040125776 Haugli et al. Jul 2004 A1
20040138787 Ransom et al. Jul 2004 A1
20040140908 Gladwin et al. Jul 2004 A1
20040157613 Steer et al. Aug 2004 A1
20040183687 Petite et al. Sep 2004 A1
20040185845 Abhishek et al. Sep 2004 A1
20040193329 Ransom et al. Sep 2004 A1
20040210544 Shuey et al. Oct 2004 A1
20040263390 Merenda et al. Dec 2004 A1
20040268142 Karjala et al. Dec 2004 A1
20050026569 Lim et al. Feb 2005 A1
20050027859 Alvisi et al. Feb 2005 A1
20050030968 Rich et al. Feb 2005 A1
20050033967 Morino et al. Feb 2005 A1
20050055432 Rodgers Mar 2005 A1
20050058144 Ayyagari et al. Mar 2005 A1
20050065742 Rodgers Mar 2005 A1
20050122944 Kwon et al. Jun 2005 A1
20050136972 Smith et al. Jun 2005 A1
20050172024 Cheifot et al. Aug 2005 A1
20050187928 Byers Aug 2005 A1
20050193390 Suzuki et al. Sep 2005 A1
20050195757 Kidder et al. Sep 2005 A1
20050201397 Petite Sep 2005 A1
20050228874 Edgett et al. Oct 2005 A1
20050243867 Petite Nov 2005 A1
20050249113 Kobayashi et al. Nov 2005 A1
20050251403 Shuey Nov 2005 A1
20050257215 Denby et al. Nov 2005 A1
20050270173 Boaz Dec 2005 A1
20050276243 Sugaya et al. Dec 2005 A1
20050286440 Strutt et al. Dec 2005 A1
20060028355 Patterson et al. Feb 2006 A1
20060055432 Shimokawa et al. Mar 2006 A1
20060056363 Ratiu et al. Mar 2006 A1
20060056368 Ratiu et al. Mar 2006 A1
20060077906 Maegawa et al. Apr 2006 A1
20060087993 Sengupta et al. Apr 2006 A1
20060098576 Brownrigg et al. May 2006 A1
20060098604 Flammer, III et al. May 2006 A1
20060111111 Ovadia May 2006 A1
20060130053 Buljore et al. Jun 2006 A1
20060140135 Bonta et al. Jun 2006 A1
20060146717 Conner et al. Jul 2006 A1
20060158347 Roche et al. Jul 2006 A1
20060161310 Lal Jul 2006 A1
20060167784 Hoffberg Jul 2006 A1
20060184288 Rodgers Aug 2006 A1
20060215583 Castagnoli Sep 2006 A1
20060215673 Olvera-Hernandez Sep 2006 A1
20060217936 Mason et al. Sep 2006 A1
20060230276 Nochta Oct 2006 A1
20060271244 Cumming et al. Nov 2006 A1
20060271678 Jessup et al. Nov 2006 A1
20070001868 Boaz Jan 2007 A1
20070013547 Boaz Jan 2007 A1
20070019598 Prehofer Jan 2007 A1
20070036353 Reznik et al. Feb 2007 A1
20070057767 Sun et al. Mar 2007 A1
20070060147 Shin et al. Mar 2007 A1
20070063866 Webb Mar 2007 A1
20070063868 Borleske Mar 2007 A1
20070085700 Walters et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070089110 Li Apr 2007 A1
20070101442 Bondurant May 2007 A1
20070103324 Kosuge et al. May 2007 A1
20070109121 Cohen May 2007 A1
20070110024 Meier May 2007 A1
20070120705 Kiiskila et al. May 2007 A1
20070136817 Nguyen Jun 2007 A1
20070139220 Mirza et al. Jun 2007 A1
20070143046 Budike, Jr. Jun 2007 A1
20070147268 Kelley et al. Jun 2007 A1
20070169074 Koo et al. Jul 2007 A1
20070169075 Lill et al. Jul 2007 A1
20070169080 Friedman Jul 2007 A1
20070174467 Ballou, Jr. et al. Jul 2007 A1
20070177538 Christensen et al. Aug 2007 A1
20070177576 Johansen et al. Aug 2007 A1
20070177613 Shorty et al. Aug 2007 A1
20070189249 Gurevich et al. Aug 2007 A1
20070200729 Borleske et al. Aug 2007 A1
20070201504 Christensen et al. Aug 2007 A1
20070204009 Shorty et al. Aug 2007 A1
20070205915 Shuey et al. Sep 2007 A1
20070206503 Gong et al. Sep 2007 A1
20070206521 Osaje Sep 2007 A1
20070207811 Das et al. Sep 2007 A1
20070210933 Leach Sep 2007 A1
20070211636 Bellur et al. Sep 2007 A1
20070239477 Budike, Jr. Oct 2007 A1
20070248047 Shorty et al. Oct 2007 A1
20070257813 Vaswani et al. Nov 2007 A1
20070258508 Werb et al. Nov 2007 A1
20070263647 Shorty et al. Nov 2007 A1
20070265947 Schimpf et al. Nov 2007 A1
20070266429 Ginter et al. Nov 2007 A1
20070271006 Golden et al. Nov 2007 A1
20070276547 Miller Nov 2007 A1
20080011864 Tessier et al. Jan 2008 A1
20080018492 Ehrke et al. Jan 2008 A1
20080024320 Ehrke et al. Jan 2008 A1
20080031145 Ethier et al. Feb 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080037569 Werb et al. Feb 2008 A1
20080042874 Rogai Feb 2008 A1
20080046388 Budike, Jr. Feb 2008 A1
20080048883 Boaz Feb 2008 A1
20080051036 Vaswani et al. Feb 2008 A1
20080063205 Braskich et al. Mar 2008 A1
20080068217 Van Wyk et al. Mar 2008 A1
20080068994 Garrison et al. Mar 2008 A1
20080068996 Clave et al. Mar 2008 A1
20080086560 Monier et al. Apr 2008 A1
20080089314 Meyer et al. Apr 2008 A1
20080095221 Picard Apr 2008 A1
20080097782 Budike Apr 2008 A1
20080107034 Jetcheva et al. May 2008 A1
20080117110 Luglio et al. May 2008 A1
20080129538 Vaswani et al. Jun 2008 A1
20080130535 Shorty et al. Jun 2008 A1
20080130562 Shorty et al. Jun 2008 A1
20080132185 Elliott et al. Jun 2008 A1
20080136667 Vaswani et al. Jun 2008 A1
20080137620 Wang et al. Jun 2008 A1
20080151795 Shorty et al. Jun 2008 A1
20080151824 Shorty et al. Jun 2008 A1
20080151825 Shorty et al. Jun 2008 A1
20080151826 Shorty et al. Jun 2008 A1
20080151827 Shorty et al. Jun 2008 A1
20080154396 Shorty et al. Jun 2008 A1
20080159213 Shorty et al. Jul 2008 A1
20080165712 Shorty et al. Jul 2008 A1
20080170511 Shorty et al. Jul 2008 A1
20080177678 Di Martini et al. Jul 2008 A1
20080180274 Cumeralto et al. Jul 2008 A1
20080181133 Thubert et al. Jul 2008 A1
20080183339 Vaswani et al. Jul 2008 A1
20080186202 Vaswani et al. Aug 2008 A1
20080186203 Vaswani et al. Aug 2008 A1
20080187001 Vaswani et al. Aug 2008 A1
20080187116 Reeves et al. Aug 2008 A1
20080189415 Vaswani et al. Aug 2008 A1
20080189436 Vaswani et al. Aug 2008 A1
20080204272 Ehrke et al. Aug 2008 A1
20080205355 Liu et al. Aug 2008 A1
20080224891 Ehrke et al. Sep 2008 A1
20080225737 Gong et al. Sep 2008 A1
20080238714 Ehrke et al. Oct 2008 A1
20080238716 Ehrke et al. Oct 2008 A1
20080272934 Wang et al. Nov 2008 A1
20080283620 Knapp Nov 2008 A1
20080310311 Flammer et al. Dec 2008 A1
20080310346 Rich et al. Dec 2008 A1
20080310377 Flammer et al. Dec 2008 A1
20080317047 Zeng et al. Dec 2008 A1
20080318547 Ballou, Jr. et al. Dec 2008 A1
20090003214 Vaswani et al. Jan 2009 A1
20090003232 Vaswani et al. Jan 2009 A1
20090003243 Vaswani et al. Jan 2009 A1
20090003356 Vaswani et al. Jan 2009 A1
20090010178 Tekippe Jan 2009 A1
20090034418 Flammer, III et al. Feb 2009 A1
20090034419 Flammer, III et al. Feb 2009 A1
20090034432 Bonta et al. Feb 2009 A1
20090043911 Flammer et al. Feb 2009 A1
20090046732 Pratt, Jr. et al. Feb 2009 A1
20090055032 Rodgers Feb 2009 A1
20090059794 Frei Mar 2009 A1
20090068947 Petite Mar 2009 A1
20090077405 Johansen Mar 2009 A1
20090079584 Grady et al. Mar 2009 A1
20090082888 Johansen Mar 2009 A1
20090096605 Petite et al. Apr 2009 A1
20090102737 Birnbaum et al. Apr 2009 A1
20090115626 Vaswani et al. May 2009 A1
20090129575 Chakraborty et al. May 2009 A1
20090132220 Chakraborty et al. May 2009 A1
20090134969 Veillette May 2009 A1
20090135677 Veillette May 2009 A1
20090135716 Veillette May 2009 A1
20090135843 Veillette May 2009 A1
20090136042 Veillette May 2009 A1
20090138777 Veillette May 2009 A1
20090161594 Zhu et al. Jun 2009 A1
20090167547 Gilbert Jul 2009 A1
20090168846 Filippo III et al. Jul 2009 A1
20090175238 Jetcheva et al. Jul 2009 A1
20090179771 Seal et al. Jul 2009 A1
20090201936 Dumet et al. Aug 2009 A1
20090235246 Seal et al. Sep 2009 A1
20090243840 Petite et al. Oct 2009 A1
20090245270 van Greunen et al. Oct 2009 A1
20090262642 van Greunen et al. Oct 2009 A1
20090267792 Crichlow Oct 2009 A1
20090285124 Aguirre et al. Nov 2009 A1
20090303972 Flammer, III et al. Dec 2009 A1
20090310593 Sheynblat et al. Dec 2009 A1
20090315699 Satish et al. Dec 2009 A1
20090319672 Reisman Dec 2009 A1
20090320073 Reisman Dec 2009 A1
20100017249 Fincham et al. Jan 2010 A1
20100037069 Deierling et al. Feb 2010 A1
20100037293 St. Johns et al. Feb 2010 A1
20100040042 van Greunen et al. Feb 2010 A1
20100060259 Vaswani et al. Mar 2010 A1
20100061272 Veillette Mar 2010 A1
20100061350 Flammer, III Mar 2010 A1
20100073193 Flammer, III Mar 2010 A1
20100074176 Flammer, III et al. Mar 2010 A1
20100074304 Flammer, III Mar 2010 A1
20100138660 Haynes et al. Jun 2010 A1
20100195593 Denteneer et al. Aug 2010 A1
20100238917 Silverman et al. Sep 2010 A1
20100256830 Kressner et al. Oct 2010 A1
20110004358 Pollack et al. Jan 2011 A1
20110035073 Ozog Feb 2011 A1
20110066297 Saberi et al. Mar 2011 A1
Foreign Referenced Citations (23)
Number Date Country
0 578 041 Nov 1999 EP
0 663 746 Jan 2003 EP
0 812 502 Aug 2004 EP
0 740 873 Dec 2005 EP
10-070774 Mar 1998 JP
10-135965 May 1998 JP
WO 9512942 May 1995 WO
WO 9610307 Apr 1996 WO
WO 9610307 Apr 1996 WO
WO 0054237 Sep 2000 WO
WO 0126334 Apr 2001 WO
WO 0155865 Aug 2001 WO
WO 03015452 Feb 2003 WO
WO 2005091303 Sep 2005 WO
WO 2006059195 Jun 2006 WO
WO 2007015822 Aug 2007 WO
WO 2007132473 Nov 2007 WO
WO 2008027457 Mar 2008 WO
WO 2008033287 Mar 2008 WO
WO 2008033514 Mar 2008 WO
WO 2008038072 Apr 2008 WO
WO 2008092268 Aug 2008 WO
WO 2009067251 May 2009 WO
Non-Patent Literature Citations (132)
Entry
Hydro One Networks, Inc., Request for Proposal for Smart Metering Services, 16 pp., Mar. 4, 2005.
Trilliant Networks, “The Trilliant AMI Solution,” RFP SCP-07003, 50 pp., Mar. 22, 2007.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile 0x0109, Revision 14, Document 075356r14, 202 pp., May 29, 2008.
Hubaux, J. P., et al. “Towards Mobile Ad-Hoc WANs: Terminodes,” 2000 IEEE, Wireless Communications and Networking Conference, WCNC, vol. 3, pp. 1052-1059, 2000.
Miklos, G., et al., “Performance Aspects of Bluetooth Scatternet Formation,” First Annual Workshop on Mobile and Ad Hoc Networking and Computing, MobiHOC 2000, pp. 147-148, 2000.
Eng, K. Y., et al. “BAHAMA: A Broadband Ad-Hoc Wireless ATM Local-Area Network,” 1995 IEEE International Conference on Communications, ICC '95 Seattle, ‘Gateway to Globalization’, vol. 2, pp. 1216-1223, Jun. 18-22, 1995.
Lee, David J. Y., “Ricocheting Bluetooth,” 2nd International Conference on Microwave and Millimeter Wave Technology Proceedings, ICMMT 2000, pp. 432-435, 2000.
Lilja, Tore, “Mobile Energy Supervision,” Twenty-second International Telecommunications Energy Conference, 2000 INTELEC, pp. 707-712, 2000.
Parkka, Juha, et al., “A Wireless Wellness Monitor for Personal Weight Management,” Proceedings of the 2000 IEEE EMBS International Conference on Information Technology Applications in Biomedicine, pp. 83-88, 2000.
Broch, J., et al., “Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks,” Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pp. 370-375 (7 pp. with Abstract), Jun. 23-25, 1999.
Privat, G., “A System-Architecture Viewpoint on Smart Networked Devices,” Microelectronic Engineering, vol. 54, Nos. 1-2, pp. 193-197, Dec. 2000.
Jonsson, U., et al., “MIPMANET-Mobile IP for Mobile Ad Hoc Networks,” MobiHOC 2000, First Annual Workshop on Mobile and Ad Hoc Networking and Computing, pp. 75-85 (12 pp. with Abstract), 2000.
Kapoor, R., et al., “Multimedia Support Over Bluetooth Piconets,” First Workshop on Wireless Mobile Internet, pp. 50-55, Jul. 2001.
Sung-Yuan, K., “The Embedded Bluetooth CCD Camera,” TENCON, Proceedings of the IEEE Region 10 International Conference on Electrical and Electronic Technology, vol. 1, pp. 81-84 (5 pp. with Abstract), Aug. 19-22, 2001.
Lim, A., “Distributed Services for Information Dissemination in Self-Organizing Sensor Networks,” Journal of the Franklin Institute, vol. 338, No. 6, pp. 707-727, Sep. 2001.
Meguerdichian, S., et al., “Localized Algorithms in Wireless Ad-Hoc Networks: Location Discovery and Sensor Exposure,” ACM Symposium on Mobile Ad Hoc Networking & Computing, MobiHOC 2001, pp. 106-116, Oct. 2001.
Lilakiatsakun, W., et al. “Wireless Home Networks Based on a Hierarchical Bluetooth Scatternet Architecture,” Proceedings of the Ninth IEEE International Conference on Networks, pp. 481-485 (6 pp. with Abstract), Oct. 2001.
Jha, S., et al., “Universal Network of Small Wireless Operators (UNSWo),” Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 626-631 (7 pp. with Abstract), 2001.
“AMRON Technologies Successfully Deploys Advanced Metering Solution for C&I Customers Using Bluetooth” [online], Sep. 2, 2004 [retrieved on Jan. 2, 2009], 3 pp., Retrieved from the Internet: http://www.techweb.com/showpressrelease?articleId=X234101&CompanyId=3.
Utility Intelligence, “Exclusive Distributors of Dynamic Virtual Metering” [online], Copyright 2004-2005 [retrieved on May 12, 2005], Retrieved from the Internet: http://www.empoweringutilities.com/hardware.html, 29 pp.
“AMRON Meter Management System” [online], [retrieved on May 12, 2005], 41 pp., Retrieved from the Internet: http://www.amronm5.com/products/.
Broch, Josh, et al., “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proceedings of the Fourth Annual ACM/IEEE International Conference in Mobile Computing and Networking (MobiCom '98), Dallas, Texas, 13 pp., Oct. 25-30, 1998.
Broch, Josh, et al., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks” [online], Mar. 13, 1998 [retrieved on Feb. 24, 2009], 31 pp., Retrieved from the Internet: http://tools.ietf.org/draft-ietf-manet-dsr-00.txt.
Katz, Randy H. and Brewer, Eric A., “The Case for Wireless Overlay Networks,” Electrical Engineering and Computer Science Department, University of California, Berkeley, 12 pp., 1996.
Johnson, David B., “Routing in Ad Hoc Networks of Mobile Hosts,” IEEE, pp. 158-163, 1995.
Nachum Shacham, Edwin B. Brownrigg, & Clifford A. Lynch, A Packet Radio Network For Library Automation, 1987 IEEE Military Communications Conference, vol. 2 at 21.3.1, (Oct. 1987).
Nachum Shacham & Janet D. Tornow, Future Directions in Packet Radio Technology, Proc. of the IEEE Infocom 1985 at 93 (Mar. 1985). 17 pp.
John Jubin & Janet D. Tornow, The DARPA Packet Radio Network Protocols, Proc. of the IEEE, vol. 75, No. 1 at 21 (Jan. 87).
John Jubin, Current Packet Radio Network Protocols, Proc. of the IEEE Infocom1985 at 86 (Mar. 1985), 9 pp.
David B. Johnson & David A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, reprinted in Mobile Computing, 153, Kluwer Academic Publishers (Tomasz Imielinski & Henry F. Korth eds., 1996), 18 pp.
David B. Johnson, Mobile Host Internetworking Using IP Loose Source Routing, Carnegie Mellon University CMU-CS-93-128, DARPA Order No. 7330 (Feb. 1993), 18 pp.
Daniel M. Frank, Transmission of IP Datagrams Over NET/ROM Networks, Proc. of the ARRL 7th Computer Networking Conference 1988 at 65 (Oct. 1988), 6 pp.
Robert E. Kahn, et al., Advances in Packet Radio Technology, Proc. of the IEEE, vol. 66, No. 11, pp. 1468-1496 (Nov. 1978).
Clifford A. Lynch & Edwin B. Brownrigg, Packet Radio Networks, Bergamon Press, 259-74 (1987).
Charles E. Perkins & Pravin Bhagwat, Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, ACM SIGCOMM Computer Communication Review, vol. 24, Issue 4 at 234 (Oct. 1994), 11 pp.
William MacGregor, Jil Westcott, & Michael Beeler, Multiple Control Stations in Packet Radio Networks, 1982 IEEE Military Communications Conference, vol. 3 at 10.3-1 (Oct. 1982), 6 pp.
Nachum Shacham & Jil Westcott, Future Directions in Packet Radio Architectures and Protocols, Proc. of the IEEE, vol. 75, No. 1 at 83 (Jan. 1987), 17 pp.
David B. Johnson and David A. Maltz, Protocols for Adaptive Wireless and Mobile Networking, IEEE Personal Communications, Feb. 1996, p. 34-42.
Arek J. Dadej and Daniel Floreani, Interconnected Mobile Radio Networks—A step Towards Integrated Multimedia Military Communications, Communications and Networks for the Year 2000, IEEE Singapore International Conference on Networks/International Conference on Information Engineering '93, vol. 1, p. 152-156.
David A. Beyer, Accomplishments of the DARPA SURAN Program, IEEE MILCOM 1990, p. 39.6.1-8.
William S. Hortos, Application of Neural Networks to the Dynamic Spatial Distribution of Nodes within an Urban Wireless Network, SPIE, vol. 2492, p. 58-70, 1995.
Nachum Shacham and Richard G. Ogier, Network Control and Data Transport for C3I Applications, IEEE 1987, p. 30.5.1-6.
John E. Rustad, Reidar Skaug, and Andreas Aasen, New Radio Networks for Tactical Communication, IEEE Jornal on Selected Areas in Communications, vol. 8, No. 5, p. 713-27, Jun. 1990.
Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi, Issues in Packet Radio Network Design, Proceedings of the IEEE, vol. 75, No. 1, p. 6-20, Jan. 1987.
Janet Tornow, Functional Summary of the DARPA SURAP1 Network, DARPA, Sep. 1986, 17 pp.
John F. Shoch and Lawrence Stewart, Interconnecting Local Networks via the Packet Radio Network, Sixth Data Communications Symposium, Nov. 1979, pp. 153-158.
J.R. Cleveland, Performance and Design Considerations for Mobile Mesh Networks, IEEE MILCOM 96, vol. 1, p. 245-49.
Cmdr. R. E. Bruninga, USN, A Worldwide Packet Radio Network, Signal, vol. 42, No. 10, p. 221-230, Jun. 1988.
Nachum Shacham and Janet Tornow, Packet Radio Networking, Telecommunications, vol. 20, No. 9, p. 42-48, 64, 82, Sep. 1986.
Spencer T. Carlisle, Edison's NetComm Project, IEEE 1989, Paper No. 89CH2709-4-B5, p. B5-1-B5-4.
Brian H. Davies and T.R. Davies, The Application of Packet Switching Techniques to Combat Net Radio, Proceedings of the IEEE, vol. 75, No. 1, p. 43-55, Jan. 1987.
Fouad A. Tobagi, Richard Binder, and Barry Leiner, Packet Radio and Satellite Networks, IEEE Communications Magazine, vol. 22, No. 11, p. 24-40, Nov. 1984.
M. Scott Corson, Joseph Macker, and Stephen G. Batsell, Architectural Considerations for Mobile Mesh Networking, IEEE MILCOM 96, vol. 1, p. 225-9.
K.Y. Eng, et. al., Bahama: A Broadband Ad-Hoc Wireless ATM Local-Area Network, 1995 IEEE International Conference on Communications, vol. 2, p. 1216-23, Jun. 18-22, 1995.
J. Jonquin Garcia-Luna-Aceves, A Fail-Safe Routing Algorithm for Multihop Packet-Radio Networks, IEEE INFOCOM '86, p. 434-43, Apr. 8-10, 1986.
Johanes P. Tamtomo, A Prototype of TCP/IP-Based Internet-PRNET for Land Information Networks and Services, Department of Surveying Engineering, University of New Brunswick, Jan. 25, 1993, 118 pp.
A. Alwan, et al., Adaptive Mobile Multimedia Networks, IEEE Personal Communications, p. 34-51, Apr. 1996.
Michael Ball, et al., Reliability of Packet Switching Broadcast Radio Networks, IEEE Transactions on Circuits and Systems, vol. Cas-23, No. 12, p. 806-13 ,Dec. 1976.
Kenneth Brayer, Implementation and Performance of Survivable Computer Communication with Autonomous Decentralized Control, IEEE Communications Magazine, p. 34-41, Jul. 1983.
Weidong Chen and Eric Lin, Route Optimization and Locations Updates for Mobile Hosts, Proceedings of the 16th ICDCS, p. 319-326, 1996.
Daniel Cohen, Jonathan B. Postel, and Raphael Rom, IP Addressing and Routing in a Local Wireless Network, IEEE INFOCOM 1992, p. 5A.3.1-7.
Charles Perkins and David B. Johnson, Mobility Support in IPv6, Sep. 22, 1994, http//www.monarch.cs.rice.edu/internet-drafts/draft-perkins-ipv6-mobility-sup-00.txt (last visited Sep. 26, 2009.
Jonathan J. Hahn and David M. Stolle, Packet Radio Network Routing Algorithms: A Survey, IEEE Communications Magazine, vol. 22, No. 11, p. 41-7, Nov. 1984.
David A. Hall, Tactical Internet System Architecture for the Task Force XXI, IEEE 1996, p. 219-30.
Robert Hinden and Alan Sheltzer, The DARPA Internet Gateway, DARPA RFC 823, Sep. 1982, 45 pp.
Manuel Jimenez-Cedeno and Ramon Vasquez-Espinosa, Centralized Packet Radio Network: A Communication Approach Suited for Data Collection in a Real-Time Flash Flood Prediction System, Dept. of Electrical and Computer Engineering, University of Puerto Rico-Mayaguez, ACM 0-89791-568-2/93, p. 709-13, 1993.
David B. Johnson, Routing in Ad Hoc Networks of Mobile Hosts, Workshop on Mobile Computing Systems and Applications, Dec. 8-9, 1994, Santa Cruz, California, IEEE 1995, p. 158-63.
David B. Johnson, Route Optimization in Mobile IP, Nov. 28, 1994, http://www.monarch.cs.rice.edu/internet-drafts/draft-ietf-mobileip-optim-00.txt (last visited Sep. 26, 2009), 32 pp.
Mark G. Lewis and J.J. Garcia-Luna-Aceves, Packet-Switching Applique for Tactical VHF Radios, 1987 IEEE MILCOM Communciations Conference, Oct. 19-22, 1987, Washington, D.C., p. 21.2.1-7.
Sioe Mak and Denny Radford, Design Considerations for Implementation of Large Scale Automatic Meter Reading Systems, IEEE Transactions on Power Delivery, vol. 10, No. 1, p. 97-103, Jan. 1995.
Charles E. Perkins and Pravin Bhagwat, A Mobile Networking System Based on Internet Protocol, IEEE Personal Communications, First Quarter 1994, IEEE 1994, p. 32-41.
Richard Schulman, Richard Snyder, and Larry J. Williams, SINCGARS Internet Controller-Heart of the Digitized Battlefield, Proceedings of the 1996 Tactical Communications Conference, Apr. 30-May 2, 1996, Fort Wayne, Indiana, p. 417-21.
Nachum Shacham and Earl J. Craighill, Dynamic Routing for Real-Time Data Transport in Packet Radio Networks, Proceedings of INFOCOM 1982, IEEE 1982, p. 152-58.
R. Lee Hamilton, Jr. and Hsien-Chuen Yu, Optimal Routing in Multihop Packet Radio Networks, IEEE 1990, p. 389-96.
Carl A. Sunshine, Addressing Problems in Multi-Network Systems, Proceedings of INFOCOM 1982, IEEE 1982, p. 12-18.
J.J. Garcia-Luna-Aceves, Routing Management in Very Large-Scale Networks, North-Holland, Future Generations Computer Systems 4, 1988, pp. 81-93.
J.J. Garcia-Luna-Aceves, A Minimum-hop Routing Algorithm Based on Distributed Information, North-Holland, Computer Networks and ISDN Systems 16, 1988/1989, p. 367-382.
D. Hubner, J. Kassubek, F. Reichert, A Distributed Multihop Protocol for Mobile Stations to Contact a Stationary Infrastructure, Third IEE Conference on Telecommunications, Conference Publication No. 331, p. 204-7.
Jens Zander and Robert Forchheimer, The SOFTNET Project: A Retrospect, IEEE EUROCON, Jun. 13-17, 1988, p. 343-5.
Mario Gerla and Jack Tzu-Chich Tsai, Multicluster, Mobile, Multimedia Radio Network, Wireless Networks 1, J.C. Baltzer AG, Science Publishers, 1995, p. 255-265.
F. G. Harrison, Microwave Radio in the British TeleCom Access Network, Second IEE National Conference on Telecommunications, Conference Publication No. 300, Apr. 2-5, 1989, p. 208-13.
Chai-Keong Toh, A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, Mar. 27-29, 1996, p. 480-6.
Fadi F. Wahhab, Multi-Path Routing Protocol for Rapidly Deployable Radio Networks, Thesis submitted to the Department of Electrical Engineering and Computer Science of the University of Kansas, 1994, 59 pp.
Jil Westcott and Gregory Lauer, Hierarchical Routing for Very Large Networks, IEEE MILCOM 1984, Oct. 21-24, 1984, Conference Record vol. 2, p. 214-8
International Search Report and Written Opinion for Application No. PCT/US08/13019, dated Jan. 12, 2009, 13 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13028, dated Jan. 15, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13021, dated Jan. 15, 2009, 11 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13016, dated Jan. 9, 2009, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13024, dated Jan. 13, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13022, dated Jan. 27, 2009, 10 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13030, dated Jan. 9, 2009, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13017, dated Mar. 18, 2009, 11 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13026, dated Feb. 24, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13029, dated Feb. 2, 2009, 8 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13032, dated May 12, 2009, 14 pp.
International Search Report and Written Opinion for Application No. PCT/US09/05008, dated Oct. 22, 2009, 8 pp.
Leis, John, “TCP/IP Protocol Family,” pp. 1 and 42-43, Apr. 3, 2006.
Supplementary European Search Report for Application No. EP 08 85 1869, dated Dec. 30, 2010, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US10/26956, dated May 19, 2010, 2 pp.
Supplementary European Search Report for Application No. EP 08 85 1132, dated Dec. 6, 2010, 9 pp.
Baumann, R., et al., “Routing Packets Into Wireless Mesh Networks,” Wireless and Mobile Computing, Networking and Communications, 2007, WIMOB 2007, Third IEEE International Conference, Piscataway, NJ, Oct. 8, 2007, p. 38 (XP031338321).
Levis Stanford University, J. P. Vasseur, Cisco Systems, et al., “Overview of Existing Routing Protocols for Low Power and Lossy Networks,” draft-levis-rl2n-overview-protocols-02.txt, IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, Ch, No. 2, Nov. 17, 2007 (XP015054252) (ISSN: 0000-0004).
Culler Arch Rock, J.P. Vasseur, Cisco Systems, et al., “Routing Requirements for Low Power and Lossy Networks, draft-culler-rl2n-routing-reqs-01.txt,” IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, Ch, No. 1, Jul. 7, 2007 (XP015050851) (ISSN: 000-0004).
Perkins, C. E., et al., “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Network Working Group Internet Draft, XX, Nov. 9, 2001 (XP002950167).
Postel, J., “RFC 793 Transmission Control Protocol,” Sep. 1981 [retrieved on Jan. 1, 2007], Retrieved From the Internet: http://www.ietf.org/rfc/rfc0793.txt.
Supplementary European Search Report for Application No. EP 08 85 1927, dated Dec. 22, 2010, 10 pp.
Younis, M., et al., “Energy-Aware Routing in Cluster-Based Sensor Networks,”Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 10th IEEE Proceedings on Mascots, Oct. 11-16, 2002, Piscataway, NJ (XP010624424) (ISNB: 978-0-7695-1840-4).
Supplementary European Search Report for Application No. EP 08 85 3052, dated Mar. 18, 2011, 10 pp.
Supplementary European Search Report for Application No. EP 08 85 1560, dated Mar. 24, 2011, 9 pp.
Supplementary European Search Report for Application No. EP 08 85 2992, dated Mar. 23, 2011, 6 pp.
International Search Report and Written Opinion for Application No. PCT/US2011/060694, dated Apr. 9, 2012, 10 pp.
International Search Report and Written Opinion for Application No. PCT/US12/22334, dated Apr. 9, 2012, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US11/56620, dated Mar. 13, 2012, 8 pp.
Supplementary European Search Report for Application No. EP 08 84 2449, dated Nov. 29, 2011, 5 pp.
Lin, Shen, et al., “A Wireless Network Based on the Combination of Zigbee and GPRS” [online], [retrieved on Feb. 16, 2012], IEEE International Conference on Networking, Sensing and Control, Apr. 6-8, 2008, 4 pp., Retrieved From the Internet: http://ieeexplore.ieee.org/xpls/abs—all.jsp?arnumber=4525223.
Telegesis, “ZigBee Gateway Makes Your Meter Smart” [online], 2005 [retrieved on Feb. 16, 2012], 1 p., Retrieved From the Internet: http://www.telegesis.com/downloads/general/SSV%20IP%20gateway%20case%20study.pdf.
Supplementary European Search Report for Application No. EP 09 81 1849, dated Dec. 13, 2011, 9 pp.
Gerla, Mario, et al., Multicasting Protocols for High-Speed, Wormhole-Routing Local Area Networks, ACM SIGCOMM Computer Communication Review, vol. 26, No. 4, Oct. 4, 1996, pp. 184-193.
International Search Report and Written Opinion for Application No. PCT/US2011/049277, dated Jan. 31, 2012, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US11/21167, dated Mar. 21, 2012, 8 pp.
“UCAIug Home Area Network System Requirements Specification, A Work Product of the OpenHAN Task Force Formed by the SG Systems Working Group Under the Open Smart Grid (OpenSG) Technical Committee of the UCA® International Users Group, Version 2.0,” 157 pp., Aug. 30, 2010.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile: 0x0109, Revision 15, Dec. 1, 2008, Document 075345r15 (SEP Document), 244 pp.
Edison Electric Institute (EEI), “Uniform Business Practices for Unbundled Electricity Metering, vol. Two,” Dec. 5, 2000, 196 pp., www.naesb.org/pdf/ubp120500.pdf.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile: 0x0109, Revision 16, Version 1.1, Document 075356r16ZB, 332 pp., Mar. 23, 2011.
“ZigBee Over-the-Air Upgrading Cluster,” ZigBee Alliance, Document 095264r18, Revision 18, Version 1.0, 63 pp., Mar. 14, 2010.
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements, “Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (WPANs),” IEEE Computer Society, 323 pp., Sep. 8, 2006.
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements, “Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs),” IEEE Computer Society, 679 pp., Oct. 1, 2003.
“ZigBee Cluster Library Specification,” ZigBee Alliance, Document 075123r02ZB, 420 pp., May 29, 2008.
Liu, Ryan, et al., “A Survey of PEV Impacts on Electric Utilities,” EEE PES Innovative Smart Grid Technologies Conference, Anaheim, California, 8 pp., Jan. 17-19, 2011.
“Utility/Lab Workshop on PV Technology and Systems,” DTE Energy DER Technology Adoption, DEW Analysis of Renewable, PEV & Storage, Tempe, Arizona, 36 pp., Nov. 8-9, 2010.
“Network Device: Gateway Specification,” ZigBee Alliance, ZigBee Document 075468r35, Revision 35, Version No. 1.0, 301 pp., Mar. 23, 2011.
International Search Report and Written Opinion for Application No. PCT/US12/28135, dated Jul. 5, 2012, 7 pp.
Related Publications (1)
Number Date Country
20120052812 A1 Mar 2012 US
Provisional Applications (1)
Number Date Country
61377548 Aug 2010 US