Wireless content caching in small cell networks (SCNs) has recently been considered as an efficient way to reduce the data traffic and energy consumption of backhaul emerging heterogeneous cellular networks. In this paper, we consider a cluster-centric SCN with combined design cooperative transmission policy. Small base stations (SBSs) are grouped into disjoint clusters, which in-cluster cache space is utilized entity. We propose scheme, where part each cluster reserved for most popular...

Cell-free (CF) massive multiple-input multiple-output (MIMO) is an alternative topology for future wireless networks, where a large number of single-antenna access points (APs) are distributed over the coverage area. There no cells but all users jointly served by APs using network MIMO methods. Prior works have claimed that CF inherits basic properties cellular MIMO, namely, channel hardening and favorable propagation. In this paper, we evaluate if one can rely on these when having realistic...

Departing from the conventional cache hit optimization in cache-enabled wireless networks, we consider an alternative approach for probabilistic caching placement stochastic D2D networks taking into account reliability of transmissions. Using tools geometry, provide a closed-form approximation cache-aided throughput, which measures density successfully served requests by local device caches, and obtain optimal probabilities via numerical optimization. Compared with cache-hit-optimal case,...

Federated Learning (FL) is a collaborative machine learning (ML) framework that combines on-device training and server-based aggregation to train common ML model among distributed agents. In this work, we propose an asynchronous FL design with periodic tackle the straggler issue in systems. Considering limited wireless communication resources, investigate effect of different scheduling policies designs on convergence performance. Driven by importance reducing bias variance aggregated...

Personalized web search is a promising way to improve quality by customizing results for people with individual information goals. However, users are uncomfortable exposing private preference engines. On the other hand, privacy not absolute, and often can be compromised if there gain in service or profitability user. Thus, balance must struck between protection. This paper presents scalable automatically build rich user profiles. These profiles summarize user.s interests into hierarchical...

This paper studies the interplay between device-to-device (D2D) communications and real-time monitoring systems in a cellular-based Internet of Things (IoT) network. In particular, besides possibility that IoT devices communicate directly with each other D2D fashion, we consider they frequently send time-sensitive information/status updates (about some underlying physical processes observed by them) to their nearest cellular base stations (BSs). Specifically, model locations as bipolar...

Proximity-based content caching and distribution in wireless networks has been identified as a promising traffic offloading solution for improving the capacity quality of experience (QoE) by exploiting popularity spatiotemporal request correlation. In this paper, we address following question: where should popular be cached network? For that, model cellular network using stochastic geometry analyze performance two architectures, namely at mobile device allowing device-to-device (D2D)...

Age of Information (AoI) is a newly appeared concept and metric to characterize the freshness data. In this work, we study delay AoI in multiple access channel (MAC) with two source nodes transmitting different types data common destination. The first node grid-connected its packets arrive bursty manner, at each time slot it transmits one packet some probability. Another energy harvesting (EH) sensor generates new status update certain probability whenever charged. We derive EH as functions...

We consider a resource-constrained IoT network, where multiple users make on-demand requests to cache-enabled edge node send status updates about various random processes, each monitored by an energy harvesting sensor. The serves users' deciding whether command the corresponding sensor fresh update or retrieve most recently received measurement from cache. Our objective is find best actions of minimize average age information (AoI) measurements upon request, i.e., AoI, subject per-slot...

In this work, we study age-optimal scheduling with stability constraints in a multiple access channel two heterogeneous source nodes transmitting to common destination. The first node is connected power grid and it has randomly arriving data packets. Another energy harvesting (EH) sensor monitors stochastic process sends status updates the We formulate an optimization problem that aims at minimizing average age of information (AoI) EH subject queue condition grid-connected node. First,...

Abstract In strong light environments, images often appear overexposed, which seriously impacts the accuracy of target detection. Most existing researches, however, require additional modules to assist in detection, affects timeliness detection process. To address issues reduced and overexposed this paper proposes a real-time anti-light improvement algorithm based on you only look once (YOLO) v8n, focusing enhancing model's ability extract features from without need for modules. Firstly,...

Although pre-trained large vision foundation models (VFM) yield superior results on various downstream tasks, full fine-tuning is often impractical due to its high computational cost and storage requirements. Recent advancements in parameter-efficient (PEFT) of VFM for image classification show significant promise. However, the application PEFT techniques dense prediction tasks remains largely unexplored. Our analysis existing methods reveals that underlying premise utilizing low-rank...

Large scale optimization problems arise in diverse fields. Decomposing the large problem into small subproblems regarding variable interactions and optimizing them cooperatively are critical steps an algorithm. To explore perform decomposition tasks, we develop a two stage interaction reconstruction A learning model is proposed to part of as prior knowledge. marginalized denoising construct overall using knowledge, with which decomposed modules. optimize relieve premature convergence,...

In this paper, we study joint power control and scheduling in uplink massive multiple-input-multiple-output (MIMO) systems with randomly arriving data traffic. We consider both co-located Cell-Free (CF) Massive MIMO, where the difference lies whether antennas are at base station or spread over a wide network area. The is generated each user according to an individual stochastic process. Using Lyapunov optimization techniques, develop dynamic algorithm (DSA), which decides time slot amount of...

Machine learning is widely used in our daily lives. Large amounts of data have been continuously produced and transmitted to the cloud for model training processing, which raises a problem: how preserve security data. Recently, secure machine system named SecureML has proposed solve this issue using two-party computation. However, due excessive computation expenses computation, about 2× slower than original methods. Previous work on mostly focused novel protocols or improving accuracy, while...

In this paper, we propose a decentralized access control scheme for interference management in device-to-device (D2D) underlaid cellular networks. Our method combines signal-to-interference ratio (SIR)-aware link activation with guard zones system, where D2D links opportunistically the licensed spectrum when conditions are satisfied. Analytical expressions success/coverage probability of both and derived. We characterize impact zone radius SIR threshold on potential throughput coverage. A...

In this work, we consider a system where external requests arrive for status updates of remote source, which is monitored by an energy harvesting (EH) sensor. The are placed in aggregator that has direct communication with the sensor and also equipped storage space to cache previously generated update. A probabilistic model considered determine whether new request will be served fresh update from EH or cached aggregator. first case, replace one Assuming arrivals at can modeled Bernoulli...

Intelligent reflecting surface (IRS) and device-to-device (D2D) communication are two promising technologies for improving transmission reliability between transceivers in systems. In this paper, we consider the design of reliable access point (AP) actuators a downlink multiuser multiple-input single-output (MISO) system industrial IoT (IIoT) scenario. We propose two-stage protocol combining IRS with D2D so that all can successfully receive message from AP within given delay. The superiority...

In this paper, we analyze a shared access network with fixed primary node and randomly distributed secondary nodes whose spatial distribution follows poisson point process. The use random protocol allowing them to the channel probabilities that depend on queue size of node. Assuming system multipacket reception receivers, having bursty packet arrivals at saturated traffic nodes, our can be tuned alleviate congestion primary. We throughput average delay, as well impact probability transmit...

Federated Learning (FL) is a newly emerged decentralized machine learning (ML) framework that combines on-device local training with server-based model synchronization to train centralized ML over distributed nodes. In this paper, we propose an asynchronous FL periodic aggregation eliminate the straggler issue in systems. For proposed model, investigate several device scheduling and update policies compare their performances when devices have heterogeneous computation capabilities data...

In this paper, we investigate the effect of bursty traffic and random availability caching helpers in a wireless system. More explicitly, consider general system consisting helper with its dedicated user proximity another non-dedicated requesting for content. Both have limited storage capabilities. When is not able to locate requested content own cache, then request shall be served either by or large data center. Assuming arrivals at from destination, serve other users affected rate, which...