Abstract:
Aspects of the present disclosure provide techniques for efficient ranging, for example, in a neighbor aware network (NAN). According to certain aspects, an apparatus for wireless communications is provided. The apparatus generally includes a processing system configured to determine a period that at least one second apparatus is scheduled to be awake, generate a first frame for transmission to the second apparatus during the period, determine ranging information based on a time difference between transmission of the first frame and receipt of a second frame in response to the first frame, and generate a third frame including the ranging information; a transmit interface configured to output the first and third frames for transmission; and a receive interface configured to obtain the second frame. By exchanging ranging information in already scheduled wake-up periods and in existing frame, power consumption and signaling overhead may be reduced.
Abstract:
A method, an apparatus, and a computer program product for wireless communication are provided. In one aspect, an apparatus includes a processor configured to send a request to at least one station associated with the apparatus to scan for information related to at least one neighboring access point (AP) operating in a neighborhood of the apparatus and report the information to the apparatus, receive from the at least one associated station a report including the information, generate a neighborhood report related to the at least one neighboring AP, the neighborhood report including the information received from the at least one associated station, and transmit the neighborhood report to one or more other stations not associated with the apparatus to facilitate discovery of an AP of interest to the one or more other stations.
Abstract:
Methods, devices, and systems are described to enable fair message transmission and to reduce maximum power consumption of stations in a wireless network. For example, a first station of the wireless network may transmit a message including a first neighbor list to a second station of the wireless network. The first neighbor list may identify one or more stations within a particular range of the first station. The second station may selectively transmit, based on a comparison between the first neighbor list and a second neighbor list and a random countdown, a copy of the message including the second neighbor list to another station of the wireless network. The second neighbor list may identify one or more stations within a particular range of the second station.
Abstract:
A wireless communication device includes a memory and a processor coupled to the memory. The processor is configured to set a packet number to a particular value in accordance with a packet number initialization scheme associated with a data link group of a neighbor aware network (NAN). The processor is further configured to generate a packet based on the packet number.
Abstract:
Methods, apparatuses, and systems are described that implement techniques and protocols to enable a station to receive a neighbor query request from a first associated access point that is associated with the station. The station may wirelessly communicate a neighbor report of a second access point to the first access point while the station is unassociated with the second access point.
Abstract:
Methods, apparatuses, and systems are described that implement techniques and protocols to enable a station to receive a neighbor query request from a first associated access point that is associated with the station. The station may wirelessly communicate a neighbor report of a second access point to the first access point while the station is unassociated with the second access point.
Abstract:
Methods, systems, and devices are described for unicast key management across multiple neighborhood aware network (NAN) data link networks (NDL) comprising: establishing, by a first device, a first association with a second device via a first data link; establishing, by the first device, a second association with the second device via a second data link; and using a single unicast key to encrypt unicast traffic transmitted via the first data link and the second data link between the first device and the second device.
Abstract:
Methods, systems, and devices are described for presence indication and determination in a wireless data link, such as a neighbor aware network (NAN) data link (NDL). A wireless station (STA) may identify a set of devices associated with the wireless data link and transmit a message to the set of devices including a presence request indicator. The STA may determine that a first subset of the set of devices are present in the wireless data link based on receiving a response to the message from the first subset. The STA may also determine that at least one device of the set of devices are absent from the wireless data link based on receiving a notice of absence message from the one device.
Abstract:
A device for communication includes a processor, a transmitter, and a receiver. The processor is configured to generate a traffic advertisement indicating availability of data to be sent to a plurality of devices. The traffic advertisement includes a unicast message addressed to a first device of the plurality of devices. The transmitter is configured to transmit the traffic advertisement during a paging window. The receiver is configured to receive, during a data transmission window that is subsequent to the paging window, a data request from a second device of the plurality of devices. The data request is responsive to the traffic advertisement. The transmitter is further configured to send first data to the second device responsive to the data request.
Abstract:
Methods, systems, and devices related to wireless communication via a mesh network are described. In particular, the disclosure is directed to selecting a path between two nodes in a wireless mesh network based on consideration of type of data requested and a determination whether an intermediate node, within a predetermined range of the requesting node, is actively broadcasting the requested data. Such opportunistic consideration in selecting a path between two nodes may avoid unnecessary activation of additional broadcasting nodes and reduce the risk of triggering interference between multiple nodes broadcasting duplicate data.