Optimal path routing method in wireless network

• US 20080205355A1
• Filed: 05/10/2006
• Published: 08/28/2008
• Est. Priority Date: 05/10/2005
• Status: Active Grant

• Current Assignee: City University of New York, Samsung Electronics Co. Ltd.
• Original Assignee: City University of New York, Samsung Electronics Co. Ltd.
• Inventors: Liu, Yong, Lee, Myung-jong
• Granted Patent: US 7,899,053 B2
• Time in Patent Office: Days
• US Class Current: 370/338
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/42 Centralised routing
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/34 Modification of an existing route

Abstract

An optimal path routing method is provided for transmitting data from a source node to a destination node. The optimal path setting method includes transmitting a shortcut request (SCRQ) message from the source node to a topology server; determining shortcut information at the topology server based on the SCRQ message; and transmitting a shortcut notification (SCNF) message containing the shortcut information from the topology server to the destination node.

Claims

1. An optimal path setting method for transmitting data from a source node to a destination node, the optimal path setting method comprising:

transmitting a shortcut request (SCRQ) message from the source node to a topology server;

determining shortcut information at the topology server based on the SCRQ message; and

transmitting a shortcut notification (SCNF) message containing the shortcut information from the topology server to the destination node.

2. The optimal path setting method of claim 1, further comprising:

transmitting a shortcut response (SCRP) message from the destination node to a neighboring node on a shortcut path, the SCRP message generated based on the shortcut information contained in the SCNF message; and

setting an optimal path between the source node via the neighboring node on the shortcut path and the destination node in accordance with the SCRP message.

3. The optimal path setting method of claim 2, wherein the SCRP message comprises an media access control (MAC) header, a network header and a network payload.

4. The optimal path setting method of claim 3, wherein the MAC header comprises a receiver MAC address and a sender MAC address, the network header comprises a source network address and a destination network address, and the network payload comprises and a plurality of relay network addresses.

5. The optimal path setting method of claim 1, wherein the topology server determines the shortcut information corresponding to the optimal path transmissible in a shortest distance from the source node to the destination node, based on addresses of lower nodes connected to the topology server.

6. The optimal path setting method of claim 5, wherein the topology server stores, in an information table, node information containing network addresses of the lower nodes connected thereto and media access control (MAC) addresses.

7. The optimal path setting method of claim 1, wherein the SCRQ message comprises a media access control (MAC) header, a network header, and a network payload.

8. The optimal path setting method of claim 7, wherein the MAC header comprises a receiver MAC address and a sender MAC address, the network header comprises a PC network address, a source network address and a source MAC address, and the network payload comprises a destination network address and a destination MAC address.

9. The optimal path setting method of claim 1, wherein the SCNF message comprises an MAC header, a network header and a network payload.

10. The optimal path setting method of claim 9, wherein the MAC header comprises a receiver MAC address and a sender MAC address, the network header comprises a destination network address, a destination MAC address, a PC network address and a PC MAC address, and the network payload comprises a source network address, a source MAC address, and a plurality of relay network addresses.

11. The optimal path setting method of claim 1, wherein the SCRQ message and the SCNF message are in a command form.

12. The optimal path setting method of claim 1, wherein the determining the shortcut information comprises generating at the topology server shortcut information on a shortest path of nodes in a server coverage area (SCA) area of the topology server if the source node and the destination node are located in an area other than the SCA area.

13. The optimal path setting method of claim 1, wherein if the topology server is in error, a neighboring node of the topology server replaces the topology server and receives the SCRQ message.

14. The optimal path setting method of claim 13, wherein the neighboring node of the topology server determines the shortcut information based on the SCRQ message, and transmits the SCNF message containing the shortcut information to the destination node via the neighboring node thereof.

15. The optimal path setting method of claim 13, wherein a neighboring node of the neighboring node replacing the topology server, operates as a backup server with respect to the neighboring node.

16. A topology server comprising a processor that determines an optimal path for transmitting data from a source node to a destination node based on a shortcut request message from the source node;

the optimal path being a shortest transmissible distance from the source node to the destination node based on addresses of lower nodes connected to the topology server.

17. A wireless network comprising:

a plurality of nodes each comprising a source node, a destination node, and a server, the server including a processor that determines an optimal path for a transmission between the source node and the destination node based on a shortcut request message from a source node;

the optimal path being a shortest transmissible distance from the source node to the destination node based on addresses of lower nodes connected to the server.