Two-hop relay for reducing distance vector routing information
US7978612B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 13, 2008 |
| Grant date | Jul 12, 2011 |
| Priority date | — |
| Expiry date | Dec 18, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04W40/24
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.