WIRELESS COMMUNICATION NETWORK AND ROUTING METHOD

• US 20100165885A1
• Filed: 11/11/2009
• Published: 07/01/2010
• Est. Priority Date: 12/29/2008
• Status: Active Grant

• Current Assignee: Industrial Technology Research Institute
• Original Assignee: Industrial Technology Research Institute
• Inventors: CHANG, Shu-Hsin, Tsai, Wei-Lun, Yao, Chih-Yuan, Liu, Pin-Chuan
• Granted Patent: US 8,537,719 B2
• Time in Patent Office: Days
• US Class Current: 370/256
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/488 using root node determination
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing

Abstract

A wireless communication network, including a destination node, a first node transmitting a first routing message, wherein the first node has a first routing table including a first entry for the destination node, and the first entry includes a first list field for child node(s). The network further includes a second node generating and transmitting a second routing message according to the first routing message, wherein the second routing message includes a second parent node field, and the second parent node field is marked as the first node that transmitted the first routing message. The first node further receives the second routing message and stores a first mark in the first list field for child node(s) of the first entry after determining that the second parent node field of the second routing message is marked as the first node, and the first mark denotes the second node.

Claims

1. A wireless communication network, comprising:

a destination node;

a first node transmitting a first routing message comprising a destination field marked as the destination node, wherein the first node has a first routing table comprising a first entry for the destination node, and the first entry comprises a first list field for child node(s); and

a second node generating and transmitting a second routing message comprising a destination field marked as the destination node, according to the first routing message, wherein the second routing message comprises a second parent node field, and the second parent node field is marked as the first node that transmitted the first routing message,

wherein, the first node further receives the second routing message and stores a first mark in the first list field for child node(s) of the first entry after determining that the second parent node field of the second routing message is marked as the first node, and the first mark denotes the second node that transmitted the second routing message.

2. The wireless communication network as claimed in claim 1, wherein the destination node is the first node.

3. The wireless communication network as claimed in claim 2, wherein the second routing message further comprises a relay field marked as the second node that transmitted the second routing message, and the destination field of the second routing message is marked as the first node that transmitted the first routing message.

4. The wireless communication network as claimed in claim 1, wherein the first entry further comprises a destination field and a nexthop field, and the first node marks the destination field and the nexthop field as the destination node when the first node receives an initial routing message from the destination node.

5. The wireless communication network as claimed in claim 1, further comprising a third node transmitting a third routing message to the second node, wherein the third routing message is generated after the first routing message and comprises a destination field marked as the destination node, the third node has a third routing table comprising a third entry for the destination node, the third entry comprises a third list field for child node(s) and a third destination field, the first entry further comprises a first destination field, and the first destination field and the third destination field are both marked as the destination node.

6. The wireless communication network as claimed in claim 5, wherein the second node further generates and transmits a fourth routing message to the first node and the third node according to the third routing message, the fourth routing message comprises a fourth parent node field, and the fourth parent node field is marked as the third node that transmitted the third routing message.

7. The wireless communication network as claimed in claim 6, wherein the third node further stores a third mark in the third list field for child node(s) of the third entry after determining that the fourth parent node field of the fourth routing message is marked as the third node, and the third mark denotes the second node that transmitted the fourth routing message.

8. The wireless communication network as claimed in claim 6, wherein the first node further clears the first mark from the first list field for child node(s) of the first entry after determining that the fourth parent node field of the fourth routing message is not marked as the first node.

9. The wireless communication network as claimed in claim 1, wherein the first node determines whether to transmit any routing message with a destination field marked as the destination node based on the first list field for child node(s), when the first node receives an update routing message from the destination node.

10. The wireless communication network as claimed in claim 9, wherein the destination node transmits the update routing message when detecting a new node.

11. A routing method, comprising:

transmitting a first routing message generated by a first node to a second node, wherein the first node has a first routing table comprising a first entry for a destination node, the first entry comprises a first list field for child node(s), and the first routing message comprises a destination field marked as the destination node;

generating and transmitting a second routing message at the second node according to the first routing message, wherein the second routing message comprises a second parent node field, the second parent node field is marked as the first node that generated the first routing message, and the second routing message comprises a destination field marked as the destination node; and

storing a first mark in the first list field for child node(s) of the first entry after determining that the second parent node field of the second routing message is marked as the first node, wherein the first mark denotes the second node that transmitted the second routing message.

12. The routing method as claimed in claim 11, wherein the destination node is the first node.

13. The routing method as claimed in claim 12, wherein the second routing message further comprises a relay field, and the method further comprises:

marking the relay field as the second node that transmitted the second routing message; and

marking the destination field of the second routing message as the first node that transmitted the first routing message.

14. The routing method as claimed in claim 11, wherein the first entry further comprises a destination field and a nexthop field, and the method further comprising marking the destination field and the nexthop field as the destination node when the first node receives an initial routing message from the destination node.

15. The routing method as claimed in claim 11, further comprising transmitting a third routing message generated by a third node to the second node, wherein the third routing message is generated after the first routing message and comprises a destination field marked as the destination node, the third node has a third routing table comprising a third entry for the destination node, the third entry comprises a third list field for child node(s) and a third destination field, the first entry further comprises a first destination field, and the first destination field and the third destination field are both marked as the destination node.

16. The routing method as claimed in claim 15, further comprising:

generating a fourth routing message at the second node according to the third routing message, wherein the fourth routing message comprises a fourth parent node field, and the fourth parent node field is marked as the third node that transmitted the third routing message; and

transmitting the fourth routing message to the first node and the third node.

17. The routing method as claimed in claim 16, further comprising storing a third mark in the third list field for child node(s) of the third entry after determining that the fourth parent node field of the fourth routing message is marked as the third node, wherein the third mark denotes the second node that transmitted the fourth routing message.

18. The routing method as claimed in claim 16, further comprising clearing the first mark from the first list field for child node(s) of the first entry after determining that the fourth parent node field of the fourth routing message is not marked as the first node.

19. The routing method as claimed in claim 11, further comprising determining whether to transmit any routing message, that comprises a destination field marked as the destination node, at the first node based on the first list field for child node(s) when the first node receives an update routing message from the destination node.

20. The routing method as claimed in claim 19, wherein the update routing message is transmitted at the destination node when the destination node detects a new node.