Group communication in a mobile ad-hoc network

• US 8,203,971 B2
• Filed: 01/12/2007
• Issued: 06/19/2012
• Est. Priority Date: 01/12/2007
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Niranjan, Duggi, Mohan Reddy
• Primary Examiner(s): Cordero, Marivelisse Santiago
• Assistant Examiner(s): TRAN, MONG-THUY THI
• Application Number:
  US11/653,010
• Publication Number:
  US 20080170513A1
• Time in Patent Office: 1,985 Days
• Field of Search: 370/254, 370/351, 370/256, 370/352, 370/390, 370/389, 370/408, 455/445
• 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, the method comprising:

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

caching the collected route information by encoding a group communication route from the source node to the at least one group member node;

determining whether an intermediate link of a host node has a single branch to the at least one group member node in the collected route information;

if the intermediate link has the single branch, merging the intermediate link by;

deleting the host node having the single branch to the at least one group member node; and

recording a neighbor node in place of the deleted host node.

2. The method of claim 1 further comprising:

forming a group comprised of group member nodes.

3. The method of claim 1 further comprising:

selecting the at least one group member node.

4. The method of claim 1 further comprising:

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

5. The method of claim 1, wherein the encoding further 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 the updated host node is at the periphery of the group communication route; and

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

6. The method of claim 1 further comprising:

attaching the encoded group communication route to a data packet.

7. The method of claim 6 further comprising:

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

8. The method of claim 1 further comprising:

decoding the encoded group communication route at the host node.

9. The method of claim 1 further comprising:

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

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

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

caching the collected route information;

determining whether an intermediate link of a host node has a single branch to the at least one group member node in the collected route information;

if the intermediate link has the single branch, merging the intermediate link by;

deleting the host node having the single branch to the at least one group member node; and

recording a neighbor node in place of the deleted host node;

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.

11. The method of claim 10 further comprising:

decoding the encoded group communication route at the host node.

12. The method of claim 10 further comprising:

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

13. The method of claim 10 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.

14. The method of claim 13 wherein the encoding further 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 the updated host node is at the periphery of the group communication route; and

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

15. A non-transient computer readable medium embodying a computer program, the computer program comprising:

computer readable program code for forming a group comprised of at least one group member node;

computer readable program code for collecting a route from a source node to the at least one group member node;

computer readable program code for determining a number of branches from a host node to the at least one group member node;

computer readable program code for determining whether an intermediate link of a host node has a single branch to the at least one group member node in the collected route;

computer readable program code for, if the intermediate link has the single branch, merging the intermediate link by;

deleting the host node having the single branch to the at least one group member node; and

recording a neighbor node in place of the deleted host node; and

computer readable program code for creating a consolidated route from the source node through the merged intermediate links to the at least one group member node.

16. The non-transient computer readable medium of claim 15, wherein the computer program further comprises:

computer readable program code for encoding a group communication route from the consolidated route.

17. The non-transient computer readable medium of claim 16, wherein the computer program further comprises:

computer readable program code for attaching the encoded group communication route to a data packet.

18. The non-transient computer readable medium of claim 17, wherein the computer program further comprises:

computer readable program code for sending the attached encoded group communication route and data packet along the consolidated route.

19. The non-transient computer readable medium of claim 16, wherein the computer program further comprises:

computer readable program code for decoding the encoded group communication route at the host node.

20. The non-transient computer readable medium of claim 19, wherein the computer program further comprises:

computer readable program code for re-encoding the encoded group communication route at the host node from the host node to the at least one group member node.

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

a transceiver configured to receive and transmit wireless data packets;

a processor communicably coupled to the transceiver, wherein the processor is configured to encode a group communication route from a source node to at least one group member node by

determining whether an intermediate link of a host node has a single branch to the at least one group member node in the collected route, if the intermediate link has the single branch, merging the intermediate link by deleting the host node having the single branch to the at least one group member node , and recording a neighbor node in place of the deleted host node, attach the encoded group communication route to a data packet and send 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 is configured to store the at least one group communication node.

22. The system of claim 21 wherein the-processor is further configured to form a group comprised of the at least one group member nodes.

23. The system of claim 21 wherein the-processor is further configured to collect a route from the source node to the at least one group member node.

24. The system of claim 21 wherein the processor is further configured to determine a number of branches from a host node to the at least one group member node.

25. The system of claim 21 wherein the processor is further configured to create a consolidated route from the source node through the merged intermediate links to the at least one group member node.