Authorizing equipment on a sub-network

Information

  • Patent Grant
  • 9130888
  • Patent Number
    9,130,888
  • Date Filed
    Wednesday, November 23, 2011
    12 years ago
  • Date Issued
    Tuesday, September 8, 2015
    8 years ago
Abstract
Systems and methods for authorizing a customer premise equipment (CPE) device to join a network through a network termination unit (NTU). The CPE device can send an encrypted connection request, and an authorization server can decrypt the connection request and provide a network membership key (NMK) associated with the CPE device to the NTU. The authorization server can encrypt the NMK associated with the CPE device using a device access key (DAK) associated with the NTU.
Description
TECHNICAL FIELD

The invention relates to managing secured communications over a shared medium.


BACKGROUND

A network of communication stations can share a communication medium (e.g., wires connecting multiple stations or spectrum for transmitting radio signals among stations) using any of a variety of access techniques. Security for a shared communication medium network can be difficult since there is no protection from others connecting unauthorized devices to the network. For example, when a new customer premise equipment (CPE) device subscribes, the new CPE device should be able to easily join the network, while unauthorized CPEs should be inhibited from joining the network. While an encryption key can provide some security, the distribution of the encryption key can be difficult because communication of the keys can provide opportunity to compromise the encryption key.


SUMMARY

The following are various aspects described herein. In one aspect computer implemented authentication methods are disclosed. Such method can include: receiving an encrypted connection request from a customer premise equipment device at a network termination unit, the encrypted connection request being encrypted using a network membership key; forwarding the encrypted connection request to an authorization server; receiving an encrypted network membership key from the authorization server, the encrypted network membership key being encrypted using a device access key associated with the network termination unit; decrypting the encrypted network membership key using the device access key; and, authorizing the customer premise equipment device to join a subnet associated with the network termination unit.


Other methods can include: receiving a forwarded connection request, the forwarded connection request comprising an encrypted connection request received by a network termination unit forwarded to an authorization server; inspecting a first unique identifier associated with the forwarded connection request; identifying a network membership key associated with the first unique identifier; authenticating the forwarded connection request based on the identified network membership key; encrypting the network membership key using a device access key associated with the network termination unit; and, communicating the encrypted network membership key to the network termination unit.


Systems can include a network termination unit and an authorization server. The network termination unit can receive an encrypted connection request from a customer premise equipment device and forward the encrypted connection request if the network termination unit determines that the customer premise equipment device is not associated with the network termination unit. The authorization server can receive the encrypted connection request from the network termination unit and can decrypted the encrypted connection request based on a unique identifier, the unique identifier being associated with the customer premise equipment device. The authorization server can also provide a network membership key associated with the first unique identifier address based on decrypting the encrypted connection request.


Other aspects will be found in the detailed description, drawings and claims.





DESCRIPTION OF DRAWINGS


FIG. 1 is a schematic diagram of a communication network.



FIG. 2 is a block diagram of a powerline communication network.



FIG. 3 is a block diagram of a communication system for communicating over a powerline network.



FIG. 4 is a block diagram illustrating a process for authorizing customer premise equipment device into a sub-network.



FIG. 5 is a block diagram illustrating the communication flow associated with authorizing a customer premise equipment device into a sub-network.



FIG. 6 is a flow diagram depicting an example flow for authorization of a customer premise equipment device into a sub-network.



FIGS. 7 and 8 are flowcharts illustrating example methods for authorizing a customer premise equipment device into a sub-network.





DETAILED DESCRIPTION

There are a many possible implementations of the invention, some example implementations are described below. However, such examples are descriptions of various implementations, 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.



FIG. 1 shows an exemplary network configuration for an access network 100 such as a broadband power line Network (BPLN) that provides access to a backhaul network. The BPLN can be managed by a service provider entity having access to the underlying physical power line medium. BPLN is a general purpose network that can be used for several types of applications including, smart grid management, broadband internet access, voice and video delivery services, etc. In various implementations, BPLN can be deployed on low voltage, medium voltage and high voltage power lines. Additionally, BPLN can span an entire neighborhood or it may be deployed within a single multi-dwelling unit. For example, it can be used to provide network service to tenants in a single apartment building. While power lines are one medium for deploying the BPLN, similar techniques can be deployed on other wire lines, such as, for example, coaxial cables, twisted pair or a combination thereof.


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, 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 includes a head end (HE), repeaters (R), and network termination units (NTU), but can 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 media access control (MAC) service data units (MSDUs) to extend the effective range and bandwidth of the BPLN cell. Repeaters can also perform routing and quality of service (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.


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” (STA) 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. STAs that cannot directly communicate with each other use one or more repeater STAs to communicate with each other. 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 can provide data to and receives data from the network interface module. A 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). A MPDU is a segment of information including header 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.



FIG. 2 is a block diagram of a powerline communication network. In various implementations, a powerline communication network can enable customer premises equipment (CPE) devices 205a-d to access a backhaul network 210 through a gateway (e.g., a headend 215). In various implementations, there can be multiple gateways to the backhaul network 210. For example, it can be inefficient for a CPE device in one city to be required to send a signal to another city prior to accessing the backhaul network 210 (e.g., the Internet).


The CPE devices 205a-d can communicate with the headend 215 through a network of network termination units 220a-d and repeaters 225a-d. In some implementations, the network termination units can operate to translate the data signals from the CPE devices in any of a variety of communications protocols onto a powerline network. For example, a CPE 205a-d might communicate with an NTU 220a-d using a IEEE 802.11 wireless protocol, and the NTU 220a-d can convert the wireless signal to a signal suitable for transmission on a powerline medium. Systems for transmitting and receiving powerline network signals are further described in FIG. 3.


In various implementations, repeaters 225a-d can be located throughout the powerline network to provide the ability for a data signal to travel on the powerline carrier medium over long distances. As discussed above, the headend 215 can provide a gateway for the data signal to be transferred to a backhaul network 210. For example, the headend 215 can extract the data signal from the powerline network and convert the signal for transmission on a packet switched network such as the Internet. In various implementations, one or more of the repeaters 225a-d can be equipped to transfer the signal from the powerline network to the backhaul network 210.


In some implementations, the headend 215 can also include an authorization server. In one implementation, the authorization server is included on the backhaul network 210. The authorization server can be operable to authorize CPE devices 205a-d for transmission of data over the powerline network. When a CPE device 205a-d is not authorized, in various implementations, the CPE device 205a-d can be provided access to a registration server 230. The registration server 230, in various implementations, can enable the user of a CPE device 205a-d to register the CPE device 205a-d with the network to obtain access to the powerline network.


In various implementations, the registration server 230 can provide a limited registration to a CPE device 205a-d to try the powerline network. For example, the registration can be limited by a period of time, bandwidth, destination address, or any other limitation that might allow the user to have limited access to the network. In additional implementations, the registration server 230 can require payment prior to using the network. For example, the registration server can provide web pages operable to collect payment information from the user. In various implementations, the registration server can allow the user to pay for any of a variety of different access plans. For example, an access plan might allow a user to purchase access for a specified period of time, at a specified bandwidth, or combinations thereof. In some implementations, the registration server and authorization server can be co-located as shown in FIG. 2. In additional implementations, the registration server can be part of the backhaul network 201. In still further implementations, the registration server is not co-located with the authorization server.


Referring to FIG. 3, a communication system 300 includes a transmitter 302 for transmitting a signal (e.g., a sequence of OFDM symbols) over a communication medium 304 to a receiver 306. The transmitter 302 and receiver 306 can both be incorporated into a network interface module at each station. The communication medium 304 can represent a path from one device to another over the power line network.


At the transmitter 302, modules implementing the PHY layer receive an MPDU from the MAC layer. The MPDU is sent to an encoder module 320 to perform processing such as scrambling, error correction coding and interleaving.


The encoded data is fed into a mapping module 322 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 322 also determines which of the carrier frequencies f1 . . . , fN within the OFDM bandwidth are used by the system 300 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 322 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 304 that may radiate power no energy is transmitted on those carriers (e.g., A10=0). The mapping module 322 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 324 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 322 onto N orthogonal carrier waveforms having peak frequencies f1, . . . , fN. The modulated carriers are combined by IDFT module 324 to form a discrete time symbol waveform S(n) (for a sampling rate fR), which can be written as










S


(
n
)


=




i
=
1

N








A
i



exp


[

j


(


2

π












n
/
N


+

Φ
i


)


]








Eq
.





(
1
)









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 326 combines a sequence of consecutive (potentially overlapping) symbols into a “symbol set” that can be transmitted as a continuous block over the communication medium 304. The post-processing module 326 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 300 and/or the communication medium 304) the post-processing module 326 can extend each symbol with a cyclic prefix that is a copy of the last part of the symbol. The post-processing module 326 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 328 couples an analog signal containing a continuous-time (e.g., low-pass filtered) version of the symbol set to the communication medium 304. The effect of the transmission of the continuous-time version of the waveform S(t) over the communication medium 304 can be represented by convolution with a function g(τ;t) representing an impulse response of transmission over the communication medium. The communication medium 304 may add noise n(t), which may be random noise and/or narrowband noise emitted by a jammer.


At the receiver 306, modules implementing the PHY layer receive a signal from the communication medium 304 and generate an MPDU for the MAC layer. An AFE module 330 operates in conjunction with an automatic gain control (AGC) module 332 and a time synchronization module 334 to provide sampled signal data and timing information to a discrete Fourier transform (DFT) module 336.


After removing the cyclic prefix, the receiver 306 feeds the sampled discrete-time symbols into DFT module 336 to extract the sequence of N complex numbers representing the encoded data values (by performing an N-point DFT). Demodulator/Decoder module 338 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 300 including modules in the transmitter 302 or receiver 306 can be implemented in hardware, software, or a combination of hardware and software.



FIG. 4 is a block diagram illustrating a process for authorizing customer premise equipment (CPE) device into a sub-network. In various implementations, a powerline network can enable a CPE device 400 to access a backhaul network 410 through a powerline network. The powerline network can include a network termination unit (NTU) 420, a repeater 430, an authorization server 440 which determines whether the CPE 400 can access the backhaul network 410.


In various implementations, CPE 400 can associate with the powerline network by sending a connection request 450 to the authorization server 440 through the NTU 420 and the repeater 430. The connection request 450, in some implementations, can include a request for a network encryption key (NEK). The connection request 450 can be encrypted by the CPE 400 using a network membership key (NMK) associated with the CPE 400.


In some implementations, the authorization server 440 can decrypt the connection request 450 using the NMK associated with the CPE 400. The authorization server 440 can identify the NMK associated with the CPE 400 by extracting an identifier (e.g., a media access control (MAC) address) associated with the connection request 450. Once the NMK has been identified, the authorization server can decrypt the connection request 450 to determine that the CPE device is requesting an NEK to connect to the network. The authorization server 440 can authorize the CPE device 400 based upon being able to decrypt the connection request 450.


The authentication server 440 can respond to the NTU 420 by encrypting the NMK associated with the CPE device 400 using a device access key (DAK) associated with the NTU 420, as shown by signal 460. The NTU 420 can decrypt the communication from the authorization server 440 by using its own DAK. The NTU can then encrypt an NEK using the NMK associated with the new CPE device 400 received from the authorization server 440, as further shown by signal 460.


When the CPE device 400 receives the encrypted NEK from the NTU 420, the CPE device 400 can decrypt the NEK using its own NMK. The CPE device 400 can be joined to the network and enabled to communicate with the network devices (e.g., NTU 420, repeater 430, and authentication server 440) as shown by signal 470. The CPE device 400 can also communicate with the backhaul network 410 (e.g., external network).


In some implementations, the CPE communicates to the authorization server through NTUs, repeaters and a headend (i.e., a gateway device to the backhaul network). For example, in FIG. 2 the CPE 205a can communicate with the authorization server 230 through NTU 210a, repeaters 215a, 215d and headend 220. In such implementations, the headend 230 can relay the connection request from the CPE 205a to the authorization server 230. The headend can further relay the response from the authentication server to the NTU. In various implementations, the authorization server 230 can inform the headend 220 that the CPE 205a is authorized to access the backhaul network along with the information on the service level that are guaranteed for the CPE 205a. The service level information can include, for example, the maximum uplink and maximum down link bandwidths that were guaranteed to the CPE, the number of VoIP number and/or type of connections the CPE can make, etc. The headend can use this information to restrict the CPE from accessing the backhaul network. In various implementations, the authorization server 230 can itself be part of the backhaul network.



FIG. 5 is a block diagram illustrating the communication flow associated with authorizing a customer premise equipment (CPE) device 500 into a sub-network. The CPE device 500 can send a connection request to an associated network termination unit (NTU) 510 as shown by signal (1). The connection request can include a request for a network encryption key (NEK) to join a sub-net associated with the NTU 510. In various implementations, the connection request can be encrypted using a network membership key (NMK) associated with the CPE device 500. Because the CPE device 500 was not previously associated with the NTU 510, the NTU 510 cannot decrypt the encrypted connection request.


The NTU 510 can forward the connection request to an authorization server 520 as shown by signal (2). The authorization server 520 can extract an identifier associated with a device originating the connection request (e.g., a media access control (MAC) address associated with the CPE device 500). Based upon the extracted identifier, the authorization server 520 can identify an NMK associated with the CPE device 500. The authorization server can then decrypt the connection request using the identified NMK associated with the identifier extracted from the connection request. The authorization server 520 can authorization the CPE device 500 based upon decryption of the connection request using the NMK associated with the extracted identifier.


The authorization server can then encrypt the NMK associated with the CPE device 500 using a device access key (DAK) associated with the NTU 510 that forwarded the connection request. The authorization server 520 can then send the encrypted NMK to the NTU 510 as shown by signal (3). The NTU 510 can decrypt the encrypted NMK received from the authorization server 520 using its own DAK.


The NTU 510 can then encrypt an NEK using the decrypted NMK associated with the new CPE device 500. The NTU 510 can then send the encrypted NEK to the CPE device 500 as shown by signal (4). The CPE device 500 can then decrypt the encrypted NEK using its NMK. The decrypted NEK can thereafter be used to encrypt communications sent to the NTU 510 as shown by signal (5). The CPE device 500 can also use the NEK to communicate with other network devices and to send/receive information to/from a backhaul network 530 (e.g., the Internet) through the NTU 510 as shown by signal (6).



FIG. 6 is a flow diagram depicting an example flow for joining a CPE device 601 into a sub-cell (e.g., a sub-net). In some implementations, registered CPE devices 601 can access the network from a variety of locations. The variety in locations, for example, can be caused by relocating, can be caused by the user taking his or her laptop from home to the office, etc. In such implementations, the CPE device already includes a unique NMK.


However, when the CPE device 601 attempts to join a new NTU 602 by requesting a unique NEK encrypted using the unique NMK as shown by signal 605, the new NTU 602 does not recognize the encrypted NEK request. The request for a unique NEK, in some implementations, can include a unique identifier (e.g., a MAC address) associated with the NTU 602 from which the NEK is requested.


The NTU 602 forwards the encrypted NEK request to an authorization server 603 as shown by signal 610. The authorization server 603 can parse the forwarded request to locate a unique identifier (e.g., a MAC address) associated with the CPE device 601. Once the unique identifier has been located, the authorization server 603 can query a data store to determine a unique NMK associated with the unique identifier. The unique NMK can be used to decrypt the NEK request. In some implementations, a unique identifier associated with the encrypted portion of the NEK request can be matched to the NTU 602 from which the NEK request was forwarded to determine authenticity of the request.


The authorization server 603 can then encrypt the NMK of the CPE device 601 using a DAK associated with the NTU 602 as shown by signal 615. The NTU 602 can thereby decrypt the NMK associated with the requesting CPE device 601 using its DAK. The NMK associated with the CPE device 601 can be used to encrypt the NEK. The NTU 602 can communicate the encrypted NEK to the CPE device 601 as shown by signal 620.


The CPE device 601 can decrypt the NEK using its NMK. The CPE device 601 can then send information to an external network 604 through the NTU 602 using the NEK to encrypt the transmissions, as shown by signals 625, 630. The CPE device 601 can also receive information from the external network 604 through the NTU 602 as shown by signals 635 and 640, the signals 625, 640 between the NTU 602 and the CPE device 601 being encrypted using the NEK to provide security between the CPE device 601 and the NTU 602. In some implementations, the NEK used between the CPE device 601 and the NTU 602 is a unique NEK within the sub-cell (e.g., sub-net) associated with a particular NTU 602.



FIG. 7 is a flowchart illustrating an example method to request connection to a sub-cell (e.g., sub-net). At stage 700, an encrypted connection request is received. The encrypted connection request can be received, for example, by an NTU (e.g., NTU of FIG. 1). In some implementations, the connection request can be encrypted by a CPE device using a unique NMK associated with the CPE device. The encrypted connection request cannot be decrypted by the NTU, because the NTU does not possess the NMK associated with the CPE device.


At stage 705, an encrypted connection request can be forwarded. In various embodiments, the encrypted connection request can be forwarded, for example, by an NTU (e.g., NTU 420 of FIG. 4). The encrypted connection request can be forwarded to an authorization server (e.g., authorization server 603 of FIG. 6).


At stage 710, the encrypted NMK can be received. The encrypted NMK can be received, for example, by an NTU (e.g., NTU 420 of FIG. 4). The NMK is encrypted using the DAK associated with the NTU. The NTU has knowledge of its own DAK and is therefore able to decrypt the encrypted NMK.


At stage 715, the encrypted NMK can be decrypted. The encrypted NMK can be decrypted, for example, by an NTU (e.g., NTU 420 of FIG. 4). The NMK is decrypted using the DAK associated with the NTU. The NTU has knowledge of its own DAK and is therefore able to decrypt the encrypted NMK.


At stage 720, the CPE device is authorized. The CPE device can be authorized, for example, by the NTU (e.g., NTU 420 of FIG. 4). The authorization can include communicating an NEK to the CPE device using the unique NMK associated with the CPE device. In other implementations, authorization can include joining the CPE device to the sub-cell.



FIG. 8 is a flowchart illustrating an example method to authorize joining of a CPE device to a sub-cell. At stage 800, a forwarded encrypted connection request is received. The encrypted network connection request can be received, for example, by a authorization server (e.g., authorization server 440 of FIG. 4). In some implementations, the connection request is encrypted using the NMK associated with the CPE device requesting the connection.


At stage 805, a unique identifier associated with the connection request is identified. In various embodiments, the unique identifier can be identified, for example, by an authorization server (e.g., authorization server 440 of FIG. 4). In some implementations, the unique identification can include a MAC address associated with the CPE device requesting the connection, and can be transmitted without encryption.


At stage 810, an NMK associated with the first unique identifier is located. The NMK associated with the first unique identifier can be located, for example, by an authorization server (e.g., authorization server 420 of FIG. 4). In some implementations, the NMK associated with the first unique identifier can be located, for example, by querying a data store for an NMK associated with the first unique identifier.


At stage 815, the encrypted connection request can be authorized. The connection request can be authorized, for example, by the authorization server (e.g., authorization server 440 of FIG. 4). In some implementations, the connection request can be authorized by decrypting the connection request using the NMK associated with the first unique identifier. In some implementations, the connection request includes a second unique identifier within the encrypted portion of connection request. Based upon the second unique identifier matching an NTU unique identifier, the connection request can be authenticated.


At stage 820, the NMK is encrypted. The NMK can be encrypted, for example, by an authorization server (e.g., authorization server 440 of FIG. 4). In some implementations, the NMK can be encrypted using the DAK associated with the NTU. The DAK associated with the NTU can be retrieved from a data store including multiple DAKs, each of the DAKs being respectively associated with a unique identifier of an NTU.


At stage 825, the encrypted NMK is communicated to the NTU. The encrypted NMK can be communicated to the NTU, for example, by an authorization server (e.g., authorization server 440 of FIG. 4). In some implementations, the encrypted NMK can be encrypted using a DAK associated with the NTU. Thus, the NTU can decrypt the NMK using its DAK, and authorize the CPE device to join the sub-net.


The systems and methods disclosed herein may use data signals conveyed using networks (e.g., local area network, wide area network, internet, etc.), fiber optic medium, carrier waves, wireless networks (e.g., wireless local area networks, wireless metropolitan area networks, cellular networks, etc.), etc. for communication with one or more data processing devices (e.g., mobile devices). The data signals can carry any or all of the data disclosed herein that is provided to or from a device.


The methods and systems described herein may be implemented on many different types of processing devices by program code comprising program instructions that are executable by one or more processors. The software program instructions may include source code, object code, machine code, or any other stored data that is operable to cause a processing system to perform methods described herein.


The systems and methods may be provided on many different types of computer-readable media including computer storage mechanisms (e.g., CD-ROM, diskette, RAM, flash memory, computer's hard drive, etc.) that contain instructions for use in execution by a processor to perform the methods' operations and implement the systems described herein.


The computer components, software modules, functions and data structures described herein may be connected directly or indirectly to each other in order to allow the flow of data needed for their operations. It is also noted that software instructions or a module can be implemented for example as a subroutine unit of code, or as a software function unit of code, or as an object (as in an object-oriented paradigm), or as an applet, or in a computer script language, or as another type of computer code or firmware. The software components and/or functionality may be located on a single device or distributed across multiple devices depending upon the situation at hand.


This written description sets forth the best mode of the invention and provides examples to describe the invention and to enable a person of ordinary skill in the art to make and use the invention. This written description does not limit the invention to the precise terms set forth. Thus, while the invention has been described in detail with reference to the examples set forth above, those of ordinary skill in the art may effect alterations, modifications and variations to the examples without departing from the scope of the invention.


As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise. Finally, as used in the description herein and throughout the claims that follow, the meanings of “and” and “or” include both the conjunctive and disjunctive and may be used interchangeably unless the context clearly dictates otherwise.


Ranges may be expressed herein as from “about” one particular value, and/or to “about” another particular value. When such a range is expressed, another embodiment includes from the one particular value and/or to the other particular value. Similarly, when values are expressed as approximations, by use of the antecedent “about,” it will be understood that the particular value forms another embodiment. It will be further understood that the endpoints of each of the ranges are significant both in relation to the other endpoint, and independently of the other endpoint.


These and other implementations are within the scope of the following claims.

Claims
  • 1. A method comprising: receiving, at an authorization server, an encrypted request for a connection;identifying, by the authorization server, a first unique identifier associated with the encrypted request;identifying, by the authorization server, a network membership key associated with the first unique identifier;authorizing, by the authorization server, the encrypted request based on the network membership key;creating, by the authorization server, an encrypted network membership key, said creating including encrypting the network membership key using a device access key associated with a network termination unit; andcommunicating, by the authorization server, the encrypted network membership key to the network termination unit.
  • 2. The method of claim 1, further comprising: determining whether a second unique identifier associated with the network termination unit is encrypted within the encrypted request; andauthorizing a customer premise equipment device based, at least in part, on the determination.
  • 3. The method of claim 1, wherein the network membership key comprises a unique network membership key associated with a customer premise equipment device.
  • 4. The method of claim 1, further comprising providing, by the network termination unit, a network encryption key to a customer premise equipment device.
  • 5. The method of claim 4, wherein the network encryption key is encrypted using the network membership key.
  • 6. The method of claim 4, wherein the network encryption key is unique to the customer premise equipment device.
  • 7. The method of claim 1, wherein authorizing the encrypted request authorizes a customer premise equipment device regardless of which of a plurality of network termination units to which the customer premise equipment device is attached.
  • 8. The method of claim 1, further comprising transmitting information to a headend device indicating that a customer premise equipment device is authorized to access a network communicably coupled to the headend device.
  • 9. The method of claim 8, wherein the information further includes a restriction on the use of the network by the customer premise equipment device.
  • 10. An apparatus comprising: one or more processors;a network interface communicably coupled to the one or more processors; anda non-transitory computer-readable storage medium having stored thereon instructions that when executed cause the one or more processors to perform operations comprising:receiving, using the network interface, an encrypted request for a connection,identifying a first unique identifier associated with the encrypted request,identifying a network membership key associated with the first unique identifier,authorizing the encrypted request based on the network membership key,creating an encrypted network membership key, wherein said creating includes encrypting the network membership key using a device access key associated a network termination unit, andcommunicating the encrypted network membership key to the network termination unit.
  • 11. The apparatus of claim 10, wherein the operations further include: determining whether a second unique identifier associated with the network termination unit is encrypted within the encrypted request; andauthorizing a customer premise equipment device based, at least in part, on the determination.
  • 12. The apparatus of claim 10, wherein the network membership key comprises a unique network membership key associated with a customer premise equipment device.
  • 13. The apparatus of claim 10, wherein the network termination unit is configured to provide a network encryption key to a customer premise equipment device.
  • 14. The apparatus of claim 13, wherein the network encryption key is encrypted using the network membership key.
  • 15. The apparatus of claim 13, wherein the network encryption key is unique to the customer premise equipment device.
  • 16. The apparatus of claim 10, wherein the operations further include transmitting information to a headend device indicating that a customer premise equipment device is authorized to access a network communicably coupled to the headend device.
  • 17. The apparatus of claim 16, wherein the information further includes a restriction on the use of the network by the customer premise equipment device.
  • 18. A non-transitory computer-readable storage medium having stored thereon computer-executable instructions that when executed cause one or more processors to perform operations comprising: receiving an encrypted request for a connection;identifying a first unique identifier associated with the encrypted request;identifying a network membership key associated with the first unique identifier;authorizing the encrypted request based on the network membership key;creating an encrypted network membership key, wherein said creating includes encrypting the network membership key using a device access key associated with a network termination unit; andcommunicating the encrypted network membership key to the network termination unit.
  • 19. The non-transitory computer-readable storage medium of claim 18, wherein the operations further comprise: determining whether a second unique identifier associated with the network termination unit is encrypted within the encrypted request; andauthorizing a customer premise equipment device based, at least in part, on the determination.
  • 20. The non-transitory computer-readable storage medium of claim 18, wherein the network membership key comprises a unique network membership key associated with a customer premise equipment device.
  • 21. The non-transitory computer-readable storage medium of claim 18, wherein the operations further comprise transmitting a network encryption key to a customer premise equipment device.
  • 22. The non-transitory computer-readable storage medium of claim 21, wherein the network encryption key is encrypted using the network membership key.
  • 23. The non-transitory computer-readable storage medium of claim 21, wherein the network encryption key is unique to the customer premise equipment device.
  • 24. The non-transitory computer-readable storage medium of claim 18, wherein said authorizing the encrypted request includes providing authorization to a customer premise equipment device regardless of which of a plurality of network termination units to which the customer premise equipment device is attached.
  • 25. The non-transitory computer-readable storage medium of claim 18, wherein the operations further comprise transmitting information to a headend device indicating that a customer premise equipment device is authorized to access a network communicably coupled to the headend device.
  • 26. The non-transitory computer-readable storage medium of claim 25, wherein the information further includes a restriction on the use of the network by the customer premise equipment device.
PRIORITY INFORMATION

This application is a divisional of U.S. application Ser. No. 11/970,323, entitled “AUTHORIZING CUSTOMER PREMISE EQUIPMENT ON A SUB-NETWORK,” by Lawrence W. Yonge III, Srinivas Katar, and Manjunath Krishnam, filed on Jan. 7, 2008, which claims priority to U.S. Provisional Application Ser. No. 60/941,949, entitled “MANAGING COMMUNICATIONS OVER A SHARED MEDIUM,” by Lawrence W. Yonge III, Srinivas Katar, and Manjunath Krishnam, filed on Jun. 4, 2007, each of which is hereby incorporated by reference in its entirety as though fully and completely set forth herein.

US Referenced Citations (193)
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
5491750 Bellare et al. Feb 1996 A
5570355 Dail et al. Oct 1996 A
5613012 Hoffman et al. Mar 1997 A
5617421 Chin et al. Apr 1997 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 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
7065643 Cornils et al. Jun 2006 B1
7085284 Negus Aug 2006 B1
7089298 Nyman et al. Aug 2006 B2
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 Apr 2008 B1
7369579 Logvinov et al. May 2008 B2
7395097 Perdomo et al. Jul 2008 B2
7409543 Bjorn Aug 2008 B1
7496039 Yamada et al. Feb 2009 B2
7506042 Ayyagari Mar 2009 B2
7558294 Yonge, III Jul 2009 B2
7558575 Losh et al. Jul 2009 B2
7573891 Chow et al. Aug 2009 B1
7609681 Kurobe et al. Oct 2009 B2
7623542 Yonge, III et al. Nov 2009 B2
7756039 Yonge, III 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, III May 2011 B2
7961694 Chan et al. Jun 2011 B1
8112358 Yonge, III Feb 2012 B2
8170051 Yonge, III May 2012 B2
20010000709 Takahashi et al. May 2001 A1
20020015496 Weaver et al. 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
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
20040128310 Zmudzinski et al. Jul 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 et al. Sep 2005 A1
20050192037 Nanda 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
20060120371 Huang et al. Jun 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 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
20070183445 Kim et al. Aug 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
20080178003 Eastham et al. Jul 2008 A1
20080181219 Chen et al. Jul 2008 A1
20080186230 Wengler et al. Aug 2008 A1
20080192666 Koskan et al. Aug 2008 A1
20080212591 Wu et al. Sep 2008 A1
20080222447 Ram et al. Sep 2008 A1
20080225774 Kim 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, III 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
20090097443 Pasanen et al. Apr 2009 A1
20090106551 Boren et al. Apr 2009 A1
20090116461 Yonge, III May 2009 A1
20090119190 Realini 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 Apr 2010 A1
20100161972 Staring et al. Jun 2010 A1
Foreign Referenced Citations (12)
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
03010096 Feb 2003 WO
WO03100996 Dec 2003 WO
WO2004038980 May 2004 WO
Non-Patent Literature Citations (66)
Entry
Co-pending U.S. Appl. No. 13/113,474, filed May 23, 2011, 32 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 Final Office Action”, Apr. 16, 2012, 32 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/970,339 Office Action”, Jun. 18, 2012, 26 pages.
“U.S. Appl. No. 11/971,446 Office Action”, Feb. 15, 2011, 20 pages.
“U.S. Appl. No. 11/971,446 Final Office Action”, Jul. 1, 2011, 17 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”, Feb. 16, 2011, 26 pages.
“U.S. Appl. No. 12/108,334 Office Action”, Aug. 3, 2010, 20 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,301 Office Action”, Mar. 1, 2012, 38 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”, Jun. 9, 2011, 38 pages.
“U.S. Appl. No. 12/133,315 Final Office Action”, Jul. 20, 2010, 30 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/108,334 Office Action”, Aug. 3, 2012 , 18 pages.
“U.S. Appl. No. 12/133,315 Office Action”, Aug. 9, 2012 , 37 pages.
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.
HomePlug Powerline Alliance Inc., “HomePlug AV White Paper,” Doc. Ver. No. HPAVWP-050818, Aug. 2005, pp. 1-11.
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.
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.
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,339 Office Action”, Jun. 27, 2013 , 22 pages.
U.S. Appl. No. 13/873,168 Office Action, 23 pages, Dec. 16, 2013.
U.S. Appl. No. 12/133,301 Office Action, Sep. 25, 2013 , 44 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.
U.S. Appl. No. 12/133,301 Final Office Action, Sep. 26, 2012, 54 pages.
“U.S. Appl. No. 11/970,339 Final Office Action”, Jan. 3, 2014 , 27 pages.
U.S. Appl. No. 11/971,446 Office Action, 19 pages, Feb. 14, 2014.
“U.S. Appl. No. 11/970,339 Office Action”, May 22, 2014, 18 pages.
“U.S. Appl. No. 12/133,301 Final Office Action”, Apr. 17, 2014, 28 pages.
“U.S. Appl. No. 13/873,168 Final Office Action”, Jun. 11, 2014, 22 pages.
Co-pending U.S. Appl. No. 13/873,168, filed Apr. 29, 2013, 20 pages.
Co-pending U.S. Appl. No. 13/917,394, filed Jun. 13, 2013, 34 pages.
“U.S. Appl. No. 13/113,474 Office Action”, Jun. 17, 2013 , 10 pages.
Notification of First Office Action, The State Intellectual Property Office of the People's Republic of China, issued in Chinese Application No. 20088010048.9, Nov. 21, 2012, 17 pages.
U.S. Appl. No. 11/970,339 Final Office Action, Dec. 11, 2012, 25 pages.
“U.S. Appl. No. 11/970,297 Office Action”, Jan. 21, 2015, 38 pages.
“U.S. Appl. No. 13/917,394 Final Office Action”, Feb. 23, 2015, 54 pages.
“U.S. Appl. No. 11/970,339 Final Office Action”, Nov. 6, 2014, 24 pages.
“U.S. Appl. No. 12/133,301 Office Action”, Oct. 2, 2014, 34 pages.
“U.S. Appl. No. 13/917,394 Office Action”, Oct. 17, 2014, 49 Pages.
Related Publications (1)
Number Date Country
20120072715 A1 Mar 2012 US
Provisional Applications (1)
Number Date Country
60941949 Jun 2007 US
Divisions (1)
Number Date Country
Parent 11970323 Jan 2008 US
Child 13303913 US