Laplace Equation-Based High-Speed Autonomous Clustering for MANET
R. Kawasaki, C. Takano, and M. Aida. 32th International Teletraffic Congress (ITC 32), Ph.D. Workshop, Osaka, Japan, (2020)
Abstract
Autonomous decentralized clustering technologies to realize hierarchical route control for mobile ad hoc network terminals have been studied. The autonomous decentralized clustering must be able to realize clustering that can adapt to various movement patterns of terminals. Particularly, it must be effective even when user density is very high, such as around a train station during rush hour. However, existing methods have found that the cluster structure cannot be maintained when user density becomes very high. This paper proposes an autonomous decentralized clustering method that can maintain the cluster structure even if user density is high. We introduce an autonomous decentralized algorithm based on the Laplace equation that enables the method to quickly respond to user movement.
%0 Conference Paper
%1 rio20ITC32-WS
%A Kawasaki, Rio
%A Takano, Chisa
%A Aida, Masaki
%B 32th International Teletraffic Congress (ITC 32), Ph.D. Workshop
%C Osaka, Japan
%D 2020
%K Laplace_equation MANET autonomous_decentralized_clustering high-speed_clustering itc itc32
%T Laplace Equation-Based High-Speed Autonomous Clustering for MANET
%U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/rio20ITC32-WS.pdf?inline=true
%X Autonomous decentralized clustering technologies to realize hierarchical route control for mobile ad hoc network terminals have been studied. The autonomous decentralized clustering must be able to realize clustering that can adapt to various movement patterns of terminals. Particularly, it must be effective even when user density is very high, such as around a train station during rush hour. However, existing methods have found that the cluster structure cannot be maintained when user density becomes very high. This paper proposes an autonomous decentralized clustering method that can maintain the cluster structure even if user density is high. We introduce an autonomous decentralized algorithm based on the Laplace equation that enables the method to quickly respond to user movement.
@inproceedings{rio20ITC32-WS,
abstract = {Autonomous decentralized clustering technologies to realize hierarchical route control for mobile ad hoc network terminals have been studied. The autonomous decentralized clustering must be able to realize clustering that can adapt to various movement patterns of terminals. Particularly, it must be effective even when user density is very high, such as around a train station during rush hour. However, existing methods have found that the cluster structure cannot be maintained when user density becomes very high. This paper proposes an autonomous decentralized clustering method that can maintain the cluster structure even if user density is high. We introduce an autonomous decentralized algorithm based on the Laplace equation that enables the method to quickly respond to user movement.},
added-at = {2021-03-02T15:22:25.000+0100},
address = {Osaka, Japan},
author = {Kawasaki, Rio and Takano, Chisa and Aida, Masaki},
biburl = {https://www.bibsonomy.org/bibtex/2e55f6b60e8412d5507f16c69e50c335d/itc},
booktitle = {32th International Teletraffic Congress (ITC 32), Ph.D. Workshop},
interhash = {99c238d3476800323c07ec7e6ab934c6},
intrahash = {e55f6b60e8412d5507f16c69e50c335d},
keywords = {Laplace_equation MANET autonomous_decentralized_clustering high-speed_clustering itc itc32},
timestamp = {2021-03-02T15:22:25.000+0100},
title = {Laplace Equation-Based High-Speed Autonomous Clustering for MANET},
url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/rio20ITC32-WS.pdf?inline=true},
year = 2020
}