Fanchun Jin

Learn More
— This paper considers the problem of maximizing the system throughput in IEEE 802.16 broadband access networks with mesh topology, and the following results are presented. We first consider a simplified linear network with only uplink traffic and provide an optimal scheduling algorithm and establish an analytical result on the length of the schedule. We(More)
— Channel-aware scheduling and link adaptation methods are widely considered to be crucial for realizing high data rates in wireless networks. However, predicting the future channel states, and adjusting the transmission schedules and parameters accordingly, may consume valuable system resources, such as bandwidth, time, and power. This paper considers the(More)
We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in(More)
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread information bits over the entire signal band can take advantage of the frequency selective fading, and choose the sub-carrier(s) that have the best channel conditions for(More)
As the energy consumption in sensor nodes is dominated by the radio transmission/reception circuitry, communication protocols must be designed for economy in radio communications. Sensor nodes are generally equipped with short-range radios that have various characteristics including data rate, power consumption in transmit, receive, and sleep modes, and(More)
Given a time slotted list of resource capacities, we address the problem of scheduling resource allocation considering that a change in allocation results in the changeover penalty of one timeslot. The goal is to maximize the overall allocation of resources. We prove that no 1-lookahead algorithm can be better than 8/5-competitive. We provide improved(More)
In multi access network environments, mobile stations may encounter multiple choices for selecting an access network. Carefully designed access selection schemes can provide not only mobile users with better services but also network operators with better resource utilizations. It is also envisioned that further improvements can be achieved by(More)
— In this paper, we address the problem of access selection in multi-access networks. As admission and handover process durations are in the order of seconds and decentralized decisions are made over multiple cells spread over the network, such decisions have to be made quickly and in a distributed manner while keeping the network stable and its load(More)
In multi access network environments, mobile stations may encounter multiple choices for selecting an access network. Carefully designed access selection schemes can provide not only mobile users with better services but also network operators with better resource utilizations. It is also envisioned that further improvements can be achieved by(More)