The stability of a queueing network with interdependent servers is considered. dependency among the described by definition their subsets that can be activated simultaneously. Multihop radio networks provide motivation for consideration this system. problem scheduling server activation under constraints imposed studied. performance criterion policy its throughput characterized region, is, set vectors arrival and service rates which system stable. A obtained optimal in sense region superset...

An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information generated certain and needs to reach set designated gateway nodes. Each node may adjust its power within range that determines the possible one hop away neighbors. Traffic forwarding through multiple hops employed when intended destination not immediate reach. The have limited initial amounts energy consumed at different rates depending on level receiver....

A routing problem in static wireless ad hoc networks is considered as it arises a rapidly deployed, sensor based, monitoring system known the network. Information obtained by nodes needs to be routed set of designated gateway nodes. In these networks, every node capable sensing, data processing, and communication, operates on its limited amount battery energy consumed mostly transmission reception at radio transceiver. If we assume that transmitter power level can adjusted use minimum...

Joint power control and beamforming schemes are proposed for cellular systems where adaptive arrays used only at base stations. In the uplink, mobile receiver diversity combining vectors stations calculated jointly. The transmitted is minimized, while signal-to-interference-and-noise ratio (SINR) each link maintained above a threshold. A transmit scheme downlink also weight allocations jointly such that SINR target value. algorithm achieves feasible solution if there one minimizes total in...

Consider N parallel queues competing for the attention of a single server. At each time slot queue may be connected to server or not depending on value binary random variable, connectivity variable. Allocation at slot; is based information and lengths only. end slot, service completed with given fixed probability. Such queueing model appropriate some communication networks changing topology. In case infinite buffers, necessary sufficient conditions are obtained stabilizability system in...

The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to increase capacity in wireless communication networks. minimum variance distortionless response beamformer maximizes signal-to-interference-and-noise ratio (SINR) when it is employed receiver a link. In system with omnidirectional antennas, are used maximize SINR well. We consider beamforming capabilities receiver, control. An iterative algorithm proposed...

Directional antennas in ad hoc networks offer many benefits compared with classical omnidirectional antennas. The most important include significant increase of spatial reuse, coverage range and subsequently network capacity as a whole. On the other hand, use directional requires new approach design MAC protocol to fully exploit these benefits. Unfortunately, transmissions hidden terminal problem, problem deafness determination neighbors' location. In this paper we propose that deals...

Federated learning (FL) allows model training from local data collected by edge/mobile devices while preserving privacy, which has wide applicability to image and vision applications. A challenge is that client in FL usually have much more limited computation communication resources compared servers a center. To overcome this challenge, we propose PruneFL -a novel approach with adaptive distributed parameter pruning, adapts the size during reduce both overhead minimize overall time,...

Abstract Remote quantum entanglement can enable numerous applications including distributed computation, secure communication, and precision sensing. We consider how a network—nodes equipped with limited processing capabilities connected via lossy optical links—can distribute high-rate simultaneously between multiple pairs of users. develop protocols for such “repeater” nodes, which pair users to achieve large gains in rates over using linear chain repeaters, by exploiting the diversity...

Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items at small cell base stations (SBSs) been proposed to decrease costly transmissions from macrocell without requiring high capacity backhaul links connecting SBSs with core network. However, policy design is challenging problem especially if one considers realistic parameters such as bandwidth constraints can be reached in congested urban...

The proliferation of innovative mobile services such as augmented reality, networked gaming, and autonomous driving has spurred a growing need for low-latency access to computing resources that cannot be met solely by existing centralized cloud systems. Mobile Edge Computing (MEC) is expected an effective solution meet the demand enabling execution tasks at network-periphery, in proximity end-users. While number recent studies have addressed problem determining service routing user requests...

The landscape toward 5G wireless communication is currently unclear, and, despite the efforts of academia and industry in evolving traditional cellular networks, enabling technology for still obscure. This paper puts forward a network paradigm next-generation targeting to satisfy explosive demand mobile data while minimizing energy expenditures. builds on two principles; namely caching multicast. On one hand, policies disperse popular content files at edge, e.g., pico-cells femto-cells,...

The unprecedented growth of mobile data traffic challenges the performance and economic viability today's cellular networks calls for novel network architectures communication solutions. Mobile offloading through third-party Wi-Fi or femtocell access points (APs) can significantly alleviate congestion enhance user quality service (QoS), without requiring costly time-consuming infrastructure investments. This solution has substantial benefits both operators (MNOs) users, but comes with unique...

Federated learning (FL) is a distributed paradigm that enables large number of devices to collaboratively learn model without sharing their raw data. Despite its practical efficiency and effectiveness, the iterative on-device process incurs considerable cost in terms time energy consumption, which depends crucially on selected clients local iterations each training round. In this paper, we analyze how design adaptive FL optimally chooses these essential control variables minimize total while...

Federated learning (FL) algorithms usually sample a fraction of clients in each round (partial participation) when the number participants is large and server's communication bandwidth limited. Recent works on convergence analysis FL have focused unbiased client sampling, e.g., sampling uniformly at random, which suffers from slow wall-clock time for due to high degrees system heterogeneity statistical heterogeneity. This paper aims design an adaptive algorithm that tackles both minimize...

Wireless ad hoc networks have been a growing area of research. While there has considerable research on the topic routing in such networks, topology creation not received due attention. This is because almost all to date built top single channel, broadcast based wireless media, as 802.11 or IR LANs. For distance relationship between nodes implicitly (and uniquely) determines network. Bluetooth promising new technology, which enables portable devices form short-range and frequency hopping...

A resource allocation model that has within its scope a number of computer and communication network architectures was introduced by Tassiulas Ephremides (1992) scheduling methods achieve maximum throughput were proposed. Those require the solution complex optimization problem at each packet transmission time as result they are not amenable to direct implementations. We propose class policies for have linear complexity can lead practical They rely on randomized, iterative algorithm arising...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless ad hoc networks. formalize the objective under constraints. propose a which assigns dynamic weights to flows such that depend on congestion neighborhood and schedule constitute maximum weighted matching. It is possible prove analytically this policy attains both short term long fairness. more generalized fairness notions, suggest mechanisms attain these objectives.

In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under present support an infinite infrastructure network. Such network architecture allows nodes to communicate each other by purely using remaining as their relays. addition, can also utilize existing fully or partially reaching any access point (or gateway) in single multi-hop fashion. Using same tools [1], show that per source node T(W/log(N)) be achieved scenario following assumptions: (i)...

We consider the problem of cross-layer resource allocation for wireless networks operating with rechargeable batteries under general arrival, channel state and recharge processes. The objective is to maximize total system utility, defined as a function long-term rate achieved per link, while satisfying energy power constraints. A policy decoupled admission control decisions proposed that achieves asymptotic optimality sufficiently large battery capacity maximum transmission ratio (explicit...

A new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained is presented. The objective to maximize total number that can be successfully sent over network without knowing any information regarding future message arrivals or generation rates. From a theoretical perspective, we show if admission control permitted, then worst-case performance our within factor O(log(network size)) best achievable solution. In other words, achieves logarithmic competitive...

Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in years, because it is particularly appealing from a network operator's perspective (e.g., UMTS, 802.16e). When there are many co-channel users and/or the stringent, problem becomes infeasible and some form admission control necessary. We advocate cross-layer approach to joint multiuser transmit control, aiming maximize number that can be served at their desired QoS. It shown core...