Neighbor discovery to support sleepy nodes

Patent metadata

Field	Value
Publication number	US-2016174148-A1
Application number	US-201414902605-A
Country	US
Kind code	A1
Filing date	Jul 11, 2014
Priority date	Jul 12, 2013
Publication date	Jun 16, 2016
Grant date	—

Abstract

Many internet of things (IoT) are “sleepy” and thus occasionally go into a sleep mode. As described herein, nodes in a connected network of nodes may determine that other nodes in the network are sleepy. Further, nodes, such as endpoint devices and routers for example, may process packets in the network based on a reachability state of their neighboring nodes.

First claim

What is claimed:

1 . In a system comprising a plurality of nodes that communicate with each other via a network, a method comprising, at a first node of the plurality of nodes:
receiving a packet that is targeted for a second node of the plurality of nodes; determining that the second node is a sleepy node configured to enter a low power state and suspend communications with the first node; determining a reachability state of the second node; and processing the packet based on the determined reachability state.

2 . The method of claim 1 , the method further comprising:
receiving a solicitation message that includes one or more sleepy node variables indicative of sleepy attributes of the second node.

3 . The method as recited in claim 2 , wherein the determined reachability state is a sleeping state, the method further comprising:
storing the packet for a time duration specified in one of the sleepy node variables; and when the time duration elapses, sending the packet to the second node.

4 . The method as recited in claim 2 , wherein the determined reachability state is a sleeping state, the method further comprising:
sending an alert to a node that sent the packet, the alert including a sleep time that remains before the second node wakes up.

5 . The method as recited in claim 2 , wherein the determined reachability state is a sleeping state, the method further comprising:
sending the packet to a redirect node specified by one of the sleepy node variables, wherein the redirect node is at least one of a proxy for the second node or functionally equivalent to the second node.

6 . The method as recited in claim 2 , wherein the determined reachability state is a sleeping state, the method further comprising:
sending a redirect message to a node that sent the packet, the redirect message including one of the sleepy node variables indicating an address of a redirect node, wherein the redirect node is at least one of a proxy for the second node or functionally equivalent to the second node.

7 . The method as recited in claim 1 , the method further comprising:
storing the reachability state of the second node in a neighbor cache entry associated with the second node; and removing the neighbor cache entry associated with the second node when the determined reachability state is an unreachable state.

8 . The method as recited in claim 1 , the method further comprising:
generating an advertisement message that includes one or more sleepy node variables indicative of sleepy attributes of the first node.

9 . The method as recited in claim 8 , wherein the sleepy attributes include at least one of a sleep pattern associated with the first node, a duty cycle associated with the first node, and a requirement that the first node is notified when a sleep state of the second node changes.

10 . A first network node in a network of connected nodes, the first network node comprising:
a first processor adapted to execute computer-readable instructions; and a first memory communicatively coupled to said first processor, said first memory having stored therein computer-readable instructions that, when executed by the first processor, cause the processor to perform operations comprising:
receiving a packet that is targeted for a second network in the network of connected nodes;
determining that the second network is a sleepy node configured to enter a low power state and suspend communications with the first node;
determining a reachability state of the second network node; and
processing the packet based on the determined reachability state.

11 . The first network node as recited in claim 10 , the operations further comprising:
receiving a solicitation message that includes one or more sleepy node variables indicative of sleepy attributes of the second network node.

12 . The first network node as recited in claim 11 , wherein the determined reachability state is a sleeping state, the operations further comprising:
storing the packet for a time duration specified in one of the sleepy node variables; and when the time duration elapses, sending the packet to the second network node.

13 . The first network node as recited in claim 11 , wherein the determined reachability state is a sleeping state, the operations further comprising:
sending an alert to a node that sent the packet in the network of connected nodes, the alert including a sleep time that remains before the second network node wakes up.

14 . The first network node as recited in claim 11 , wherein the determined reachability state is a sleeping state, the operations further comprising:
sending the packet to a redirect node in the network of connected nodes, the redirect node specified by one of the sleepy node variables, wherein the redirect node is at least one of a proxy for the second network node or functionally equivalent to the second network node.

15 . The first network node as recited in claim 11 , wherein the determined reachability state is a sleeping state, the operations further comprising:
sending a redirect message to a node that sent the packet in the network of connected nodes, the redirect message including one of the sleepy node variables indicating an address of a redirect node in the network of connected nodes, wherein the redirect node is at least one of a proxy for the second network node or functionally equivalent to the second network node.

16 . The first network node as recited in claim 10 , the operations further comprising:
storing the reachability state of the second network node in a neighbor cache entry associated with the second network node; and removing the neighbor cache entry associated with the second network node when the determined reachability state is an unreachable state.

17 . The first network node as recited in claim 10 , the operations further comprising:
generating an advertisement message that includes one or more sleepy node variables indicative of sleepy attributes of the first network node.

18 . The first network node as recited in claim 17 , wherein the sleepy attributes include at least one of a sleep pattern associated with the first network node, a duty cycle associated with the first network node, or a requirement that the first network node is notified when a sleep state of the second network node changes.

Assignees

• Convida Wireless LLC

Inventors

• Seed Dale N
• Rahman Shamim Akbar
• Dong Lijun
• Wang Chonggang

Classifications

• H04W52/0203 Primary

  in the radio access network or backbone network of wireless communication networks · CPC title

• H04W4/005

  Electricity · mapped topic

• Y02D30/70

  in wireless communication networks · CPC title

• H04W40/005

  Routing actions in the presence of nodes in sleep or doze mode · CPC title

• H04W4/70

  Services for machine-to-machine communication [M2M] or machine type communication [MTC] · CPC title