Abstract: A method for transmitting beacon transmissions in a wireless local area network (WLAN) communications system (100) operating on one or more channels includes transmitting a first beacon (C1) using a directional antenna in a first direction (D1) on a first channel. A second beacon (C2) is then transmitted using a directional antenna in a second direction (D2) on the first channel. This process is then repeated such that the first beacon and second beacon after a predetermined beacon interval. The first beacon begins its transmission at a target beacon transmission time (TBTT) and the second beacon begins its transmission in a sequential period defined by an antenna switching time after the transmission of the first beacon.

Abstract: A method and apparatus for facilitating a fast handoff for subscribers in a Wireless Metropolitan Area Network (WMAN) by establishing a hard association with a first entity by sending a hard association request to the first entity and receiving a hard association response in response to the hard association request and establishing a pending association with a second entity by sending a pending association request to a second entity and receiving a pending association response from the second entity. In one embodiment, the pending association with the second entity may be converted to a hard association.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: A method and system for data transmission by computational devices in a wireless network (100) are disclosed. A computational device (102) organizes the wireless network in a hierarchical topology having at least one root node and updates a list of interferers and a list of descendents. Then, the computational device allocates a Contention Free Period (CFP) slot to each computational device in the wireless network based on at least one of the list of interferers and the list of descendents and transmits data during the allocated CFP slot.

Abstract: Methods for providing a client access to a channel in a meshed wireless local area network are disclosed. The methods comprise that a client in the meshed wireless local area network implement a polling based channel access methodology. The client determines that the channel is available by sensing that the channel is not busy and sends a request for access to the channel to an access point, wherein the request specifies a priority of data that is to be transmitted when the client is granted access to the channel. The client waits a time period before receiving at least one of a) a rejection of the request for access to the channel, b) access to the channel, c) modification of the request for access to the channel, and d) delay access to the channel.

Abstract: A system (100) that includes a device (120), such as an access point, which is configured for: obtaining (210) a status of a busy channel indicator; and dynamically selecting (220) an access scheme within a contention free period interval based on the status of the busy channel indicator.

Abstract: Methods for performing client to client communication in a wireless local area network are disclosed. At an ‘n’ tier client in the wireless local area network, a signaling message from an ‘n?1’ tier client is received wherein the signaling message comprises a first period, a second period, and a third period. Communicating with the ‘n?1’ tier client during the first period and communicating with the ‘n+1’ tier client during the third period. At an access point in the wireless local area network, an association table identifying clients in the wireless local area network is created and a first period for client to client communication based upon the association table and traffic in the wireless local area network is determined where the access point does not communicate with the clients during the first period.

Abstract: In the present invention, the subscriber unit (200) obtains a set of access point identifiers and measurement opportunity information for each access point identifier. A first measurement is performed on a first access point identified from the set of access point identifiers. A current timer value is determined after completing the step of performing, and a second access point identified from the set of access point identifiers in which to perform a second measurement is selected. Selecting the second access point is based on at least the measurement opportunity information for the second access point in relation to the current timer value.

Abstract: Methods for managing wireless backhaul in a multi-tier wireless local area network are disclosed. The methods comprise maintaining a polling list wherein the polling list specifies the children to be serviced, transmitting a communication in the downstream direction to a child in the polling list, receiving exception communications from the child, and updating the polling list in response to the exception communication.

Abstract: Distributed DNS in a wireless communication network comprising broadcasting by a first node a request message to a second node is disclosed. The request message comprises a hostname of the second node. The first node forwards the request message to the second node through intermediate nodes in the wireless communication network and the second node transmits a response message to the first node. The response message comprises a MAC address of the second node.

Abstract: A method for transmitting beacons by nodes in a multi-tier wireless local area network is disclosed. First, a first beacon by a tier 1 node in the multi-tier wireless local area network is transmitted. Then, a second beacon by a tier 2 node is transmitted where the second beacon is transmitted based upon the time that the first beacon is sent by the tier 1 node.

Abstract: A method for performing neighbor discovery in a multi-tier wireless local area network where a client creates a neighbor list identifying a neighbor wherein the neighbor is identified as an access point or a client. Then, the client determines a time to perform a scan of neighbors based upon 1) a type of neighbor discovery to be performed and 2) when a first beacon is transmitted by an access point in a first tier of the multi-tier wireless local area network. Subsequently, the client performs a scan of neighbors at the determined time on a channel associated with the type of neighbor discovery. Finally, the client receives a beacon sent from a neighbor of the client to update the neighbor list with information transmitted in the beacon.