The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Dec. 10, 2019

Filed:

Sep. 27, 2016
Applicant:

Signify Holding B.v., Eindhoven, NL;

Inventors:

Xiaodong Ge, Shenzhen, CN;

Zhizhong Zhang, Shanghai, CN;

Peiliang Dong, Shanghai, CN;

Jun Jun Zhang, Shanghai, CN;

Assignee:

SIGNIFY HOLDING B.V., Eindhoven, NL;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/707 (2013.01); H04L 12/703 (2013.01); H04L 12/733 (2013.01); H04W 40/02 (2009.01); H04W 40/24 (2009.01); H04W 84/18 (2009.01); H04W 40/12 (2009.01); H04W 40/32 (2009.01); H04L 12/741 (2013.01);
U.S. Cl.
CPC ...
H04L 45/22 (2013.01); H04L 45/122 (2013.01); H04L 45/28 (2013.01); H04L 45/74 (2013.01); H04W 40/02 (2013.01); H04W 40/125 (2013.01); H04W 40/24 (2013.01); H04W 40/246 (2013.01); H04W 40/32 (2013.01); H04W 84/18 (2013.01);
Abstract

The present invention relates to a method for routing messages through a mesh network comprising a plurality of nodes, wherein a message is send from a sending node to a receiving node. The method comprises the steps of defining a routing table designating a path from a source node to a destination node through the mesh network, and defining a neighbor table listing one or more neighbor nodes from the plurality of nodes which are in the neighborhood of the sending node. If the destination node is not in the neighbor table of the sending node, the message is transmitted by the sending node to a receiving node adapted to forward the message to the destination node in accordance with the routing table. The one or more neighbor nodes save the message in internal storage and a predetermined number of helping nodes from the one or more neighbor nodes repeat the message after respective predetermined time intervals have passed, wherein the number of helping nodes being smaller or equal than the number of neighbor nodes.


Find Patent Forward Citations

Loading…