arXiv subjects

Megumi Kaneko

Publications and source records attributed to Megumi Kaneko.

16 recordsLinked to original sources

arXiv2025

Context-aware Rate Adaptation for Predictive Flying Networks using Contextual Bandits

The increasing complexity of wireless technologies, such as Wi-Fi, presents significant challenges for Rate Adaptation (RA) due to the large configuration space of transmission parameters. While extensive research has been conducted on RA for low-mobility networks, existing solutions fail to adapt in flying networks, where high mobility and dynamic wireless conditions introduce additional uncertainty. We propose Linear Upper Confidence Bound for RA (LinRA), a novel Contextual Bandit-based approach that leverages real-time link context to optimize transmission rates. Designed for predictive flying networks, where future trajectories are known, LinRA proactively adapts to obstacles affecting channel quality. Simulation results demonstrate that LinRA converges $\mathbf{5.2\times}$ faster than state-of-the-art benchmarks and improves throughput by 80\% in Non Line-of-Sight (NLoS) conditions, matching the performance of ideal algorithms. With low time complexity, LinRA is a scalable and efficient RA solution for predictive flying networks.

cs.NI↗

arXiv2025

Joint Channel Bandwidth Assignment and Relay Positioning for Predictive Flying Networks

Flying Networks (FNs) have emerged as a promising solution to provide on-demand wireless connectivity when network coverage is insufficient or the communications infrastructure is compromised, such as in disaster management scenarios. Despite extensive research on Unmanned Aerial Vehicle (UAV) positioning and radio resource allocation, the challenge of ensuring reliable traffic relay through backhaul links in predictive FNs remains unexplored. This work proposes Simulated Annealing for predictive FNs (SAFnet), an innovative algorithm that optimizes network performance under positioning constraints, limited bandwidth and minimum rate requirements. Our algorithm uniquely leverages prior knowledge of the first-tier node trajectories to assign bandwidth and dynamically adjust the position of the second-tier flying relay. Building upon Simulated Annealing, our approach enhances this well-known AI algorithm with penalty functions, achieving performance levels comparable to exhaustive search while significantly reducing computational complexity.

cs.NI↗

arXiv2024

Enhancing LR-FHSS Scalability Through Advanced Sequence Design and Demodulator Allocation

The accelerating growth of the Internet of Things (IoT) and its integration with Low-Earth Orbit (LEO) satellites demand efficient, reliable, and scalable communication protocols. Among these, the Long-Range Frequency Hopping Spread Spectrum (LR-FHSS) modulation, tailored for LEO satellite IoT communications, sparks keen interest. This work presents a joint approach to enhancing the scalability of LR-FHSS, addressing the demand for massive connectivity. We deepen into Frequency Hopping Sequence (FHS) mechanisms within LR-FHSS, spotlighting the potential of leveraging Wide-Gap sequences. Concurrently, we introduce two novel demodulator allocation strategies, namely, ``Early-Decode" and ``Early-Drop," to optimize the utilization of LoRa-specific gateway decoding resources. Our research further validates these findings with extensive simulations, offering a comprehensive look into the future potential of LR-FHSS scalability in IoT settings.

cs.NI↗

arXiv2021

Power and Beam Optimization for Uplink Millimeter-Wave Hotspot Communication Systems

We propose an effective interference management and beamforming mechanism for uplink communication systems that yields fair allocation of rates. In particular, we consider a hotspot area of a millimeter-wave (mmWave) access network consisting of multiple user equipment (UE) in the uplink and multiple access points (APs) with directional antennas and adjustable beam widths and directions (beam configurations). This network suffers tremendously from multi-beam multi-user interference, and, to improve the uplink transmission performance, we propose a centralized scheme that optimizes the power, the beam width, the beam direction of the APs, and the UE - AP assignments. This problem involves both continuous and discrete variables, and it has the following structure. If we fix all discrete variables, except for those related to the UE-AP assignment, the resulting optimization problem can be solved optimally. This property enables us to propose a heuristic based on simulated annealing (SA) to address the intractable joint optimization problem with all discrete variables. In more detail, for a fixed configuration of beams, we formulate a weighted rate allocation problem where each user gets the same portion of its maximum achievable rate that it would have under non-interfered conditions. We solve this problem with an iterative fixed point algorithm that optimizes the power of UEs and the UE - AP assignment in the uplink. This fixed point algorithm is combined with SA to improve the beam configurations. Theoretical and numerical results show that the proposed method improves both the UE rates in the lower percentiles and the overall fairness in the network.

cs.NI↗

arXiv2020

Energy Efficient Resource Allocation Optimization in Fog Radio Access Networks with Outdated Channel Knowledge

Fog Radio Access Networks (F-RAN) are gaining worldwide interests for enabling mobile edge computing for Beyond 5G. However, to realize the future real-time and delay-sensitive applications, F-RAN tailored radio resource allocation and interference management become necessary. This work investigates user association and beamforming issues for providing energy efficient F-RANs. We formulate the energy efficiency maximization problem, where the F-RAN specific constraint to guarantee local edge processing is explicitly considered. To solve this intricate problem, we design an algorithm based on the Augmented Lagrangian (AL) method. Then, to alleviate the computational complexity, a heuristic low-complexity strategy is developed, where the tasks are split in two parts: one solving for user association and Fog Access Points (F-AP) activation in a centralized manner at the cloud, based on global but outdated user Channel State Information (CSI) to account for fronthaul delays, and the second solving for beamforming in a distributed manner at each active F-AP based on perfect but local CSIs. Simulation results show that the proposed heuristic method achieves an appreciable performance level as compared to the AL-based method, while largely outperforming the energy efficiency of the baseline F-RAN scheme and limiting the sum-rate degradation compared to the optimized sum-rate maximization algorithm.

cs.NI↗

arXiv2019

Joint Allocation Strategies of Power and Spreading Factors with Imperfect Orthogonality in LoRa Networks

The LoRa physical layer is one of the most promising Low Power Wide-Area Network (LPWAN) technologies for future Internet of Things (IoT) applications. It provides a flexible adaptation of coverage and data rate by allocating different Spreading Factors (SFs) and transmit powers to end-devices. We focus on improving throughput fairness while reducing energy consumption. Whereas most existing methods assume perfect SF orthogonality and ignore the harmful effects of inter-SF interferences, we formulate a joint SF and power allocation problem to maximize the minimum uplink throughput of end-devices, subject to co-SF and inter-SF interferences, and power constraints. This results into a mixed-integer non-linear optimization, which, for tractability, is split into two sub-problems: firstly, the SF assignment for fixed transmit powers, and secondly, the power allocation given the previously obtained assignment solution. For the first sub-problem, we propose a low-complexity many-to-one matching algorithm between SFs and end-devices. For the second one, given its intractability, we transform it using two types of constraints approximation: a linearized and a quadratic version. Our performance evaluation demonstrates that the proposed joint SF allocation and power optimization enables to drastically enhance various performance objectives such as throughput, fairness and power consumption, and that it outperforms baseline schemes.

cs.NI↗

arXiv2019

Interference Management in NOMA-based Fog-Radio Access Networks via Joint Scheduling and Power Adaptation

Non-Orthogonal Multiple Access (NOMA) and Fog Radio Access Networks (FRAN) are promising candidates within the 5G and beyond systems. This work examines the benefit of adopting NOMA in an FRAN architecture with constrained capacity fronthaul. The paper proposes methods for optimizing joint scheduling and power adaptation in the downlink of a NOMA-based FRAN with multiple resource blocks (RB). We consider a mixed-integer optimization problem which maximizes a network-wide rate-based utility function subject to fronthaul-capacity constraints, so as to determine i) the user-to-RB assignment, ii) the allocated power to each RB, and iii) the power split levels of the NOMA users in each RB. The paper proposes a feasible decoupled solution for such non-convex optimization problem using a three-step hybrid centralized/distributed approach. The proposed solution complies with FRAN operation that aims to partially shift the network control to the FAPs, so as to overcome delays due to fronthaul rate constraints. The paper proposes and compares two distinct methods for solving the assignment problem, namely the Hungarian method, and the Multiple Choice Knapsack method. The power allocation and the NOMA power split optimization, on the other hand, are solved using the alternating direction method of multipliers (ADMM). Simulations results illustrate the advantages of the proposed methods compared to different baseline schemes including the conventional Orthogonal Multiple Access (OMA), for different utility functions and different network environments.

cs.NI↗

arXiv2018

SS5G: Collision Resolution Protocol for Delay and Energy Efficient LoRa Networks

Future 5G and Internet of Things (IoT) applications will heavily rely on long-range communication technologies such as low-power wireless area networks (LPWANs). In particular, LoRaWAN built on LoRa physical layer is gathering increasing interests, both from academia and industries, for enabling low-cost energy efficient IoT wireless sensor networks for, e.g., environmental monitoring over wide areas. While its communication range may go up to 20 kilometers, the achievable bit rates in LoRaWAN are limited to a few kilobits per second. In the event of collisions, the perceived rate is further reduced due to packet loss and retransmissions. Firstly, to alleviate the harmful impacts of collisions, we propose a decoding algorithm that enables to resolve several superposed LoRa signals. Our proposed method exploits the slight desynchronization of superposed signals and specific features of LoRa physical layer. Secondly, we design a full MAC protocol enabling collision resolution. The simulation results demonstrate that the proposed method outperforms conventional LoRaWAN jointly in terms of system throughput, energy efficiency as well as delay. These results show that our scheme is well suited for 5G and IoT systems, as one of their major goals is to provide the best trade-off among these performance objectives.

cs.NI↗

arXiv2018

Adaptive Beam-Frequency Allocation Algorithm with Position Uncertainty for Millimeter-Wave MIMO Systems

Envisioned for fifth generation (5G) systems, millimeter-wave (mmWave) communications are under very active research worldwide. Although pencil beams with accurate beamtracking may boost the throughput of mmWave systems, this poses great challenges in the design of radio resource allocation for highly mobile users. In this paper, we propose a joint adaptive beam-frequency allocation algorithm that takes into account the position uncertainty inherent to high mobility and/or unstable users as, e.g., Unmanned Aerial Vehicles (UAV), for whom this is a major problem. Our proposed method provides an optimized beamwidth selection under quality of service (QoS) requirements for maximizing system proportional fairness, under user position uncertainty. The rationale of our scheme is to adapt the beamwidth such that the best trade-off among system performance (narrower beam) and robustness to uncertainty (wider beam) is achieved. Simulation results show that the proposed method largely enhances the system performance compared to reference algorithms, by an appropriate adaptation of the mmWave beamwidths, even under severe uncertainties and imperfect channel state information (CSIs).

cs.NI↗

arXiv2018

Topology Control for Energy-Efficient Localization in Mobile Underwater Sensor Networks using Stackelberg Game

The characteristics of mobile Underwater Sensor Networks (UWSNs), such as low communication bandwidth, large propagation delay, and sparse deployment, pose challenging issues for successful localization of sensor nodes. In addition, sensor nodes in UWSNs are usually powered by batteries whose replacements introduce high cost and complexity. Thus, the critical problem in UWSNs is to enable each sensor node to find enough anchor nodes in order to localize itself, with minimum energy costs. In this paper, an Energy-Efficient Localization Algorithm (EELA) is proposed to analyze the decentralized interactions among sensor nodes and anchor nodes. A Single-Leader-Multi-Follower Stackelberg game is utilized to formulate the topology control problem of sensor nodes and anchor nodes by exploiting their available communication opportunities. In this game, the sensor node acts as a leader taking into account factors such as 'two-hop' anchor nodes and energy consumption, while anchor nodes act as multiple followers, considering their ability to localize sensor nodes and their energy consumption. We prove that both players select best responses and reach a socially optimal Stackelberg Nash Equilibrium. Simulation results demonstrate that the proposed EELA improves the perfor- mance of localization in UWSNs significantly, and in particular the energy cost of sensor nodes. Compared to the baseline schemes, the energy consumption per node is about 48% lower in EELA, while providing a desirable localization coverage, under reasonable error and delay.

cs.NI↗

arXiv2018

Decoding Superposed LoRa Signals

Long-range low-power wireless communications, such as LoRa, are used in many IoT and environmental monitoring applications. They typically increase the communication range to several kilometers, at the cost of reducing the bitrate to a few bits per seconds. Collisions further reduce the performance of these communications. In this paper, we propose two algorithms to decode colliding signals: one algorithm requires the transmitters to be slightly desynchronized, and the other requires the transmitters to be synchronized. To do so, we use the timing information to match the correct symbols to the correct transmitters. We show that our algorithms are able to significantly improve the overall throughput of LoRa.

cs.NI↗

arXiv2018

LoRa Throughput Analysis with Imperfect Spreading Factor Orthogonality

LoRa is one of the promising techniques for enabling Low Power Wide Area Networks (LPWANs) for future Internet-of-Things (IoT) devices. Although LoRa allows flexible adaptations of coverage and data rates, it is subject to intrinsic types of interferences: co-SF interferences where end-devices with the same Spreading Factors (SFs) are subject to collisions, and inter-SF interferences where end-devices with different SFs experience collisions. Most current works have considered perfect orthogonality among different SFs. In this work, we provide a theoretical analysis of the achievable LoRa throughput in uplink, where the capture conditions specific to LoRa are included. Results show the accuracy of our analysis despite approximations, and the throughput losses from imperfect SF orthogonality, under different SF allocations. Our analysis will enable the design of specific SF allocation mechanisms, in view of further throughput enhancements.

cs.NI↗

arXiv2018

User Pre-Scheduling and Beamforming with Imperfect CSI in 5G Fog Radio Access Networks

We investigate the user-to-cell association (or user-clustering) and beamforming design for Cloud Radio Access Networks (CRANs) and Fog Radio Access Networks (FogRANs) for 5G. CRAN enables cloud centralized resource and power allocation optimization over all the small cells served by multiple Access Points (APs). However, the fronthaul links connecting each AP to the cloud introduce delays and cause outdated Channel State Information (CSI). By contrast, FogRAN enables lower latencies and better CSI qualities, at the cost of local optimization. To alleviate these issues, we propose a hybrid algorithm exploiting both the centralized feature of the cloud for globally-optimized pre-scheduling using outdated CSIs and the distributed nature of FogRAN for accurate beamforming with high quality CSIs. The centralized phase enables to consider the interference patterns over the global network, while the distributed phase allows for latency reduction. Simulation results show that our hybrid algorithm for FogRAN outperforms the centralized algorithm under imperfect CSI, both in terms of throughput and delays.

eess.SP↗

arXiv2017

Graph-based Joint Signal / Power Restoration for Energy Harvesting Wireless Sensor Networks

The design of energy and spectrally efficient Wireless Sensor Networks (WSN) is crucial to support the upcoming expansion of IoT/M2M mobile data traffic. In this work, we consider an energy harvesting WSN where sensor data are periodically reported to a Fusion Center (FC) by a sparse set of active sensors. Unlike most existing works, the transmit power levels of each sensor are assumed to be unknown at the FC in this distributed setting. We address the inverse problem of joint signal / power restoration at the FC- a challenging under-determined separation problem. To regularize the ill-posed problem, we assume both a graph-signal smoothness prior (signal is smooth with respect to a graph modeling spatial correlation among sensors) and a sparsity power prior for the two unknown variables. We design an efficient algorithm by alternately fixing one variable and solving for the other until convergence. Specifically, when the signal is fixed, we solve for the power vector using Simplex pivoting in linear programming (LP) to iteratively identify sparse feasible solutions, locally minimizing an objective. Simulation results show that our proposal can achieve very low reconstruction errors and outperform conventional schemes under reasonable assumptions

cs.IT↗

arXiv2012

Compressed Sensing based Protocol for Efficient Reconstruction of Sparse Superimposed Data in a Multi-Hop Wireless Sensor Network

We consider a multi-hop wireless sensor network that measures sparse events and propose a simple forwarding protocol based on Compressed Sensing (CS) which does not need any sophisticated Media Access Control (MAC) scheduling, neither a routing protocol, thereby making significant overhead and energy savings. By means of flooding, multiple packets with different superimposed measurements are received simultaneously at any node. Thanks to our protocol, each node is able to recover each measurement and forward it while avoiding cycles. Numerical results show that our protocol achieves close to zero reconstruction errors at the sink, while greatly reducing overhead. This initial research reveals a new and promising approach to protocol design through CS for wireless mesh and sensor networks.

cs.OH↗

arXiv2010

Coordinated Transmissions to Direct and Relayed Users in Wireless Cellular Systems

The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple communication flows and (2) usage of \emph{a priori} information to cancel the interference. In this paper we use these principles to devise new transmission schemes in wireless cellular systems that feature both users served directly by the base stations (direct users) and users served through relays (relayed users). We present four different schemes for \emph{coordinated transmission} of uplink and downlink traffic in which one direct and one relayed user are served. These schemes are then used as building blocks in multi-user scenarios, where we present several schemes for scheduling pairs of users for coordinated transmissions. The optimal scheme involves exhaustive search of the best user pair in terms of overall rate. We propose several suboptimal scheduling schemes, which perform closely to the optimal scheme. The numerical results show a substantial increase in the system--level rate with respect to the systems with non--coordinated transmissions.

cs.IT↗