191 research outputs found
A distributed channel allocation scheme for cellular network using intelligent software agents
PhDAbstract not availabl
Performance analysis of the interference adaptation dynamic channel allocation technique in wireless communication networks
Dynamic channel allocation (DCA) problem is one of the major research topics in the wireless networking area. The purpose of this technique is to relieve the contradiction between the increasing traffic load in wireless networks and the limited bandwidth resource across the air interface. The challenge of this problem comes from the following facts: a) even the basic DCA problem is shown to be NP-complete (none polynomial complete); b) the size of the state space of the problem is very large; and c) any practical DCA algorithm should run in real-time.
Many heuristic DCA schemes have been proposed in the literature. It has been shown through simulation results that the interference adaptive dynamic channel allocation (IA-DCA) scheme is a promising strategy in Time Devision [sic] Multiple Accesss/Frequency Devision [sic] Multiple Accesss [sic] (TDMA/FDMA) based wireless communication systems. However, the analytical work on the IA-DCA strategy in the literature is nearly blank.
The performance of a, DCA algorithm in TDMA/FDMA wireless systems is influenced by three factors: representation of the interference, traffic fluctuation, and the processing power of the algorithm. The major obstacle in analyzing IA-DCA is the computation of co-channel interference without the constraint of conventional channel reuse factors. To overcome this difficulty, one needs a representation pattern which can approximate the real interference distribution as accurately as desired, and is also computationally viable. For this purpose, a concept called channel reuse zone (CRZ) is introduced and the methodology of computing the area of a CRZ with an arbitrary, non-trivial channel reuse factor is defined. Based on this new concept, the computation of both downlink and uplink CO-channel interference is investigated with two different propagation models, namely a simplified deterministic model and a shadowing model. For the factor of the processing power, we proposed an idealized Interference Adaptation Maximum Packing (IAMP) scheme, which gives the upper bound of all IA-DCA schemes in terms of the system capacity. The effect of traffic dynamics is delt [sic] with in two steps. First, an asymptotic performance bound for the IA-DCA strategy is derived with the assumption of an arbitrarily large number of channels in the system. Then the performance bound for real wireless systems with the IA-DCA strategy is derived by alleviating this assumption. Our analytical result is compared with the performance bound drawn by Zander and Eriksson for reuse-partitioning DCA1 and some simulation results for IA-DCA in the literature. It turns out that the performance bound obtained in this work is much tighter than Zander and Eriksson\u27s bound and is in agreement with simulation results.
1only available for deterministic propagation model and downlink connection
Optimal channel assignment and power control in wireless cellular networks
Wireless mobile communication is a fast growing field in current telecommunication industry. In a wireless cellular network, channel assignment is a mechanism that assigns channels to mobile users in order to establish a communication between a mobile terminal and a base station. It is important to determine an optimal allocation of channels that makes effective use of channels and minimizes call-blocking and call-dropping probabilities. Another important issue, the power control, is a problem of determining an optimal allocation of power levels to transmitters such that the power consumption is minimized while signal quality is maintained. In wireless mobile networks, channels and transmitter powers are limited resources. Therefore, efficient utilization of both those resources can significantly increase the capacity of network.
In this thesis, we solve such optimizations by the hybrid channel assignment (HCA) method using integer linear programming (ILP). Two novel sets of ILP formulation are proposed for two different cases: Reuse Distance based HCA without power control, and Carrier-to-Interference Ratio based HCA combined with power control. For each of them, our experimental results show an improvement over other several approaches
Efficient Utilization of Channels Using Dynamic Guard Channel Allocation with Channel Borrowing Strategy in Handoffs
User mobility in wireless data networks is increasing because of
technological advances and the desire for voice and multimedia applications.
These applications, however, require fast handoffs between base stations to
maintain the quality of the connections. In this paper, the authors describe
the use of novel and efficient data structure which dynamically allocates guard
channel for handoffs and introduces the concept of channel borrowing strategy.
The proposed scheme allocates the guard channels for handoff requests
dynamically, based on the traffic load for certain time period. A new
originating call in the cell coverage area also uses these guard channels if
they are unused. Our basic idea is to allow Guard channels to be shared between
new calls and handoff calls. This approach maximizes the channel utilization.
The simulation results prove that the channel borrowing scheme improves the
overall throughput.Comment: International Conference CCSEA 2012 at New Delhi May 27. arXiv admin
note: substantial text overlap with arXiv:1206.306
QoS Provisioning for Multi-Class Traffic in Wireless Networks
Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks.
We present three variations of a novel resource borrowing scheme for cellular networks that exploits the ability of some multimedia applications to adapt to transient fluctuations in the supplied resources. The first of the schemes is shown to be proportionally fair: the second scheme is max-min fair. The third scheme for cellular networks uses knowledge about the relationship between streams that together comprise a multimedia session in order to further improve performance. We also present a predictive resource reservation scheme for LEO satellite networks that exploits the regularity of the movement patterns of mobile hosts in LEO satellite networks. We have developed the cellular network simulator (CNS) for evaluating call-level QoS provisioning schemes. QoS at the call-level is concerned with call blocking probability (CBP), call dropping probability (CDP), and supplied bandwidth. We introduce two novel QoS parameters that relate to supplied bandwidth—the average percent of desired bandwidth supplied (DBS), and the percent of time spent operating at the desired bandwidth level (DBT)
Adaptive Predictive Handoff Scheme with Channel Borrowing in Cellular Network
Previously, we presented an extension of predictive channel reservation (PCR) scheme, called HPCR_CB, for handoff motivated by the rapid evolving technology of mobile positioning. In this thesis, the author proposes a new scheme, called adaptive PCR_CB (APCR_CB), which is an extension of HPCR_CB by incorporating the concept of adaptive guard channels. In APCR_CB, the number of guard channel(s) is adjusted automatically based on the average handoff blocking rate measured in the past certain time period. The handoff blocking rate is controlled under the designated threshold and the new call blocking rate is minimized. The performance evaluation of the APCR_CB scheme is done by simulation. The result shows the APCR_CB scheme outperforms the original PCR, GC, and HPCR_CB schemes by controlling a hard constraint on the handoff blocking probability. It is able to achieve the optimal performance by maximizing the resource utilization and by adapting to changing traffic conditions automatically
Adaptive Predictive Handoff Scheme with Channel Borrowing in Cellular Network
Previously, we presented an extension of predictive channel reservation (PCR) scheme, called HPCR_CB, for handoff motivated by the rapid evolving technology of mobile positioning. In this thesis, the author proposes a new scheme, called adaptive PCR_CB (APCR_CB), which is an extension of HPCR_CB by incorporating the concept of adaptive guard channels. In APCR_CB, the number of guard channel(s) is adjusted automatically based on the average handoff blocking rate measured in the past certain time period. The handoff blocking rate is controlled under the designated threshold and the new call blocking rate is minimized. The performance evaluation of the APCR_CB scheme is done by simulation. The result shows the APCR_CB scheme outperforms the original PCR, GC, and HPCR_CB schemes by controlling a hard constraint on the handoff blocking probability. It is able to achieve the optimal performance by maximizing the resource utilization and by adapting to changing traffic conditions automatically
Reuse partitioning in cellular networks with dynamic channel allocation
Great interest in recent years has been devoted to mobile communications. The research effort has been directed to increasing the capacity of radio systems by applying space reuse techniques. Higher efficiency in the usage of the available frequency spectrum can be obtained either by reducing the cell size, thus requiring the provision of new base stations, or by reusing the available spectrum more efficiently without cell size reduction. In this paper we present a dynamic frequency allocation algorithm for cellular networks that exploits a given reuse pattern. The performance of the proposed scheme, in terms of blocking probability, is evaluated by means of computer simulations both when the position of the mobiles remains unchanged and when mobility is taken into account, under both uniform and hot-spot traffic. The numerical results show that the capacity of the proposed scheme is sensibly higher than that of a dynamic channel allocation without reuse partitioning. The effects of both user mobility and reuse partitioning on the signalling load are also considered
Recommended from our members
Modelling and Analysis of Resource Management Schemes in Wireless Networks. Analytical Models and Performance Evaluation of Handoff Schemes and Resource Re-Allocation in Homogeneous and Heterogeneous Wireless Cellular Networks.
Over recent years, wireless communication systems have been experiencing a dramatic and continuous growth in the number of subscribers, thus placing extra demands on system capacity. At the same time, keeping Quality of Service (QoS) at an acceptable level is a critical concern and a challenge to the wireless network designer. In this sense, performance analysis must be the first step in designing or improving a network. Thus, powerful mathematical tools for analysing most of the performance metrics in the network are required. A good modelling and analysis of the wireless cellular networks will lead to a high level of QoS.
In this thesis, different analytical models of various handoff schemes and resource re-allocation in homogeneous and heterogeneous wireless cellular networks are developed and investigated. The sustained increase in users and the request for advanced services are some of the key motivations for considering the designing of Hierarchical Cellular Networks (HCN). In this type of system, calls can be blocked in a microcell flow over to an overlay macrocell. Microcells in the HCN can be replaced by WLANs as this can provide high bandwidth and its users have limited mobility features. Efficient sharing of resources between wireless cellular networks and WLANs will improve the capacity as well as QoS metrics.
This thesis first presents an analytical model for priority handoff mechanisms, where new calls and handoff calls are captured by two different traffic arrival processes, respectively. Using this analytical model, the optimised number of channels assigned to
II
handover calls, with the aim of minimising the drop probability under given network scenarios, has been investigated. Also, an analytical model of a network containing two cells has been developed to measure the different performance parameters for each of the cells in the network, as well as altogether as one network system. Secondly, a new solution is proposed to manage the bandwidth and re-allocate it in a proper way to maintain the QoS for all types of calls. Thirdly, performance models for microcells and macrocells in hierarchical cellular networks have been developed by using a combination of different handoff schemes. Finally, the microcell in HCN is replaced by WLANs and a prioritised vertical handoff scheme in an integrated UMTS/WLAN network has been developed. Simulation experiments have been conducted to validate the accuracy of these analytical models. The models have then been used to investigate the performance of the networks under different scenarios
- …