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.
Patent No.:
Date of Patent:
May. 26, 2026
Filed:
Feb. 02, 2024
Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA (US);
Mitsubishi Electric Corporation, Tokyo, JP;
Jianlin Guo, Newton, MA (US);
Kieran Parsons, Gloucester, MA (US);
Philip Orlik, Cambridge, MA (US);
Takenori Sumi, Tokyo, JP;
Yukimasa Nagai, Tokyo, JP;
Yuki Kawashima, Tokyo, JP;
Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA (US);
Mitsubishi Electric Corporation, Tokyo, JP;
Abstract
A node device for forming a multi-hop network is provided. The node device is configured to discover two routing topologies, a regular routing topology for regular data delivery and a priority topology for priority data delivery. The regular routes are discovered for all data nodes in an IoT network and priority routes are discovered for priority data nodes only. The regular data routes (D-Routes) are discovered using a distance based route discovery protocol RPL and the priority routes (P-Routes) are optimally discovered for priority data nodes only to minimize route overlap, route transmission time and route length. The node device includes a transceiver configured to receive and transmit regular data in a Destination Oriented Directed Acyclic Graph (DODAG) based topology and priority data in an optimal routing topology, a memory configured to store computer executable programs including a communication mode (CM), multi-rate link count (MLC), degree of route overlap (DRO), neighbor information, route transmission time and route length, and a processor configured to perform steps of the computer executable programs. The steps include discovering D-Routes and discovering P-Routes, which in turn includes acyclic route discovery, minimal overlap route discovery, minimal transmission time route discovery and minimal length route discovery.