• Title/Summary/Keyword: Continuous Path Generation Method

Search Result 12, Processing Time 0.017 seconds

Geometric Optimization Algorithm for Path Loss Model of Riparian Zone IoT Networks Based on Federated Learning Framework

  • Yu Geng;Tiecheng Song;Qiang Wang;Xiaoqin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.7
    • /
    • pp.1774-1794
    • /
    • 2024
  • In the field of environmental sensing, it is necessary to develop radio planning techniques for the next generation Internet of Things (IoT) networks over mixed terrains. Such techniques are needed for smart remote monitoring of utility supplies, with links situated close to but out of range of cellular networks. In this paper, a three-dimension (3-D) geometric optimization algorithm is proposed, considering the positions of edge IoT devices and antenna coupling factors. Firstly, a multi-level single linkage (MLSL) iteration method, based on geometric objectives, is derived to evaluate the data rates over ISM 915 MHz channels, utilizing optimized power-distance profiles of continuous waves. Subsequently, a federated learning (FL) data selection algorithm is designed based on the 3-D geometric positions. Finally, a measurement example is taken in a meadow biome of the Mexican Colima district, which is prone to fluvial floods. The empirical path loss model has been enhanced, demonstrating the accuracy of the proposed optimization algorithm as well as the possibility of further prediction work.

A Tessellation of a Planar Polynomial Curve and Its Offset (평면곡선과 오프셋곡선의 점열화)

  • Ju, S.Y.;Chu, H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.2
    • /
    • pp.158-163
    • /
    • 2004
  • Curve tessellation, which generates a sequence of points from a curve, is very important for curve rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal deviation. Our approach has two merits. One is that it guarantees satisfaction of a given tolerance, and the other is that it can be applied in not only a polynomial curve but its offset. Especially the point sequence generated from an original curve can cause over-cutting in NC machining. This problem can be solved by using the point sequence generated from the offset curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.