Route optimization using star-mesh hybrid topology in localized dense ad-hoc networks
First Claim
Patent Images
1. A method, comprising:
- receiving a packet at a first network device in a network;
determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table;
routing the packet to the neighbor network device using the optimal route; and
maintaining the SRT, wherein maintaining the SRT comprises;
determining whether a route in the SRT is one-hop optimized;
when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route;
when sending a test packet fails, canceling a maintaining process for the route; and
when sending a test packet succeeds, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route.
2 Assignments
0 Petitions
Accused Products
Abstract
Optimized routing in localized dense networks is provided. A packet is received at a first network device in a network. An optimal route for the packet to a neighbor network device in the network is determined using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table, and wherein the optimized routing table comprises a list of neighbor network devices that the first network device can route to directly and wherein the standard routing table comprises a ZigBee source routing table. The packet is routed using the optimal route.
100 Citations
15 Claims
-
1. A method, comprising:
-
receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT), wherein the SRT includes an optimized routing table and a standard routing table; routing the packet to the neighbor network device using the optimal route; and maintaining the SRT, wherein maintaining the SRT comprises; determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet succeeds, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer program product, stored on a non-transitory computer readable medium, including instructions of optimized routing in localized dense networks that, when executed on a processor in communication with the non-transitory computer readable medium, cause the processor to perform operations of:
-
receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; routing the packet using the optimal route; and maintaining the SRT, by; determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A network device comprising:
-
a memory; a processor; a communications interface; and an interconnection mechanism coupling the memory, the processor, and the communications interface; wherein the memory is encoded with an application to optimize routing in localized dense networks, that when performed on the processor, provides a process to optimize routing in localized dense networks, the process causing the network device to perform operations of; receiving a packet at a first network device in a network; determining an optimal route for the packet to a neighbor network device in the network using a Source Routing Table (SRT) wherein the SRT includes an optimized routing table and a standard routing table; routing the packet to the neighbor network device using the optimal route; and maintaining the SRT, wherein maintaining the SRT comprises; determining whether a route in the SRT is one-hop optimized; when the route is determined not to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops using a one-hop optimized route; when sending a test packet fails, canceling a maintaining process for the route; and when sending a test packet is successful, resending the test packet directly to the neighbor network device with no intermediary hops a predetermined number of times at predetermined intervals, such that if the resending is successful each time, routing all future non-test packets to the neighbor network device using the one-hop optimized route. - View Dependent Claims (12, 13, 14, 15)
-
Specification