Abstract: A method determines wireless radio locations in a network. The method includes identifying a group of location fixed radios in a network. Radios in the network with known location coordinates and/or known timing bias error values are grouped. RTT values are determined between each radio in the group and radios outside the group. Timing bias error values are determined for each radio outside the group. The timing bias error value for each radio outside the group of radios with known location coordinates and known timing bias error values is based on the determined RTT values. Location coordinates are estimated for each radio outside the group. A request is received for access to the network from a mobile radio device. The known location coordinates and estimated location coordinates of radios are used to determine a distance of the mobile radio device from one of the location fixed radios.

Abstract: A pump for a reductant insertion assembly, comprises a housing configured to receive a reductant. A pumping element is disposed within the housing. The pumping element configured to pressurize the reductant and communicate the pressurized reductant out of the housing. The housing and/or the pumping element comprises aluminum, and the pump further comprises a corrosion resistant layer disposed on at least a portion of a surface of the housing and/or the pumping element that is configured to contact the reductant. The corrosion resistant layer comprising a fluoropolymer.

Abstract: In an example embodiment, an apparatus comprising an interface configured to communicate with at least one wireless transceiver, and a controller coupled to the interface. The controller is configured to determine a predefined characteristic such as current load and/or interference for a wireless channel associated with the at least one wireless transceiver. The controller is operable to suppress sending a probe response in response to the at least one wireless transceiver receiving a probe request, wherein how often probe responses are suppressed is based on the predefined characteristic for the wireless channel.

Abstract: In one embodiment, a receiving node in a computer network may detect congestion, and also identifies a set (e.g., subset) of its neighbor nodes. In response to the congestion, the receiving node may assign a transmission timeslot to each neighbor node of the set based on the congestion, where each neighbor is allowed to transmit (synchronously) only during its respective timeslot. The assigned timeslots may then be transmitted to the set of neighbor nodes. In another embodiment, a transmitting node (e.g., a neighbor node of the receiving node) may receive a scheduling packet from the receiving node. Accordingly, the transmitting node may determine its assigned transmission timeslot during which the transmitting node is allowed to transmit. As such, the transmitting node may then transmit packets only during the assigned timeslot (e.g., for a given time). In this manner, congestion at the receiving node may be reduced.

Abstract: In one embodiment, a computer network may include nodes and at least one root node. A first subset of the nodes may be located along a designated path (a directed acyclic graph (DAG)) through the computer network to the root node, where the first subset of nodes is configured to operate according to a first wake-up timer. A second subset of the nodes that are not along the designated path are in communication to at least one node of the first subset of nodes along the designated path, and operate according to a second wake-up timer that is longer than the first wake-up timer. In this manner, second subset of nodes may be awake less often, e.g., conserving energy.

Abstract: A multicast message may be distributed by receiving, at a first node in a multicast network, a multicast message from a parent node of the first node. The multicast message is transmitted to child nodes of the first node in the multicast network. A population of the child nodes to which the multicast message was transmitted is accessed and acknowledgement messages which reveal child nodes that are among an acknowledging subset of less than all of the child nodes of the first node are received. Child nodes revealed by the received acknowledgement messages are compared with child nodes determined to be among the population of child nodes to which the multicast message is expected to be received. Based on results of the comparison, a compressed non-acknowledging subset is identified and transmitted to the parent node.

Abstract: In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may also notify the parent node of a load associated with the request and whether the node has any other parent node options. The requesting node may then receive a response from the parent node that is either an acceptance or a denial. While the node may join the parent node in response to an acceptance, if a denial is received, the node may divide the load into first and second portions, and may re-request to join the parent node with the load of the first portion. In this manner, by partitioning the load, a load balancing mode of operation across multiple is parents in a DAG is provided.

Abstract: In an example embodiment, an apparatus comprising an interface configured to communicate with at least one wireless transceiver, and a controller coupled to the interface. The controller is configured to determine a predefined characteristic such as current load and/or interference for a wireless channel associated with the at least one wireless transceiver. The controller is operable to suppress sending a probe response in response to the at least one wireless transceiver receiving a probe request, wherein how often probe responses are suppressed is based on the predefined characteristic for the wireless channel.

Abstract: A method of rate shifting specially suited for the voice traffic, which differentiates poor channel conditions from a heavily loaded channel of a WLAN and adapts to the network traffic condition and channel condition promptly with low rate of false shifting. Determining when to rate shift is based on a combination of the received signal strength indication and the retry rate.

Abstract: A method of rate shifting specially suited for the voice traffic, which differentiates poor channel conditions from a heavily loaded channel of a WLAN and adapts to the network traffic condition and channel condition promptly with low rate of false shifting. Determining when to rate shift is based on a combination of the received signal strength indication and the retry rate.

Abstract: A method for evaluating number of additional admissible calls for use in call admission control includes tracking a percentage of channel busy time and transmission time of downlink and uplink voice packets, receiving a call admission request, and calculating the number of admissible calls. The number of admissible calls is calculated based on a channel bandwidth requirement determined from the percentage of channel busy time and a voice packet queuing requirement determined from the transmission time of downlink and uplink voice packets. The call admission request is approved if the number of admissible calls is greater than one and rejected if the number of admissible calls is less than one.