Abstract:
Methods, devices, and computer program products communicating discovery information in a wireless neighborhood aware network (NAN). One method includes receiving a message from a neighboring wireless device. The message includes an identifier associated with the neighboring wireless device. The method further includes adding the identifier to a data structure indicative of discovered device identifiers. The method further includes transmitting a message including the data structure indicative of discovered device identifiers.
Abstract:
Apparatuses and methods are disclosed for delivering queued downlink (DL) data from a second wireless device to a plurality of first wireless devices. In accordance with example embodiments, the second wireless device may determine, for each of the plurality of first wireless devices, a presence of a corresponding set of queued DL data, may transmit a beacon frame identifying which of the plurality of first wireless devices has queued DL data, and may transmit, to each of the identified first wireless devices, permission to request delivery of queued DL data. Next, the second wireless device may receive, from each of the identified first wireless devices, a request for delivery of the queued DL data. Then, the second wireless device may concurrently transmit, to each of the identified first wireless devices, the corresponding set of queued DL data.
Abstract:
A method of communication includes generating, at a first device, a traffic advertisement indicating availability of data to be sent by the first device to at least one second device. The method also includes sending the traffic advertisement during an initial portion of a neighbor aware network (NAN) data link (NDL) time block. The method further includes sending first data to the second device during the NDL time block. The first data is sent independently of receiving an acknowledgement (ACK) responsive to the traffic advertisement from the second device.
Abstract:
A method of communication includes selecting a logical channel of a plurality of logical channels at a first electronic device of a neighbor aware network (NAN). The logical channel indicates a particular communication channel of a plurality of communication channels and indicates a set of transmission windows of a plurality of transmission windows. The method also includes generating a message indicating that the first electronic device is available to communicate with other electronic devices of the NAN and identifying the logical channel. The method further includes transmitting the message to a second electronic device of the NAN.
Abstract:
Systems and methods for monitoring the number of neighboring wireless devices in a wireless network are described herein. In one aspect, the method includes receiving a message from one of the neighboring wireless devices having an identifier associated with the neighboring wireless device and adding the identifier into a Bloom filter. The method may further include estimating the number of distinct strings that have been added into the Bloom filter based on the number of zeros in the Bloom filter, the number of distinct strings representing an estimate of the number of neighboring wireless devices in the wireless network.
Abstract:
Methods and apparatus for independent basic service set based data paths for neighbor aware networks are described herein. In some aspects, an apparatus for wireless communication in an independent basic service set is provide. The apparatus comprises a receiver configured to receive a service discovery frame from a device in a neighbor aware network. The apparatus comprises a processor configured to determine a timing for an announcement traffic indication message window, wherein the timing is defined as an offset from a beginning of a discovery window for the neighbor aware network. The apparatus comprises a transmitter configured to transmit an announcement traffic indication message during the announcement traffic indication message window. The service discovery frame comprises an independent basic service set availability attribute defining a duration of the announcement traffic indication message window.
Abstract:
Systems and methods of limiting wireless discovery range are described. A method may include determining, at a first device, a discovery range threshold that limits a distance from the first device at which a second device is operative to decode a discovery message. The method may include adjusting a transmission attribute at the first device based on the discovery range threshold. The method may include sending the discovery message in accordance with the adjusted transmission attribute.
Abstract:
A user equipment (UE) uses information regarding the timing of scheduling mobile wireless services (MWS) RAT communications to improve MWS and wireless network connectivity (WCN) radio access technology coexistence. To allow sufficient time for an uplink grant to be received by the UE in advance of the scheduled uplink time, an uplink grant may be sent in advance of the scheduled uplink time. In some instances, the UE may receive an indication of scheduled uplink time of the MWS RAT via a physical layer communication. The UE may schedule communications of the WCN RAT based at least in part on the indication of future activity.
Abstract:
Methods and apparatus in accordance with various embodiments provide for private service IDs for utilization in wireless devices in neighbor aware networks. One aspect of the subject matter described in the disclosure provides a method of transmitting service information in a wireless neighborhood aware network. The method includes generating a first message comprising a first service identifier, wherein the first service identifier includes a first hash value based on a service name and timing information, wherein the first hash value is generated by applying a first hash function. The method further includes transmitting the first message.
Abstract:
Described embodiments are directed to systems, methods, and apparatuses for dynamically scheduling channel dwell times across two or more channels across a single radio using Multi-Channel Concurrency. Communications may be transmitted and/or received over a first channel of the radio during a first dwell time of a dwell period and over a second channel of the radio during a second dwell time of the dwell period. Some embodiments include adjusting the dwell period and/or dwell time spent actively transmitting or receiving on two or more channels based on measured channel utilization metrics, to drive toward a balanced utilization across the two or more channels. Other embodiments include adjusting the dwell period and/or dwell time of multiple channels based on latency information and/or priority information of at least one of the channels.