Abstract:
Certain embodiments of the present disclosure relate to methods for increasing a capacity in a peer-to-peer (P2P) wireless network. The methods include generating a connectivity metric (CM) value indicative of a number of other wireless nodes of the P2P wireless network to which the wireless node is connected, transmitting the CM value, and then transmitting full connectivity information maintained by the wireless node at a frequency determined based on the CM value. The disclosed methods therefore allow well-connected nodes of the P2P wireless network to be exploited in a manner that increases the overall connectivity of all the nodes in the network.
Abstract:
According to one aspect of the invention, a method is provided in which a control channel used for transmitting control information is partitioned into a plurality of subchannels each of which is operated at a specific data rate. For each of one or more user terminals, one of the subchannels is selected based on one or more selection criteria for transmitting control information from an access point to the respective user terminal. Control information is transmitted from the access point to a user terminal on a particular subchannel selected for the respective user terminal. At the user terminal, one or more subchannels are decoded to obtain control information designated for the user terminal.
Abstract:
Coding techniques for a (e.g., OFDM) communication system capable of transmitting data on a number of “transmission channels” at different information bit rates based on the channels' achieved SNR. A base code is used in combination with common or variable puncturing to achieve different coding rates required by the transmission channels. The data (i.e., information bits) for a data transmission is encoded with the base code, and the coded bits for each channel (or group of channels with the similar transmission capabilities) are punctured to achieve the required coding rate. The coded bits may be interleaved (e.g., to combat fading and remove correlation between coded bits in each modulation symbol) prior to puncturing. The unpunctured coded bits are grouped into non-binary symbols and mapped to modulation symbols (e.g., using Gray mapping). The modulation symbol may be “pre-conditioned” and prior to transmission.
Abstract:
For a peer-to-peer call in an ad hoc wireless network, a wireless device performs discovery of a target wireless device, performs authentication of the target wireless device and generates a session key (e.g., using a pre-shared key or a certificate provisioned on the wireless device), forms an ad hoc wireless network with the target wireless device, and communicates peer-to-peer with the target wireless device via the ad hoc wireless network. The wireless device may perform discovery with a list of identifiers for wireless devices designated to communicate with this wireless device. The wireless device may derive a service set identifier (SSID) used to identify the ad hoc wireless network based on its user-specific identifier (e.g., its phone number) and/or a user-specific identifier for the target wireless device. Other aspects, embodiments, and features are also claimed and described.
Abstract:
Certain embodiments of the present disclosure relate to a method for improving the effective coverage of nodes within a peer-to-peer (P2P) wireless network. Collection of nodes of the P2P network can have a larger aggregate coverage footprint than any given single node. This inherent multi-site property of P2P wireless networks can be exploited to provide each node with benefits of multi-user diversity, thus improving discovery of devices in the P2P network.
Abstract:
Certain embodiments of the present disclosure relate to a method and an apparatus for managing and optimizing service discovery in a peer-to-peer (P2P) wireless network. Nodes of the P2P network advertise their capabilities to their peers in the form of services. Efficient propagation and management of node's services to other nodes is proposed in the present disclosure.
Abstract:
An IBSS that allows token passing for round-robin service of QoS flows is disclosed (an RRBSS). The RRBSS permits low-latency, reduced contention, distributed scheduling useful in any ad hoc network, but particularly suitable for high data rates. Distributed scheduled access is provided for flows through a round-robin token passing service discipline. STAs follow a round-robin order, or list, and are able to communicate with round-robin transmit opportunities during a defined period. Each STA in the list transmits a respective token to transfer access to the shared medium to the next STA in the RR List. Techniques are disclosed to add and remove STAs to the sequence, establish connectivity lists (receive and forward), and maintain other sequence parameters such as bandwidth management and TXOP duration. Various other aspects are also disclosed.
Abstract:
Certain embodiments of the present disclosure relate to a method and an apparatus for managing and optimizing service discovery in a peer-to-peer (P2P) wireless network. Nodes of the P2P network advertise their capabilities to their peers in the form of services. Efficient propagation and management of node's services to other nodes is proposed in the present disclosure.
Abstract:
Coding techniques for a (e.g., OFDM) communication system capable of transmitting data on a number of “transmission channels” at different information bit rates based on the channels' achieved SNR. A base code is used in combination with common or variable puncturing to achieve different coding rates required by the transmission channels. The data (i.e., information bits) for a data transmission is encoded with the base code, and the coded bits for each channel (or group of channels with the similar transmission capabilities) are punctured to achieve the required coding rate. The coded bits may be interleaved (e.g., to combat fading and remove correlation between coded bits in each modulation symbol) prior to puncturing. The unpunctured coded bits are grouped into non-binary symbols and mapped to modulation symbols (e.g., using Gray mapping). The modulation symbol may be “pre-conditioned” and prior to transmission.
Abstract:
Certain embodiments of the present disclosure relate to methods for increasing a capacity in a peer-to-peer (P2P) wireless network. The methods include generating a connectivity metric (CM) value indicative of a number of other wireless nodes of the P2P wireless network to which the wireless node is connected, receiving a query for services, and then responding to the query for services if the CM value is greater than a defined CM threshold value. The disclosed methods therefore allow well-connected nodes of the P2P wireless network to be exploited in a manner that increases the overall connectivity of all the nodes in the network.