ROUTE OPTIMIZATION USING STAR-MESH HYBRID TOPOLOGY IN LOCALIZED DENSE AD-HOC NETWORKS

• US 20170093716A1
• Filed: 03/02/2016
• Published: 03/30/2017
• Est. Priority Date: 09/25/2015
• Status: Active Grant

• Current Assignee: Digital Lumens, Inc. (Ams-Osram AG)
• Original Assignee: OSRAM Sylvania Inc. (Ams-Osram AG)
• Inventors: Ko, David, O'Hagan, Liam, Tolisano, Leo, Warner, Stefan
• Granted Patent: US 10,230,634 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering
• CPC Class Codes: H04W 4/80 Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

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.

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; and

routing the packet to the neighbor network device using the optimal route.

2. The method of claim 1, wherein determining comprises:

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, 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.

3. The method of claim 1, further comprising maintaining the SRT.

4. The method of claim 3, 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.

5. The method of claim 3, wherein maintaining the SRT comprises:

determining whether a route in the SRT is one-hop optimized;

when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops;

when sending a test packet succeeds, canceling a maintaining process for the route; and

when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

6. The method of claim 3, wherein maintaining the SRT comprises:

determining whether a route to or from a concentrator in the SRT is one-hop optimized;

when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good;

when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval;

when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops;

when sending a test packet is not successful, canceling a maintaining process for the route; and

when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.

7. The method of claim 6, wherein when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator;

when sending a test packet succeeds, canceling a maintaining process for the route;

when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and

when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.

8. 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; and

routing the packet using the optimal route.

9. The computer program product of claim 8, wherein the instructions cause the processor to perform further operations of:

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, 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.

10. The computer program product of claim 8, wherein the instructions cause the processor to perform further operations of:

maintaining the SRT.

11. The computer program product of claim 10, wherein the instructions for maintaining the SRT cause the processor to perform further operations of:

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.

12. The computer program product of claim 10, wherein the instructions for maintaining the SRT cause the processor to perform further operations of:

determining whether a route in the SRT is one-hop optimized;

when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops;

when sending a test packet succeeds, canceling a maintaining process for the route; and

when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

13. The computer program product of claim 10, wherein the instructions for maintaining the SRT cause the processor to perform further operations of:

determining whether a route to or from a concentrator in the SRT is one-hop optimized;

when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good;

when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval;

when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops;

when sending a test packet is not successful, canceling a maintaining process for the route; and

when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.

14. The computer program product of claim 13, wherein the instructions cause the processor to perform further operations of:

when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator;

when sending a test packet succeeds, canceling a maintaining process for the route;

when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and

when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.

15. 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; and

routing the packet to the neighbor network device using the optimal route.

16. The network device of claim 15, 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.

17. The network device of claim 15, further comprising operations of maintaining the SRT.

18. The network device of claim 17, 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.

19. The network device of claim 17, wherein maintaining the SRT comprises:

determining whether a route in the SRT is one-hop optimized;

when the route is determined to be one-hop optimized, sending a test packet directly to the neighbor network device with no intermediary hops;

when sending a test packet succeeds, canceling a maintaining process for the route; and

when sending a test packet is not successful, setting the route as not one-hop optimized and routing all future non-test packets to the neighbor network device using the standard routing table of the SRT.

20. The network device of claim 17, wherein maintaining the SRT comprises:

determining whether a route to or from a concentrator in the SRT is one-hop optimized;

when the route is determined not to be one-hop optimized, determining whether the concentrator is in a neighbor table and whether a link quality of a link to the concentrator is good;

when the concentrator is either not in a neighbor table or a link quality is not good, repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval;

when the concentrator is either in a neighbor table or a link quality is good, sending a test packet directly to the concentrator with no intermediary hops;

when sending a test packet is not successful, canceling a maintaining process for the route; and

when sending a test packet is successful, sending again a predetermined number of times, and if all are successful, setting the route as one-hop optimized and routing all future non-test packets to the concentrator using the one-hop optimized routing table of the SRT.

21. The network device of claim 20, further comprising operations of:

when the route is determined to be one-hop optimized, and wherein a link quality is good, sending a predetermined number of test packets to or from the concentrator;

when sending a test packet succeeds, canceling a maintaining process for the route;

when sending a test packet is not successful, then setting the route as not one-hop optimized and routing all future non-test packets to or from the concentrator using the standard routing table of the SRT; and

when the route is determined to be one-hop optimized and a link quality is not good, then repeating determining whether a route to or from a concentrator in the SRT is one-hop optimized after a predetermined time interval.