METHOD OF COMMUNICATING CONTENT IN MOBILE AD-HOC NETWORK AND COMMUNICATION NODE INCLUDED IN MOBILE AD-HOC NETWORK

• US 20150222479A1
• Filed: 01/07/2015
• Published: 08/06/2015
• Est. Priority Date: 02/04/2014
• Status: Abandoned Application

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: KIM, Jong-Hwan, JUNG, Il-Gu, RYU, Won, KIM, Do-Hyung, YEOM, Ik-Jun
• Application Number:
  US14/591,261
• Publication Number:
  US 20150222479A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04W 28/0236 radio quality, e.g. interference, losses or delay
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Provided are a method of communicating content in a mobile ad-hoc network and a communication node included in a mobile ad-hoc network, the method and communication node intended to efficiently perform communication based on information centric networking (ICN) in a mobile ad-hoc network and reduce the waste of energy resulting from frequent reconfiguration of communication caused by the mobility of a terminal. The method includes receiving an interest packet or a response packet for content; determining a next node to which the received packet will be relayed based on a forwarding information base (FIB) or a pending interest table (PIT), and relaying the packet using a unicast scheme; and when the relay of the packet to the next node fails, restoring a routing path by storing the packet in a relay candidate buffer and broadcasting the packet.

Claims

1. A method of communicating content in a mobile ad-hoc network, the method comprising:

receiving an interest packet or a response packet for content;

determining a next node to which the received packet will be relayed based on a forwarding information base (FIB) or a pending interest table (PIT), and relaying the packet using a unicast scheme; and

when the relay of the packet to the next node fails, restoring a routing path by storing the packet in a relay candidate buffer and broadcasting the packet.

2. The method of claim 1, wherein a header of the packet includes at least one of requestor identification information, identification information of a relay node having relayed the packet, a distance from a requestor, a packet lifetime, a content identifier (ID), and a flooding bit.

3. The method of claim 1, wherein the FIB stores routing path information of content-specific interest packets as a table, and

each entry includes at least one of a content identifier (ID), identification information of a next node to which the packet will be relayed, a distance from a content provider, and lifetime information of the entry.

4. The method of claim 1, wherein the PIT stores information on an interest packet waiting for a response packet as a table, and

each entry includes at least one of a content identifier (ID), requestor identification information, information on a relay node having relayed the interest packet, information on a distance from a requestor, lifetime information of the entry, and a flooding bit.

5. The method of claim 1, wherein the determination of the next node to which the received packet will be relayed includes:

determining the next node based on the FIB when the received packet is the interest packet; and

determining the next node based on the PIT when the received packet is the response packet.

6. The method of claim 1, wherein the restoring of the routing path includes:

searching the relay candidate buffer for a response packet corresponding to the interest packet when the packet having failed to be relayed is the interest packet, and searching the relay candidate buffer for an interest packet corresponding to the response packet when the packet having failed to be relayed is the response packet;

when the corresponding response packet or interest packet is retrieved, determining a next node to which the packet, having failed to be relayed, will be relayed based on header information of the retrieved packet, and retransmitting the packet; and

removing the retransmitted packet from the relay candidate buffer.

7. The method of claim 6, wherein the restoring of the routing path further includes:

determining a next node to which the interest or response packet, retrieved to correspond to the packet having failed to be relayed, will be relayed based on header information of the packet having failed to be relayed, and retransmitting the corresponding packet; and

removing the retransmitted corresponding packet from the relay candidate buffer.

8. The method of claim 6, wherein the searching of the corresponding response packet or interest packet includes searching for a packet including the same content identifier (ID) as the packet having failed to be relayed in a header.

9. A method of communicating content in a mobile ad-hoc network, the method comprising:

receiving an interest packet for content;

determining whether content corresponding to a content identifier (ID) included in a header of the interest packet is present in a content memory;

when it is determined that the content corresponding to the content ID is not present in the content memory, updating a pending interest table (PIT) based on header information of the interest packet;

updating relay node identification information in the header information of the interest packet with identification information of a current node having received the interest packet, and increasing a value of distance from a requestor;

determining a next node to which the interest packet will be relayed based on a forwarding information base (FIB), and relaying the interest packet; and

when the relay of the interest packet to the next node fails, restoring a routing path by storing the interest packet in a relay candidate buffer and broadcasting the interest packet.

10. The method of claim 9, further comprising, when it is determined that the content corresponding to the content ID included in the header of the interest packet is present in the content memory, generating a response packet including the content present in the content memory and returning the response packet to a node having relayed the interest packet.

11. The method of claim 9, wherein a header of the interest packet includes at least one of requestor identification information, identification information of a relay node having relayed the interest packet, the distance from the requestor, a packet lifetime, a content ID, and a flooding bit.

12. The method of claim 9, wherein each entry of the PIT includes at least one of a content ID, content requestor identification information, identification information of a relay node having relayed the interest packet for requesting the content, information on the distance from the requestor, lifetime information of the entry, and a flooding bit.

13. The method of claim 11, wherein the updating of the PIT based on the header information of the interest packet includes:

when there is no entry having the same requestor identification information and content ID as the interest packet, adding an entry corresponding to the interest packet to the PIT based on the header information of the interest packet; and

when there is an entry having the same requestor identification information and content ID as the interest packet but the distance value stored in the interest packet is smaller than a distance value of the entry in the PIT, updating the entry with the header information of the interest packet.

14. The method of claim 9, wherein the restoring of the routing path includes:

searching the relay candidate buffer for a response packet corresponding to the interest packet having failed to be relayed;

when the corresponding response packet is retrieved, determining a next node to which the interest packet, having failed to be relayed, will be relayed based on header information of the retrieved response packet, and retransmitting the interest packet having failed to be relayed;

determining a next node to which the retrieved response packet will be relayed based on the header information of the interest packet having failed to be relayed, and retransmitting the retrieved response packet; and

removing the retransmitted interest and response packets from the relay candidate buffer.

15. A method of communicating content in a mobile ad-hoc network, the method comprising:

receiving a response packet including content;

storing the content included in the response packet in a content memory together with a content identifier (ID);

updating relay node identification information in header information of the response packet with identification information of a current node, and increasing a value of distance from a requestor;

determining a next node to which the response packet will be relayed based on a pending interest table (PIT), and relaying the response packet; and

when the determination of the next node fails or the relay of the response packet to the next node fails, restoring a routing path by storing the response packet in a relay candidate buffer and broadcasting the response packet.

16. The method of claim 15, wherein the restoring of the routing path includes:

searching the relay candidate buffer for an interest packet corresponding to the response packet having failed to be relayed;

determining a next node to which the response packet, having failed to be relayed, will be relayed based on header information of a retrieved interest packet, and retransmitting the response packet having failed to be relayed;

determining a next node to which the retrieved interest packet will be relayed based on the header information of the response packet having failed to be relayed, and retransmitting the retrieved interest packet; and

removing the retransmitted response and interest packets from the relay candidate buffer.

17. The method of claim 15, further comprising, after the relay of the response packet is finished, removing an entry of an interest packet corresponding to the response packet from the PIT.

18. A communication node included in a mobile ad-hoc network, the communication node comprising:

a wireless transceiver configured to exchange packets with a neighboring node;

a processor; and

a memory comprising instructions that, when executed by the processor;

perform operations comprising;

receiving an interest packet for content or a response packet including content from the neighboring node through the wireless transceiver;

determining a next node to which the received packet will be relayed based on a forwarding information base (FIB) or a pending interest table (PIT) stored in the memory to relay the received packet; and

restoring a routing path by storing the received packet in a relay candidate buffer in the memory and broadcasting the received packet through the wireless transceiver, when the relay of the received packet to the next node fails.

19. A communication node included in a mobile ad-hoc network, the communication node comprising:

a wireless transceiver configured to exchange packets with a neighboring node;

a processor; and

a memory comprising instructions that, when executed by the processor;

perform operations comprising;

receiving an interest packet for content from the neighboring node through the wireless transceiver;

determining whether content corresponding to a content identifier (ID) included in a header of the interest packet is present in the memory;

updating a pending interest table (PIT) in the memory based on header information of the interest packet, updating relay node identification information in the header information of the interest packet with identification information of the communication node, increasing a value of distance from a requestor, and determining a next node to which the interest packet will be relayed based on a forwarding information base (FIB) in the memory, when it is determined that the content corresponding to the content ID is not present in the memory; and

restoring a routing path by storing the interest packet in a relay candidate buffer in the memory and broadcasting the interest packet, when relay of the interest packet to the determined next node fails.

20. A communication node included in a mobile ad-hoc network, the communication node comprising:

a wireless transceiver configured to exchange packets with a neighboring node;

a processor; and

a memory comprising instructions that, when executed by the processor;

perform operations comprising;

receiving a response packet including content from the neighboring node through the wireless transceiver;

storing the content included in the response packet in the memory together with a content identifier (ID);

updating relay node identification information in header information of the response packet with identification information of the communication node and increasing a value of distance from a requestor,

determining a next node to which the response packet will be relayed based on a pending interest table (PIT) in the memory and relaying the response packet; and

restoring a routing path by storing the response packet in a relay candidate buffer in the memory and broadcasting the response packet, when the determination of the next node fails or the relay of the response packet to the determined next node fails.