Abstract: Presented herein are techniques for using uplink transmissions from devices (e.g., wireless tags, clients, etc.) to determine a path loss between neighboring access points. In one example, a wireless controller obtains receive signal strength information of uplink transmissions received at neighboring access points in a wireless network. The wireless controller determines an effective path loss between the neighboring access points based on the receive signal strength information for the uplink transmissions received at the neighboring access points. The wireless controller also performs radio resource management operations in the wireless network using the effective path loss determined based on the uplink transmissions received at the neighboring access points.

Abstract: Presented herein are techniques for using uplink transmissions from devices (e.g., wireless tags, clients, etc.) to determine a path loss between neighboring access points. In one example, a wireless controller obtains receive signal strength information of uplink transmissions received at neighboring access points in a wireless network. The wireless controller determines an effective path loss between the neighboring access points based on the receive signal strength information for the uplink transmissions received at the neighboring access points. The wireless controller also performs radio resource management operations in the wireless network using the effective path loss determined based on the uplink transmissions received at the neighboring access points.

Abstract: In an example embodiment, an access point (AP) uses out-of-band signaling on a single non-DFS (Dynamic Frequency Selection) frequency band radio in an N-radio system to synchronize information with neighboring APs and to learn about their radio interfaces. This enables the AP to be able to acquire information about neighbor APs on different frequency bands and to build and maintain mesh routing structures while minimizing backhaul down-time.

Abstract: A mesh tree formation system. In particular implementations, a method includes responsive to a selection of a channel potentially bearing a higher priority use, entering a silent state and initiating a channel scan of the selected channel for a period of time. The method also includes, responsive to receipt of an enabling signal, entering a limited transmission state that enables transmission of wireless frames on the selected channel. The method also includes, responsive to termination of the period of time of the channel scan wherein no higher priority use is detected, entering a full transmission state comprising transmission of enabling signals corresponding to the selected channel.

Abstract: In an example embodiment, a beacon is sent on all available interfaces of a device comprising data indicating the operating parameters of all interfaces of the device. A beacon containing data about the configuration of a first interface and a second interface is sent on both the first interface and the second interface. The beacon may suitably comprise data indicating the protocol, channel, and spanning trees for the interface. If communication on the primary interface becomes unavailable, the data in the beacons can be used to facilitate switching communication to the secondary interface.

Abstract: A coordinated channel change system. In particular implementations, a method includes receiving a prepare-to-change message, wherein the prepare-to-change message indicates instructions to prepare to change channels and includes a designated channel, and forwarding the prepare-to-change message to one or more child nodes. The method also includes receiving a ready-to-change message from the one or more child nodes, and transmitting a change-to-channel message to the one or more child nodes, wherein the change-to-channel message indicates instructions to switch to the designated channel. The method also includes receiving an acknowledgement message from the one or more child nodes, and changing to the designated channel.

Abstract: In an example embodiment, an access point (AP) uses out-of-band signaling on a single non-DFS (Dynamic Frequency Selection) frequency band radio in an N-radio system to synchronize information with neighboring APs and to learn about their radio interfaces. This enables the AP to be able to acquire information about neighbor APs on different frequency bands and to build and maintain mesh routing structures while minimizing backhaul down-time.

Abstract: In an example embodiment, a beacon is sent on all available interfaces of a device comprising data indicating the operating parameters of all interfaces of the device. A beacon containing data about the configuration of a first interface and a second interface is sent on both the first interface and the second interface. The beacon may suitably comprise data indicating the protocol, channel, and spanning trees for the interface. If communication on the primary interface becomes unavailable, the data in the beacons can be used to facilitate switching communication to the secondary interface.

Abstract: A coordinated channel change system. In particular implementations, a method includes receiving a prepare-to-change message, wherein the prepare-to-change message indicates instructions to prepare to change channels and includes a designated channel, and forwarding the prepare-to-change message to one or more child nodes. The method also includes receiving a ready-to-change message from the one or more child nodes, and transmitting a change-to-channel message to the one or more child nodes, wherein the change-to-channel message indicates instructions to switch to the designated channel. The method also includes receiving an acknowledgement message from the one or more child nodes, and changing to the designated channel.

Abstract: An address of a server that should supply an information object or service to a requester is returned in response to a request therefor. The address of the server that is returned is an optimal server selected according to specified performance metrics. The specified performance metrics may include one or more of an average delay from the server to another, average processing delays at the server, reliability of a path from the server to another, available bandwidth in said path, and loads on the server.

Abstract: A mesh tree formation system. In particular implementations, a method includes responsive to a selection of a channel potentially bearing a higher priority use, entering a silent state and initiating a channel scan of the selected channel for a period of time. The method also includes, responsive to receipt of an enabling signal, entering a limited transmission state that enables transmission of wireless frames on the selected channel. The method also includes, responsive to termination of the period of time of the channel scan wherein no higher priority use is detected, entering a full transmission state comprising transmission of enabling signals corresponding to the selected channel.

Abstract: A method is described for distance vector routing of on-demand traffic between routers within an ad-hoc network maintaining multiple loop-free paths to destinations. Each router maintains routing table entries only for destinations associated with data flows through the router which reduce the amount of storage space and bandwidth required for routing table maintenance. Diffusing computations are utilized for establishing and maintaining the routes within the network. The sending of unnecessary flood searches and search-to-infinity problems are avoided, while the protocol decreases the vulnerability of the network to various service attacks along with router failures, fading, and drop outs.

Abstract: A bandwidth efficient routing protocol for wireless ad-hoc networks. This protocol can be used in ad-hoc networks because it considerably reduces control overhead, thus increasing available bandwidth and conserving power at mobile stations. It also gives very good results in terms of the throughput seen by the user. The protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid. The paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.

Abstract: An address of a server that should supply an information object or service to a requester is returned in response to a request therefor. The address of the server that is returned is an optimal server selected according to specified performance metrics. The specified performance metrics may include one or more of an average delay from the server to another, average processing delays at the server, reliability of a path from the server to another, available bandwidth in said path, and loads on the server.

Abstract: A method is described for distance vector routing of on-demand traffic between routers within an ad-hoc network maintaining multiple loop-free paths to destinations. Each router maintains routing table entries only for destinations associated with data flows through the router which reduce the amount of storage space and bandwidth required for routing table maintenance. Diffusing computations are utilized for establishing and maintaining the routes within the network. The sending of unnecessary flood searches and search-to-infinity problems are avoided, while the protocol decreases the vulnerability of the network to various service attacks along with router failures, fading, and drop outs.

Abstract: An efficient routing method (i.e., protocol) for use with wireless ad-hoc networks, referred to as “dynamic source tracing” or DST routing, that considerably reduces control overhead and thereby increases the available bandwidth while conserving power at the mobile stations. DST routing also provides high user throughput and can operate efficiently in a variety of traffic situations. DST employs a source-tracing algorithm that provides loop checking of complete paths prior to an entry being made into the routing table. In addition, DST makes use of information about the length and second-to-last hop (predecessor) of the shortest path to all known destinations, thus eliminating the counting to infinity problem, such as exhibited by the distributed Bellman-Ford protocol.

Abstract: A bandwidth efficient routing protocol for wireless ad-hoc networks. This protocol can be used in ad-hoc networks because it considerably reduces control overhead, thus increasing available bandwidth and conserving power at mobile stations. It also gives very good results in terms of the throughput seen by the user. The protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid. The paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.