[go: up one dir, main page]

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 SAS
Original Assignee
Bull SAS
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 SAS filed Critical Bull SAS
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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

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
FR1904713 2019-05-06
FR1904713A FR3095914B1 (en) 2019-05-06 2019-05-06 Dynamic routing method in a network of connected objects

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
WO2016019287A2 (en) * 2014-07-31 2016-02-04 Convida Wireless, Llc Mechanism and service for device naming
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
CN107832834B (en) Method for constructing WIFI indoor positioning fingerprint database based on generation countermeasure network
Whelan et al. Vesper 1.5–spatial prediction software for precision agriculture
Riera et al. Deep multiview image fusion for soybean yield estimation in breeding applications
FR3088464B1 (en) Neural network construction method for simulating physical systems
Zhang et al. Cloud-based framework for scalable and real-time multi-robot slam
CN108768736B (en) An Optimization Method for Embedding Cost of Hybrid Service Function Chain
CN106408132A (en) Method and device of crop yield prediction based on plantation device
FR3067496B1 (en) DESCRIPTOR LEARNING PROCESS FOR THE DETECTION AND LOCATION OF OBJECTS IN A VIDEO
FR3095914B1 (en) Dynamic routing method in a network of connected objects
Khalid et al. Service architecture models for fog computing: a remedy for latency issues in data access from clouds
CN110798618A (en) Camera resource scheduling method and device in dynamic tracking
Kumari et al. Multidisciplinary real-time model for smart agriculture based on weather forecasting using IoT, machine learning, big data and cloud
Jones et al. Genetic networks in ecology: A guide to population, relatedness, and pedigree networks and their applications in conservation biology
CN112153595A (en) End-edge-cloud cooperative data transmission method for AGV scene movement of intelligent factory
Park et al. A closeness centrality analysis algorithm for workflow-supported social networks
CN105991708A (en) Selection method of application server, apparatus and system thereof
Morera‐Pujol et al. Methods to detect spatial biases in tracking studies caused by differential representativeness of individuals, populations and time
Carius et al. Cloud-based cross-platform collaborative ar in flutter
CN116402275A (en) Dynamic selection method of unmanned vehicle for dam intelligent collaborative inspection
CN117880206A (en) Load balancing method and system for Internet of things management equipment
Jandl IoT and edge computing technologies for vertical farming from seed to harvesting
Gomez et al. Monitoring of small crops for the measurement of environmental factors through the internet of things (IoT)
FR3095917B1 (en) Dynamic routing method in interconnected networks of connected objects
de Sá et al. Genetic and backtracking search optimization algorithms applied to localization problems
FR3061391B1 (en) COMPUTER NETWORK OF KNOTS COMMUNICATING BETWEEN THEM THROUGH PAIR MESSAGES AND INTERCONNECTION METHOD BETWEEN NODES ASSOCIATED THEREWITH

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

PLFP Fee payment

Year of fee payment: 6

PLFP Fee payment

Year of fee payment: 7