Group communication in a mobile AD-HOC network

• US 20080170513A1
• Filed: 01/12/2007
• Published: 07/17/2008
• Est. Priority Date: 01/12/2007
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Duggi, Mohan Reddy, Niranjan
• Granted Patent: US 8,203,971 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/16 Multipoint routing
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

A system, method, and computer readable medium for group communication protocol in mobile ad-hoc network, that comprises, collecting a route from a source node to at least one group member node, caching the collected route information, and merging an intermediate link of a host node having a single branch to the at least one group member node in the collected route.

Claims

1. A method of group communication in a mobile ad-hoc network, comprising:

collecting a route from a source node to at least one group member node;

caching the collected route information; and

merging an intermediate link of a host node having a single branch to the at least one group member node in the collected route.

2. The method of claim 1 comprising:

forming a group comprised of group member nodes.

3. The method of claim 1 comprising:

selecting the at least one group member nodes.

4. The method of claim 1 comprising:

discovering the route from the source node to the at least one group member node.

5. The method of claim 1 comprising:

encoding a group communication route from the source node to the at least one group member node.

6. The method of claim 5 wherein the encoding includes:

deleting the host node at a periphery of the group communication route; and

recording a neighbor node to the deleted host node.

7. The method of claim 6 wherein the encoding includes:

indexing the neighbor node to be an updated host node;

determining an updated neighbor node to the updated host node;

deleting the updated host node if it is at the periphery of the group communication route; and

recording the updated neighbor node to the deleted updated host node.

8. The method of claim 5 comprising:

attaching the encoded group communication route to a data packet.

9. The method of claim 6 comprising:

sending the attached encoded group communication route and data packet from the source node to the at least one group member node.

10. The method of claim 5 comprising:

decoding the encoded group communication route at the host node.

11. The method of claim 5 comprising:

re-encoding the encoded group communication route at the host node from the host node to the at least one group member node.

12. A method of group communication in a mobile ad-hoc network, comprising:

collecting a route from a source node to at least one group member node;

caching the collected route information;

merging an intermediate link of a host node having a single branch to the at least one group member node in the collected route;

encoding a group communication route from the source node to the at least one group member node;

attaching the encoded group communication route to a data packet; and

sending the attached encoded group communication route and data packet from the source node to the at least one group member node.

13. The method of claim 12 comprising:

decoding the encoded group communication route at the host node.

14. The method of claim 12 comprising:

re-encoding the encoded group communication route at the host node from the host node to the at least one group member node.

15. The method of claim 12 wherein the encoding includes:

deleting the host node at a periphery of the group communication route; and

recording a neighbor node to the deleted host node.

16. The method of claim 15 wherein the encoding includes:

indexing the neighbor node to be an updated host node;

determining an updated neighbor node to the updated host node;

deleting the updated host node if it is at the periphery of the group communication route; and

recording the updated neighbor node to the deleted updated host node.

17. A computer readable medium comprising instructions for:

forming a group comprised of at least one group member node;

collecting a route from a source node to the at least one group member node;

determining a number of branches from a host node to the at least one group member node;

merging an intermediate link of the host node having one branch to the at least one group member node in the collected route; and

creating a consolidated route from the source node through the merged intermediate links to the at least one group member node.

18. The computer readable medium of claim 17 comprising instructions for:

encoding a group communication route from the consolidated route.

19. The computer readable medium of claim 18 comprising instructions for:

attaching the encoded group communication route to a data packet.

20. The computer readable medium of claim 19 comprising instructions for:

sending the attached encoded group communication route and data packet along the consolidated route.

21. The computer readable medium of claim 18 comprising instructions for:

decoding the encoded group communication route at the host node.

22. The computer readable medium of claim 21 comprising instructions for:

re-encoding the encoded group communication route at the host node from the host node to the at least one group member node.

23. A system for group communication protocol in mobile ad-hoc network, comprising:

a transceiver for receiving and transmitting wireless data packets;

a processor communicably coupled to the transceiver, wherein the processor encodes a group communication route from a source node to at least one group member node, attaches the encoded group communication route to a data packet and sends the attached encoded group communication route and data packet from the source node to at least one group communication node; and

a memory communicably coupled to the processor, wherein the memory stores the at least one group communication node.

24. The system of claim 23 wherein the processor,

forms a group comprised of the at least one group member nodes.

25. The system of claim 23 wherein the processor,

collects a route from the source node to the at least one group member node.

26. The system of claim 23 wherein the processor,

determines a number of branches from a host node to the at least one group member node.

27. The system of claim 23 wherein the processor,

determines a number of branches from a host node to the at least one group member node.

28. The system of claim 25 wherein the processor,

merges an intermediate link of a host node having one branch to the at least one group member node in the collected route.

29. The system of claim 28 wherein the processor,

creates a consolidated route from the source node through the merged intermediate links to the at least one group member node.