Abstract: A method and apparatus are described including determining address using an access point address and a multicast group address, transmitting a recovery request message to a recovery server to request recovery data using the address and receiving the recovery data from the recovery server. Also described are a method and apparatus including receiving a registration message, transmitting a reply to the registration message, receiving a recovery request message, transmitting recovery data responsive to the recovery request message and transmitting a message to a recovery multicast group to determine status of the recovery multicast group.

Abstract: A method and apparatus are described including scanning a channel, generating a report for the scanned channel, transmitting the channel report to an associated access point and receiving a channel assignment responsive to said channel report. Also described are a method and apparatus including scanning a channel, generating a first channel report, receiving a second channel report from an associated client, transmitting the first channel report and the second channel report to a server, receiving a channel assignment message from the server responsive to the first and second channel reports and transmitting the channel assignment message to the associated client. Further described are a method and apparatus including receiving a channel report from an associated access point, building an interference graph responsive to the channel report, determining channel assignments based on the interference graph and transmitting a channel assignment message to the associated access point.

Abstract: System and method embodiments are provided for selective data redundancy elimination. In an embodiment, the method includes receiving, at a transmission point, an incoming data packet containing content, wherein the content comprises a content type, eliminating, with the transmission point, redundant data elements from the data packet when the content type matches a selective data redundancy elimination type, and bypassing, with the transmission point, selective data redundancy elimination when the content type matches a bypass-elimination type.

Abstract: A method and apparatus are described including determining if a communications medium is idle; determining a time interval for a reservation of said communications medium; multicasting a message for reserving said communications medium; receiving responses to said message for reserving said communications medium; and determining if a number of said received responses compared to an expected number of responses exceeds a value; performing one of initiating pending frame exchanges and multicasting data or management frames during said time interval for said reservation of said communications medium if said comparison exceeds said value; repeating said first determining act if said comparison does not exceed said value.

Abstract: A method is described including receiving multiple requests for a multicast service, generating parameters associated with binding paths to a multicast tree to provide the requested multicast service and binding the paths to the multicast tree. Also described is a method including receiving a request for multicast service with a multicast tree identification, binding the multicast tree identification to paths satisfying a quality of service level for the multicast tree identification and transmitting a first message to a multi-hop relay base station. A method is described including receiving requests to delete multicast service from client devices served by multiple paths, generating parameters associated with unbinding paths from a multicast tree to delete the multicast service and unbinding the paths from the multicast tree. Also described is a method for unbinding of paths from the perspective of the relay station.

Abstract: A method and apparatus are described for increasing multicasting reliability, including receiving content and a first layer of a plurality of a forward error correction coded packets from a first multicast group and joining an additional multicast group in order to receive one of additional layers of forward error correction coded packets and the content along with a further additional layer of the plurality of forward error correction coded packets.

Abstract: Message formats and apparatus are described that reserve access to a communication medium in a multicast system. A first message, a multicast request-to-send message, includes a duration field having information representing the reserved time for a communication medium, multicast receiver and transmitter address fields, and bits that specifies a destination that is expected to reply to the multicast digital message. The bits that specify a destination can be extended to a plurality of fields that each contain different destination identifiers. Example destination identifiers include association identifiers or media access control addresses. Alternately, the bits that specify a destination can have a first field containing an offset and a second field indicating destinations with respect to the offset. A second message includes a duration field and multicast receiver and transmitter address fields. The second message is used to cancel a data transmission resulting from a multicast request-to-send message.

Abstract: A method and apparatus are described including selecting a first route between a source node and a destination node using a bandwidth-aware routing protocol, determining if the selected first route satisfies a bandwidth requirement of an application of the source node, initiating a switch to a new channel selected from a back-up channel list if the bandwidth requirement of the application is not satisfied by the selected route, selecting a second route over the new channel using the bandwidth-aware routing protocol, determining if the selected second route over the new channel satisfies the bandwidth requirement of the application of the source node and streaming data from the source node to the destination node if the selected first route satisfies the bandwidth requirement of the application or if the selected second route over the new channel satisfies the bandwidth requirement of the application.

Abstract: A method and apparatus are described including competing by a secondary transmitter with a plurality of secondary nodes in a cognitive radio network to become a relay node for a primary transmitter, the secondary nodes being secondary transmitters and secondary receivers, receiving data transmitted by the primary transmitter in a first time slot if the secondary transmitter was successful in the competition, relaying the received data transmitted by the primary transmitter to a primary receiver in a second time slot, transmitting secondary data to a corresponding secondary receiver in a subslot of the second time slot and transmitting the secondary data to the corresponding secondary receiver in a subslot of the first time slot if the secondary transmitter was not successful in the competition and if the corresponding secondary receiver was successful in the competition.

Abstract: A method for delivering packets in a wireless communications system includes determining a cause of loss for a previously transmitted packet based on a packet acknowledgement corresponding to the previously transmitted packet, the packet acknowledgement including at least one of a wireless loss indicator and a congestion warning indicator for the wireless communications system. The method also includes adjusting a transmission parameter in a packet transmission protocol according to the cause of loss, and retransmitting the previously transmitted packet.

Abstract: An embodiment of a system and method that uses inline measurements to probe available bandwidth for a transmission control protocol, and adaptively sets a slow-start threshold according to the available bandwidth. The method includes initializing a congestion window “cwnd,” sending cwnd packets, estimating an available bandwidth for the cwnd packets. The congestion window cwnd is set to a higher number, and the higher number of further packets is sent if the available bandwidth is greater than a first threshold level. The available bandwidth is re-estimated for the higher number of the further packets, and a soft start threshold “ssthresh” is set to the re-estimated available bandwidth. A statistical measure is calculated for the re-estimated available bandwidth, and the congestion window cwnd is set equal to ssthresh if a ratio of the statistical measure to the re-estimated available bandwidth is less than a second threshold level.

Abstract: Described herein are a method and apparatus including calculating an aggregate peak total traffic demand for all overlapping access points in an interference range, comparing the aggregate peak total traffic demand to a threshold, rejecting a requested new quality of service traffic stream responsive to results of the comparison, calculating a peak total traffic demand for each overlapping access point in the interference range if the requested new quality of service traffic stream is admissible responsive to results of the comparison, comparing the peak total traffic demand for each overlapping access point in the interference range, if the requested new quality of service traffic stream is admissible, to the threshold and one of accepting the requested new quality of service traffic stream and rejecting the requested new quality of service traffic stream responsive to results of the second comparison.

Abstract: A method and apparatus are described including buffering data to be transmitted, transmitting data retrieved from a buffer via a datagram protocol, receiving a request for retransmission of data, determining if the requested data is in the buffer and retransmitting the requested data via a protocol that provides end-to-end acknowledgement of data and error recovery.

Abstract: A method is described including requesting content from a directory service, receiving a list of peers in a peer-to-peer network having the requested content, selecting a peer from the received list of peers, establishing communications with the selected peer, receiving a list of chunks of content and ads available from the selected peer, requesting a chunk of content and ads available from said selected peer and receiving the chunk of content and randomly selected ads from the selected peer. Also described is a method including receiving a request for content, generating a list of chunks of content available for the requested content, generating a list of ads associated with the requested content, transmitting the list of available chunks of content responsive to the request, receiving a request for a selected chunk of content and transmitting the selected chunk of content and ads associated with the selected chunk of content.

Abstract: A method and apparatus are described including communicating with neighbor nodes in a wireless network, determining one-hop neighbor nodes and two-hop neighbor nodes responsive to the communication, determining a minimum multipoint relay set responsive to the first working channel determination and communicating over the wireless network using the minimum multipoint relay set.

Abstract: A method and apparatus are described including assigning sub-channels to different multicast sessions under the assumption that in each session all sub-channels are allocated to all users of that session and power is equally allocated to each sub-channel, then for each session assigning the sub-channels to the users of that session under the assumption that the same amount of power is allocated to each sub-channel, then allocating remaining power to certain sub-channels within the session to increase multicast rate, finally modifying the sub-channel allocations among the multicast sessions depending on the sub-channel and power allocation within each multicast session.

Abstract: A method and apparatus are described including allocating one of a plurality of sub-channels to one of a plurality of multicast group clients for a multicast session and performing bit-loading for the allocated sub-channel, wherein said performing act further includes finding one of the plurality of multicast group clients having a lowest received bit rate, finding one of the plurality of sub-channels needing a lowest power to transmit one more bit to the one of the plurality of multicast group clients having the lowest received bit rate, comparing the needed power to a residual power, adding one more transmission bit to the sub-channel if the needed power is not greater than the residual power and updating a multicast rate, the residual power and the power need to transmit one more bit if the needed power is not greater than the residual power.

Abstract: A method and apparatus for multicast communications in a multi-hop relay network are described including sending an extended request message, wherein the request message includes a multicast connection identification, multicast distribution tree information and a path identification and receiving an extended response message. Correspondingly, a method and apparatus for multicast communications in a multi-hop relay network are described including receiving an extended request message, wherein the request message includes a multicast connection identification, multicast distribution tree information and a path identification and sending an extended response message.

Abstract: A method and apparatus are described including scanning a channel, generating a report for the scanned channel, transmitting the channel report to an associated access point and receiving a channel assignment responsive to said channel report. Also described are a method and apparatus including scanning a channel, generating a first channel report, receiving a second channel report from an associated client, transmitting the first channel report and the second channel report to a server, receiving a channel assignment message from the server responsive to the first and second channel reports and transmitting the channel assignment message to the associated client. Further described are a method and apparatus including receiving a channel report from an associated access point, building an interference graph responsive to the channel report, determining channel assignments based on the interference graph and transmitting a channel assignment message to the associated access point.

Abstract: A method and apparatus are described including categorizing each channel into one of four categories, selecting a channel from a first category of channels, if there are any channels in the first category of channels, selecting a channel from a second category of channels, if there are any channels in the second category of channels and selecting a channel from a third category of channels, if there are any channels in the third category of channels.