Method for managing neighbor nodes and setting a routing path in a mobile ad-hoc network environment and network apparatus using the same

• US 20060126514A1
• Filed: 12/02/2005
• Published: 06/15/2006
• Est. Priority Date: 12/11/2004
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Mun, Byung-in, Lee, Keun-jae, Cho, Song-yean
• Granted Patent: US 7,349,370 B2
• Time in Patent Office: Days
• US Class Current: 370/238
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/34 Signalling channels for network management communication
• CPC Class Codes: H04L 43/0811 by checking connectivity
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/30 for proactive routing

Abstract

A method and network apparatus for setting a routing path and managing a neighbor node in mobile ad hoc, network environment are provided. The method for setting a routing path in mobile ad hoc network environment includes receiving a packet periodically broadcast from a neighbor node, measuring the quality of a link with the neighbor node through the received packet, calculating routing paths using the routing information of the neighbor node when the measured link quality is higher than a first threshold value, and selecting the shortest routing path to a destination node, among the calculated routing paths, as a path for packet transmission.

Claims

1. A method for setting a routing path in a mobile ad hoc network environment, comprising:

receiving a packet, which is periodically broadcast from a neighbor node;

measuring quality of a link with the neighbor node through the received packet;

calculating routing paths, using routing information of the neighbor node when the measured link quality is higher than a first threshold value; and

setting a shortest routing path to a destination node, among the calculated routing paths, as a path for data packet transmission.

2. The method of claim 1, wherein the packet comprises the routing information of the neighbor node.

3. The method of claim 1, wherein the link quality is a SNR value based on a signal strength of the received packet.

4. The method of claim 1, further comprising;

re-measuring the link quality of the neighbor node through a received packet when the packet that is periodically broadcast from the neighbor node is re-received;

calculating routing paths using routing information of the neighbor node when the re-measured link quality is higher than a second threshold value; and

setting the shortest routing path to a destination node as the path for data packet transmission, among the routing paths calculated using routing information of the neighbor node when the re-measured link quality is higher than the second threshold value.

5. The method of claim 4, wherein the first threshold value is higher than the second threshold value.

6. A method for managing a neighbor node in a mobile ad hoc network environment, comprising:

receiving a packet that is periodically broadcast from a neighbor node;

measuring quality of a link with the neighbor node through the received packet; and

managing the neighbor node in a first node group or a second node group according to the measured link quality.

7. The method of claim 6, wherein the packet comprises routing information of the neighbor node.

8. The method of claim 6, wherein the link quality is a SNR value based on a signal strength of the received packet.

9. The method of claim 6, wherein managing the neighbor node comprises:

searching for the neighbor node in the first node group;

comparing the measured link quality with a first threshold value when the neighbor node is not found during the search;

classifying the neighbor node into the first node group when the link quality is higher than the first threshold value; and

classifying the neighbor node into the second node group when the link quality is lower than the first threshold value.

10. The method of claim 9 further comprising:

comparing the measured link quality with a second threshold value when, as a result of searching, the neighbor node is found in the first node group;

maintaining the neighbor node in the first node group when the link quality is found to be higher than the second threshold value; and

classifying the neighbor node into the second node group when, as a result of the comparison with the second threshold value, the link quality is found to be lower than the second threshold value.

11. The method of claim 7, wherein the routing information of the neighbor node managed in the first node group is used in calculating a routing path.

12. The method of claim 6, further comprising deleting the neighbor node from the first node group or the second node group when a packet is not received from the neighbor node managed by the first node group or the second node group during a certain time period.

13. A network apparatus comprising:

a transceiving unit which is configured to receive a packet periodically broadcast from a neighbor node;

a measuring unit which is configured to measure quality of a link with the neighbor node using the packet received through the transceiving unit;

a comparison unit which is configured to compare the measured link quality with a first threshold value; and

a routing unit which calculates routing paths using routing information of the neighbor node when, as a result of the comparison by the comparison unit, the link quality is found to be higher than the first threshold value, and sets a shortest routing path to a destination node, among the calculated routing paths, as a path for data packet transmission.

14. The apparatus of claim 13, wherein the packet includes the routing information of the neighbor node.

15. The apparatus of claim 13, wherein the link quality is a SNR value based on a signal strength of the received packet;

16. The apparatus of claim 13, w,herein, when the transceiving unit re-receives a packet periodically broadcast from the neighbor node, the measuring unit re-measures the quality of a link with the neighbor node, using the re-received packet, and the comparison unit compares the re-measured link quality with a second threshold value, and the routing unit sets a shortest routing path to a destination node as a path for data packet transmission, among the routing paths calculated using the routing information of the neighbor node whose re-measured link quality is higher than the second threshold value when, as a result of comparison by the comparison unit, the link quality is found to be higher than the second threshold value.

17. The apparatus of claim 16, wherein the first threshold value is higher than the second threshold value.

18. A network apparatus comprising:

a transceiving unit which is configured to receive a packet periodically broadcast from a neighboring node;

a measuring unit which is configured to measure quality of a link with the neighbor node based on the received packet; and

a management unit which is configured to manage the neighbor node in a first node group or a second node group according to the measured link quality.

19. The apparatus of claim 18, wherein, the packet includes routing information of the neighbor node.

20. The apparatus of claim 18, wherein the link quality is a SNR value based on a signal strength of the received packet.

21. The apparatus of claim 18, wherein the measurement unit comprises:

a search unit which is configured to search for the neighbor node in a first node group;

a comparison unit which is configured to compare the link quality of the neighbor node with a threshold value according to a result of the search by the search unit; and

a group setting unit which is configured to classify the neighbor node into the first node group or the second node group according to the result of the comparison by the comparison unit.

22. The apparatus of claim 21, wherein the threshold value becomes a first threshold value when the neighbor node is not found in the first node group as a result of the search by the search unit;

and

when, as a result of comparison by the comparison unit, the link quality is found to be higher than the first threshold value, the group setting unit classifies the neighbor node into the first node group, and when the link quality is lower than the first threshold value, the group setting unit classifies the neighbor node into the second node group.

23. The apparatus of claim 21, wherein the threshold value becomes a second threshold value when the neighbor node is found in the first node group as a result of the search by the search unit, and

when, as a result of comparison by the comparison unit, the link quality is found to be higher than the second threshold value, the group setting unit maintains the neighbor node in the first node group, and when the link quality is lower than the second threshold value, the group setting unit classifies the neighbor node into the first node group.

24. The apparatus of claim 21, wherein routing information of the neighbor node classified into the first node group is used in calculating a routing path.

25. The apparatus of claim 21, wherein the group setting unit deletes the neighbor node managed in the first node group or the second node group from the first node group or the second node group when a packet is not received from the neighbor node during a certain time period.