System and method of reliably broadcasting data packet under ad-hoc network environment

• US 7,894,381 B2
• Filed: 03/03/2004
• Issued: 02/22/2011
• Est. Priority Date: 03/04/2003
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Sin, Jin-hyun, Cho, Song-yean, Mun, Byung-in
• Primary Examiner(s): Yao; Kwang B
• Assistant Examiner(s): BOKHARI, SYED M
• Application Number:
  US10/791,544
• Publication Number:
  US 20040174844A1
• Time in Patent Office: 2,547 Days
• Field of Search: 370/394, 370/389, 370/392, 370/352, 370/338, 370/254, 370/310, 370/236, 370/410, 370/329, 370/401, 370/439, 370/400, 370/258, 370/85, 370/469, 709/238
• US Class Current: 370/328
• CPC Class Codes: H04L 12/1868 Measures taken after transmission, e.g. acknowledgments
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 40/248 Connectivity information update

Abstract

A system for reliably broadcasting a data packet under an ad-hoc network environment including a determining unit for determining whether or not at least one node receiving the broadcast data packet is a relay node, a comparing unit for comparing a first relay node sequence number contained in a management packet which the node transmits with a second relay node sequence number stored in a neighbor table of the node, and a control unit for determining whether or not the data packet is retransmitted to the node according to a result of the comparison of the comparing unit. By comparing the second relay node sequence number stored in the neighbor table of the node which has broadcast the data packet with the first relay node sequence numbers transmitted through a Hello packet, it is possible to check whether or not the data packet is lost during broadcasting, and thus it is possible to reduce a loss factor of the data packet which is generated during broadcasting. Thereby, the data packet can be reliably broadcast.

Claims

1. A system for reliably broadcasting a data packet under an ad-hoc network environment, the system comprising:

a comparing unit which compares a first relay node sequence number with a second relay node sequence number,

wherein the first relay node sequence number is contained in a management packet, the management packet is transmitted from a predetermined neighboring node to at least one node which receives the first relay node sequence number,

wherein the at least one node transmits the data packet to the predetermined neighboring node, and

wherein the second relay node sequence number is stored in a neighbor table of the at least one node;

a memory unit which stores information of the data packet before the data packet is transmitted to the predetermined neighboring node, wherein the information of the data packet comprises the second relay node sequence number; and

a control unit which determines whether or not the data packet is retransmitted to the predetermined neighboring node by the at least one node according to a result of the comparison,

wherein the comparing is performed in the at least one node transmitting the data packet.

2. The system according to claim 1, wherein the control unit transmits the data packet, wherein after adding “

1”

to the second relay node sequence number, the resulting sequence number is included in the data packet.

3. The system according to claim 1, wherein the memory unit comprises the neighbor table,

wherein the neighbor table is updated on the basis of information of the management packet received by the at least one node.

4. The system according to claim 1, wherein the data packet includes at least one of Internet protocol addresses of neighboring nodes, relay nodes, link status, and relay node sequence numbers.

5. The system according to claim 3, wherein the neighbor table is updated on the basis of the information of the management packet each of a predetermined number of times.

28. The system according to claim 1, wherein the management packet is transmitted by a node which receives the data packet transmitted by the at least one node.

6. A system for reliably broadcasting a data packet under an ad-hoc network environment, the system comprising:

a determining unit which determines whether or not at least one node that receives the data packet is a relay node which transmits the received data packet to other neighboring nodes;

a comparing unit which compares a first relay node sequence number with a second relay node sequence number,

wherein the first relay node sequence number is contained in a management packet, the management packet is transmitted from a predetermined neighboring node to at least one node which receives the first relay node sequence number

wherein the at least one node transmits the data packet to the predetermined neighboring node, and

wherein the second relay node sequence number is stored in a neighbor table of the at least one node that transmits the data packet;

a memory unit which stores information of the data packet before the data packet is transmitted to the predetermined neighboring node, wherein the information of the data packet comprises the second relay node sequence number; and

a control unit which determines whether or not the data packet is retransmitted to the predetermined neighboring node by the at least one node that transmits the data packet according to a result of the comparison,

wherein the comparing is performed in the at least one node transmitting the data packet.

7. The system according to claim 6, wherein the control unit transmits the data packet, wherein after adding “

1”

to the second relay node sequence number, the resulting sequence number is included in the data packet.

8. The system according to claim 6, wherein the memory unit comprises the neighbor table,

wherein the neighbor table is updated on the basis of information of the management packet received by the at least one node that transmits the data packet.

9. The system according to claim 6, wherein the data packet includes at least one of Internet protocol addresses of neighboring nodes, relay nodes, link status, and relay node sequence numbers.

10. The system according to claim 8, wherein the neighbor table is updated on the basis of the information of the management packet each of a predetermined number of times.

11. A method for reliably broadcasting a data packet under an ad-hoc network environment, the method comprising:

broadcasting the data packet to neighboring nodes;

comparing a first relay node sequence number with a second relay node sequence number,

wherein the first relay node sequence number is contained in a management packet received from the neighboring nodes after broadcasting the data packet to neighboring nodes,

wherein the second relay node sequence number is stored in a neighbor table of a broadcasting node which broadcast the data packet to the neighboring nodes;

storing information of the data packet before the data packet is transmitted to the neighboring nodes, wherein the information of the data packet comprises the second relay node sequence number; and

determining whether or not the data packet is retransmitted to the neighboring nodes, by the broadcasting node, according to a result of the comparison,

wherein the comparing is performed in the at least one node transmitting the data packet.

12. The method according to claim 11, wherein the step of broadcasting comprises:

adding “

1”

to the second relay node sequence number which is stored in the neighbor table of each of the neighboring nodes; and

adding the resulting relay node sequence number and predetermined information to the data packet.

13. The method according to claim 11, wherein the step of comparing comprises:

receiving the management packet from the neighboring nodes; and

comparing the first relay node sequence number contained in the received management packet with the second relay node sequence number stored in the neighbor table of the node broadcasting the data packet.

14. The method according to claim 11, wherein the step of determining comprises:

as a result of the comparison, when the first and second relay node sequence numbers are equal, terminating transmission of the data packet; and

when the first and second relay node sequence numbers are not equal to each other, retransmitting the data packet to the neighboring nodes.

15. The method according to claim 14, wherein a number of times for retransmitting the data packet is set to a predetermined number of times, and when the number of times the data packet has been retransmitted exceeds the set number of times, retransmitting the data packet is stopped.

16. The method according to claim 15, wherein, when the first and second relay node sequence numbers are not equal, the neighbor table is updated with a relatively large relay node sequence number.

17. The method according to claim 11, wherein the data packet includes at least one of Internet protocol addresses of neighboring nodes, relay nodes, link status, and relay node sequence numbers.

18. The method according to claim 15, wherein the neighbor table is updated on the basis of information of the management packet each of the predetermined number of times.

19. A method for reliably broadcasting a data packet under an ad-hoc network environment, the method comprising:

checking whether at least one node operable to receive the data packet is a relay node;

as a result of checking, when the node is a relay node, broadcasting the data packet to neighboring nodes by the at least one node;

comparing a first relay node sequence number with a second relay node sequence number,

wherein the first relay node sequence number is contained in a management packet which each of the neighboring nodes transmits after broadcasting the data packet to neighboring nodes,

wherein the second relay node sequence number is stored in a neighbor table of the at least one node,

storing information of the data packet before the data packet is transmitted to the neighboring nodes, wherein the information of the data packet comprises the second relay node sequence number; and

determining whether or not the data packet is retransmitted to the neighboring nodes, by the at least one node, according to a result of the comparison,

wherein the comparing is performed in the at least one node broadcasting the data packet.

20. The method according to claim 19, wherein the step of broadcasting comprises:

adding “

1”

to the second relay node sequence number which is stored in the neighbor table of each of the neighboring nodes; and

adding the resulting relay node sequence number and predetermined information to the data packet.

21. The method according to claim 19, wherein the step of comparing comprises:

receiving the management packet from the neighboring nodes; and

comparing the first relay node sequence number contained in the management packet which each of the neighboring nodes transmits, with the second relay node sequence number stored in the neighbor table of the at least one node.

22. The method according to claim 19, wherein the step of determining comprises:

as a result of the comparison, when the first and second relay node sequence numbers are equal, terminating transmission of the data packet; and

when the first and second relay node sequence numbers are not equal, retransmitting the data packet to the neighboring nodes.

23. The method according to claim 22, wherein retransmission of the data packet is set to occur a predetermined number of times, and when the number of times the data packet is retransmitted exceeds the set number of times, retransmitting the data packet is stopped.

24. The method according to claim 23, wherein, when the first and second relay node sequence numbers are not equal, the neighbor table is updated with a relatively large relay node sequence number.

25. The method according to claim 19, wherein the data packet includes at least one of Internet protocol addresses of the neighboring nodes, relay nodes, link status, and relay node sequence numbers.

26. The method according to claim 23, wherein the neighbor table is updated on the basis of information of the management packet each of the predetermined number of times.

27. The method according to claim 19, further comprising the step of;

as a result of checking, when the node is not the relay node, storing information of the received data packet in the neighbor table.