FR3095914B1 - Dynamic routing method in a network of connected objects - Google Patents

Dynamic routing method in a network of connected objects Download PDF

Info

Publication number
FR3095914B1
FR3095914B1 FR1904713A FR1904713A FR3095914B1 FR 3095914 B1 FR3095914 B1 FR 3095914B1 FR 1904713 A FR1904713 A FR 1904713A FR 1904713 A FR1904713 A FR 1904713A FR 3095914 B1 FR3095914 B1 FR 3095914B1
Authority
FR
France
Prior art keywords
network
connected objects
dynamic routing
routing method
connection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
FR1904713A
Other languages
French (fr)
Other versions
FR3095914A1 (en
Inventor
Bruno Demeilliez
Gilles Menigot
Wajih Chaabane
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bull SA
Original Assignee
Bull SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bull SA filed Critical Bull SA
Priority to FR1904713A priority Critical patent/FR3095914B1/en
Priority to US16/730,177 priority patent/US11108680B2/en
Priority to EP19220131.7A priority patent/EP3675435A1/en
Publication of FR3095914A1 publication Critical patent/FR3095914A1/en
Application granted granted Critical
Publication of FR3095914B1 publication Critical patent/FR3095914B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

Il est proposé un procédé de routage dynamique dans un réseau d’objets connectés comprenant au moins deux passerelles de connexion à au moins un réseau de transport de données. En particulier, le procédé permet à chaque passerelle de connexion d’un réseau d’objets connectés de connaître en temps réel l’évolution de son environnement et de sélectionner un chemin de transmission d’un message d’un objet connecté à une autre associé à un niveau de performance (de la transmission) optimal. Figure à publier avec l’abrégé : Figure 2A dynamic routing method is proposed in a network of connected objects comprising at least two gateways for connection to at least one data transport network. In particular, the method allows each connection gateway of a network of connected objects to know in real time the evolution of its environment and to select a transmission path of a message from one connected object to another associated one. at an optimum performance level (of the transmission). Figure to be published with the abstract: Figure 2

FR1904713A 2018-12-31 2019-05-06 Dynamic routing method in a network of connected objects Active FR3095914B1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
FR1904713A FR3095914B1 (en) 2019-05-06 2019-05-06 Dynamic routing method in a network of connected objects
US16/730,177 US11108680B2 (en) 2018-12-31 2019-12-30 Dynamic routing method in a network of connected objects
EP19220131.7A EP3675435A1 (en) 2018-12-31 2019-12-30 Method for dynamic routing in a network of connected objects

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1904713A FR3095914B1 (en) 2019-05-06 2019-05-06 Dynamic routing method in a network of connected objects
FR1904713 2019-05-06

Publications (2)

Publication Number Publication Date
FR3095914A1 FR3095914A1 (en) 2020-11-13
FR3095914B1 true FR3095914B1 (en) 2021-05-28

Family

ID=67742742

Family Applications (1)

Application Number Title Priority Date Filing Date
FR1904713A Active FR3095914B1 (en) 2018-12-31 2019-05-06 Dynamic routing method in a network of connected objects

Country Status (1)

Country Link
FR (1) FR3095914B1 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6879806B2 (en) * 2001-06-01 2005-04-12 Zensys A/S System and a method for building routing tables and for routing signals in an automation system
US9705747B1 (en) * 2012-12-04 2017-07-11 Qualcomm Incorporated Distributed path selection in hybrid networks
KR101997370B1 (en) * 2014-07-31 2019-10-01 콘비다 와이어리스, 엘엘씨 Server for device location registration in an internet of things(iot)
US10530603B2 (en) 2017-01-11 2020-01-07 Smartiply, Inc. Intelligent multi-modal IOT gateway

Also Published As

Publication number Publication date
FR3095914A1 (en) 2020-11-13

Similar Documents

Publication Publication Date Title
Peralta et al. Fog computing based efficient IoT scheme for the Industry 4.0
Bayrak et al. Shortest path network interdiction with asymmetric information
CN104579854A (en) Crowdsourcing test method
Kicherer et al. Automatic image‐based determination of pruning mass as a determinant for yield potential in grapevine management and breeding
CN101977249B (en) Method for penetrating NAT (Network Address Translation) equipment
FR3095914B1 (en) Dynamic routing method in a network of connected objects
Nayyar et al. Simulation and performance comparison of ant colony optimization (ACO) routing protocol with AODV, DSDV, DSR routing protocols of wireless sensor networks using NS-2 simulator
CN111400040A (en) Industrial Internet system based on deep learning and edge calculation and working method
FR3067496B1 (en) DESCRIPTOR LEARNING PROCESS FOR THE DETECTION AND LOCATION OF OBJECTS IN A VIDEO
Park et al. A closeness centrality analysis algorithm for workflow-supported social networks
Reitz et al. Industry 4.0 beyond the factory: An application to forestry
Hroob et al. Benchmark of visual and 3D lidar SLAM systems in simulation environment for vineyards
Khalid et al. Service architecture models for fog computing: a remedy for latency issues in data access from clouds
CN105991708A (en) Selection method of application server, apparatus and system thereof
Crespi et al. Effects of different dynamics in an ant colony optimization algorithm
CN110798618B (en) Camera resource scheduling method and device in dynamic tracking
CN108759920A (en) A kind of depot safety monitoring system based on Internet of Things
CN104573864A (en) Data analysis alarm method based on autoregressive prediction
Carius et al. Cloud-based cross-platform collaborative ar in flutter
FR3095917B1 (en) Dynamic routing method in interconnected networks of connected objects
CN100508491C (en) Method of preventing effectively non-structure equal network covering network segmentation problem
Rudolph et al. A taxonomy for organic computing systems regarding mutual influences
Fatouros et al. Enhancing Smart Agriculture Scenarios with Low-code, Pattern-oriented functionalities for Cloud/Edge collaboration
CN110674143A (en) No-tillage machine operation information monitoring system and method
Pagano et al. SWI-FEED: Smart Water IoT Framework for Evaluation of Energy and Data in Massive Scenarios

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20201113

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4

PLFP Fee payment

Year of fee payment: 5