ENHANCED WIRELESS AD HOC COMMUNICATION TECHNIQUES
First Claim
1. A method for wireless communication within a wireless ad hoc network, the method comprising:
- identifying criteria and weightings for a multivariate route cost calculation for each of a plurality of traffic types;
identifying possible routes to each destination within a backhaul access point routing domain;
applying the multivariate route cost calculation to determine a lowest-cost route to each destination within the backhaul access point routing domain for each one of the plurality of traffic types thereby providing routing data;
storing the routing data in a routing matrix accessible by traffic type and destination;
identifying a transmit traffic type and a transmit destination for data in a transmit queue;
looking up the lowest-cost route to the transmit destination for the transmit traffic type in the routing matrix; and
transmitting the data to the transmit destination according to the lowest-cost route.
2 Assignments
0 Petitions
Accused Products
Abstract
Enhancements are disclosed for wireless ad hoc networking including optimized wireless routing, multicast routing, quick network entry, use of contention domains and node weighting for improved time slot scheduling, and the like. Quality of service may be supported at each node and within scheduling algorithms across a group of nodes in order to provide a number of service levels to network users according to traffic type or the like. These and other enhancements may be used individually or in combination to improve operation of a wireless ad hoc network and support scalability, routing, traffic management, quality of service delivery, and other features.
158 Citations
21 Claims
-
1. A method for wireless communication within a wireless ad hoc network, the method comprising:
-
identifying criteria and weightings for a multivariate route cost calculation for each of a plurality of traffic types; identifying possible routes to each destination within a backhaul access point routing domain; applying the multivariate route cost calculation to determine a lowest-cost route to each destination within the backhaul access point routing domain for each one of the plurality of traffic types thereby providing routing data; storing the routing data in a routing matrix accessible by traffic type and destination; identifying a transmit traffic type and a transmit destination for data in a transmit queue; looking up the lowest-cost route to the transmit destination for the transmit traffic type in the routing matrix; and transmitting the data to the transmit destination according to the lowest-cost route. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A node in a wireless ad hoc network comprising:
-
a data source; a radio for operating within the wireless ad hoc network; a memory for storing routing information; and a processor programmed to identify criteria and weightings for a multivariate route cost calculation for each of a plurality of traffic types;
identify possible routes to each destination within a backhaul access point routing domain;
apply the multivariate route cost calculation to determine a lowest-cost route to each destination within the backhaul access point routing domain for each one of the plurality of traffic types thereby providing routing data;
store the routing data in a routing matrix accessible by traffic type and destination;
identify a transmit traffic type and a transmit destination for data in a transmit queue;
look up the lowest-cost route to the transmit destination for the transmit traffic type in the routing matrix; and
transmit the data to the transmit destination according to the lowest-cost route. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21-124. -124. (canceled)
Specification