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: Method and apparatus for packet scheduling in a wireless network is described. First values for a data transmission rate are measured for each of a plurality of mobile stations over time. Second values for a function of the data transmission rate are computed using at least one of the first values for each of the mobile stations. A rate of change of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A stability of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A channel quality factor is determined for each of the mobile stations using a current value of the second values, the rate of change of the function, and the stability of the function associated therewith.

Abstract: A method and apparatus for electing broadcast relay nodes (520B, H, M) in an ad hoc network (500). Each node (520A-520O) generates an attribute message including associated parameters. Each node (520A-520O) generates a weighted value (WV) based on the parameters. The WV can be included in the attribute message for that node, can provide a metric for ranking that node to be nominated to be a broadcast relay node, can alternatively provide a probability measure for that node to probabilistically elect itself as a broadcast relay node. The broadcast manager node (520C) receives the attribute messages and elects at least one nominated node as a broadcast relay node (520B, H, M) based on the attribute messages. Each node (520A-520O) can also initiate election of an intermediate broadcast relay node if that node fails to receive a test message within a predetermined time.

Abstract: A method for sending requests in a network (100) is disclosed. The network includes a plurality of nodes and a plurality of wireless base stations. Each of the plurality of nodes is associated with at least one wireless base station in the network. The method includes receiving at a wireless base station a request for at least one destination node from a source node. A batch route request is generated based on the request. The batch route request is sent to the network for delivery to the at least one destination node.

Abstract: A method and system for routing a data packet, intended for a destination node, from a source node to a first intermediate node in a network is useful for improving the efficiency of the network. The method includes determining a priority level for a user of the source node and a priority level for a user of the destination node (step 505). A priority level is also determined for each of the following: a device associated with the source node, a device associated with the destination node, and a device associated with the first intermediate node (step 510). A routing path is then selected that routes the data packet from the source node to the first intermediate node based on a comparison of the priority level for the device associated with the first intermediate node, the priority levels for the users of the source and destination nodes, and the priority levels for the devices associated with the source and destination nodes (step 515).

Abstract: Disclosed is a method for reliable multicasting. The method comprises receiving a multicast packet, sending a first acknowledgement for having received the multicast packet, and receiving a second acknowledgement in response to having sent the first acknowledgement.

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 self-learning geographically aware handoff method and system is disclosed. The system includes a handoff manager (108), which receives information about a position and movement of the mobile nodes (102a, 102b, 102c and 102d) present in the mobile network (100). The handoff manager learns the coverage capabilities of the access points (104a, 104b, 104c and 104d) in the mobile network. It then determines a second access point, to which a mobile node will handoff to, based on the learned coverage capabilities. The handoff manager then informs the mobile node about the second access point.

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: Methods for delivery of multicast packets in a wireless communication system are disclosed. The methods comprise transmitting a contention free period initiation signal from an access point to the station, transmitting broadcast packets from the access point to the station, transmitting multicast packets from the access point to the station and holding the multicast packets in storage after the transmission, transmitting a contention free period end signal from the access point to the station, determining if a negative acknowledgement message has been received, retransmitting the multicast packets in response to receiving a negative acknowledgment message, and eliminating the multicast packets at a next beacon interval.

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: A method and system for wireless data transmission between at least three stations use multiple frequency bands for simultaneous channel communications. The method includes transmitting a Request To Send (RTS) packet from a first station to an intermediate second station over a first frequency band. Two Clear To Send (CTS) packets, which CTS packets include transmission timing information, are then transmitted from the second station simultaneously both to the first station and to a third station. The CTS packet sent to the first station is transmitted over the first frequency band and the CTS packet sent to the third station is transmitted over a second frequency band. A data packet from the first station is then transmitted to the second station. The third station suspends, based on the transmission timing information included in the CTS packets, any unicast transmission to the second station during the transmission of the data packet from the first station to the second station.

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.

Abstract: A method and apparatus for improving throughput in a wireless local area (WLAN), which includes buffering a set of messages, identifying a target address for the set of messages, and concatenating the set of messages based on the target address. The target address can be either unicast, broadcast, multicast or combination of unicast, broadcast and multicast as described herein.

Abstract: In one embodiment of the present invention, an access point (111) receives a multicast packet intended for a particular multicast group. Upon receipt, the access point only rebroadcast the multicast packet over a wireless segment if it determines that there is at least one wireless subscriber unit (131) belonging to the particular multicast group and associated with the access point that did not originate the multicast packet. Optionally, if the multicast packet signals an automatic rebroadcast of the multicast packet over the wireless segment, the access point automatically rebroadcasts the multicast packet without determining whether there is at least one wireless subscriber unit belonging to the particular multicast group and associated with the access point that did not originate the multicast packet.

Abstract: A method and system for scheduling multicast transmissions in a WLAN involves transmissions between a Quality of Service (QoS) Access Point (QAP) (105) and a plurality of stations (110). The method includes transmitting a first group poll (410) from a QAP (105) to each station (110) in a multicast group comprising a plurality of stations (110) (step 705). An active station (110) and inactive stations (110) among said plurality of stations (110) are then identified (step 510). Next, a directed Contention Free (CF) poll (425) is transmitted from the QAP (105) to the active station (110) (step 715). An inbound QoS data frame (415) is then transmitted from the active station (110) to the QAP (105) (step 720). An outbound QoS data frame (420) corresponding to the inbound QoS data frame (415) is then multicast from the QAP (105) to the inactive stations (110) (step 725).

Abstract: In a communication system, a mobile station (104) is currently associated with a first access point (AP1). AP1 (100) receives a transmission at a first signal quality from the mobile station. AP1 also receives a first message that indicates a second signal quality at which a second access point (AP2) is receiving transmissions from the mobile station. AP1 compares the first signal quality with the second signal quality, and when the second signal quality is greater than the first signal quality, AP1 signaling AP2 (102) to initiate a handoff with the mobile station. Alternatively, prior to AP1 signaling AP2 to initiate the handoff, AP1 may take into consideration the signal quality of transmissions received by the mobile station from the access points (100, 102).