641 research outputs found
Wireless Scheduling with Power Control
We consider the scheduling of arbitrary wireless links in the physical model
of interference to minimize the time for satisfying all requests. We study here
the combined problem of scheduling and power control, where we seek both an
assignment of power settings and a partition of the links so that each set
satisfies the signal-to-interference-plus-noise (SINR) constraints.
We give an algorithm that attains an approximation ratio of , where is the number of links and is the ratio
between the longest and the shortest link length. Under the natural assumption
that lengths are represented in binary, this gives the first approximation
ratio that is polylogarithmic in the size of the input. The algorithm has the
desirable property of using an oblivious power assignment, where the power
assigned to a sender depends only on the length of the link. We give evidence
that this dependence on is unavoidable, showing that any
reasonably-behaving oblivious power assignment results in a -approximation.
These results hold also for the (weighted) capacity problem of finding a
maximum (weighted) subset of links that can be scheduled in a single time slot.
In addition, we obtain improved approximation for a bidirectional variant of
the scheduling problem, give partial answers to questions about the utility of
graphs for modeling physical interference, and generalize the setting from the
standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore
the utility of graph models in capturing wireless interference.Comment: Revised full versio
On Wireless Scheduling Using the Mean Power Assignment
In this paper the problem of scheduling with power control in wireless
networks is studied: given a set of communication requests, one needs to assign
the powers of the network nodes, and schedule the transmissions so that they
can be done in a minimum time, taking into account the signal interference of
concurrently transmitting nodes. The signal interference is modeled by SINR
constraints. Approximation algorithms are given for this problem, which use the
mean power assignment. The problem of schduling with fixed mean power
assignment is also considered, and approximation guarantees are proven
Wireless packet scheduling for two-state link models
Packet scheduling is key to the provision of Quality of Service (QoS) differentiation and guarantees in a wireless network. Unlike its wireline counterpart, wireless communication poses special problems such as time-varying link capacity and location-dependent errors. These special problems make designing efficient and effective scheduling algorithms for wireless networks very challenging. Although many wireless scheduling algorithms have been proposed in recent years, some issues remain unresolved. This paper introduces a new wireless scheduling algorithm called BGFS-EBA (bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation), which addresses these issues. It is shown that BGFS-EBA distributes excess bandwidth effectively, strikes a balance between effort-fair and outcome-fair, and provides delay bound for error-free flows and transmission effort guarantees for error-prone flows. The new algorithm is compared with some recent wireless scheduling algorithms.published_or_final_versio
Quantum Approximation for Wireless Scheduling
This paper proposes a quantum approximate optimization algorithm (QAOA)
method for wireless scheduling problems. The QAOA is one of the promising
hybrid quantum-classical algorithms for many applications and it provides
highly accurate optimization solutions in NP-hard problems. QAOA maps the given
problems into Hilbert spaces, and then it generates Hamiltonian for the given
objectives and constraints. Then, QAOA finds proper parameters from classical
optimization approaches in order to optimize the expectation value of generated
Hamiltonian. Based on the parameters, the optimal solution to the given problem
can be obtained from the optimum of the expectation value of Hamiltonian.
Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS)
algorithm is proposed. First of all, this paper formulates a wireless
scheduling problem using maximum weight independent set (MWIS). Then, for the
given MWIS, the proposed QAOS designs the Hamiltonian of the problem. After
that, the iterative QAOS sequence solves the wireless scheduling problem. This
paper verifies the novelty of the proposed QAOS via simulations implemented by
Cirq and TensorFlow-Quantum
A High Reliability Asymptotic Approach for Packet Inter-Delivery Time Optimization in Cyber-Physical Systems
In cyber-physical systems such as automobiles, measurement data from sensor
nodes should be delivered to other consumer nodes such as actuators in a
regular fashion. But, in practical systems over unreliable media such as
wireless, it is a significant challenge to guarantee small enough
inter-delivery times for different clients with heterogeneous channel
conditions and inter-delivery requirements. In this paper, we design scheduling
policies aiming at satisfying the inter-delivery requirements of such clients.
We formulate the problem as a risk-sensitive Markov Decision Process (MDP).
Although the resulting problem involves an infinite state space, we first prove
that there is an equivalent MDP involving only a finite number of states. Then
we prove the existence of a stationary optimal policy and establish an
algorithm to compute it in a finite number of steps.
However, the bane of this and many similar problems is the resulting
complexity, and, in an attempt to make fundamental progress, we further propose
a new high reliability asymptotic approach. In essence, this approach considers
the scenario when the channel failure probabilities for different clients are
of the same order, and asymptotically approach zero. We thus proceed to
determine the asymptotically optimal policy: in a two-client scenario, we show
that the asymptotically optimal policy is a "modified least time-to-go" policy,
which is intuitively appealing and easily implementable; in the general
multi-client scenario, we are led to an SN policy, and we develop an algorithm
of low computational complexity to obtain it. Simulation results show that the
resulting policies perform well even in the pre-asymptotic regime with moderate
failure probabilities
- …