Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limited-buffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematical analysis and simulations.

Over the last decade there has been a rapid growth of wireless communication technology. Among numerous wireless network architectures, the personal communication services (PCS) networks and wireless local area networks (WLAN) have attracted lots of attention. One of the core functionalities in wireless networks is the location service that provides location information for subscriber services, emergency services, and various mobile networks internal operations. In this paper, an integrated location management mechanism is proposed for heterogeneous wireless networks that combine PCS networks and WLAN. Three major functionalities in the integrated location management scheme are the determination of the WLAN connectivity for a mobile terminal, the development of a local area location scheme for WLAN, and the location prediction module for PCS networks. This mechanism not only determines the location of a mobile client more precisely, but also reduces the cost of locating. The performance evaluation is conducted to demonstrate the effectiveness of the proposed mechanism for heterogeneous wireless networks.