Search arXiv⌕ Search

arXiv subjects

Chikara Ohta

Publications and source records attributed to Chikara Ohta.

5 recordsLinked to original sources

Denoising Rather Than Gap Filling: Missing-Data Handling in Sparse Outdoor BLE Positioning

Received signal strength indicator (RSSI) positioning outdoors has one to two orders of magnitude fewer anchors than the indoor systems its methods come from. In the ten-day cattle-tracking deployment reported here, four gateways cover $4{,}302\,\mathrm{m}^2$, or $0.93$ anchors per $1000\,\mathrm{m}^2$. An animal is heard by $0.99$ gateways per second on average, so the observation vector for a given second is almost never complete. How the gaps are filled is therefore a first-order design choice, not a preprocessing detail. Filling at all is worth $8.1\,\mathrm{m}$, $96\%$ of the improvement the hold-length setting can deliver and a $29\%$ error reduction. How long a value is then held is worth the remaining $4\%$, from four seconds to unbounded. Once a value is available, the gain comes from removing noise rather than rebuilding the lost sample: a filtered channel estimate improves on a held raw sample, whereas filling backwards from future samples makes it worse. As that mechanism predicts, smoothing strength has a real interior optimum that is costly to miss in either direction. A smoother allowed to read the future gains only $0.55\,\mathrm{m}$, one fifteenth of what filling is worth, which bounds what any offline method can add. Three method families do not apply here for structural reasons rather than poor performance: two or more of the four channels are live in only $25\%$ of seconds, so the cross-channel structure generative imputation must learn is largely unobserved.

eess.SP↗

A Study on E2E Performance Improvement of Platooning Using Outdoor LiFi

Platooning within autonomous vehicles has proven effective in addressing driver shortages and reducing fuel consumption. However, as platooning lengths increase, traditional C-V2X (cellular vehicle-to-everything) architectures are susceptible to end-to-end (E2E) latency increases. This is due to the necessity of relaying information through multiple hops from the leader vehicle to the last vehicle. To address this problem, this paper proposes a hybrid communication architecture based on a simulation that integrates light fidelity (LiFi) and C-V2X. The proposed architecture introduces multiple-leader vehicles equipped with outdoor LiFi communication nodes in platoons to achieve high-speed and low-delay communication between leader vehicles, which reduces E2E delay.

cs.NI↗

NR Cell Identity-based Handover Decision-making Algorithm for High-speed Scenario within Dual Connectivity

The dense deployment of 5G heterogeneous networks (HetNets) has improved network capacity. However, it also brings frequent and unnecessary handover challenges to high-speed mobile user equipment (UE), resulting in unstable communication and degraded quality of service. Traditional handovers ignore the type of target next-generation Node B (gNB), resulting in high-speed UEs being able to be handed over to any gNB. This paper proposes a NR cell identity (NCI)-based handover decision-making algorithm (HDMA) to address this issue. The proposed HDMA identifies the type of the target gNB (macro/small/mmWave gNB) using the gNB identity (ID) within the NCI to improve the handover decision-making strategy. The proposed HDMA aims to improve the communication stability of high-speed mobile UE by enabling high-speed UEs to identify the target gNB type during the HDMA using the gNB ID. Simulation results show that the proposed HDMA outperforms other HDMAs in enhanced connection stability.

cs.NI↗

Supercharging the APGAS Programming Model with Relocatable Distributed Collections

In this article we present our relocatable distributed collections library. Building on top of the AGPAS for Java library, we provide a number of useful intra-node parallel patterns as well as the features necessary to support the distributed nature of the computation through clearly identified methods. In particular, the transfer of distributed collections' entries between processes is supported via an integrated relocation system. This enables dynamic load-balancing capabilities, making it possible for programs to adapt to uneven or evolving cluster performance. The system we developed makes it possible to dynamically control the distribution and the data-flow of distributed programs through high-level abstractions. Programmers using our library can therefore write complex distributed programs combining computation and communication phases through a consistent API. We evaluate the performance of our library against two programs taken from well-known Java benchmark suites, demonstrating superior programmability, and obtaining better performance on one benchmark and reasonable overhead on the second. Finally, we demonstrate the ease and benefits of load-balancing and on a more complex application which uses the various features of our library extensively.

cs.DC↗

Topic Allocation Method on Edge Servers for Latency-sensitive Notification Service

The importance of real-time notification has been growing for social services and Intelligent Transporting System (ITS). As an advanced version of Pub/Sub systems, publish-process-subscribe systems, where published messages are spooled and processed on edge servers, have been proposed to achieve data-driven intelligent notifications. In this paper, we present a system that allows a topic to be managed on multiple edge servers so that messages are processed near the publishers, even when publishers are spread over a wide area. Duplicating messages on geographically distributed servers could enable immediate notification to neighboring subscribers. However, the duplicated message spool may cause exhaustion of resources. We prepare a formal model of our publish-process-subscribe system and formulate the topic allocation as an optimization problem under the resource constraints of edge servers. As the optimization problem is NP-hard, we propose heuristics leveraging the locality and the pub/sub relationships observed between clients to use the edge server resources efficiently. Our performance evaluation shows that our method reduces the delay to deliver notifications and the effectiveness of the strategy exploiting the relationships between clients.

cs.NI↗