The invention relates to managing clock synchronization over a shared medium.
A network of communication stations can use any of a variety of clock recovery techniques to correct for clock error before decoding a packet or data stream. Various techniques for clock recovery are based on detecting portions of transmitted signals (e.g., a preamble that can also be used to detect the start of a data packet). For example, Digital Video Broadcasting (DVB) standards for digital television include techniques for clock recovery based on a continuous stream including pilot carriers that can be used to synchronize a local phase-locked loop used for decoding the stream. However, such techniques may not be appropriate in networks in which multiple stations may be transmitting data.
In one aspect, in general, a method for communicating among stations in a network includes providing repeated beacon transmissions from at least some of the stations including a first station, where the first station is assigned to a first level. The method includes assigning any stations that can reliably receive transmissions from the first station to a second level. The method includes assigning to each of one or more higher levels any stations not assigned to any of the preceding levels that can reliably receive transmissions from the preceding level. The method includes synchronizing timing information at each station in a given level according to transmissions received from at least one station in the preceding level.
In another aspect, in general, a method for communicating among stations in a network includes providing repeated beacon transmissions from at least some of the stations including a first station. The first station is assigned to a first level. For each given station other than the first station, a station is determined from which transmissions can be reliably received that has the lowest level, and the given station is assigned to a level that is one higher than the level of the determined station. Timing information at each station in a given level is synchronized according to transmissions received from at least one station in the preceding level.
In another aspect, in general, a system for communicating among stations in a network includes a first station assigned to a first level; a first set of one or more stations that can each reliably receive transmissions from the first station assigned to a second level; and one or more additional sets of one or more stations that can reliably receive transmissions from at least one station in the preceding level, each set assigned to a given level configured to synchronize timing information according to transmissions received from at least one station in the preceding level.
Aspects can include one or more of the following features.
Synchronizing the timing information at a given station comprises synchronizing a local clock used to sample received transmissions at the station.
Synchronizing the timing information at a given station comprises synchronizing a local clock used to prepare transmissions from the station.
Synchronizing the timing information at a given station in a given level comprises synchronizing a prediction of a periodic time reference based on timing information in a transmission received from at least one station in the preceding level.
Each of at least some of the beacon transmissions from a given station includes at least one of: a timestamp of a clock at the given station, and time delay information indicating a time delay between a periodic time reference and a time associated with the beacon transmission from the given station.
Synchronizing the timing information at a given station comprises synchronizing a clock at the given station based on the timestamp in a received beacon transmission.
Synchronizing the timing information at a given station includes: tracking a position in an AC line cycle, and using the time delay information in a received beacon transmission to predict future occurrences of the periodic time reference relative to the tracked AC line cycle position.
The position in the AC line cycle comprises a zero crossing.
The method further comprises using the predicted future occurrence of the periodic time reference in response to not receiving a beacon transmission at an expected time.
Synchronizing the timing information at a given station includes: tracking a clock at the given station, and using the time delay information in a received beacon transmission to predict future occurrences of the periodic time reference relative to the tracked clock.
The method further comprises updating the tracked clock using information from beacon transmissions.
Aspects can have one or more of the following advantages.
In some networks it is useful to have tight synchronization of clocks at various nodes (or “stations”) in the network. One application of tightly synchronized clocks is to enable cost saving at the physical layer. In some cases, physical layer signaling requires the clock of a receiver to be within a certain offset (e.g., 1 part per million) of the clock of a transmitter for proper operation. The cost of circuitry (e.g., clock crystals) of highly accurate clocks to provide such a low offset may be expensive. As an alternative to highly accurate clocks, clocks with lower precision can be used along with a clock synchronization mechanism that enables stations to compensate for a given clock offset. The synchronization techniques can be used to synchronize the physical layer (PHY) signaling between stations to eliminate inter-carrier interference without the need for highly accurate clocks. Synchronization can also enable tight control of jitter within the network. For example, an audio streaming application may require that multiple speakers play music in a synchronized manner. Since typical networks create jitter, a clock synchronization mechanism that synchronizes the clocks at all of the speakers and indicates the time at which each audio packet is to be played at each speaker can be used.
Other aspects and advantages will be apparent from the detailed description, drawings, appendices and claims.
There are a great many possible implementations of the invention, too many to describe herein. Some possible implementations that are presently preferred are described below. It cannot be emphasized too strongly, however, that these are descriptions of implementations of the invention, and not descriptions of the invention, which is not limited to the detailed implementations described in this section but is described in broader terms in the claims.
A BPLN can include one or more Cells. A cell is a group of broadband power line (BPL) devices in a BPLN that have similar characteristics such as association management, security, Quality of Service (QoS) and channel access settings, for example. Cells in a BPLN are logically isolated from each other, and communication to and from the backhaul occurs within the cell. Each cell in a BPLN includes a Core-Cell and may also include one or more Sub-Cells. There can be more than one cell on a given physical power line medium.
A Core-Cell includes a group of devices in a BPLN that can share certain functionality such as a common security protocol. An exemplary Core-Cell includes a Head End (HE), Repeaters (R), and Network Termination Units (NTUs), but may exclude Customer Premise Equipment (CPE). The Head End (HE) is a device that bridges a cell to the backhaul network. At a given time, a cell will have one active Head End and the Head End manages the cell including the Core-Cell and any associated Sub-Cells. A Repeater (RP) is a device that selectively retransmits MSDUs to extend the effective range and bandwidth of the BPLN Cell. Repeaters can also perform routing and QoS functions. The NTU is a device that connects a BPLN cell to the end users' network or devices. The NTU may in some cases bridge to other network technologies such as WiFi. A single NTU can serve more than one customer. Each Sub-Cell is associated with an active NTU. In some implementations, an HE, an NTU and/or an RP can be co-located at a single station. Thus, a single device may be designed to perform multiple functions. For example, a single device can simultaneously be programmed to perform the tasks associated with an RP and an NTU.
Various types of CPE devices (e.g., a computer) can be used as endpoint nodes in the network and such devices can communicate with other nodes in the network through the NTU, any number of repeaters, (e.g., including no repeaters), and the Head End. Each node in the network communicates as a communication “station” using a PHY layer protocol that is used by the nodes to send transmissions to any other stations that are close enough to successfully receive the transmissions. Stations that cannot directly communicate with each other use one or more repeater stations to communicate with each other. The stations have the potential to interfere with each other, but techniques can be used to coordinate in a centralized and/or distributed manner.
Any of a variety of communication system architectures can be used to implement the portion of the network interface module that converts data to and from a signal waveform that is transmitted over the communication medium. An application running on a station provides and receives data to and from the network interface module in segments. A “MAC Service Data Unit” (MSDU) is a segment of information received by the MAC layer. The MAC layer can process the received MSDUs and prepares them to generate “MAC protocol data units” (MPDUs). An MPDU is a segment of information including a header (e.g., with management and overhead information) and payload fields that the MAC layer has asked the PHY layer to transport. An MPDU can have any of a variety of formats based on the type of data being transmitted. A “PHY Protocol Data Unit (PPDU)” refers to the modulated signal waveform representing an MPDU that is transmitted over the power line by the physical layer.
Apart from generating MPDUs from MSDUs, the MAC layer can provide several functions including channel access control, providing the required QoS for the MSDUs, retransmission of corrupt information, routing and repeating. Channel access control enables stations to share the powerline medium. Several types of channel access control mechanisms like carrier sense multiple access with collision avoidance (CSMA/CA), centralized Time Division Multiple Access (TDMA), distributed TDMA, token based channel access, etc., can be used by the MAC. Similarly, a variety of retransmission mechanism can also be used. The Physical layer (PHY) can also use a variety of techniques to enable reliable and efficient transmission over the transmission medium (power line, coax, twisted pair etc). Various modulation techniques like Orthogonal Frequency Division Multiplexing (OFDM), Wavelet modulations can be used. Forward error correction (FEC) code line Viterbi codes, Reed-Solomon codes, concatenated code, turbo codes, low density parity check code, etc., can be employed by the PHY to overcome errors. A preferred implementation of the MAC and PHY layers used by powerline medium is that based on HomePlug AV specification.
One implementation of the PHY layers is to use OFDM modulation. In OFDM modulation, data are transmitted in the form of OFDM “symbols.” Each symbol has a predetermined time duration or symbol time Ts. Each symbol is generated from a superposition of N sinusoidal carrier waveforms that are orthogonal to each other and form the OFDM carriers. Each carrier has a peak frequency fi and a phase Φi measured from the beginning of the symbol. For each of these mutually orthogonal carriers, a whole number of periods of the sinusoidal waveform is contained within the symbol time Ts. Equivalently, each carrier frequency is an integral multiple of a frequency interval Δf=1/Ts. The phases Φi and amplitudes Ai of the carrier waveforms can be independently selected (according to an appropriate modulation scheme) without affecting the orthogonality of the resulting modulated waveforms. The carriers occupy a frequency range between frequencies f1 and fN referred to as the OFDM bandwidth.
Referring to
At the transmitter 202, modules implementing the PHY layer receive an MPDU from the MAC layer. The MPDU is sent to an encoder module 220 to perform processing such as scrambling, error correction coding and interleaving.
The encoded data is fed into a mapping module 222 that takes groups of data bits (e.g., 1, 2, 3, 4, 6, 8, or 10 bits), depending on the constellation used for the current symbol (e.g., a BPSK, QPSK, 8-QAM, 16-QAM constellation), and maps the data value represented by those bits onto the corresponding amplitudes of in-phase (I) and quadrature-phase (Q) components of a carrier waveform of the current symbol. This results in each data value being associated with a corresponding complex number Ci=Ai exp(jΦi) whose real part corresponds to the I component and whose imaginary part corresponds to the Q component of a carrier with peak frequency fi. Alternatively, any appropriate modulation scheme that associates data values to modulated carrier waveforms can be used.
The mapping module 222 also determines which of the carrier frequencies f1, . . . , fN within the OFDM bandwidth are used by the system 200 to transmit information. For example, some carriers that are experiencing fades can be avoided, and no information is transmitted on those carriers. Instead, the mapping module 222 uses coherent BPSK modulated with a binary value from the Pseudo Noise (PN) sequence for that carrier. For some carriers (e.g., a carrier i=10) that correspond to restricted bands (e.g., an amateur radio band) on a medium 204 that may radiate power no energy is transmitted on those carriers (e.g., A10=0). The mapping module 222 also determines the type of modulation to be used on each of the carriers (or “tones”) according to a “tone map.” The tone map can be a default tone map, or a customized tone map determined by the receiving station, as described in more detail below.
An inverse discrete Fourier transform (IDFT) module 224 performs the modulation of the resulting set of N complex numbers (some of which may be zero for unused carriers) determined by the mapping module 222 onto N orthogonal carrier waveforms having peak frequencies f1, . . . , fN. The modulated carriers are combined by IDFT module 224 to form a discrete time symbol waveform S(n) (for a sampling rate fR), which can be written as
where the time index n goes from 1 to N, Ai is the amplitude and Φi is the phase of the carrier with peak frequency fi=(i/N) fR, and j=√−1. In some implementations, the discrete Fourier transform corresponds to a fast Fourier transform (FFT) in which N is a power of 2.
A post-processing module 226 combines a sequence of consecutive (potentially overlapping) symbols into a “symbol set” that can be transmitted as a continuous block over the communication medium 204. The post-processing module 226 prepends a preamble to the symbol set that can be used for automatic gain control (AGC) and symbol timing synchronization. To mitigate intersymbol and intercarrier interference (e.g., due to imperfections in the system 200 and/or the communication medium 204) the post-processing module 226 can extend each symbol with a cyclic prefix that is a copy of the last part of the symbol. The post-processing module 226 can also perform other functions such as applying a pulse shaping window to subsets of symbols within the symbol set (e.g., using a raised cosine window or other type of pulse shaping window) and overlapping the symbol subsets.
An Analog Front End (AFE) module 228 couples an analog signal containing a continuous-time (e.g., low-pass filtered) version of the symbol set to the communication medium 204. The effect of the transmission of the continuous-time version of the waveform S(t) over the communication medium 204 can be represented by convolution with a function g(τ;t) representing an impulse response of transmission over the communication medium. The communication medium 204 may add noise n(t), which may be random noise and/or narrowband noise emitted by a jammer.
At the receiver 206, modules implementing the PHY layer receive a signal from the communication medium 204 and generate an MPDU for the MAC layer. An AFE module 230 operates in conjunction with an Automatic Gain Control (AGC) module 232 and a time synchronization module 234 to provide sampled signal data and timing information to a discrete Fourier transform (DFT) module 236.
After removing the cyclic prefix, the receiver 206 feeds the sampled discrete-time symbols into DFT module 236 to extract the sequence of N complex numbers representing the encoded data values (by performing an N-point DFT). Demodulator/Decoder module 238 maps the complex numbers onto the corresponding bit sequences and performs the appropriate decoding of the bits (including de-interleaving and descrambling).
Any of the modules of the communication system 200 including modules in the transmitter 202 or receiver 206 can be implemented in hardware, software, or a combination of hardware and software.
Various stations in a network may generate regular beacon transmissions for various purposes. A beacon transmission (or simply a “beacon”) includes management information that can be used for a variety of purposes. The stations may communicate with each other in time periods between beacon transmissions, provided the power line channel characteristics between any two communicating stations permit it.
In some networks one of the functions of a beacon transmission is to carry medium allocation (or scheduling) information. The scheduling information allocates some of the time between beacon transmissions as a contention period during which stations may contend for access to the power line medium. The scheduling information also allocates a contention-free period during which times slots are assigned to particular stations for access to the power line medium. The scheduling information is provided relative to a TDMA Scheduling Period Start Time (or TDMA Period Start Time).
The TDMA Period start time is synchronized with respect to the AC line cycle of the power line waveform such that the time between consecutive TDMA period start times is based on the underlying AC line cycle frequency. Thus, to the extent that the AC line cycle frequency may vary, the TDMA period start time (and hence the duration of each TDMA Period) may not be perfectly periodic. Since the beacons transmitted by the HE may not be heard by every station, each station transmits its own beacon to relay the information in the beacon to stations that do not hear the HE. While the stations may transmit their beacons at different times, the TDMA period start time is established with respect to the information contained in the beacons transmitted by the HE. At each station, the TDMA period start time can be synchronized to that of the HE using a start time synchronization procedure described in more detail below. Each station can then predict a given TDMA period end time (or future TDMA period start time) based on the synchronized start time and the local AC line cycle at the given station by correlating the synchronized start time to a detectable feature of the power line waveform such as a zero crossing. The TDMA period can be set by the HE to any multiple of a half of the AC line cycle period, for example, by waiting for a given number of zero crossings.
In the absence of the AC line cycle such as on a DC power bus or on other medium such as coax or phone lines, the TDMA Period may be based on or synchronized to the Network Time Base (NTB). In this case, the HE would communicate the period and timing of the TDMA period to other stations in the network base on the NTB. The NTB is a network wide clock provided by the HE whose current clock value is included in the beacon (e.g. 32 bit NTB clock value based on a 25 MHz clock). Each station that can directly hear the HE will recover the NTB locally from the information communicated in the HE's beacon and will include the locally recovered NTB in their own beacon transmission for use by stations that cannot hear the HE directly. Stations that cannot hear the HE directly will recover the NTB from another station that it can directly hear that is nearer to the HE than itself and will also include the locally recovered NTB in their own beacon transmission. This provides a means for all in the network stations to recover the NTB. CPEs do not need to transmit the NTB in a beacon.
In some cases it is desirable to increase the TDMA period to make more efficient use of the medium by reducing the percentage of time devoted to sending the “overhead” information in the beacon transmission. There is also overhead information associated with transmissions from the stations during each TDMA period. It may also be desirable to keep the TDMA period small enough to provide a desired number of transmission opportunities in a given length of time to reduce the latency. Thus, the TDMA period can be selected according to a trade-off between keeping overhead low and latency between transmission opportunities low. For example, in some implementations the TDMA period is selected to be twice the AC line cycle period. In this case, when operating in power line environments with an AC line cycle frequency of 60 Hz, the TDMA period would be approximately 33.33 msec. When operating in power line environments with an AC line cycle frequency of 50 Hz, the TDMA period would be approximately 40 msec. Variations in the TDMA period may occur due to drift in the AC line cycle frequency. The HE determines the duration of the TDMA period as well as the start time of the TDMA period. In order to reduce latency, more than one time slot may be assigned to a station during a TDMA period.
In networks in which repeaters are used to extend the reach of signals in the network, multiple stations can retransmit beacon transmissions to be heard by stations that would otherwise not be able to receive the beacon transmissions from the HE.
Synchronization can be achieved in a network with the head end as a “master” and multiple levels of stations that are formed based on which stations are able to hear certain other stations' beacon transmissions. The synchronization can be used to: correct a local PHY clock used for the processing of transmitted and received signals at the stations, announce the future TDMA period start times and schedules relative to the TDMA period, and perform other functions such as jitter control. The synchronization can be performed in a hierarchical manner such that stations can synchronize to other stations from which they can reliably receive beacon transmissions. Thus, not all stations need to be able to reliably receive messages from the HE in order to maintain synchronization with a clock at the HE. A “Beacon Level” can be used as part of a “network time base synchronization” and a “start time synchronization” within the network.
Each station in the BPLN broadcasts a beacon transmission regularly but not necessarily at the same time (or at the same frequency) at which the HE broadcasts beacon transmissions. For example, a Repeater station may transmit its beacon within a given target maximum delay (e.g., 100 ms) after reception of the beacon it is tracking.
The beacon transmission can contain many fields including the Beacon Level (BL) and Beacon Time Stamp (BTS). The BL and BTS are used to obtain network time base synchronization. The HE is considered to be a Beacon Level 0 station and it sets the BL field in the beacon transmission to be zero. All the stations that can reliably receive (or “hear”) the beacon transmissions sent by the HE (with BL=0) are Beacon Level 1 stations and set the BL field in their beacon transmissions to 1. For all other stations, the BL is one higher than the smallest BL of all the stations it can reliably hear.
The HE maintains a timer circuit (e.g., a 32-bit timer circuit such as a counter), called the Network Time Base (NTB) timer, clocked by high-frequency clock (e.g., a 25 MHz clock). Each of the other stations also maintains its own NTB timer that represents an estimate of the NTB timer at the HE station. The stations other than the HE maintain their NTB timer using a local clock, and regularly update their NTB timer using recently received NTB timer values from beacon transmissions of the lowest level (the level closest to the level of the HE) station that it can hear. Any of a variety of techniques can be used to update the NTB timers including adjustable circuitry and/or offset formulas computed by a processor. The HE sets the BTS field of the beacon transmission to be the value of the NTB timer at the time the beacon transmission is sent (e.g., the time instant at which the first non-zero sample of the beacon transmission appears on the transmitter's analog output), called the Beacon Transmit Time (BTT). The Beacon Level 1 stations track the beacon transmissions received from the HE, and use the BTS in the received beacon transmission to update the NTB timer maintained by that station. The Beacon Level 1 stations can also correct their local clocks using this information. The Beacon Level 1 stations in turn send beacon transmissions with the BTS field set to the value of their NTB timer at the time of their beacon transmission. This process continues with each station using the BTS field information of beacons reliably received from stations with lowest BL to update their own NTB timer. Using this approach, all the stations in the BPL network can be synchronized in a hierarchical manner. The NTB timer maintained by each station can be updated by synchronizing in frequency and/or value to the NTB timer maintained at the HE via the received BTS values.
Start time synchronization can be used to establish TDMA period start times as a series of repeating shared time references (“Start Times”) that can be used, for example, to generate and enforce non-interfering local TDMA schedules or for channel adaptation purposes (for example, adapt differently at different portions of the TDMA period). This may be required, for example, because stations may be on different phases of the AC line cycle, and even if their relative phase offsets were known, there may be local noise in the zero cross detection circuit can distort the detection of actual position of the zero crossings making it hard to establish a shared time reference from the power line waveform alone. Each station transmits a Start Time Offset (STO) as one of the fields of its beacon transmission. The STO value corresponds to the time offset of the beacon being transmitted with respect to the shared Start Time of the network. The HE determines the Start Time according to a local time reference (e.g., the zero crossing of its AC line cycle). The other stations compute the Start Time using the STO field of the beacon it reliably received from the station with the lowest beacon level. Similar to the network time base synchronization, the start time synchronization is achieved in a hierarchical manner using the BL field and the STO field (instead of the BTS field) in the beacon.
A station can predict the location of any number of future Start Times using any combination of their NTB timer, their local clock, and/or their local power line waveform. Additionally, even though a station may have been established as a Beacon Level N+1 station that reliably receives beacons from a Beacon Level N station, the station may occasionally miss a beacon due to the beacon being not received successfully or perhaps not being transmitted for some reason. If a given station does not receive a beacon transmission as expected, the station may also infer the location of a previous Start Time based on one or more previous STO values received in earlier beacons and any combination of their NTB timer, their local clock, and/or their local power line waveform. For example, line-cycle synchronization can be achieved by tracking a particular point in the AC line cycle using a Digital Phase Locked Loop (DPLL) or equivalent. Each station can use its local tracking history to predict future locations of the TDMA period Start Times.
This application is a continuation of U.S. patent application Ser. No. 12/133,233, entitled “CLOCK SYNCHRONIZATION OVER A SHARED MEDIUM”, filed on Jun. 4, 2008 now U.S. Pat. No. 7,949,356, which claims priority to U.S. Provisional Application Ser. No. 60/941,949, entitled “MANAGING COMMUNICATIONS OVER A SHARED MEDIUM,” filed on Jun. 4, 2007, both of which are herein incorporated by reference as though fully and completely set forth herein.
Number | Name | Date | Kind |
---|---|---|---|
4578530 | Zeidler | Mar 1986 | A |
4689786 | Sidhu et al. | Aug 1987 | A |
4807248 | Pyatt et al. | Feb 1989 | A |
5328530 | Semiatin et al. | Jul 1994 | A |
5359625 | Vander Mey et al. | Oct 1994 | A |
5570355 | Dail et al. | Oct 1996 | A |
5682428 | Johnson | Oct 1997 | A |
5732076 | Ketseoglou et al. | Mar 1998 | A |
6074086 | Yonge, III | Jun 2000 | A |
6111919 | Yonge, III | Aug 2000 | A |
6141355 | Palmer et al. | Oct 2000 | A |
6167137 | Marino et al. | Dec 2000 | A |
6173400 | Perlman et al. | Jan 2001 | B1 |
6185185 | Bass et al. | Feb 2001 | B1 |
6188690 | Holden et al. | Feb 2001 | B1 |
6189040 | Oohara | Feb 2001 | B1 |
6201794 | Stewart et al. | Mar 2001 | B1 |
6243761 | Mogul et al. | Jun 2001 | B1 |
6269132 | Yonge, III | Jul 2001 | B1 |
6269163 | Rivest et al. | Jul 2001 | B1 |
6272135 | Nakatsugawa | Aug 2001 | B1 |
6278685 | Yonge, III et al. | Aug 2001 | B1 |
6307940 | Yamamoto et al. | Oct 2001 | B1 |
6310892 | Olkin | Oct 2001 | B1 |
6388995 | Gai et al. | May 2002 | B1 |
6519231 | Ding et al. | Feb 2003 | B1 |
6574195 | Roberts | Jun 2003 | B2 |
6591364 | Patel | Jul 2003 | B1 |
6606303 | Hassel et al. | Aug 2003 | B1 |
6631136 | Chowdhury et al. | Oct 2003 | B1 |
6711163 | Reid et al. | Mar 2004 | B1 |
6775656 | Gettwart et al. | Aug 2004 | B1 |
6804252 | Johnson | Oct 2004 | B1 |
6904462 | Sinha | Jun 2005 | B1 |
6910136 | Wasserman et al. | Jun 2005 | B1 |
7039021 | Kokudo | May 2006 | B1 |
7085284 | Negus | Aug 2006 | B1 |
7181620 | Hur | Feb 2007 | B1 |
7234058 | Baugher et al. | Jun 2007 | B1 |
7346021 | Yoshizawa et al. | Mar 2008 | B2 |
7350076 | Young et al. | Mar 2008 | B1 |
7352770 | Yonge, III et al. | Apr 2008 | B1 |
7369579 | Logvinov et al. | May 2008 | B2 |
7409543 | Bjorn | Aug 2008 | B1 |
7496039 | Yamada et al. | Feb 2009 | B2 |
7506042 | Ayyagari | Mar 2009 | B2 |
7558294 | Yonge, III et al. | Jul 2009 | B2 |
7558575 | Losh et al. | Jul 2009 | B2 |
7573891 | Chow et al. | Aug 2009 | B1 |
7609681 | Kurobe et al. | Oct 2009 | B2 |
7756039 | Yonge, III et al. | Jul 2010 | B2 |
7797751 | Hughes et al. | Sep 2010 | B1 |
7804842 | Malik et al. | Sep 2010 | B2 |
7826475 | Lee et al. | Nov 2010 | B2 |
7826618 | Klingler et al. | Nov 2010 | B2 |
7894487 | Yonge, III | Feb 2011 | B2 |
7949356 | Yonge et al. | May 2011 | B2 |
7961694 | Chan et al. | Jun 2011 | B1 |
8112358 | Yonge, III | Feb 2012 | B2 |
8170051 | Yonge, III | May 2012 | B2 |
8429406 | Yonge et al. | Apr 2013 | B2 |
8467369 | Yonge, III et al. | Jun 2013 | B2 |
8488615 | Yonge, III et al. | Jul 2013 | B2 |
8503480 | Yonge, III et al. | Aug 2013 | B2 |
8510470 | Yonge, III et al. | Aug 2013 | B2 |
20010000709 | Takahashi et al. | May 2001 | A1 |
20020015496 | Weaver, III | Feb 2002 | A1 |
20020025810 | Takayama et al. | Feb 2002 | A1 |
20020029260 | Dobbins et al. | Mar 2002 | A1 |
20020060986 | Fukushima et al. | May 2002 | A1 |
20020097679 | Berenbaum | Jul 2002 | A1 |
20020107023 | Chari et al. | Aug 2002 | A1 |
20020114303 | Crosbie et al. | Aug 2002 | A1 |
20020122411 | Zimmerman et al. | Sep 2002 | A1 |
20020124177 | Harper et al. | Sep 2002 | A1 |
20020137462 | Rankin | Sep 2002 | A1 |
20020141417 | Umayabashi | Oct 2002 | A1 |
20030012166 | Benveniste | Jan 2003 | A1 |
20030018812 | Lakshminarayana et al. | Jan 2003 | A1 |
20030022978 | Hohner et al. | Jan 2003 | A1 |
20030048183 | Vollmer et al. | Mar 2003 | A1 |
20030067892 | Beyer et al. | Apr 2003 | A1 |
20030086437 | Benveniste | May 2003 | A1 |
20030095551 | Gotoh et al. | May 2003 | A1 |
20030137993 | Odman | Jul 2003 | A1 |
20030193959 | Lui et al. | Oct 2003 | A1 |
20030224784 | Hunt et al. | Dec 2003 | A1 |
20030228846 | Berliner et al. | Dec 2003 | A1 |
20030229783 | Hardt | Dec 2003 | A1 |
20040047319 | Elg | Mar 2004 | A1 |
20040070912 | Kopp | Apr 2004 | A1 |
20040081089 | Ayyagari et al. | Apr 2004 | A1 |
20040090982 | Xu | May 2004 | A1 |
20040165532 | Poor et al. | Aug 2004 | A1 |
20040190542 | Ono et al. | Sep 2004 | A1 |
20040210630 | Simonnet et al. | Oct 2004 | A1 |
20040218577 | Nguyen et al. | Nov 2004 | A1 |
20040234073 | Sato et al. | Nov 2004 | A1 |
20040264428 | Choi et al. | Dec 2004 | A1 |
20050001694 | Berkman | Jan 2005 | A1 |
20050021539 | Short et al. | Jan 2005 | A1 |
20050025176 | Ko et al. | Feb 2005 | A1 |
20050068227 | Caspi et al. | Mar 2005 | A1 |
20050071631 | Langer | Mar 2005 | A1 |
20050089005 | Sakoda et al. | Apr 2005 | A1 |
20050114489 | Yonge, III | May 2005 | A1 |
20050117515 | Miyake | Jun 2005 | A1 |
20050117750 | Rekimoto | Jun 2005 | A1 |
20050135291 | Ketchum et al. | Jun 2005 | A1 |
20050147075 | Terry | Jul 2005 | A1 |
20050169222 | Ayyagari et al. | Aug 2005 | A1 |
20050190785 | Yonge, III et al. | Sep 2005 | A1 |
20050210157 | Sakoda | Sep 2005 | A1 |
20050243765 | Schrader et al. | Nov 2005 | A1 |
20050249186 | Kelsey et al. | Nov 2005 | A1 |
20060002406 | Ishihara et al. | Jan 2006 | A1 |
20060039371 | Castro et al. | Feb 2006 | A1 |
20060072517 | Barrow et al. | Apr 2006 | A1 |
20060077997 | Yamaguchi et al. | Apr 2006 | A1 |
20060104301 | Beyer et al. | May 2006 | A1 |
20060159260 | Pereira et al. | Jul 2006 | A1 |
20060168647 | Chiloyan | Jul 2006 | A1 |
20060224813 | Rooholamini et al. | Oct 2006 | A1 |
20060251017 | Bishop | Nov 2006 | A1 |
20060251021 | Nakano et al. | Nov 2006 | A1 |
20060252378 | Bishop | Nov 2006 | A1 |
20060256741 | Nozaki | Nov 2006 | A1 |
20060268746 | Wijting et al. | Nov 2006 | A1 |
20070004404 | Buckley et al. | Jan 2007 | A1 |
20070019609 | Anjum | Jan 2007 | A1 |
20070025244 | Ayyagari et al. | Feb 2007 | A1 |
20070025384 | Ayyagari et al. | Feb 2007 | A1 |
20070025391 | Yonge, III et al. | Feb 2007 | A1 |
20070026794 | Ayyagari et al. | Feb 2007 | A1 |
20070030811 | Frei et al. | Feb 2007 | A1 |
20070053520 | Eckleder | Mar 2007 | A1 |
20070058661 | Chow | Mar 2007 | A1 |
20070058732 | Riedel et al. | Mar 2007 | A1 |
20070060141 | Kangude et al. | Mar 2007 | A1 |
20070097867 | Kneckt et al. | May 2007 | A1 |
20070115973 | Koga et al. | May 2007 | A1 |
20070118730 | Platt | May 2007 | A1 |
20070133388 | Lee et al. | Jun 2007 | A1 |
20070133449 | Schacht et al. | Jun 2007 | A1 |
20070140185 | Garg et al. | Jun 2007 | A1 |
20070147322 | Agrawal et al. | Jun 2007 | A1 |
20070189189 | Andrews et al. | Aug 2007 | A1 |
20070220570 | Dawson et al. | Sep 2007 | A1 |
20070254596 | Corson et al. | Nov 2007 | A1 |
20070271398 | Manchester et al. | Nov 2007 | A1 |
20070286074 | Xu | Dec 2007 | A1 |
20070286111 | Corson et al. | Dec 2007 | A1 |
20080002599 | Yau et al. | Jan 2008 | A1 |
20080151820 | Solis et al. | Jun 2008 | A1 |
20080181219 | Chen et al. | Jul 2008 | A1 |
20080186230 | Wengler et al. | Aug 2008 | A1 |
20080212591 | Wu et al. | Sep 2008 | A1 |
20080222447 | Ram et al. | Sep 2008 | A1 |
20080247408 | Yoon et al. | Oct 2008 | A1 |
20080267106 | Buddhikot et al. | Oct 2008 | A1 |
20080279126 | Katar et al. | Nov 2008 | A1 |
20080298252 | Yonge, III | Dec 2008 | A1 |
20080298589 | Katar et al. | Dec 2008 | A1 |
20080298590 | Katar et al. | Dec 2008 | A1 |
20080298594 | Yonge, III | Dec 2008 | A1 |
20080301052 | Yonge, III | Dec 2008 | A1 |
20080301446 | Yonge, III | Dec 2008 | A1 |
20080310414 | Yonge, III | Dec 2008 | A1 |
20090010276 | Yonge et al. | Jan 2009 | A1 |
20090034552 | Yonge, III | Feb 2009 | A1 |
20090040930 | Yonge, III | Feb 2009 | A1 |
20090067389 | Lee et al. | Mar 2009 | A1 |
20090074007 | Yonge, III | Mar 2009 | A1 |
20090092075 | Corson et al. | Apr 2009 | A1 |
20090106551 | Boren et al. | Apr 2009 | A1 |
20090116461 | Yonge, III et al. | May 2009 | A1 |
20090154487 | Ryan et al. | Jun 2009 | A1 |
20090207769 | Park et al. | Aug 2009 | A1 |
20090311963 | Haverty | Dec 2009 | A1 |
20100014444 | Ghanadan et al. | Jan 2010 | A1 |
20100091760 | Yoon | Apr 2010 | A1 |
20100100724 | Kaliski, Jr. | Apr 2010 | A1 |
20120072715 | Yonge, III | Mar 2012 | A1 |
20130235730 | Yonge, III | Sep 2013 | A1 |
20130272315 | Yonge, III et al. | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
1748574 | Jan 2007 | EP |
1748597 | Jan 2007 | EP |
1179919 | Jul 2010 | EP |
3107317 | May 1991 | JP |
2002135177 | May 2002 | JP |
2005073240 | Mar 2005 | JP |
WO9634329 | Oct 1996 | WO |
WO9857439 | Dec 1998 | WO |
WO02103943 | Dec 2002 | WO |
03100996 | Dec 2003 | WO |
2004038980 | May 2004 | WO |
Entry |
---|
“U.S. Appl. No. 11/970,339 Office Action”, Jun. 18, 2012, 26 pages. |
“U.S. Appl. No. 12/108,334 Office Action”, Aug. 3, 2012, 18 pages. |
“U.S. Appl. No. 12/133,301 Final Office Action”, Sep. 26, 2012, 54 pages. |
“U.S. Appl. No. 12/133,315 Office Action”, Aug. 9, 2012, 37 pages. |
Muir A., et al., “An Efficient Packet Sensing MAC Protocol for Wireless Networks”, Computer Engineering Department School of Engineering, University of California, Aug 1998, pp. 20. |
Notification of First Office Action, The State Intellectual Property Office of the People's Republic of China, issued in Chinese Application No. 200880100486.9 17 pages. Nov. 21, 2012. |
U.S. Appl. No. 11/970,339 Final Office Action. 25 pages. Dec. 11, 2012. |
U.S. Appl. No. 13/303,913 Office Action. 37 pages. Dec. 26, 2012. |
European Search Report, European Patent Office, European Patent Application No. 06253916.8-1246, Oct. 31, 2006, 8 pages. |
HomePlug Powerline Alliance Inc., “HomePlug AV White Paper,” Doc. Ver. No. HPAVWP-050818, Aug. 2005, pp. 1-11. |
Katar et al., “Beacon Schedule Persistence to Mitigate Beacon Loss in HomePlug AV Networks,” May 2006, IEEE 1-4244-0113-05/06, pp. 184-188. |
Lee et al., “HomePlug 1.0 Powerline Communication LANs-Protocol Description and Performance Results version 5.4,” 2000, International Journal of Communication Systems, 2000 00:1-6, pp. 1-25. |
Afkhamie et al., “An Overview of the upcoming HomePlug AV Standard”, May 2005, IEEE 0-7803-8844-5/05, pp. 400-404. |
European Search Report—EP09178487, Search Authority , Munich Patent Office, Jan. 21, 2010. |
Faure, Jean-Philippe et al., Call for Submissions. Draft Standard for Broadband over Power Line Networks: Medium Access Control and Physical Layer Specifications. Feb. 14, 2007, 4 pages. |
Faure, Jean-Philippe et al., Coexistence/interoperability Cluster, FTR SG Requirements. Draft Standard for Broadband over Power Line Networks: Medium Access Control and Physical Layer Specifications. Feb. 5, 2007 , 13 pages. |
International Search Report and Written Opinion—PCT/US2008/065811, International Searching Authority, European Patent Office, Nov. 25, 2008. |
International Search Report and Written Opinion—PCT/US2008/065831, International Searching Authority, European Patent Office, Feb. 20, 2009, 22 pages. |
Loh et al, Quality of Support and priority Management in HomePNA 2.0 Link Layer, IEEE, 6 pages, 2003. |
Notification of First Office Action, The State Intellectual Property Office of the People's Republic of China, issued in Chinese Application No. 200610107587.1, dated Oct. 11, 2010, 6 pages. |
Notification of Reasons for Rejection, Japanese Patent Office, issued in Japanese Patent Application No. 2006-205200, dated Jan. 18, 2011, 3 pages. |
Opera Specification-Part 1: Technology, Open PLC European Research Alliance, 198 pages, 1006. |
“U.S. Appl. No. 11/970,297 Final Office Action”, Apr. 16, 2012, 32 pages. |
“U.S. Appl. No. 12/133,301 Office Action”, Mar. 1, 2012, 38 pages. |
“U.S. Appl. No. 11/970,271 Final Office Action”, Jul. 19, 2011 , 21 pages. |
“U.S. Appl. No. 11/970,271 Office Action”, Mar. 9, 2012, 19 pages. |
“U.S. Appl. No. 11/970,271 Office Action”, Oct. 7, 2011, 20 pages. |
“U.S. Appl. No. 11/970,271 Office Action”, Dec. 7, 2010, 21 pages. |
“U.S. Appl. No. 11/970,297 Office Action”, Mar. 30, 2011 30 pages. |
“U.S. Appl. No. 11/970,297 Office Action”, Sep. 29, 2011, 31 pages. |
“U.S. Appl. No. 11/970,323 Office Action”, Dec. 7, 2010, 12 pages. |
“U.S. Appl. No. 11/970,339 Final Office Action”, Jul. 7, 2011 , 14 pages. |
“U.S. Appl. No. 11/970,339 Office Action”, Jan. 19, 2011 , 22 pages. |
“U.S. Appl. No. 11/971,446 Final Office Action”, Jul. 1, 2011 , 17 pages. |
“U.S. Appl. No. 11/971,446 Office Action”, Feb. 15, 2011 , 20 pages. |
“U.S. Appl. No. 12/108,334 Final Office Action”, Jun. 14, 2011 , 28 pages. |
“U.S. Appl. No. 12/108,334 Office Action”, Aug. 3, 2010 , 20 pages. |
“U.S. Appl. No. 12/108,334 Office Action”, Feb. 16, 2011 , 26 pages. |
“U.S. Appl. No. 12/133,270 Final Office Action”, Nov. 18, 2011 , 23 pages. |
“U.S. Appl. No. 12/133,270 Office Action”, Jun. 3, 2011 , 67 pages. |
“U.S. Appl. No. 12/133,301 Final Office Action”, Mar. 22, 2011 , 39 pages. |
“U.S. Appl. No. 12/133,301 Office Action”, Sep. 22, 2010 , 42 pages. |
“U.S. Appl. No. 12/133,312 Final Office Action”, Feb. 16, 2011 , 24 pages. |
“U.S. Appl. No. 12/133,312 Office Action”, Jun. 8, 2011 , 24 pages. |
“U.S. Appl. No. 12/133,312 Office Action”, Jul. 28, 2010 , 29 pages. |
“U.S. Appl. No. 12/133,315 Final Office Action”, Jul. 20, 2010 , 30 pages. |
“U.S. Appl. No. 12/133,315 Final Office Action”, Jun. 9, 2011 , 38 pages. |
“U.S. Appl. No. 12/133,315 Office Action”, Dec. 24, 2009 , 28 pages. |
“U.S. Appl. No. 12/133,315 Office Action”, Dec. 28, 2010 , 36 pages. |
“U.S. Appl. No. 12/133,325 Final Office Action”, Dec. 9, 2010 , 33 pages. |
“U.S. Appl. No. 12/133,325 Office Action”, May 27, 2010 , 31 pages. |
“U.S. Appl. No. 12/133,301 Office Action”, Sep. 25, 2013 , 44 pages. |
Co-pending U.S. Appl. No. 13/873,168, filed Apr. 29, 2013, 34 pages. |
Co-pending U.S. Appl. No. 13/917,394, filed Jun. 13, 2013, 20 pages. |
U.S. Appl. No. 11/970,339 Office Action, Jun. 27, 2013, 22 pages. |
Co-pending U.S. Appl. No. 13/933,924, filed Jul. 2, 2013, 36 pages. |
U.S. Appl. No. 11/971,446 Office Action, 19 pages, Feb. 14, 2014. |
“U.S. Appl. No. 13/873,168 Office Action”, Dec. 16, 2013 , 23 pages. |
U.S. Appl. No. 11/970,339 Final Office Action, 27 pages, Jan. 3, 2014. |
Number | Date | Country | |
---|---|---|---|
60941949 | Jun 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12133233 | Jun 2008 | US |
Child | 13113474 | US |