In the IEEE 802.11e standard, a reference scheduler is presented. The reference scheduler uses the same service interval (SI) to poll all stations in a polling list, and uses separate scheduling and admission algorithms. This increases the polling overhead and decreases TXOP utilization. Many papers have attempted to enhance the reference scheduler, but its admission control is similar to reference scheduler. In this paper, we propose a scheduling and admission algorithm that assigns each station an SI close to its maximum SI (MSI). As a result, the proposed algorithm shows higher performance than that of the reference scheduler.

DV-Hop algorithm produces errors in location estimations due to inaccurate hop size. We propose a novel localization scheme based on DV-Hop to improve positioning accuracy with least error hop sizes of anchors and average hop sizes of unknowns. The least error hop size of an anchor minimizes its location error, but it may be far small or large. To cope with this inconsistent hop size, each unknown node calculates its average hop size with hop sizes from anchors. Simulation results show that the proposed algorithm outperforms the DV-Hop algorithm in location estimations.

Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.

Radio resource is the bottleneck for current multimedia wireless networks. Intelligent traffic control strategies can be enforced to optimize resource allocation so as to enhance network performance. In this study, dynamic control scheme for non-real-time traffic and autonomic control schemes for multimedia traffic are proposed to guarantee the required quality of service (QoS) in the inference-dominated high-speed wireless environment. Both handoff priority and terminal mobility are also taken into consideration. The performance of the state-dependent multidimensional birth-death process is derived by the efficient matrix-analytic methods (MAMs). Compared with the previous results, this paper shows that the proposed control methods can be used for both real-time and non-real-time multimedia traffic in order to meet the required performance without degrading the quality of multimedia services. These results are also important for the design of evolving multimedia wireless systems as well as network optimization.