Method and apparatus for operating an AD-HOC communication system

• US 20060034193A1
• Filed: 08/16/2004
• Published: 02/16/2006
• Est. Priority Date: 08/16/2004
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Huang, Jian, Shi, Qicai, Huang, Yan
• Granted Patent: US 7,656,804 B2
• Time in Patent Office: Days
• US Class Current: 370/255
• CPC Class Codes: H04L 2101/604 Address structures or formats
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/50 Address allocation
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

An ad-hoc communication system is established where each node within the system may have multiple children nodes and parent nodes. An address scheme is proposed where each node may comprise more than one address, each address being based upon one of the parent'"'"'s address. Because each node may have more than one parent, a bridge, or shortcut may exist between network branches.

Claims

1. A method for operating a node within an ad-hoc communication system, the method comprising the steps of:

associating with a first parent node;

receiving a first address from the first parent node;

associating with a second parent node; and

receiving a second address from the second parent node.

2. The method of claim 1 wherein the step of receiving the first address from the first parent node comprises the step of receiving a first and a second address portion, wherein the second address portion is equal to a first and a second address portion assigned to the first parent node.

3. The method of claim 2 wherein the step of receiving the second address from the second parent node comprises the step of receiving a third and a fourth address portion, wherein the fourth address portion is equal to a first and a second address portions assigned to the second parent node.

4. The method of claim 1 wherein the step of associating with the first parent node comprises the step of associating with the first parent node if no more than a predetermined number of parents exist for the node and the step of associating with the second parent node comprises the step of associating with the second parent node if no more than the predetermined number of parents exist for the node.

5. The method of claim 1 further comprising the steps of:

serving as a parent node to a first child node;

assigning the first child node a third address;

serving as a parent node to a second child node; and

assigning the second child node a fourth address.

6. The method of claim 5 wherein the step of assigning the first child node the third address comprises the step of assigning a fifth and a sixth address portion to the first child node, wherein the sixth address portion is equal to the first address.

7. The method of claim 6 wherein the step of assigning the second child node the fourth address comprises the step of assigning a seventh and an eighth address portion to the second child node, wherein the eighth address portion is equal to the first address.

8. The method of claim 5 wherein the step of serving as the parent to the first child node comprises the steps of:

determining a link quality for the first child node;

determining a current number of child nodes associated with the node; and

serving as the parent node to the first child node when the link quality for the first child node is above a threshold, and when no more than a predetermined number of child nodes are already associated with the node.

9. A method for finding a best route to a destination node, the method comprising the steps of:

determining a number of hops to the destination node through a first parent node;

determining a number of hops to the destination node through a second parent node;

determining a number of hops to the destination node through a first child node;

determining a number of hops to the destination node through a second child node;

determining a node having a shortest number of hops to the destination node; and

providing route information for routing data through the node having the shortest number of hops.

10. The method of claim 9 wherein the step of determining the number of hops to the destination node through a parent node comprises the step of determining D=(L_d−

L)+(L_p−

L), where L_p is a length of the parent'"'"'s name, L is a length of the shared last name by the destination node and the parent, and L_d is a length of the destination'"'"'s name.

11. The method of claim 9 wherein the step of determining the number of hops to the destination node through a child node comprises the step of determining D=(L_d−

L)+(L_c−

L), where L_c is a length of the child'"'"'s name, L is a length of the shared last name by the destination node and the child, and L_d is a length of the destination'"'"'s name.

12. A node existing within an ad-hoc communication system, the node comprising:

logic circuitry associating the node with a first and a second parent node; and

a receiver, receiving a first address from the first parent node and receiving a second address from the second parent node.

13. The node of claim 12 wherein the first address comprises a first and a second address portion, wherein the second address portion is equal to the first address.

14. The node of claim 12 wherein the second address comprises a third and a fourth address portion, wherein the fourth address portion is equal to second address.

15. The node of claim 12 wherein the logic circuitry associates the node with the first parent node if no more than a predetermined number of parents exist for the node and wherein the logic circuitry associates the node with the second parent node if no more than the predetermined number of parents exist for the node.

16. The node of claim 12 wherein the logic circuitry additionally serves as a parent node to a first child node, and serves as a parent node to a second child node.

17. The node of claim 12 wherein the first and the second child node do not have the first or the second parent node as a parent.

18. An apparatus for determining a best route to a destination node, the apparatus comprising:

logic circuitry for determining a number of hops to the destination node through a first parent node, determining a number of hops to the destination node through a second parent node, determining a number of hops to the destination node through a first child node, determining a number of hops to the destination node through a second child node, and determining a node having a shortest number of hops to the destination node; and

a transmitter for providing route information in order to route data through the node having the shortest number of hops.

19. The apparatus of claim 18 wherein the number of hops to the destination node through a parent node is calculate by determining D=(L_d−

L)+(L_p−

L), where L_p is a length of the parent'"'"'s name, L is a length of the shared last name by the destination node and the parent, and L_d is a length of the destination'"'"'s name.

20. The apparatus of claim 18 wherein the number of hops to the destination node through a child node comprises the step of determining D=(L_d−

L)+(L_c−

L), where L_c is a length of the child'"'"'s name, L is a length of the shared last name by the destination node and the child, and L_d is a length of the destination'"'"'s name.