The Experts below are selected from a list of 3486 Experts worldwide ranked by ideXlab platform
Yuji Yamakawa - One of the best experts on this subject based on the ideXlab platform.
-
reference Broadcast Frame synchronization for distributed high speed camera network
Static Analysis Symposium, 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
-
SAS - Reference Broadcast Frame synchronization for distributed high-speed camera network
2018 IEEE Sensors Applications Symposium (SAS), 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
Hyuno Kim - One of the best experts on this subject based on the ideXlab platform.
-
reference Broadcast Frame synchronization for distributed high speed camera network
Static Analysis Symposium, 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
-
SAS - Reference Broadcast Frame synchronization for distributed high-speed camera network
2018 IEEE Sensors Applications Symposium (SAS), 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
Masatoshi Ishikawa - One of the best experts on this subject based on the ideXlab platform.
-
reference Broadcast Frame synchronization for distributed high speed camera network
Static Analysis Symposium, 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
-
SAS - Reference Broadcast Frame synchronization for distributed high-speed camera network
2018 IEEE Sensors Applications Symposium (SAS), 2018Co-Authors: Hyuno Kim, Masatoshi Ishikawa, Yuji YamakawaAbstract:Frame synchronization using reference Broadcast is a promising method for distributed high-speed camera network due to its intuitive synchronization structure. This paper examines the performance of reference Broadcast scheme based on Message Passing Interface at camera node level. For this purpose, the event time distribution regarding reference signal receiving and image capturing is statistically analyzed. We built a high-speed camera network consisting of 8 camera nodes and attained a high accuracy of Frame synchronization, with a standard deviation on the order of tens of microseconds. In order to prove the synchronized operation of high-speed camera network at 1,000 Hz, an experiment with fast flashing LED is conducted.
Jon Crowcroft - One of the best experts on this subject based on the ideXlab platform.
-
Path-Moose : A Scalable All-Path Bridging Protocol
IEICE Transactions on Communications, 2013Co-Authors: Guillermo Ibanez, Ivan Marsa-maestre, Miguel A. Lopez-carmona, Ignacio Pérez-ibáñez, Jun Tanaka, Jon CrowcroftAbstract:This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a Broadcast Frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.
-
Path-Moose: A Scalable All-Path Bridging Protocol
IEICE Transactions on Communications, 2013Co-Authors: Guillermo Ib^|^aacute;^|^ntilde;ez, Jun Tanaka, Iv^|^aacute;n Mars^|^aacute;-maestre, Miguel A. L^|^oacute;pez-carmona, Ignacio P^|^eacute;rez-ib^|^aacute;^|^ntilde;ez, Jon CrowcroftAbstract:This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a Broadcast Frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.This work was supported in part by grants from Comunidad de Madrid and Universidad de Alcal´a through the following projects: MEDIANET-CM (S-2009/TIC-468), EMARECE (PII1I09-0204-4319) and CMAC (UAH2011/EXP-016).Publicad
Waltenegus Dargie - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Minimization of the Diffusion Delay of a Tree-Based Wireless Sensor Network
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: Francois Delobel, Alexandre Guitton, Michel Misson, Waltenegus DargieAbstract:In wireless sensor networks, saving energy is crucial in order to increase the network lifetime. Energy is often saved by synchronizing the nodes activity, and having long periods of inactivity, or by having nodes exchange a global activity schedule. The synchronization and the exchange of a global schedule are two examples where information is boadcast from a specific node to the whole network. In this paper, we focus on the delay required to Broadcast information in the whole network using a tree topology. We first show that the diffusion delay can be significantly reduced by utilizing the parallelization of node processing. We provide an algorithm in order to find optimal solutions when transmissions are sequential. Then, we propose a linear algorithm that is able to find good solutions. We compare the exact solution to the heuristic solution on a workstation and conclude that our heuristic is very competitive and can be used to reduce the diffusion delay of a Broadcast Frame in a tree.
-
Minimization of the Diffusion Delay of a Tree-Based Wireless Sensor Network
2011Co-Authors: Francois Delobel, Alexandre Guitton, Michel Misson, Waltenegus DargieAbstract:In wireless sensor networks, saving energy is crucial in order to increase the network lifetime. Energy is often saved by synchronizing the nodes activity, and having long periods of inactivity, or by having nodes exchange a global activity schedule. The synchronization and the exchange of a global schedule are two examples where information is Broadcast from a specific node to the whole network. In this paper, we focus on the delay required to Broadcast information in the whole network using a tree topology. We first show that the diffusion delay can be significantly reduced by utilizing the parallelization of node processing. We provide an exact algorithm in order to find optimal solutions. Then, we propose a linear algorithm that is able to find good solutions. We compare the exact solution to the heuristic solution on a workstation and conclude that our heuristic is very competitive and can be used to reduce the diffusion delay of a Broadcast Frame in a tree.
