System and method for determining data transmission path in communication system consisting of nodes

• US 20050159111A1
• Filed: 12/29/2004
• Published: 07/21/2005
• Est. Priority Date: 01/06/2004
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Lee, Sang-su, Kim, Ji-tae, Park, No-sung, Kim, Dae-young
• Granted Patent: US 7,656,829 B2
• Time in Patent Office: Days
• US Class Current: 455/67.140
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 40/08 based on transmission power
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 52/283 Power depending on the position of the mobile
• CPC Class Codes: H04W 52/46 in multi hop networks, e.g. wireless relay networks
• CPC Class Codes: Y02D 30/00 Reducing energy consumption in communication networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

In a communicating system including a base node, at least one adjacent node, and a start node transmitting data requested by the base node via the adjacent node or to the base node, data requested to the start node is transmitted by measuring a power required for data transmission between the nodes forming the communication system, selecting a path one by one depending on a minimum power consumption required for the data transmission from the base node to the start node using the measured power, and transmitting the requested data using the selected path.

Claims

1. In a communicating system comprising a base node, at least one adjacent node, and a start node transmitting data requested by the base node via the adjacent node or to the base node, a method for transmitting data requested to the start node comprising:

measuring a power required for data transmission between the nodes forming the communication system;

selecting a path depending on a minimum power consumption required for the data transmission from the base node to the start node using the measured power, and

transmitting the requested data using the selected path.

2. The method of claim 1, wherein the start node stores paths capable of transmitting the requested data, a power consumption in transmitting the data along the paths, and an information on a number of adjacent nodes relaying the data.

3. The method of claim 2, wherein the requested data is transmitted using the path having the smallest number of the relaying adjacent nodes when a prompt transmission of the data is required.

4. The method of claim 2, wherein the start node is notified of an information on a remaining energy from the adjacent nodes.

5. The method of claim 4, wherein the requested data is transmitted using another path when the remaining energy of the relaying adjacent nodes is less than a threshold.

6. The method of claim 5, wherein the requested data is transmitted using a path comprising adjacent nodes having the remaining energy greater than the threshold.

7. The method of claim 2, wherein the start node deletes an information on a node incapable of relaying the data.

8. The method of claim 1, wherein an adjacent node of which a location is changed notifies the other nodes of the communication system of an information on the location change.

9. The method of claim 8, wherein paths capable of transmitting the requested data, the power consumption in transmitting the data along the paths, and the information on the number of relaying adjacent nodes are updated based on the changed location information.

10. The method of claim 1, wherein the path is selected one hop at a time.

11. In a communicating system comprising a base node, at least one adjacent node, a start node transmitting data requested by the base node via the adjacent node or to the base node, a system for transmitting data requested to the start node comprising:

the base node; and

the start node selecting a path depending on a minimum power consumption required for the data transmission from the base node using a measured power consumption of each node, and transmitting the requested data using the selected path.

12. The system of claim 11, wherein the start node stores paths capable of transmitting the requested data, a power consumption in transmitting the data along the paths, and an information on a number of adjacent nodes relaying the data.

13. The system of claim 12, wherein the start node transmits the requested data using the path having the smallest number of the relaying adjacent nodes when a prompt transmission of the data is required.

14. The system of claim 12, wherein the start node is notified of an information on a remaining energy from the adjacent nodes.

15. The system of claim 14, wherein the start node traits the requested data using another path when the remaining energy of the relaying adjacent nodes is less than a threshold.

16. The system of claim 15, wherein the threshold is an average of the remaining energy of the nodes capable of relaying the data.

17. The system of claim 15, wherein the start node transmits the requested data using a path comprising adjacent nodes having the remaining energy greater than the threshold.

18. The system of claim 12, wherein the start node deletes an information on an adjacent node incapable of relaying the data.

19. The system of claim 11, wherein an adjacent node of which a location is changed notifies the other nodes of the communication system of an information on the location change.

20. The system of claim 19, wherein the start node updates paths capable of transmitting the requested data, the power consumption in transmitting the data along the paths, and the information on the number of relaying adjacent nodes based on the changed location information.

21. The system of claim 11, wherein the path is selected one hop at a time.