Kshemkalyani et al., 2020 - Google Patents

Efficient dispersion of mobile robots on dynamic graphs

Kshemkalyani et al., 2020

View PDF
Document ID
1237176078449455777
Author
Kshemkalyani A
Molla A
Sharma G
Publication year
Publication venue
2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)

External Links

Snippet

The dispersion problem on graphs asks k≤ n robots placed initially arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a distinct node of the graph. This problem is of significant interest due to its …
Continue reading at www.cs.uic.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • H04L12/4625—Single bridge functionality, e.g. connection of two networks over a single bridge
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • 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/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
    • H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
    • 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/12—Shortest path evaluation
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details

Similar Documents

Publication Publication Date Title
Kshemkalyani et al. Efficient dispersion of mobile robots on dynamic graphs
Wilkov Analysis and design of reliable computer networks
Kshemkalyani et al. Dispersion of mobile robots on grids
Flocchini et al. Computing without communicating: Ring exploration by asynchronous oblivious robots
Talukdar et al. Exact topology reconstruction of radial dynamical systems with applications to distribution system of the power grid
Misra et al. Rotation of CDS via connected domatic partition in ad hoc sensor networks
US9614735B2 (en) Bounded-budget monitor deployment in monitoring networks via end-to-end probes
Pattanayak et al. Maximal independent set via mobile agents
Das et al. Collaborative exploration by energy-constrained mobile robots
Markou et al. Black hole search and exploration in unoriented tori with synchronous scattered finite automata
CN120075129A (en) Multicast routing method in system on chip, computer equipment and program product
Molla et al. Fast deterministic gathering with detection on arbitrary graphs: the power of many robots
Dereniowski et al. Fast collaborative graph exploration
Zhang et al. Modelling critical node attacks in MANETs
Pei et al. Stars: Static relays for remote sensing in multirobot real-time search and monitoring
Saxena et al. Path connected dynamic graphs with a study of efficient dispersion
Chalopin et al. Tight bounds for scattered black hole search in a ring
Shahraeini et al. Comparison of meta-heuristic algorithms for solving dominating set problems in wams design
Flocchini et al. Mapping an unfriendly subway system
Gao et al. Preferential link tomography: Monitor assignment for inferring interesting link metrics
Balamohan et al. Improving the optimal bounds for black hole search in rings
Mazza et al. Flexible Qubit Allocation of Network Resource States
Onsu et al. Scalability assurance in SFC provisioning via distributed design for deep reinforcement learning
Kshemkalyani et al. Efficient dispersion of mobile robots on arbitrary graphs and grids
Truong et al. Repairing wireless sensor network connectivity with mobility and hop-count constraints