Mobile agent rendezvous on a probabilistic edge evolving ring

Yukiko Yamauchi, Tomoko Izumi, Sayaka Kamei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Rendezvous problem, which requires all mobile agents to gather on a single vertex, is one of the crucial methods for mobile agent systems. In previous studies on the rendezvous problem, mobile agents move on a static environment where the network topology does not change during the execution. However, in dynamic networks such as wireless mobile ad-hoc networks, the network continuously changes because of movements of vertices and interference of wireless signal. In this paper, we investigate the rendezvous problem in dynamic environment which is modeled by a probabilistic edge evolving graph. A probabilistic edge evolving graph is a sequence of subgraphs of an original graph G where each edge of G is contained in each subgraph probabilistically. We present a rendezvous algorithm for an evolving graph whose original graph is a ring, and its expected rendezvous time until two agents gather on a vertex. The analysis results show the impact of the initial directions to which agents start to move and the consistency of local port numbering during the execution on the expected rendezvous time.

Original languageEnglish
Title of host publicationProceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012
PublisherIEEE Computer Society
Pages103-112
Number of pages10
ISBN (Print)9780769548937
DOIs
Publication statusPublished - Jan 1 2012
Event2012 3rd International Conference on Networking and Computing, ICNC 2012 - Naha, Okinawa, Japan
Duration: Dec 5 2012Dec 7 2012

Other

Other2012 3rd International Conference on Networking and Computing, ICNC 2012
CountryJapan
CityNaha, Okinawa
Period12/5/1212/7/12

Fingerprint

Mobile agents
Wireless ad hoc networks
Mobile ad hoc networks
Topology

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Yamauchi, Y., Izumi, T., & Kamei, S. (2012). Mobile agent rendezvous on a probabilistic edge evolving ring. In Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012 (pp. 103-112). [6424549] IEEE Computer Society. https://doi.org/10.1109/ICNC.2012.23

Mobile agent rendezvous on a probabilistic edge evolving ring. / Yamauchi, Yukiko; Izumi, Tomoko; Kamei, Sayaka.

Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012. IEEE Computer Society, 2012. p. 103-112 6424549.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yamauchi, Y, Izumi, T & Kamei, S 2012, Mobile agent rendezvous on a probabilistic edge evolving ring. in Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012., 6424549, IEEE Computer Society, pp. 103-112, 2012 3rd International Conference on Networking and Computing, ICNC 2012, Naha, Okinawa, Japan, 12/5/12. https://doi.org/10.1109/ICNC.2012.23
Yamauchi Y, Izumi T, Kamei S. Mobile agent rendezvous on a probabilistic edge evolving ring. In Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012. IEEE Computer Society. 2012. p. 103-112. 6424549 https://doi.org/10.1109/ICNC.2012.23
Yamauchi, Yukiko ; Izumi, Tomoko ; Kamei, Sayaka. / Mobile agent rendezvous on a probabilistic edge evolving ring. Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012. IEEE Computer Society, 2012. pp. 103-112
@inproceedings{8bc223ec74644c65aaab7e5658c012b1,
title = "Mobile agent rendezvous on a probabilistic edge evolving ring",
abstract = "Rendezvous problem, which requires all mobile agents to gather on a single vertex, is one of the crucial methods for mobile agent systems. In previous studies on the rendezvous problem, mobile agents move on a static environment where the network topology does not change during the execution. However, in dynamic networks such as wireless mobile ad-hoc networks, the network continuously changes because of movements of vertices and interference of wireless signal. In this paper, we investigate the rendezvous problem in dynamic environment which is modeled by a probabilistic edge evolving graph. A probabilistic edge evolving graph is a sequence of subgraphs of an original graph G where each edge of G is contained in each subgraph probabilistically. We present a rendezvous algorithm for an evolving graph whose original graph is a ring, and its expected rendezvous time until two agents gather on a vertex. The analysis results show the impact of the initial directions to which agents start to move and the consistency of local port numbering during the execution on the expected rendezvous time.",
author = "Yukiko Yamauchi and Tomoko Izumi and Sayaka Kamei",
year = "2012",
month = "1",
day = "1",
doi = "10.1109/ICNC.2012.23",
language = "English",
isbn = "9780769548937",
pages = "103--112",
booktitle = "Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012",
publisher = "IEEE Computer Society",
address = "United States",

}

TY - GEN

T1 - Mobile agent rendezvous on a probabilistic edge evolving ring

AU - Yamauchi, Yukiko

AU - Izumi, Tomoko

AU - Kamei, Sayaka

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Rendezvous problem, which requires all mobile agents to gather on a single vertex, is one of the crucial methods for mobile agent systems. In previous studies on the rendezvous problem, mobile agents move on a static environment where the network topology does not change during the execution. However, in dynamic networks such as wireless mobile ad-hoc networks, the network continuously changes because of movements of vertices and interference of wireless signal. In this paper, we investigate the rendezvous problem in dynamic environment which is modeled by a probabilistic edge evolving graph. A probabilistic edge evolving graph is a sequence of subgraphs of an original graph G where each edge of G is contained in each subgraph probabilistically. We present a rendezvous algorithm for an evolving graph whose original graph is a ring, and its expected rendezvous time until two agents gather on a vertex. The analysis results show the impact of the initial directions to which agents start to move and the consistency of local port numbering during the execution on the expected rendezvous time.

AB - Rendezvous problem, which requires all mobile agents to gather on a single vertex, is one of the crucial methods for mobile agent systems. In previous studies on the rendezvous problem, mobile agents move on a static environment where the network topology does not change during the execution. However, in dynamic networks such as wireless mobile ad-hoc networks, the network continuously changes because of movements of vertices and interference of wireless signal. In this paper, we investigate the rendezvous problem in dynamic environment which is modeled by a probabilistic edge evolving graph. A probabilistic edge evolving graph is a sequence of subgraphs of an original graph G where each edge of G is contained in each subgraph probabilistically. We present a rendezvous algorithm for an evolving graph whose original graph is a ring, and its expected rendezvous time until two agents gather on a vertex. The analysis results show the impact of the initial directions to which agents start to move and the consistency of local port numbering during the execution on the expected rendezvous time.

UR - http://www.scopus.com/inward/record.url?scp=84874265632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874265632&partnerID=8YFLogxK

U2 - 10.1109/ICNC.2012.23

DO - 10.1109/ICNC.2012.23

M3 - Conference contribution

AN - SCOPUS:84874265632

SN - 9780769548937

SP - 103

EP - 112

BT - Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012

PB - IEEE Computer Society

ER -