A constant-factor approximation for wireless capacity maximization with power control in the SINR model
T Kesselheim - Proceedings of the twenty-second annual ACM-SIAM …, 2011 - SIAM
In modern wireless networks devices are able to set the power for each transmission carried
out. Experimental but also theoretical results indicate that such power control can improve …
out. Experimental but also theoretical results indicate that such power control can improve …
Multi-agent reinforcement learning enabled link scheduling for next generation Internet of Things
In next generation Internet of Things (NG-IoT) networks, numerous pieces of information are
aggregated from the user devices and sensor nodes to the local computing units for further …
aggregated from the user devices and sensor nodes to the local computing units for further …
Wireless capacity with oblivious power in general metrics
The capacity of a wireless network is the maximum possible amount of simultaneous
communication, taking interference into account. Formally, we treat the following problem …
communication, taking interference into account. Formally, we treat the following problem …
[HTML][HTML] CCM-FL: Covert communication mechanisms for federated learning in crowd sensing IoT
The past decades have witnessed a wide application of federated learning in crowd
sensing, to handle the numerous data collected by the sensors and provide the users with …
sensing, to handle the numerous data collected by the sensors and provide the users with …
Efficient link scheduling in wireless networks under Rayleigh-fading and multiuser interference
Link scheduling plays a key role in the network capacity and the transmission delay. In this
paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the …
paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the …
Efficient link scheduling solutions for the internet of things under rayleigh fading
Link scheduling is an appealing solution for ensuring the reliability and latency requirements
of Internet of Things (IoT). Most existing results on the link scheduling problem were based …
of Internet of Things (IoT). Most existing results on the link scheduling problem were based …
Approximation algorithms for secondary spectrum auctions
We study combinatorial auctions for secondary spectrum markets, where short-term
communication licenses are sold to wireless nodes. Channels can be assigned to multiple …
communication licenses are sold to wireless nodes. Channels can be assigned to multiple …
Nearly optimal bounds for distributed wireless scheduling in the SINR model
We study the wireless scheduling problem in the SINR model. More specifically, given a set
of nn links, each a sender–receiver pair, we wish to partition (or schedule) the links into the …
of nn links, each a sender–receiver pair, we wish to partition (or schedule) the links into the …
Algorithms for wireless capacity
In this paper, we address two basic questions in wireless communication. First, how long
does it take to schedule an arbitrary set of communication requests? Second, given a set of …
does it take to schedule an arbitrary set of communication requests? Second, given a set of …
Wireless connectivity and capacity
Given n wireless transceivers located in a plane, a fundamental problem in wireless
communications is to construct a strongly connected digraph on them such that the …
communications is to construct a strongly connected digraph on them such that the …