Self-Stabilizing Agent Traversal on Tree Networks

被引用文献1件 参考文献28件

この論文をさがす

抄録

This paper introduces the problem of n mobile agents that repeatedly visit all n nodes of a given network, subject to the constraint that no two agents can simultaneously occupy a node. This paper first presents a self-stabilizing phase-based protocol for a tree network on a synchronous model. The protocol realizes agent traversal with O(Δn) time where n is the number of nodes and Δ is the maximum degree of any vertex in the communication network. The phase-based protocol can also be applied to an asynchronous model and a ring network. This paper also presents a selfstabilizing link-alternator-based protocol with agent traversal time of O(Δn) for a tree network on an asynchronous model. The protocols are proved to be asymptotically optimal with respect to the agent traversal time.

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (28)*注記

もっと見る

キーワード

詳細情報 詳細情報について

  • CRID
    1571980077395714048
  • NII論文ID
    110003213887
  • NII書誌ID
    AA10826272
  • ISSN
    09168532
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ