10,769 research outputs found
Distributed Throughput-optimal Scheduling in Ad Hoc Wireless Networks
In this paper, we propose a distributed throughput-optimal ad hoc wireless
network scheduling algorithm, which is motivated by the celebrated simplex
algorithm for solving linear programming (LP) problems. The scheduler stores a
sparse set of basic schedules, and chooses the max-weight basic schedule for
transmission in each time slot. At the same time, the scheduler tries to update
the set of basic schedules by searching for a new basic schedule in a
throughput increasing direction. We show that both of the above procedures can
be achieved in a distributed manner. Specifically, we propose an average
consensus based link contending algorithm to implement the distributed max
weight scheduling. Further, we show that the basic schedule update can be
implemented using CSMA mechanisms, which is similar to the one proposed by
Jiang et al. Compared to the optimal distributed scheduler in Jiang's paper,
where schedules change in a random walk fashion, our algorithm has a better
delay performance by achieving faster schedule transitions in the steady state.
The performance of the algorithm is finally confirmed by simulation results.Comment: 6 pages, 3 figures. A shorter version will appear in the proceedings
of IEEE ICC 201
Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation
Distributed opportunistic scheduling is studied for wireless ad-hoc networks,
where many links contend for one channel using random access. In such networks,
distributed opportunistic scheduling (DOS) involves a process of joint channel
probing and distributed scheduling. It has been shown that under perfect
channel estimation, the optimal DOS for maximizing the network throughput is a
pure threshold policy. In this paper, this formalism is generalized to explore
DOS under noisy channel estimation, where the transmission rate needs to be
backed off from the estimated rate to reduce the outage. It is shown that the
optimal scheduling policy remains to be threshold-based, and that the rate
threshold turns out to be a function of the variance of the estimation error
and be a functional of the backoff rate function. Since the optimal backoff
rate is intractable, a suboptimal linear backoff scheme that backs off the
estimated signal-to-noise ratio (SNR) and hence the rate is proposed. The
corresponding optimal backoff ratio and rate threshold can be obtained via an
iterative algorithm. Finally, simulation results are provided to illustrate the
tradeoff caused by increasing training time to improve channel estimation at
the cost of probing efficiency.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks
Distributed opportunistic scheduling (DOS) protocols are proposed for
multiple-input multiple-output (MIMO) ad-hoc networks with contention-based
medium access. The proposed scheduling protocols distinguish themselves from
other existing works by their explicit design for system throughput improvement
through exploiting spatial multiplexing and diversity in a {\em distributed}
manner. As a result, multiple links can be scheduled to simultaneously transmit
over the spatial channels formed by transmit/receiver antennas. Taking into
account the tradeoff between feedback requirements and system throughput, we
propose and compare protocols with different levels of feedback information.
Furthermore, in contrast to the conventional random access protocols that
ignore the physical channel conditions of contending links, the proposed
protocols implement a pure threshold policy derived from optimal stopping
theory, i.e. only links with threshold-exceeding channel conditions are allowed
for data transmission. Simulation results confirm that the proposed protocols
can achieve impressive throughput performance by exploiting spatial
multiplexing and diversity.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
- …