The invention relates to network protocols and more particularly to managing distributed access to a shared medium.
Communication stations can share a communication medium using any of a variety of access techniques. Some access techniques (e.g., carrier sense multiple access (CSMA) techniques) include a contention period in which stations determine contend for use of the medium for transmitting a signal by sensing when the medium is idle. In CSMA techniques, “collisions” sometimes occur when signals from two or more stations overlap. Some CSMA techniques attempt to detect collisions and abort transmission to reduce the negative impact of collisions (e.g., CSMA/CD techniques). Other CSMA techniques include mechanisms to avoid or reduce the probability of collisions (e.g., CSMA/CA techniques). For example, different transmissions may be assigned one of multiple priorities. Access is granted using a Priority Resolution Period in which stations signal the priority at which they intend to transmit, and only the highest priority transmissions are allowed to continue in the contention process. A random backoff mechanism spreads the time over which stations attempt to transmit, thereby reducing the probability of collision.
Other access techniques (e.g., time division multiplexing (TDM) techniques) allocate predetermined time intervals in which certain stations are granted use of the medium. A particular station will transmit within a time slot assigned to that station. In these techniques, a synchronization mechanism is used to ensure that the stations agree about when their slot occurs with respect to a common time reference.
Some embodiments include a method for communicating between stations in a network. The method includes determining that a first station has been allocated a first time period to transmit over a shared medium in the network. The method includes transmitting, from the first station to a second station over the shared medium during the first time period, wherein stations other than the first station and the second station refrain from transmitting over the shared medium during the first time period. The method includes receiving, from the second station by the first station, a request message to allow the second station to transmit during the first time period and a requested amount of time to transmit. The method includes determining, by the first station, whether to allow the second station to transmit during the first time period. The method includes, in response to allowing the second station to transmit during the first time period, determining, by the first station, an authorized amount of time for the second station to transmit during the first time period, and transmitting, by the first station to the second station, an authorization message for the second station to transmit and the authorized amount of time.
Some embodiments include a method for communicating between stations in a network. The method includes determining that a first station has been allocated a first time period to transmit over a shared medium in the network based on a contention period to determine selection among the stations. The method includes transmitting, from the first station to a second station over the shared medium during the first time period, wherein stations other than the first station and the second station refrain from transmitting over the shared medium during the first time period. In response to receiving, by the first station, a request message from the second station that includes a requested amount of time that is requested for transmission by the second station, the first station transmits an authorization message to the second station to transmit for an authorized amount of time during the first time period, and transmits the authorized amount of time to the second station.
In one aspect, in general, a method for communicating between stations in a network is described. The method includes coordinating among a plurality of the stations according to a distributed protocol to select a first station to transmit over a shared medium. The method also includes transmitting between the first station and a second station over the shared medium during a time period in which stations other than the first and second stations refrain from transmitting over the shared medium. The first station transmits information that grants permission to the second station to transmit during the time period.
Aspects may incorporate one or more of the following features.
Transmitting between the first station and the second station further includes transmitting from the first station information that includes a specified amount of the time period during which the second station is allowed to transmit.
A specified amount of the time period during which the second station is allowed to transmit is predetermined before the time period begins.
The specified amount of the time period is stored in each of the stations.
The specified amount of the time period is stored in a given station when the given station joins the network.
The specified amount of time is determined as a function of a data rate being used by a station.
The method further comprises coordinating among the plurality of stations according to the distributed protocol to select one of the stations to transmit over the shared medium after receiving information over the shared medium from the first station or the second station that indicates that the time period has ended.
The first station or the second station transmits the information that indicates that the time period has ended in response to receiving a transmission from the second station or the first station.
The information that indicates that the time period has ended includes acknowledgement information confirming successful transmission of information from the second station or the first station.
The first station or the second station transmits the information that indicates that the time period has ended in response to detecting a potential collision.
Detecting a potential collision comprises receiving a transmission in which at least some data is not correctly received.
Detecting a potential collision comprises not receiving any transmission over the shared medium after a predetermined amount of time.
The first station transmits the information that grants permission after receiving a request from the second station.
The request from the second station is transmitted to the first station after at least one transmission from the first station to the second station during the time period.
The method further comprises providing a plurality of opportunities for the second station to transmit to the first station during at least a portion of the time period.
The time period includes time during which the second station is able to transmit acknowledgement information confirming successful transmission of information from the first station to the second station.
The specified amount of the time period during which the second station has received permission to transmit is larger than the time during which the second station transmits the acknowledgement information.
The first station transmits the information that grants permission after receiving a request from the second station included in the acknowledgement information.
The acknowledgement information includes information designating which of multiple segments of information were successfully received by the second station and which of the multiple segments of information should be retransmitted by the first station.
The method further comprises transmitting from the second station during the time period in response to receiving the information that grants permission.
The method further comprises transmitting from the first station acknowledgement information confirming successful transmission of information from the second station to the first station.
The acknowledgement information includes information designating which of multiple segments of information were successfully received by the first station and which of the multiple segments of information should be retransmitted by the second station.
Information transmitted from the second station within the specified amount of the time period includes information other than acknowledgement information confirming successful transmission of information from the first station to the second station.
The information transmitted from the second station within the specified amount of the time period includes a delimiter that precedes a payload, wherein the payload includes the information other than acknowledgement information.
The delimiter includes acknowledgement information confirming successful transmission of information previously transmitted from the first station to the second station.
The information that grants permission is included in header information of a transmission from the first station to the second station.
The first station transmits the information that grants permission after receiving a transmission from the second station that includes an amount of time that is requested.
Information transmitted from the second station to the first station within the specified amount of the time period comprises information used to maintain data flow from the first station to the second station.
The information transmitted from the second station to the first station within the specified amount of the time period comprises adaptation information used by the first station to prepare a signal to be transmitted to the second station.
The adaptation information comprises a map that designates a type of modulation that is to be used, respectively, on each of multiple carriers in the signal.
Information transmitted from the second station to the first station within the specified amount of the time period comprises information according to a protocol associated with a connection between the first station and the second station.
The protocol comprises transmission control protocol (TCP).
The protocol comprises a voice over internet protocol (VoIP).
Coordinating among the plurality of stations according to the distributed protocol comprises contending according to a carrier sense multiple access (CSMA) protocol.
Coordinating among the plurality of stations according to the distributed protocol comprises selecting a predetermined sequence of time slots to which respective stations are assigned.
The predetermined sequence of time slots repeats periodically.
In another aspect, in general, a system for communicating between stations is described. The system includes a first station configured to coordinate among a plurality of the stations according to a distributed protocol to gain access to transmit over a shared medium, and transmit to a second station over the shared medium during a time period in which stations other than the first and second stations refrain from transmitting over the shared medium, including transmitting information that grants permission to the second station to transmit during the time period. The second station is configured to, in response to receiving the information that grants permission, transmit to the first station over the shared medium during the time period.
In another aspect, in general, a method for communicating between stations in a network is described. The method includes coordinating among a plurality of the stations according to a distributed protocol to select a first station to transmit over a shared medium; transmitting between the first station and a second station over the shared medium during a time period in which stations other than the first and second stations refrain from transmitting over the shared medium; and coordinating among the plurality of stations according to the distributed protocol to select one of the stations to transmit over the shared medium after receiving information over the shared medium from the first station or the second station that indicates that the time period has ended.
Aspects can include one or more of the following features.
The method further comprises transmitting from the first station information that grants permission to the second station to transmit during the time period.
The first station or the second station transmits the information that indicates that the time period has ended in response to receiving a transmission from the second station or the first station.
The information that indicates that the time period has ended includes acknowledgement information confirming successful transmission of information from the second station or the first station.
The first station or the second station transmits the information that indicates that the time period has ended in response to detecting a potential collision.
Detecting a potential collision comprises receiving a transmission in which at least some data is not correctly received.
Detecting a potential collision comprises not receiving any transmission over the shared medium after a predetermined amount of time.
In another aspect, in general, a system for communicating between stations is described. The system includes a first station configured to coordinate among a plurality of the stations according to a distributed protocol to gain access to transmit over a shared medium, and transmit to a second station over the shared medium during a time period in which stations other than the first and second stations refrain from transmitting over the shared medium. The second station is configured to transmit to the first station over the shared medium during the time period. A third station is configured to coordinate among the plurality of stations according to the distributed protocol to gain access to transmit over the shared medium after receiving information over the shared medium from the first station or the second station that indicates that the time period has ended.
Among the many advantages of the invention (some of which may be achieved only in some of its various aspects and implementations) are the following.
It enables stations to operate reliably and at higher data rates under various power line environments. It provides a channel adaptation mechanism that can be used in power line communication systems as well as other media that are affected by channel impairments. It can provide a higher level of guaranteed quality of service (QoS). It enables more efficient utilization of contention-free time allocations by enabling a transmitting station to grant some of its allocated time to a receiving station.
The time granted from the allocated time enables a receiving station to send information other than acknowledgement information. For example, time allocated to a first station may include time during which a second receiving station is able to transmit acknowledgement information to the first station confirming successful transmission of information from the first station to the second station. The bi-directional bursting procedure preserves the ability of the receiving station to transmit such acknowledgment information without obtaining specific permission, and provides a way for the receiving station to obtain permission to transmit further information.
At the end of a burst, stations that did not participate in the burst can detect an indicator within a final transmission that signals that the burst is ending and that the stations are able to start contending for access to the medium. This indicator enables the stations to start contending quickly without needing to wait for an inter-frame spacing. This reduces the delay and also avoids the need for sensing circuitry for detecting the lack of a signal during such an inter-frame spacing.
Other features and advantages of the invention will be found in the detailed description, drawings, 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.
System Overview
As shown in
The stations can have differences in the specific communication protocols used, and are still able to communicate with each other if the protocols are compatible. For example, network configuration 100 includes a first type of communication station including stations 102A, 102B, 102C that use a first MAC layer protocol “MAC-A” with a second type of communication station including stations 104A and 104B that use a second type of MAC layer protocol “MAC-B.” The MAC-A and MAC-B protocols are compatible with each other and also use the same or at least compatible PHY layer protocols (e.g., one station uses a MAC-A protocol and a PHY-A protocol, and another station uses a MAC-B protocol and a PHY-B protocol, where PHY-A and PHY-B implement compatible signal modulation formats).
The co-existence of multiple MAC layer protocols can be used, for example, to allow improvements in capabilities and/or performance of the MAC layer while also allowing devices using a new MAC layer protocol to be compatible with legacy devices using an older MAC layer protocol that may exist in the network configuration 100. In some implementations, a dual-mode (DM) device can communicate with a legacy single-mode (SM) device using a first protocol, and can communicate with other DM devices using either the first protocol or a second protocol. The protocol to be used can be set by a communication mode that is determined at network setup time or when a device joins the network. For example, stations 104A and 104B include a network interface module 108 that uses MAC-A. Stations 102A, 102B, and 102C include a network interface module 106 that can use either MAC-A or MAC-B depending on the determined communication mode.
An example of a difference between the protocol layers (or “protocol stack”) used by different types of devices (e.g., the DM and SM devices) is the use of a “central coordinator” (CCo) station. The CCo is a communication station that is selected to provide certain coordination functions for at least some of the other stations in the network configuration 100. A set of stations operating under the coordination of a single CCo is called a Basic Service Set (BSS). Functions performed by the CCo include: authentication of stations upon joining the BSS, provisioning of identifiers for stations, and scheduling and timing of medium access. For example, the CCo broadcasts a repeated beacon transmission from which the stations in the BSS can determine scheduling and timing information. This beacon transmission includes fields that carry information used by the stations to coordinate communication. Though the format of each of the repeated beacon transmission is similar, the content typically changes in each transmission. The beacon transmission is repeated approximately periodically, and, in some implementations, is synchronized to a characteristic of the communication medium 110. The time between successive beacon transmissions is called a “beacon period,” even though the transmissions may not be exactly periodic. In some cases, a Proxy Coordinator (PCo) can be used to manage stations that are “hidden” from the CCo (e.g., stations that do not reliably receive signals from the CCo). An example of a system in which a CCo is used is described in U.S. application Ser. No. 11/337,963, incorporated herein by reference.
Some protocols are distributed protocols that do not rely on a CCo station to coordinate communication. Instead, the stations coordinate among each other according to a distributed protocol in which one of the stations is selected to transmit over a shared medium during a given time period. An example of such a distributed protocol is Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). In this distributed protocol, stations use random backoff algorithms to determine how long a station has to wait before it transmits a packet. If the station determines that another station has already started a transmission, the station will wait until the current transmission is complete, after which it uses the backoff algorithm. In general, the backoff parameters can be adjusted in a distributed manner based on the number of times the station deferred or the number of time a station's transmission has collided with transmissions from one or more other stations. This distributed adaptation of back-off parameters can enable the network to work efficiently under various network loads (or varying number of transmitters). Distributed protocols can also be used to reserve repeating TDMA allocations on the medium. One such example is the one described in U.S. application Ser. No. 10/695,371, entitled “Contention Free Access Intervals on a CSMA network,” incorporated herein by reference. A principle behind such protocols is to notify neighboring stations about the repeating time intervals during which the station intends to transmit. Once this information is successfully communicated to the neighboring stations, the transmitter will be allocated the repeating TDMA time slot (or “allocation”) during which it will be free to transmit. All stations in the network can use this procedure to obtain their own TDMA allocations based on application requirements.
There may also be differences in the access techniques implemented by the MAC-A and MAC-B protocols. For example, in one scenario, the MAC-A protocol uses a first access technique the MAC-B protocol is compatible with the first access technique and provides a second access technique. In this example, the MAC-A protocol uses a CSMA/CA technique to access the network configuration 100. The MAC-B protocol uses a hybrid approach that includes a contention-free period (CFP) in which a time division multiple access (TDMA) technique is used, and optionally includes a contention period (CP) in which a CSMA/CA technique is used. The contention-free period is scheduled and managed by the CCo to provide improved quality of service (QoS) for certain applications run on a device (e.g., audio and/or video applications). Other MAC protocols can use any one or combination of these or other access techniques.
In some implementations, the network interface modules use protocols that include features to improve performance when the network configuration 100 includes a communication medium 110 that exhibits varying transmission characteristics. For example, one aspect of mitigating potential impairments caused by the varying channel characteristics involves using a robust signal modulation format such as orthogonal frequency division multiplexing (OFDM), also known as Discrete Multi Tone (DMT). OFDM is a spread spectrum signal modulation technique in which the available bandwidth is subdivided into a number of narrowband, low data rate channels or “carriers.” To obtain high spectral efficiency, the spectra of the carriers are overlapping and orthogonal to each other. Data are transmitted in the form of symbols that have a predetermined duration and encompass some number of carriers. The data transmitted on these carriers can be modulated in amplitude and/or phase, using modulation schemes such as Binary Phase Shift Key (BPSK), Quadrature Phase Shift Key (QPSK), or m-bit Quadrature Amplitude Modulation (m-QAM).
System Architecture
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 Protocol Data Unit” (MPDU) is a segment of information including overhead 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.
The MPDU can be formatted, for example, as a “frame” that includes a start of frame (SOF) delimiter and (optionally) a payload. In some implementations an end of frame (EOF) delimiter can be used to indicate the end of a frame, but an EOF delimiter is not necessary and is not used in the exemplary implementations illustrated in the figures. The SOF delimiter can include overhead information within fields of a block called “frame control” that is useful for decoding the payload or for responding to another station according to a given protocol, for example. The payload can be various lengths by including some number of blocks to be individually encoded/modulated called PHY Blocks (PBs). In some cases, no payload needs to be sent, but a small amount of information such as acknowledgement information can be sent in a “short MPDU” consisting of just an SOF delimiter without a payload. At the front of a PPDU is a preamble that is used to synchronize a station to the timing of the PPDU. In some cases, the preamble can be considered part of the MPDU, for example, with the SOF delimiter including a preamble and a frame control block.
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.
There can be different types of PPDU structures, for example, depending on whether the PHY-A or PHY-B protocol is being used. For example, the PHY-B signals can use denser OFDM carrier frequency spacing and correspondingly longer symbols.
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, 5, 6, 7, 8, 9, 10, 11 and 12 bits), depending on the constellations used for the various carriers (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 carrier waveforms 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 deinterleaving 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.
Channel Estimation
Channel estimation is the process of measuring the characteristics of the power line channel to adapt the operation of the PHY layer to provide optimal performance.
Channel estimation can include:
The FEC rate and guard interval length can vary over the AC line cycle period, but they are the same for all carriers at any given time.
The results of channel estimation can be reported to the CCo in centralized protocols for use in allocating time slots in the CFP. The CCo can allocate time for communication between a transmitting and receiving station to perform channel estimation. The CCo can then use this channel estimation information in determining or updating the schedule of time slots allocated to stations in the CFP. In distributed protocols, the results of channel estimation can be used by stations as they coordinate communication including setting up time periods during which unidirectional or bi-directional communication can occur between a pair of stations.
The channel-estimation procedures may differ slightly between the CP and the CFP. In the CP, the receiving station can designate a default tone map that may be used by the transmitting station anywhere in the CP. The receiving station may optionally define additional Tone maps that may be used in the CP during particular intervals of the beacon period. This approach allows the transmitting station to begin communicating using tone map modulated data quickly, and avoids complicated interactions between the CSMA access procedure and the channel-estimation procedures for the CP. This approach is well suited to the transport of best effort data. Alternatively, the receiving station can designate intervals within a beacon period over which particular channel adaptation applies without taking into account whether a transmission is within the CP or the CFP.
Before data communication occurs in the CFP, the receiving station defines a tone map that is valid in the interval of the beacon period where the transmission is scheduled. If no valid tone map is defined in an interval, the transmitting station sends a “SOUND MPDU” in the interval until the receiving station defines a tone map that for the interval in a “Sounding process.” The SOUND MPDU includes a signal known to the receiving station from which the receiving station can estimate characteristics of the channel.
An MPDU that carries data is called a “data MPDU.” To acknowledge that the PBs within a data MPDU have been successfully received the receiving station sends to the transmitting station a selective acknowledgement (SACK) message. The SACK designates which of the PBs were successfully received (e.g., using check sequence) and which of the PBs should be retransmitted. For a SOUND MPDU, a “Sound ACK” is used to indicate the reception status and completion of the Sounding process. In some cases, the SACK and Sound ACK messages can be sent as information within one or more fields of the frame control of a short MPDU.
The receiving station defines a tone map in which the modulation for a carrier is tailored to the characteristics of the channel at that carrier frequency. In addition to channel characteristics, the receiving station can also define a tone map based on a type of data to be transmitted (e.g., more robust modulation for applications more sensitive to data loss). The tone map is sent to the transmitting station in a channel estimation response (CER) message.
Alternatively, if no valid tone map is defined in an interval, the transmitting station can use a default tone map that has enough redundancy to be successfully transmitted assuming worst case channel characteristics. This default tone map may be more appropriate if the transmitting station only has a relatively small amount of data to send.
The channel-estimation procedures also include mechanisms for maintaining the lists of the intervals within the beacon period where each tone map may be used. Tone map intervals are defined as time periods within the beacon period where a particular tone map may be used. Since the CCo locks the beacon period to the AC line cycle, intervals are synchronized to the AC line cycle.
Channel and noise characteristics over the power line tend to be periodic with the underlying AC line cycle. In some cases, these impairments occur at twice the frequency of the AC line cycle (i.e., 100 or 120 Hz), while in other cases they may occur at the same frequency as the AC line cycle (e.g., a noise source that responds to the polarity of the AC line waveform). Because of the different access mechanisms and QoS requirements, intervals occurring in the CP and CFP may be treated differently.
The receiving station specifies the intervals within which various tone maps may be used, subject to certain guidelines which may include any of the following:
Bursting
Bursting is a process in which a station transmits multiple MPDUs in a burst (without relinquishing the medium) before soliciting a response (e.g., a SACK). For example, when a burst of data MPDUs is transmitted, the SACK transmitted at the end of the burst contains the reception status of all the PBs in each of the MPDUs in the burst. When a burst of Sound MPDUs is transmitted, the Sound ACK that is transmitted at the end of the burst will indicate the reception status of the Sound MPDUs. Since bursts can be acknowledged by one response (after time spent waiting for response and the subsequent interframe spacing) for a group of MPDUs, they provide higher MAC efficiency. Significant improvement in the performance can be obtained for high data rate streams, such as High Definition Television (HDTV) and Standard Definition Television (SDTV) streams, by using bursting. Receivers are configured to recognize bursts and wait to send acknowledgements until after the burst has ended.
MPDUs are categorized as “regular MPDUs” or “burst MPDUs,” depending on whether a response is expected at the end of their transmission. MPDUs that are followed by a response are referred to as regular MPDUs and are indicated by setting the MPDUCnt in their delimiter to a predetermined value (e.g., 0). The last MPDU in a burst and MPDUs in non-burst transmissions belong to this category. MPDUs that are followed by one or more long MPDUs are referred to as burst MPDUs. In this case, MPDUCnt indicates the number of MPDUs to follow.
When a Data MPDU with a non-zero MPDUCnt field is received by a destination, the receiver refrains from generating a response and stores the corresponding SACK information locally. This process continues until the last MPDU in the burst (indicated by MPDUCnt=0) is received. Upon the reception of the last MPDU, the receiver aggregates the stored SACK information and transmits it in a single SACK MPDU. The SACK fields contain the reception status of each of the PBs in each of the MPDUs. If the transmitter fails to receive a SACK at the end of an MPDU Burst, it may send a SOF delimiter with Request SACK Retransmission (RSR) set to 1. This will cause the receiver to transmit (or retransmit) the SACK information.
When a Sound MPDU with a non-zero MPDUCnt field is received by the destination, the receiver refrains from generating a Sound ACK and waits for the subsequent Sound MPDU. This process continues until the last MPDU in the burst (indicated by MPDUCnt=0) is received. Upon reception of the last MPDU, the receiver responds with a Sound ACK. In contrast to SACK, Sound ACK indicates the proper reception of the last Sound MPDU in the Burst and does not necessarily carry an indication on the reception status of other Sound MPDUs in the burst.
During the CP, the maximum duration of a MPDU Burst, including the response time and the subsequent Contention Interframe Spacing is short enough to fit within the CP.
The burst MPDUs can include a predetermined minimum number of OFDM Symbols (e.g., at least two OFDM Symbols) for transmitting the MPDU Payload. This minimum number of OFDM Symbols can ensure that the receiver has sufficient time to interpret the frame control and start searching for the next MPDU in the burst.
In some implementations, the stations support a “bidirectional burst” procedure. This procedure allows a transmitting station to allocate part of its time to the receiving station, so the receiving station can send data to the transmitting station (i.e., over the reverse channel). This procedure can be used to send reverse traffic associated with applications that require 2-way exchange of information between stations. For example, Transmission Control protocol (TCP) based applications have application data going in one direction and TCP Acknowledgments coming in the reverse direction. In such cases, the bidirectional bursting procedure can be used to send TCP acknowledgements in the reverse channel. Applications such as Voice over Internet Protocol (VoIP), Video conferencing, etc., can also take advantage of bidirectional bursting procedure. This procedure may also be used for exchange of network management information, for example, to send an updated tone map to a transmitting station in response to a change in the channel characteristics as determined by the receiving station. In general, the bidirectional busting procedure can be used in any scenario where there is traffic flowing between a pair of station in both directions.
The receiving station initiates the bidirectional burst procedure using fields in a SACK message transmitted during the receiving station's allocated time interval for sending a SACK message. The fields in the frame control indicate the presence of the request (e.g., in a Request Reverse Transmission Flag (RRTF)) and the number of blocks that the receiving station wants to send (e.g., in a Request Reverse Transmission Length (RRTL) field). The receiving station can also indicate the type of data to be sent.
Upon receiving the request, the transmitting station decides whether the request will be granted and, in some implementations, the duration of the granted time. The transmitting station signals that the request is allowed by sending grant information including any relevant information such as, for example, the maximum amount of data that may be transmitted in the reverse direction. The transmitting station can grant the request by setting a Bidirectional Burst Flag (BBF) in the SOF delimiter, and can indicate the duration in a Maximum Reverse Transmission Frame Length (MRTFL) field in the SOF delimiter.
In some implementations, the transmitting station does not need to send the duration of the time granted because the duration may be predetermined before the request. For example, for example, the granted time may be a default amount of time (e.g., 1 ms). The receiver would simply request a reverse transmission without needing to indicate a number of blocks requested. The default amount of time can be pre-stored in each of the stations, or the default amount of time can be negotiated when a station joins a network. In some cases the default amount of time can be determined as a function of various parameters of one or more stations. For example, the default amount of time can be a function of data rate being used by a station. A higher data rate can be assigned a smaller amount of time since more data can be sent in a given time period at a higher data rate. In some implementations, the transmitter can initiate granting a reverse transmission without receiving a request from the receiver. For example, the transmitter may already know that the receiver will need time for reverse transmissions due to characteristics of a higher layer protocol.
In some implementations of the bidirectional burst procedure, there are restrictions on the bursting of multiple data MPDUs before soliciting a SACK response. For example, in some implementations bursting can be used in the forward direction, but not in the reverse direction. In this case, bidirectional communication is still allowed, but bursting only occurs in the forward direction.
Sufficient interframe spaces are maintained between various MPDUs exchanged during bidirectional bursting to account for the processing latencies and propagation latencies.
In some implementations, the bidirectional burst procedure depends on whether the burst is occurring in a CP, or a CFP. Bidirectional bursts in a CP end with a SACK or other indication that the bidirectional burst is over. The SACK can be sent in either the “forward” or “reverse” direction (by either the original transmitter or original receiver, respectively), as described in more detail below. Bidirectional bursts in a CFP may end with transmission of a SACK (in either direction) or transmission of a Reverse SOF and payload (the use of this option can be communicated during connection setup). When a bidirectional burst in a CFP ends with a Reverse SOF and payload, a minimum interframe space of RIFS_AV is present between the end of Reverse SOF payload and the end of the CFP. The support for CFP bidirectional bursts ending with Reverse SOF and payload enables stations to improve the efficiency of VoIP and other low data rate applications.
The unidirectional bursting and bidirectional bursting protocols can be used in a CFP or a CP of protocols that are centralized via a CCo or protocols that are distributed without the need for a CCo. In centralized protocols, the channel access is controlled by a single station (e.g., the CCo). The CCo provides dedicated channel access intervals to various stations. The CCo may also provide shared allocations to stations. During these shared allocations, multiple stations can transmit. For example, stations may use a distributed protocol like CSMA during the shared allocation. Examples of centralized protocols include polling protocols and beacon based TDMA channel access protocols. Channel access in distributed protocols is managed by coordination between various stations in the network, without the need for a single station acting as a master. An example of distributed protocols includes networks operating using contention based channel access protocol like CSMA as the basic channel access mechanism. Distributed protocols can also support contention free allocations. For example, station can negotiate contention free allocations with other station in the network, thus enabling the station to have access during contention free intervals.
Unidirectional or bidirectional bursting operating over distributed protocols take into account the possibility of collisions. For example, a burst can be prematurely terminated when a collision is suspected (e.g., either directly detected, or inferred due to lack of communication for a predetermined amount of time).
Unidirectional or bidirectional bursting over distributed protocols provide sufficient information to other stations in the network (i.e., stations other than the two stations participating in the burst) to enable them to determine the end of the burst and when they can start contending for access to the medium. In a technique used by some other protocols, the other stations would determine that they can start contending for access to the medium by detecting a terminal inter-frame spacing of a certain length. If no signals are detected for a given amount of time, the stations would determine that they could start contending. Such a terminal inter-frame spacing would need to be larger than the inter-frame spacing used between transmissions in a burst. In the technique used in the unidirectional and bidirectional bursting protocols described herein, the stations are able to detect the SACK transmission (in either direction) and anticipate that they will be able to start contending immediately (or within a short terminal inter-frame spacing) after the end of the final transmission. Any unique indicator within a final transmission (e.g., a SACK or a Reverse SOF and payload) by either the transmitter or receiver stations can signal that the burst is ending and that the other stations are able to start contending for access to the medium. In some cases, a terminal inter-frame spacing can be much shorter than the inter-frame spacing within a burst due to processing latencies that may be required between transmissions in the burst.
Additional restrictions like providing an upper bound on the duration of bidirectional bursting can be applied to ensure fairness among various stations in the network.
In another example shown in
In some examples, station A may also instruct station B to terminate the bidirectional burst by setting the BBF field to 0 in the SOF delimiter. Station B would then terminate the bidirectional burst by sending a SACK. If either station suspects a potential collision (e.g., if some or all received PBs are not correctly received), it can terminate the bidirectional burst with a SACK. Likewise, if no frame control is received after a predetermined amount of time, the sending station can assume a collision has occurred and terminate the bidirectional burst with a SACK.
During a bidirectional burst, listening stations (i.e., stations not participating in the bidirectional burst) defer to the two stations participating in the bidirectional burst until the end of the burst (e.g., indicated by a SACK). Upon receiving a SOF with MPDUCnt set to 0 and BBF set to 0, the third-party stations would infer that the bi-directional burst is ending and they would start priority contention at the end of the expected SACK transmission. If they receive an SOF with MPDUCnt set to 0 and BBF set to 1, they would start looking for a reverse transmission. If they receive a RSOF, they would continue to look for a SOF. If they receive a SACK at any time, they are allowed to start priority contention immediately after the SACK.
The bidirectional burst procedure during CSMA can be subject to additional restrictions. For example, the total duration of the bidirectional burst, including the final SACK and subsequent Contention Interframe Spacing (CIFS_AV), can be limited to not exceed a predetermined maximum time period (e.g., 5000 μsec). This maximum time period may be determined to fit within a CSMA period within a beacon period, for example.
Many other implementations of the invention other than those described above are within the invention, which is defined by the following claims. For example, the bidirectional bursting can also be used in environments where the transmitter gets access to the medium using other channel access techniques.
This application claim priority benefit of and is a continuation of U.S. application Ser. No. 12/118,613, filed on May 9, 2008, which claims priority benefit of U.S. Provisional Application No. 60/917,232, filed May 10, 2007.
Number | Name | Date | Kind |
---|---|---|---|
3806885 | Moore | Apr 1974 | A |
4569044 | Tao et al. | Feb 1986 | A |
4581734 | Olson et al. | Apr 1986 | A |
4630261 | Irvin | Dec 1986 | A |
4677612 | Olson et al. | Jun 1987 | A |
4682324 | Ulug | Jul 1987 | A |
4720850 | Oberlander et al. | Jan 1988 | A |
4726018 | Bux et al. | Feb 1988 | A |
4792947 | Takiyasu et al. | Dec 1988 | A |
4819229 | Pritty et al. | Apr 1989 | A |
4881241 | Pommier et al. | Nov 1989 | A |
4943959 | Arnold | Jul 1990 | A |
5001472 | Fischer et al. | Mar 1991 | A |
5003539 | Takemoto et al. | Mar 1991 | A |
5046069 | Calvignac et al. | Sep 1991 | A |
5081678 | Kaufman et al. | Jan 1992 | A |
5105423 | Tanaka et al. | Apr 1992 | A |
5121396 | Irvin et al. | Jun 1992 | A |
5140584 | Suzuki | Aug 1992 | A |
5157659 | Schenkel | Oct 1992 | A |
5197061 | Halbert-Lassalle et al. | Mar 1993 | A |
5214646 | Yacoby | May 1993 | A |
5228025 | Le Floch et al. | Jul 1993 | A |
5231634 | Giles et al. | Jul 1993 | A |
5274629 | Helard et al. | Dec 1993 | A |
5280480 | Pitt et al. | Jan 1994 | A |
5282222 | Fattouche et al. | Jan 1994 | A |
5307376 | Castelain et al. | Apr 1994 | A |
5339313 | Ben-Michael et al. | Aug 1994 | A |
5343473 | Cidon et al. | Aug 1994 | A |
5384777 | Ahmadi et al. | Jan 1995 | A |
5416801 | Chouly et al. | May 1995 | A |
5426646 | Slack | Jun 1995 | A |
RE35001 | Grow | Jul 1995 | E |
5432848 | Butter et al. | Jul 1995 | A |
5436905 | Li et al. | Jul 1995 | A |
5448565 | Chang et al. | Sep 1995 | A |
5452288 | Rahuel et al. | Sep 1995 | A |
5452322 | Lauer | Sep 1995 | A |
5473602 | McKenna et al. | Dec 1995 | A |
5481535 | Hershey | Jan 1996 | A |
5483529 | Baggen et al. | Jan 1996 | A |
5488632 | Mason et al. | Jan 1996 | A |
5504747 | Sweazey | Apr 1996 | A |
5515379 | Crisler et al. | May 1996 | A |
5524027 | Huisken | Jun 1996 | A |
5537414 | Takiyasu et al. | Jul 1996 | A |
5541922 | Pyhalammi | Jul 1996 | A |
5548649 | Jacobson | Aug 1996 | A |
5555268 | Fattouche et al. | Sep 1996 | A |
5563883 | Cheng | Oct 1996 | A |
5563897 | Pyndiah et al. | Oct 1996 | A |
5568476 | Sherer et al. | Oct 1996 | A |
5610908 | Shelswell et al. | Mar 1997 | A |
5612975 | Becker et al. | Mar 1997 | A |
5615212 | Ruszczyk et al. | Mar 1997 | A |
5619651 | Young | Apr 1997 | A |
5623512 | Sasaki | Apr 1997 | A |
5629942 | Zijderhand | May 1997 | A |
5629948 | Hagiwara et al. | May 1997 | A |
5636230 | Marturano et al. | Jun 1997 | A |
5644576 | Bauchot et al. | Jul 1997 | A |
5651009 | Perreault et al. | Jul 1997 | A |
5694389 | Seki et al. | Dec 1997 | A |
5706348 | Gray et al. | Jan 1998 | A |
5717689 | Ayanoglu | Feb 1998 | A |
5732113 | Schmidl et al. | Mar 1998 | A |
5737330 | Fulthorp et al. | Apr 1998 | A |
5745769 | Choi | Apr 1998 | A |
5757766 | Sugita | May 1998 | A |
5757770 | Lagoutte et al. | May 1998 | A |
5764931 | Schmahl et al. | Jun 1998 | A |
5771235 | Tang et al. | Jun 1998 | A |
5787071 | Basso et al. | Jul 1998 | A |
5790541 | Patrick et al. | Aug 1998 | A |
5793307 | Perreault et al. | Aug 1998 | A |
5793861 | Haigh | Aug 1998 | A |
5799033 | Baggen | Aug 1998 | A |
5812599 | Van Kerckhove | Sep 1998 | A |
5818821 | Schurig | Oct 1998 | A |
5818826 | Gfeller et al. | Oct 1998 | A |
5825807 | Kumar | Oct 1998 | A |
5828677 | Sayeed et al. | Oct 1998 | A |
5841778 | Shaffer et al. | Nov 1998 | A |
5841873 | Lockhart et al. | Nov 1998 | A |
5884040 | Chung | Mar 1999 | A |
5886993 | Ruszczyk et al. | Mar 1999 | A |
5892769 | Lee | Apr 1999 | A |
5896561 | Schrader et al. | Apr 1999 | A |
5903614 | Suzuki et al. | May 1999 | A |
5914932 | Suzuki et al. | Jun 1999 | A |
5914959 | Marchetto et al. | Jun 1999 | A |
5940399 | Weizman | Aug 1999 | A |
5940438 | Poon et al. | Aug 1999 | A |
5948060 | Gregg et al. | Sep 1999 | A |
5956338 | Ghaibeh | Sep 1999 | A |
5966412 | Ramaswamy | Oct 1999 | A |
5970062 | Bauchot | Oct 1999 | A |
5987011 | Toh | Nov 1999 | A |
6005894 | Kumar | Dec 1999 | A |
6006017 | Joshi et al. | Dec 1999 | A |
6041063 | Povlsen et al. | Mar 2000 | A |
6041358 | Huang et al. | Mar 2000 | A |
6044154 | Kelly | Mar 2000 | A |
6044482 | Wong | Mar 2000 | A |
6052377 | Ohmi et al. | Apr 2000 | A |
6074086 | Yonge, III | Jun 2000 | A |
6076115 | Sambamurthy et al. | Jun 2000 | A |
6092214 | Quoc et al. | Jul 2000 | A |
6097703 | Larsen et al. | Aug 2000 | A |
6098179 | Harter, Jr. | Aug 2000 | A |
6108713 | Sambamurthy et al. | Aug 2000 | A |
6111919 | Yonge, III | Aug 2000 | A |
6125150 | Wesel et al. | Sep 2000 | A |
6130887 | Dutta | Oct 2000 | A |
6130894 | Ojard et al. | Oct 2000 | A |
6151296 | Vijayan et al. | Nov 2000 | A |
6169744 | Grabelsky et al. | Jan 2001 | B1 |
6182147 | Farinacci | Jan 2001 | B1 |
6188717 | Kaiser et al. | Feb 2001 | B1 |
6192397 | Thompson | Feb 2001 | B1 |
6202082 | Tomizawa et al. | Mar 2001 | B1 |
6215792 | Abi-Nassif | Apr 2001 | B1 |
6216244 | Myers et al. | Apr 2001 | B1 |
6222851 | Petry | Apr 2001 | B1 |
6243386 | Chan et al. | Jun 2001 | B1 |
6243449 | Margulis et al. | Jun 2001 | B1 |
6246770 | Stratton et al. | Jun 2001 | B1 |
6252849 | Rom et al. | Jun 2001 | B1 |
6259696 | Yazaki et al. | Jul 2001 | B1 |
6263445 | Blumenau | Jul 2001 | B1 |
6269132 | Yonge, III | Jul 2001 | B1 |
6278685 | Yonge, III | Aug 2001 | B1 |
6278716 | Rubenstein et al. | Aug 2001 | B1 |
6279716 | Kayatani et al. | Aug 2001 | B1 |
6289000 | Yonge, III | Sep 2001 | B1 |
6295296 | Tappan | Sep 2001 | B1 |
6334185 | Hansson et al. | Dec 2001 | B1 |
6343083 | Mendelson et al. | Jan 2002 | B1 |
6363052 | Hosein | Mar 2002 | B1 |
6370156 | Spruyt et al. | Apr 2002 | B2 |
6385672 | Wang et al. | May 2002 | B1 |
6397368 | Yonge, III | May 2002 | B1 |
6421725 | Vermilyea et al. | Jul 2002 | B1 |
6430192 | Creedon et al. | Aug 2002 | B1 |
6430661 | Larson et al. | Aug 2002 | B1 |
6434153 | Yazaki et al. | Aug 2002 | B1 |
6442129 | Yonge, III | Aug 2002 | B1 |
6456649 | Isaksson et al. | Sep 2002 | B1 |
6466580 | Leung | Oct 2002 | B1 |
6469992 | Schieder | Oct 2002 | B1 |
6473435 | Zhou et al. | Oct 2002 | B1 |
6480489 | Muller et al. | Nov 2002 | B1 |
6487212 | Erimli et al. | Nov 2002 | B1 |
6501760 | Ohba et al. | Dec 2002 | B1 |
6519263 | Huth | Feb 2003 | B1 |
6526451 | Kasper | Feb 2003 | B2 |
6538985 | Petry et al. | Mar 2003 | B1 |
6553534 | Yonge, III | Apr 2003 | B2 |
6567416 | Chuah | May 2003 | B1 |
6567914 | Just et al. | May 2003 | B1 |
6622172 | Tam | Sep 2003 | B1 |
6654410 | Tzannes | Nov 2003 | B2 |
6667991 | Tzannes | Dec 2003 | B1 |
6671284 | Yonge, III | Dec 2003 | B1 |
6747976 | Bensaou et al. | Jun 2004 | B1 |
6778507 | Jalali | Aug 2004 | B1 |
6907044 | Yonge, III | Jun 2005 | B1 |
6909723 | Yonge, III | Jun 2005 | B1 |
7280517 | Benveniste | Oct 2007 | B2 |
7352770 | Yonge, III | Apr 2008 | B1 |
7369579 | Logvinov et al. | May 2008 | B2 |
7457306 | Watanabe et al. | Nov 2008 | B2 |
7522630 | Ho et al. | Apr 2009 | B2 |
7551606 | Iwamura | Jun 2009 | B2 |
7558294 | Yonge, III | Jul 2009 | B2 |
7623542 | Yonge et al. | Nov 2009 | B2 |
7715425 | Yonge, III | May 2010 | B2 |
7729372 | Yonge, III | Jun 2010 | B2 |
7822059 | Katar et al. | Oct 2010 | B2 |
20010043576 | Terry | Nov 2001 | A1 |
20010048692 | Karner | Dec 2001 | A1 |
20020012320 | Ogier et al. | Jan 2002 | A1 |
20020027897 | Moulsley et al. | Mar 2002 | A1 |
20020042836 | Mallory | Apr 2002 | A1 |
20020048368 | Gardner | Apr 2002 | A1 |
20020061031 | Sugar et al. | May 2002 | A1 |
20020065047 | Moose | May 2002 | A1 |
20020115458 | Mizuno et al. | Aug 2002 | A1 |
20020137462 | Rankin | Sep 2002 | A1 |
20020191533 | Chini et al. | Dec 2002 | A1 |
20030006883 | Kim et al. | Jan 2003 | A1 |
20030079169 | Ho et al. | Apr 2003 | A1 |
20030174664 | Benveniste | Sep 2003 | A1 |
20030181204 | Benveniste | Sep 2003 | A1 |
20030217182 | Liu et al. | Nov 2003 | A1 |
20030227934 | White et al. | Dec 2003 | A1 |
20040001499 | Patella et al. | Jan 2004 | A1 |
20040064509 | Ayyagari et al. | Apr 2004 | A1 |
20040077338 | Hsu et al. | Apr 2004 | A1 |
20040136396 | Yonge, III | Jul 2004 | A1 |
20040250159 | Tober et al. | Dec 2004 | A1 |
20050041588 | Kim et al. | Feb 2005 | A1 |
20050114489 | Yonge, III | May 2005 | A1 |
20050149649 | Carneal et al. | Jul 2005 | A1 |
20050190785 | Yonge, III | Sep 2005 | A1 |
20050192011 | Hong et al. | Sep 2005 | A1 |
20060034247 | Gu et al. | Feb 2006 | A1 |
20060126513 | Li et al. | Jun 2006 | A1 |
20060221879 | Nakajima et al. | Oct 2006 | A1 |
20060239213 | Frederiks et al. | Oct 2006 | A1 |
20070025383 | Katar | Feb 2007 | A1 |
20070025384 | Ayyagari et al. | Feb 2007 | A1 |
20070025391 | Yonge, III | Feb 2007 | A1 |
20070025398 | Yonge, III | Feb 2007 | A1 |
20070058659 | Ayyagari et al. | Mar 2007 | A1 |
20070064788 | Yonge, III | Mar 2007 | A1 |
20070091925 | Miyazaki et al. | Apr 2007 | A1 |
20070109973 | Trachewsky | May 2007 | A1 |
20070127381 | Oh et al. | Jun 2007 | A1 |
20070230497 | Choi et al. | Oct 2007 | A1 |
20070248089 | Redi et al. | Oct 2007 | A1 |
20080117891 | Damnjanovic et al. | May 2008 | A1 |
20080186943 | Wiatrowski | Aug 2008 | A1 |
20080279126 | Katar et al. | Nov 2008 | A1 |
20090116461 | Yonge, III | May 2009 | A1 |
20090154487 | Ryan et al. | Jun 2009 | A1 |
20090207865 | Yonge, III | Aug 2009 | A1 |
20100111099 | Yonge, III | May 2010 | A1 |
Number | Date | Country |
---|---|---|
3413144 | Oct 1985 | DE |
818905 | Jan 1998 | EP |
0818905 | Jan 1998 | EP |
9857440 | Dec 1998 | WO |
0072495 | Nov 2000 | WO |
0206986 | Jan 2002 | WO |
0213442 | Feb 2002 | WO |
0241598 | May 2002 | WO |
03100996 | Dec 2003 | WO |
2004038980 | May 2004 | WO |
2007014319 | Feb 2007 | WO |
Entry |
---|
“Korean Patent Application No. 2009-7025841, KIPO Notice of Preliminary Rejection”, Mar. 21, 2014, 9 pages. |
Applied Cryptography, Second Edition, protocols, algorithms and source code in C, Bruce Schneier, 1996. |
Benedetto S., et al., “A Soft-input soft-ouput Maximum A Posteriori (MAP) Module to Decode Parallel and Serial Concatenated Codes,” TDA Progress Report, 1996, vol. 42 (127), pp. 1-20, (XP002959296). |
Bertsekas, et al., Data Networks, Prentice Hall, Englewood Cliffs, NJ, Section 2.4.3 Selective Repeat ARQ, 1992. |
Blake, et al., “An Architecture for Differentiated Services,” The Internet Society, 1998, RFC 2475, pp. 1-31. |
Broadband Radio Access Networks (BRAN); High Performance Radio Local Area Network (HiperLAN), Type 1: Functional Specification, European Standard (Telecommunication Series) No. 300652 V. 1.2.1 (Jul. 1998). |
Bruschi D., et al., “Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issues,” Mobile Networks and Applications, 2002, pp. 503-511. |
Bux W., “Token-Ring Local-Area Networks and Their Performance,” Proceedings of the IEEE, 1989, vol. 77 (2), pp. 238-256. |
Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications, International Standard (ANSI/IEEE Std 802.3), 2002, ISO/IEC 8802-3. |
Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications, International Standard, 1996, ISO/IEC 8802, Part 3, (ANSI/IEEE Std 802.3). |
Dube P, et al., “Queueing analysis of early message discard policy,” IEEE International Conference, 2002, vol. 4, pp. 2426-2430. |
Ehrsam, et al., “A cryptographic key management scheme for implementing the Data Encryption Standard,” IBM Systems Journal, 1978, vol. 17 (2), pp. 106-125. |
European Search Report—EP09176939, Berlin, Jan. 22, 2010. |
European Search Report, European Patent Office, European Patent Application No. 09176939, Oct. 15, 2010, 6 pages. |
Goalic, et al., “Real-Time Turbo-Decoding of Product Codes on a Digital Signal Processor,” IEEE, 1997, pp. 624-628. |
HomePlug Powerline Alliance, HomePlug 1.0.1 Specification, Dec. 1, 2001. |
HomePlug Powerline Alliance Inc., “HomePlug AV White Paper,” Doc. Ver. No. HPAVWP—050818, Aug. 2005, pp. 1-11. |
IBM, Combined use of collision resolution and collision avoidance MAC protocols, IBM Technical Disclosure Bulletin, 1994, vol. 37, pp. 299-302. |
Interface Specification for HomePNA.TM. 2.0 10M8 Technology—Link Layer Protocols, Dec. 1, 1999. |
International Search Report and Written Opinion—PCT/US2008/063226, International Searching Authority, European Patent Office, Oct. 31, 2008. |
Kamerman A., et al., “Net throughput with IEEE 802.11 wireless LANs; Wireless Communications and Networking Conference,” WCNC 2000 IEEE, 2000, vol. 2 (23-28), pp. 747-752. |
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. |
Li, Tianji et al., “Investigation of the Block ACK Scheme in Wireless Ad-hoc Networks.” Wireless Communications & Mobile Computing—Medium Access Control Protocols for Wireless Ad Hoc Networks, vol. 6, Issue 6, Sep. 2006, pp. 1-13. |
Peterson W., et al., “Error-Correcting Codes,” Second Edition, The Massachusetts Institute of Technology Press, 1986, pp. 212-213, 261-263, 362. |
PKCS #5 v. 20: Password-Based Cryptography Standard RSA Laboratories, Mar. 25, 1999. |
Pyndiah R., et al., “Near Optimum Decoding of Product Codes,” IEEE, 1994, pp. 339-343. |
Pyndiah R., et al., “Near-Optimum Decoding of Product Codes: Block Turbo Codes,” Ieee Transactions on Communications, IEEE Service Center, Piscataway, 1998, vol. 46 (8), pp. 1003-1010. |
Pyndiah R., et al., “Performance of Block Turbo Coded 16-QAM and 64-QAM Modulations,” IEEE, 1995, pp. 1039-1043. |
Segal, Yossi et al., “OFDM Preamble Structure Analysis and Proposal.” IEEE 802.16 Broadband Wireless Access Working Group filip://ieee802.orgn 6 Mar. 7, 2011, 6 pages. |
Shared Wireless Access Protocol (Cordless Access) Specification, SWAP-CA Revision 1.21, Jan. 27, 1999, by the HomeRFTm Technical Committee. |
Sun, et al., “Public-key ID-based Cryptosystem,” IEEE, 1991, pp. 142-144. |
Unpublished Application, U.S. Appl. No. 12/645,561, filed Dec. 23, 2009, 37 pages. |
Unpublished Application, U.S. Appl. No. 12/645,574, filed Dec. 23, 2009, 33 pages. |
Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, International Standard (ANSI/IEEE Std802.11), 1999, ISO/IEC 8802-11. |
U.S. Appl. No. 12/118,613 Final Office Action, Mar. 14, 2012 , 39 pages. |
Number | Date | Country | |
---|---|---|---|
20130287040 A1 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
60917232 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12118613 | May 2008 | US |
Child | 13924301 | US |