Dynamic optimization of communication path relayed by optimally controlled mobile nodes

Yasuo Yanagihara, Takehiro Higuchi, Seiya Ueno

Abstract

Recent ad-hoc network realized a dynamically changing communication path which is determined by spatial coordination of nodes. But this dynamic reconfiguration of networking gives a delay which is not feasible for actual control system. We supposed a system composed of a stationary node, a moving node with given motion and relaying mobile nodes. The system keeps a communication path between the stationary node and the moving node by optimal control of relaying nodes. The task is set to minimize the distance along the communication path. In order to achieve this task, simultaneous optimization of a communication path and spatial coordination of relaying nodes is needed. Similar graphs are supposed to have similarities in controlling of relaying nodes. The similarity of communication paths can be expressed as a "graphic transition diagram." Using this diagram, we propose a method to find a time series of graphs of communication paths and optimal control of relaying node. This method gave a converging result which can keep the connection with a smaller cost function.

Original languageEnglish
Title of host publication2015 IEEE/SICE International Symposium on System Integration, SII 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages289-294
Number of pages6
ISBN (Print)9781467372428
DOIs
StatePublished - 2016 Feb 10
Event8th Annual IEEE/SICE International Symposium on System Integration, SII 2015 - Nagoya, Japan

Other

Other8th Annual IEEE/SICE International Symposium on System Integration, SII 2015
CountryJapan
CityNagoya
Period15/12/1115/12/13

Fingerprint

Communication
Ad hoc networks
Cost functions
Time series
Control systems

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering

Cite this

Yanagihara, Y., Higuchi, T., & Ueno, S. (2016). Dynamic optimization of communication path relayed by optimally controlled mobile nodes. In 2015 IEEE/SICE International Symposium on System Integration, SII 2015. (pp. 289-294). [7404993] Institute of Electrical and Electronics Engineers Inc.. DOI: 10.1109/SII.2015.7404993

Dynamic optimization of communication path relayed by optimally controlled mobile nodes. / Yanagihara, Yasuo; Higuchi, Takehiro; Ueno, Seiya.

2015 IEEE/SICE International Symposium on System Integration, SII 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 289-294 7404993.

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

Yanagihara, Y, Higuchi, T & Ueno, S 2016, Dynamic optimization of communication path relayed by optimally controlled mobile nodes. in 2015 IEEE/SICE International Symposium on System Integration, SII 2015., 7404993, Institute of Electrical and Electronics Engineers Inc., pp. 289-294, 8th Annual IEEE/SICE International Symposium on System Integration, SII 2015, Nagoya, Japan, 11-13 December. DOI: 10.1109/SII.2015.7404993
Yanagihara Y, Higuchi T, Ueno S. Dynamic optimization of communication path relayed by optimally controlled mobile nodes. In 2015 IEEE/SICE International Symposium on System Integration, SII 2015. Institute of Electrical and Electronics Engineers Inc.2016. p. 289-294. 7404993. Available from, DOI: 10.1109/SII.2015.7404993

Yanagihara, Yasuo; Higuchi, Takehiro; Ueno, Seiya / Dynamic optimization of communication path relayed by optimally controlled mobile nodes.

2015 IEEE/SICE International Symposium on System Integration, SII 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 289-294 7404993.

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

@inbook{cffdf89bd3b34da18c940bb8925d073b,
title = "Dynamic optimization of communication path relayed by optimally controlled mobile nodes",
author = "Yasuo Yanagihara and Takehiro Higuchi and Seiya Ueno",
year = "2016",
month = "2",
doi = "10.1109/SII.2015.7404993",
isbn = "9781467372428",
pages = "289--294",
booktitle = "2015 IEEE/SICE International Symposium on System Integration, SII 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - CHAP

T1 - Dynamic optimization of communication path relayed by optimally controlled mobile nodes

AU - Yanagihara,Yasuo

AU - Higuchi,Takehiro

AU - Ueno,Seiya

PY - 2016/2/10

Y1 - 2016/2/10

N2 - Recent ad-hoc network realized a dynamically changing communication path which is determined by spatial coordination of nodes. But this dynamic reconfiguration of networking gives a delay which is not feasible for actual control system. We supposed a system composed of a stationary node, a moving node with given motion and relaying mobile nodes. The system keeps a communication path between the stationary node and the moving node by optimal control of relaying nodes. The task is set to minimize the distance along the communication path. In order to achieve this task, simultaneous optimization of a communication path and spatial coordination of relaying nodes is needed. Similar graphs are supposed to have similarities in controlling of relaying nodes. The similarity of communication paths can be expressed as a "graphic transition diagram." Using this diagram, we propose a method to find a time series of graphs of communication paths and optimal control of relaying node. This method gave a converging result which can keep the connection with a smaller cost function.

AB - Recent ad-hoc network realized a dynamically changing communication path which is determined by spatial coordination of nodes. But this dynamic reconfiguration of networking gives a delay which is not feasible for actual control system. We supposed a system composed of a stationary node, a moving node with given motion and relaying mobile nodes. The system keeps a communication path between the stationary node and the moving node by optimal control of relaying nodes. The task is set to minimize the distance along the communication path. In order to achieve this task, simultaneous optimization of a communication path and spatial coordination of relaying nodes is needed. Similar graphs are supposed to have similarities in controlling of relaying nodes. The similarity of communication paths can be expressed as a "graphic transition diagram." Using this diagram, we propose a method to find a time series of graphs of communication paths and optimal control of relaying node. This method gave a converging result which can keep the connection with a smaller cost function.

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

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

U2 - 10.1109/SII.2015.7404993

DO - 10.1109/SII.2015.7404993

M3 - Conference contribution

SN - 9781467372428

SP - 289

EP - 294

BT - 2015 IEEE/SICE International Symposium on System Integration, SII 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -