Method for power saving routing in wireless networks

• US 7,020,469 B2
• Filed: 09/22/2003
• Issued: 03/28/2006
• Est. Priority Date: 05/12/2003
• Status: Active Grant

• Current Assignee: Ajou University Industry Cooperation Foundation
• Original Assignee: Daewoo Educational Foundation
• Inventors: Choi, Jong Mu, Kim, Jai Hoon, Ko, Young Bae
• Primary Examiner(s): Trinh, Sonny
• Assistant Examiner(s): LAM, DUNG LE
• Application Number:
  US10/667,733
• Publication Number:
  US 20040229622A1
• Time in Patent Office: 918 Days
• Field of Search: 455/455, 455/574, 455/343.1, 455/343.2, 455/343.3, 455/343.4, 455/343.5, 455/343.6, 370/338, 370/311, 370/216, 370/236
• US Class Current: 455/445
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management
• CPC Class Codes: Y02D 30/00 Reducing energy consumption in communication networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A method for power saving routing in wireless networks is disclosed. The present invention calculates a distance to a destination node to select and estimate candidate nodes so as to reduce the amount of calculations in the event of routing. Furthermore, the invention repeats the algorithm by optimum value n so that accessibility to the destination node can be obtained. This enables more efficient routing.

Claims

1. A method for power saving routing between a source node and a destination node in wireless networks, comprising:

(a) a first step of setting an optimal integer value n for reducing power consumed between the source node and the destination node;

(b) a second step of setting n−

1 concentric circles that have the destination node as their center and dividing a distance d between the source node and the destination node by n;

(c) a third step of setting a current execution node to the source node;

(d) a fourth step wherein said current execution node selects nodes located within a predetermined distance from the circle that is closest to the current execution node in the direction of the destination node as candidate nodes, and selects a node for which power consumed between the node and the current execution node is minimum from the candidate nodes as an intermediate node; and

(e) a fifth step of setting the current execution node as the selected intermediate node until routing between the source node and the destination node is finished and returning to the fourth step.

2. The method as claimed in claim 1, wherein the predetermined distance is:

$\frac{d}{n}-\frac{d}{2<br><br>n}<br><br><br><br>\mathrm{to}<br><br><br><br>\frac{d}{n}+\frac{d}{2<br><br>n}.$

3. The method as claimed in claim 1, wherein the fourth step ignores the selected intermediate node when the selected intermediate node satisfies the condition, $u$

(r)+u⁡

(dn)>

u⁡

(2⁢

dn)

(r is a distance between the current execution node and the selected intermediate node, u(x) is power consumption between two nodes having a distance x between them), and selects the intermediate node again for the second closest circle in the direction of the destination node.

4. The method as claimed in claim 2, wherein the fourth step ignores the selected intermediate node when the selected intermediate node satisfies the condition, $u$

(r)+u⁡

(dn)>

u⁡

(2⁢

dn)

(r is a distance between the current execution node and the selected intermediate node, u(x) is power consumption between two nodes having a distance x between them), and selects the intermediate node again for the second closest circle in the direction of the destination node.

5. The method as claimed in claim 1, wherein the fourth step finds a neighboring node for which u(r)+v(s) (r is a distance between the current execution node and an arbitrary neighboring node, s is a distance between the current execution node and the destination node, and v(x) is minimum power consumption expected between two nodes having a distance x between them) has a minimum value, and then repeatedly performs the first to fifth steps, having the neighboring node as the source node, when there is no candidate node.

6. The method as claimed in claim 2, wherein the fourth step finds a neighboring node for which u(r)+v(s) (r is a distance between the current execution node and an arbitrary neighboring node, s is a distance between the current execution node and the destination node, and v(x) is minimum power consumption expected between two nodes having a distance x between them) has a minimum value, and then repeatedly performs the first to fifth steps, having the neighboring node as the source node, when there is no candidate node.