METHOD AND SYSTEM FOR NETWORK DATA TRANSMITTING

• US 20090028069A1
• Filed: 12/13/2007
• Published: 01/29/2009
• Est. Priority Date: 01/08/2007
• Status: Active Grant

• Current Assignee: Industrial Technology Research Institute, Telcordia Applied Research Center Taiwan Company
• Original Assignee: Industrial Technology Research Institute
• Inventors: Yang, Jen-Shun, Wang, Jui-Tang, Lin, Tzu-Ming, Hsu, Yuan-Ying
• Granted Patent: US 8,040,823 B2
• Time in Patent Office: Days
• US Class Current: 370/256
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/46 Cluster building
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees
• CPC Class Codes: H04L 45/488 using root node determination
• CPC Class Codes: H04L 45/742 Route cache; Operation thereof
• CPC Class Codes: H04L 61/5038 for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support

Abstract

A method and system for network data transmitting in a communication system includes transmitting a data from at least one transmission node to at least one receiving node of a transmission-receiving group among the plurality of communication nodes by utilizing a node ID, the node ID of communication node in the group is being assigned by a N-carry operation of a determined number N.

Claims

1. A method for transmitting data in a network environment having a plurality of communication nodes, the method comprising:

transmitting a data from at least one transmission node to at least one receiving node of a transmission-receiving group among the plurality of communication nodes by utilizing a node ID, the node ID is being assigned by a N-carry operation of a determined number N.

2. The method as in claim 1, further including assigning a root node and one or more child nodes among the plurality of communication nodes of the transmission-receiving group to form a logical tree topology, wherein each of the child nodes is a parent node of 0, one or more other ones of child nodes.

3. The method as in claim 2, wherein the determined number N is the maximum number of child nodes connecting to each of the nodes of the logical tree topology.

4. The method as in claim 2, further including assigning, for each parent node, an identification a_k for each of the child nodes, in a k^th child level of the logical three topology, relative to parent nodes to identify each of said child nodes.

5. The method as in claim 4, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of child nodes along a transmission-receiving path from a first child level of the root node to said child node for which the node ID is being assigned.

6. The method as in claim 1, further including assigning, for each transmission node, an identification a_k for each of the receiving nodes, in a k^th receiving level of the transmission-receiving group, relative to the transmission nodes to identify each of said receiving nodes.

7. The method as in claim 6, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of receiving nodes along a transmission-receiving path from a first receiving level of a first level transmission node to said receiving node for which the node ID is being assigned.

8. The method as in claim 1, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

9. The method as in claim 2, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

10. The method as in claim 9, wherein the determined number N is the maximum number of child nodes connecting to each of nodes of the logical tree topology.

11. The method as in claim 9, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of a parent node ID and setting different values of lowest i bits of the shifted node ID for the respective child nodes of the child level, and assigning the node ID of each of nodes of the first child level nodes by setting different values of lowest i bits of the node ID of the respective first child level nodes.

12. The method as in claim 9, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of the parent node ID and setting lowest i bits of the shifted node ID as an integer selected within 0 to 2ⁱ−

1, and assigning the node ID of each of nodes of the first child level nodes as an integer selected within 1 to 2ⁱ−

1.

13. The method as in claim 12, wherein the node ID of each of said child nodes is being assigned according to a sequence in which the child node being associated with its parent node.

14. The method as in claim 9, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of a parent node ID and setting different values of highest i bits of the shifted node ID for the respective child nodes of the child level, and assigning the node ID of each of nodes of the first child level nodes by setting different values of the highest i bits of the node ID of the respective first child level nodes.

15. The method as in claim 9, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of the parent node ID and setting highest i bits of the shifted node ID as an integer selected within 0 to 2ⁱ−

1, and assigning the node ID of each of nodes of the first child level nodes by setting highest i bits an integer selected within 1 to 2ⁱ−

1.

16. The method as in claim 15, wherein the node ID of each of said child nodes is being assigned according to a sequence in which the child node being associated with its parent node.

17. The method as in claim 4, further including assigning to the identification a_k a number selected within 1 to N.

18. The method as in claim 5, further including assigning to the identification a_k a number selected within 1 to N.

19. The method as in claim 4, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

20. The method as in claim 19, further including assigning to the identification a_k of each of nodes of a first child level an integer selected within 1 to N−

1, and assigning to the identification a_k of each of nodes of other child levels an integer selected within 0 to N−

1.

21. The method as in claim 20, further including assigning to said identification a_k of each of said child nodes according to a sequence in which the child node being associated with its parent node.

22. The method as in claim 20, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of the parent node ID of each of said child nodes and setting lowest i bits of the shifted node ID to the identification a_k of each of said child nodes, and assigning the node ID of each of the nodes of the first child level its own identification a₁.

23. The method as in claim 20, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of the parent node ID of each of said child nodes and setting highest i bits of the shifted node ID to the identification a_k of each of said child nodes, and assigning the node ID of each of the nodes of the first child level by setting highest i bits of the node ID of the respective first child level nodes its own identification a₁.

24. The method as in claim 5, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

25. The method as in claim 24, further including assigning to the identification a_k of each of nodes of the first child level an integer selected within 1 to N−

1, and assigning to the identification a_k of each of nodes of other child levels an integer selected within 0 to N−

1.

26. The method as in claim 25, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of the parent node ID of each of said child nodes and setting the lowest i bits to the identification a_k of each of said child nodes, and assigning the node ID of each of nodes of first child level its own identification a₁.

27. The method as in claim 25, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of the parent node ID of each of said child nodes and setting highest i bits of the shifted node ID to the identification a_k of each of said child nodes, and assigning the node ID of each of the nodes of the first child level by setting highest i bits of the node ID of the respective first child level nodes its own identification a₁.

28. The method as in claim 1, wherein the transmitting further includes each node transmitting data checking a destination ID of the data with its own node ID, accepting the data for further processing if the destination ID is its own node ID.

29. The method as in claim 28, wherein the checking is performed by subtracting the destination ID by its own node ID.

30. The method as in claim 29, wherein the checking by each node transmitting data, if the destination ID is not its own node ID, further includes:

forwarding the data to subordinate receiving nodes of the k^th receiving level if the subtraction result is not zero and the result of subtraction result modulo by N^k is zero.

31. The method as in claim 30, wherein the checking by each node transmitting data, if the destination ID is not its own node ID, further includes:

discarding the data if the subtraction result is not zero and the result of subjecting the subtraction result to modulo by N^k is not zero.

32. The method as in claim 5, wherein the transmitting further includes each node transmitting data checking a destination ID of the data with its own node ID, accepting the data for further processing if the destination ID is its own node ID.

33. The method as in claim 32, wherein the checking is performed by subtracting the destination ID by its own node ID.

34. The method as in claim 33, wherein the checking by each node transmitting data further includes:

forwarding the data to subordinate child nodes of the k^th child level if the subtraction result is not zero and the result of subtraction result modulo by N^k is zero.

35. The method as in claim 34, wherein the checking by each node transmitting data further includes:

discarding the data if the subtraction result is not zero and the result of subjecting the subtraction result to modulo by N^k is not zero.

36. The method as in claim 11, wherein the transmitting further includes each node transmitting data checking a destination ID of the data with its own node ID, and accepting the data for further processing if the destination ID is its own node ID.

37. The method as in claim 36, wherein the checking by each node transmitting data, if the destination ID is not its own node ID, further includes:

right shifting the destination ID i bits;

checking the shifted ID, forwarding the data to subordinate child nodes if the shifted ID is its own node ID; and

repeating j times of the right shifting and checking of the shifted ID, j being equal to a difference between a maximum number of child levels and a child level of the data transmitting node.

38. The method as in claim 37, wherein the checking by each node transmitting data, if the destination ID is not its own node ID further includes discarding the data if the data is not forwarded.

39. The method as in claim 14, wherein the transmitting further includes each node transmitting data checking a destination ID of the data with its own node ID, and accepting the data for further processing if the destination ID is its own node ID.

40. The method as in claim 39, wherein the checking by each node transmitting data, if the destination ID is not its own node ID, further includes:

left shifting the destination ID i bits;

checking the shifted ID, forwarding the data to subordinate child nodes if the shifted ID is its own node ID; and

repeating j times of the left shifting and checking of the shifted ID, j being equal to a difference between a maximum number of child levels and a child level of the data transmitting node.

41. The method as in claim 40, wherein the checking by each node transmitting data, if the destination ID is not its own node ID further includes discarding the data if the data is not forwarded.

42. The method as in claim 1, further including assigning said node ID of each of said nodes of the transmission-receiving group by at least one of the plurality of communication nodes.

43. The method as in claim 1, further including assigning said node ID of each of said nodes of the transmission-receiving group by at least one of the plurality of communication nodes with network control capability.

44. The method as in claim 1, further including assigning said node ID of each of said nodes of the transmission-receiving group by each of said nodes of the transmission-receiving group themselves.

45. The method as in claim 1, further comprising:

identifying by at least one of the plurality of communication nodes, the determined number N; and

broadcasting or forwarding by at least one of the plurality of communication nodes, the identified number N to the transmission-receiving group.

46. The method as in claim 45, further including assigning the node ID of each of said nodes of the transmission-receiving group by at least one of the plurality of communication nodes.

47. The method as in claim 45, further including assigning said node ID of each of said nodes of the transmission-receiving group by at least one of the plurality of communication nodes with network control capability.

48. The method as in claim 45, further including assigning said node ID of each of said nodes of the transmission-receiving group by each of said nodes of the transmission-receiving group themselves

49. The method as in claim 3, further comprising:

identifying by at least one of the plurality of communication nodes, the maximum number of child nodes; and

broadcasting or forwarding by at least one of the plurality of communication nodes, the identified maximum number to the logical tree topology.

50. The method as in claim 49, further including assigning the node ID of each of said child nodes by at least one of the plurality of communication nodes.

51. The method as in claim 49, further including assigning the node ID of each of said child nodes by each of said parent nodes.

52. The method as in claim 49, further including assigning the node ID of each of said child nodes by each of said child nodes.

53. The method as in claim 49, further including assigning the node ID of each of said child nodes by the root node.

54. The method as in claim 5, further including at least one of the plurality of communication nodes recording the determined number N and said set of identifications of child nodes along a transmission-receiving path {a₁, a₂, . . . , a_k-1, a_k} of each said child nodes.

55. The method as in claim 5, further including each of said child nodes recording the determined number N and said set of identifications of child nodes along a transmission-receiving path {a₁, a₂, . . . , a_k-1, a_k} of its own.

56. The method as in claim 3, further including at least one of the plurality of communication nodes recording said maximum number of child nodes.

57. The method as in claim 3, further including each of said child nodes recording said maximum number of child nodes.

58. The method as in claim 9, further including at least one of the plurality of communication nodes recording the number i and a maximum number of child levels.

59. The method as in claim 9, further including each of said child nodes recording the number i and a number of its own child level.

60. The method as in claim 59, further including each of said child nodes recording a maximum number of child levels.

61. The method as in claim 17, wherein the N-carry operation of child nodes of k^th child level is performed by adding a_k·

N^k-1 to its parent node ID, and assigning to the identification a_k of each of nodes of 1^st child level an integer selects within 1 to N.

62. The method as in claim 2, wherein one or more logical trees is formed and the data transmitted including a destination address comprises a logical tree prefix field and a destination node ID of the logical tree field.

63. The method as in claim 62, wherein two or more logical trees is formed and the transmitting further includes:

assigning a different logical tree prefix value to the destination address; and

transforming the destination node ID of an original logical tree to a node ID of the assigned logical tree to the destination address, to transmit data utilizing said two or more logical trees.

64. A communication system, comprising:

a plurality of communication nodes interconnected to form a network environment, the network including at least one transmission node and at least one receiving node of a transmission-receiving group; and

said at least one transmission node transmitting a data to said at least one receiving node by utilizing a node ID, the node ID is being assigned by a N-carry operation of a determined number N.

65. The system as in claim 64, further comprising a logical tree topology forming by a root node and one or more child nodes connecting among the plurality of communication nodes of the transmission-receiving group, wherein each of the child nodes is a parent node of 0, one or more other ones of child nodes.

66. The system as in claim 65, wherein the determined number N is a maximum number of child nodes connected to each of the nodes of the logical tree topology.

67. The system as in claim 64, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein a_k is an identification for each of receiving nodes in k^th receiving level relative to transmission node to identify each of said receiving nodes, and {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of receiving nodes along a transmission-receiving path from a first receiving level of a first level transmission node to said receiving node for which the node ID is being assigned.

68. The system as in claim 65, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein a_k is an identification for each of child nodes in k^th child level relative to parent node to identify each of said child nodes, and {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of child nodes along a transmission-receiving path from a first child level of the root node to a child node for which the node ID is being generated.

69. The system as in claim 64, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

70. The system as in claim 65, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

71. The system as in claim 70, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of a parent node ID and setting different values of lowest i bits of the shifted node ID for the respective child nodes of the child level, and assigning the node ID of each of nodes of the first child level nodes by setting different values of lowest i bits of the node ID of the respective first child level nodes.

72. The system as in claim 70, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of its parent node ID and setting the lowest i bits to an integer selected within 0 to 2ⁱ−

1, and assigning the node ID of each of nodes of the first child level nodes an integer selected within 1 to 2ⁱ−

1.

73. The system as in claim 70, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of a parent node ID and setting different values of highest i bits of the shifted node ID for the respective child nodes of the child level, and assigning a node ID to each of nodes of the first child level nodes by setting different values of the highest i bits of the node ID of the respective first child level nodes.

74. The system as in claim 70, wherein the N-carry operation of child nodes in each child level other than the first child level is performed by right shifting i bits of its parent node ID and setting the highest i bits to an integer selected within 0 to 2ⁱ−

1, and the node ID of each of nodes of the 1^st child level nodes is assigned by setting highest i bits an integer selected within 1 to 2ⁱ−

1.

75. The system as in claim 68, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

76. The system as in claim 75, wherein the identification a_k of each of nodes of a first child level is being assigned an integer selected within 1 to N−

1, and the identification a_k of each of nodes of other child levels is being assigned an integer selected within 0 to N−

1.

77. The system as in claim 76, wherein said identification a_k of each of said child nodes is being assigned according to a sequence in which the child node being associated with its parent node.

78. The system as in claim 76, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of the parent node ID of each of said child nodes and setting the lowest i bits to the identification a_k of each of said child nodes, and assigning the node ID of each of nodes of first child level its own identification a₁.

79. The system as in claim 76, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of the parent node ID of each of said child nodes and setting highest i bits of the shifted node ID to the identification a_k of each of said child nodes, and assigning the node ID of each of the nodes of the first child level by setting highest i bits of the node ID of the respective first child level nodes its own identification a₁.

80. The system as in claim 64, wherein the node ID of each said receiving node is being assigned according to a sequence in which the receiving node being associated with its transmission node.

81. The system as in claim 66, wherein at least one of the plurality of communication nodes identifies the maximum number of child nodes.

82. The system as in claim 81, wherein at least one of the plurality of communication nodes broadcasts or forwards the identified maximum number to the tree topology.

83. The system as in claim 64, wherein at least one of the plurality of communication nodes assigning the node ID of each of said receiving nodes.

84. The system as in claim 65, wherein at least one of the plurality of communication nodes assigning the node ID of each of said receiving nodes.

85. The system as in claim 84, wherein the root node assigning the node ID of each of said child nodes.

86. The system as in claim 84, wherein each of said child nodes assigning its own node ID.

87. The system as in claim 64, wherein at least one of the plurality of communication nodes assigning the node ID for a handover node, when the system processes a handover operation.

88. The system as in claim 65, wherein at least one of the plurality of communication nodes assigning the node ID for a handover node, when the system processes a handover operation.

89. The system as in claim 88, wherein the node ID of the handover node is being assigned by the root node.

90. The system as in claim 64, wherein a handover node assigns its own node ID, when the system processes a handover operation.

91. The system as in claim 65, wherein the system forms one or more logical trees and the data transmitted includes a destination address including a logical tree prefix field and a destination node ID of the logical tree field.

92. The system as in claim 91, wherein two or more logical trees is formed and the system assigning a different logical tree prefix value to the destination address and transforming the destination node ID of an original logical tree to a node ID of the assigned logical tree to the destination address, to transmit data utilizing said two or more logical trees.

93. A communication node in a transmission-receiving group of a network, the network including a plurality of network nodes and the transmission-receiving group including at least one transmission node and at least one receiving node, the communication node comprising:

at least one memory to store data and instructions; and

at least one processor configured to access the memory, and when executing the instructions, configured to;

transmitting a communication data by utilizing a node ID, the node ID is being assigned by a N-carry operation of a determined number N.

94. The communication node as in claim 93, wherein the network further comprising a logical tree topology forming by a root node and one or more child nodes connecting among the plurality of nodes of the transmission-receiving group, wherein each of the child nodes is a parent node of 0, one or more other ones of child nodes.

95. The communication node as in claim 94, wherein the determined number N is a maximum number of child nodes connected to each of the nodes of the logical tree topology.

96. The communication node as in claim 93, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein a_k is an identification for each of receiving nodes in k^th receiving level relative to transmission node to identify each of said receiving nodes, and {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of receiving nodes along a transmission-receiving path from a first receiving level of a first level transmission node to said receiving node for which the node ID is being assigned.

97. The communication node as in claim 94, wherein the N-carry operation is being performed by a polynomial a_k·

N^k-1+a_k-1·

N^k-2+ . . . +a₂·

N¹+a₁·

N⁰, wherein a_k is an identification for each of child nodes in k^th child level relative to parent node to identify each of said child nodes, and {a₁, a₂, . . . , a_k-1, a_k} is a set of identifications of child nodes along a transmission-receiving path from a first child level of the root node to a child node for which the node ID is being generated.

98. The communication node as in claim 93, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

99. The communication node as in claim 94, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

100. The communication node as in claim 99, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of a parent node ID and setting different values of lowest i bits of the shifted node ID for the respective child nodes of the child level, and assigning the node ID of each of nodes of the first child level nodes by setting different values of lowest i bits of the node ID of the respective first child level nodes.

101. The communication node as in claim 99, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of its parent node ID and setting the lowest i bits to an integer selected within 0 to 2ⁱ−

1, and assigning the node ID of each of nodes of the first child level nodes an integer selected within 1 to 2ⁱ−

1.

102. The communication node as in claim 99, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting i bits of a parent node ID and setting different values of highest i bits of the shifted node ID for the respective child nodes of the child level, and assigning a node ID to each of nodes of the first child level nodes by setting different values of the highest i bits of the node ID of the respective first child level nodes.

103. The communication node as in claim 99, wherein the N-carry operation of child nodes in each child level other than the first child level is performed by right shifting i bits of its parent node ID and setting the highest i bits to an integer selected within 0 to 2ⁱ−

1, and the node ID of each of nodes of the 1^st child level nodes is assigned by setting highest i bits an integer selected within 1 to 2ⁱ−

1.

104. The communication node as in claim 97, wherein the determined number N is equal to 2ⁱ, i being an integer equal to or greater than zero.

105. The communication node as in claim 104, wherein the identification a_k of each of nodes of a first child level is being assigned an integer selected within 1 to N−

1, and the identification a_k of each of nodes of other child levels is being assigned an integer selected within 0 to N−

1.

106. The communication node as in claim 105, wherein said identification a_k of each of said child nodes is being assigned according to a sequence in which the child node being associated with its parent node.

107. The communication node as in claim 105, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by left shifting i bits of the parent node ID of each of said child nodes and setting the lowest i bits to the identification a_k of each of said child nodes, and assigning the node ID of each of nodes of first child level its own identification a₁.

108. The communication node as in claim 105, wherein the N-carry operation of child nodes in each child level other than the first child level is being performed by right shifting bits of the parent node ID of each of said child nodes and setting highest i bits of the shifted node ID to the identification a_k of each of said child nodes, and assigning the node ID of each of the nodes of the first child level by setting highest i bits of the node ID of the respective first child level nodes its own identification a₁.

109. The communication node as in claim 93, wherein the node ID of each said receiving node is being assigned according to a sequence in which the receiving node being associated with its transmission node.

110. The communication node as in claim 95, wherein at least one of the plurality of communication network nodes identifies the maximum number of child nodes.

111. The communication node as in claim 110, wherein at least one of the plurality of communication network nodes broadcasts or forwards the identified maximum number to the logical tree topology.

112. The communication node as in claim 93, wherein at least one of the plurality of communication network nodes assigning the node ID of each of said receiving nodes.

113. The communication node as in claim 94, wherein at least one of the plurality of communication network nodes assigning the node ID of each of said receiving nodes.

114. The communication node as in claim 94, wherein the communication node assigning its own node ID.