Abstract:
The proposed multicast architecture for multi-hop wireless mesh networks enables the mesh networks to join the global multicast group seamlessly, and extend the multicast support to any routable or non-routable devices in the wireless mesh networks. A communications network comprising a plurality of wireless devices (WRD), at least one Internet access point (LAP), and at least one Internet edge router. The Internet access point acts as a proxy device for wireless devices that are using the Internet access point to access a global Internet, wherein the Internet access point runs a group management protocol with a Internet edge router to register multicast groups for devices associated with the Internet access point (220), and wherein the Internet edge router runs a wired multicast routing protocol to join the Internet edge router to a global Internet multicast group (210).
Abstract:
A method for controlling packet transmission power by a node in a wireless communication network, the method comprising: determining respective values for a number of sample data rates collected; determining a target data rate, wherein the target data rate is a weighted average of the respective values; and adjusting packet transmission power based on a result of a comparison of an average data rate in current traffic and channel conditions to the target data rate.
Abstract:
A method for routing data packets from a source to a destination in a wireless communication network comprising a plurality of nodes, wherein each node is in uplink-downlink association with at least one neighboring node, and wherein each node comprises a registration table identifying all downlink nodes that are associated with the node, the method comprising: sending an Open Stream message from a source node which specifies a destination node; and receiving the Open Stream message at the uplink node of the source node, wherein the uplink node relays the Open Stream message to the destination node if the destination node is registered in the registration table of the uplink node.
Abstract:
A system and method for creating a spectrum agile wireless multi-hopping network, such as a wireless ad-hoc peer-to-peer multi-hopping network. The spectrum agile multi-hopping network that can respond to conditions affecting spectrum, such as FCC rulings or business related agreements on spectrum licensing related to a location or other measurable parameters of the network.
Abstract:
A system and method for supporting multicast in highly dynamic wireless multi-hop networks, such as ad-hoc networks, with good scalability. The system and method provide a multicast routing algorithm to work in wireless ad-hoc networks without any fixed infrastructure nodes present. In doing so, the system and method provide a technique to build a multicast source specific tree on demand, while using a core source node to limit routing overhead. The system and method further provide a repair process to reduce the latency of discovery of topology change, employ a node sequence number mechanism to differentiate between upstream nodes and downstream nodes on the multicast tree in the repair process, and provide an active joining process to reduce the latency of discovery of membership change.
Abstract:
A system and method for determining the mobility of a node (102) in a wireless communication network (102). The system and method determine the distance between the node (102) and at least one stationary neighboring node (102, 106, 107) at at least two or more time points, using at least two moving average filters, to arrive at two distance values. The system and method then determine the relative velocity based on the at least two distance values, and thus determine whether the node (102) is mobile.
Abstract:
A system and method for dynamic frequency selection at one or more access points APs (106) in a multihop wireless network (100). The system and method maintain at the APs (106) a table comprising end-to-end network channel information that is indicative of the degree of channel performance in the network (100). The APs (106) are capable of dynamically selecting frequencies in response to the network channel information in the table.
Abstract:
A system and method for decreasing the route convergence time in a wireless communication network, such as a wireless ad-hoc peer-to-peer network, by finding an alternate route if the nodes anticipate weakening or breakage of a route currently in use. The system and method which enables reactive routing protocols to find optimal routes between nodes in these types of networks when those routes cannot otherwise be found in certain conditions. The system and method thus decrease the route convergence time, provide an effective and efficient way to find optimal routes, and improve overall performance of the network with regard to throughput, delay, packet completion rate and other factors.
Abstract:
A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408). The meshed nodes (106, 402) which are capable of performing packet routing act as proxy nodes for their associated non-meshed nodes (STA 13 - STA 15) to route packets from their associated non-meshed nodes (STA 13 -STA 15) to destination nodes. Some of the meshed nodes further operate as intelligent access points (106) to provide the non-meshed nodes and other meshed nodes with access to other networks, such as the Internet (402).
Abstract:
The present invention provides a bandwidth efficient system and method of measuring the range between nodes (102, 106, 107) in a wireless communications network (100) with one-way data transfer, where each node (102, 106, 107) periodically transmits a message that contains information regarding neighboring nodes (102, 106, 107) from which any prior messages have been received by the transmitting node (102, 106, 107). A node (102, 106, 107) receives the messages transmitted from neighboring nodes (102, 106, 107) in the network (100), and records the times of arrival of the received messages. The node (102, 106, 107) receiving those messages can thus determine the respective distances between itself and the neighboring nodes (102, 106, 107) based on the respective time of arrivals of the received messages and the respective information included in the respective messages.