194 research outputs found

    Channel Assignment in Multihop Cellular Networks

    Get PDF

    Performance analysis of the interference adaptation dynamic channel allocation technique in wireless communication networks

    Get PDF
    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

    Analysis of hierarchical cellular networks with mobile base stations

    Get PDF
    In this paper. we develop and evaluate a hierarchical cellular architecture for totally mobile wireless networks (TMWNs). Extensive performance tests were conducted to evaluate the performance of a two-tier system and compare its throughput, handoff blocking rate and new call success rate with those obtained by a one-tier model. Our tests have shown that when the total number of channels is kept the same, the two-tier system outperformed the one-tier counterpart under all load conditions. Under the constraint of equal power consumption, the two-tier system still achieved improvement over the one-tier system. especially at light and medium load levels. The improvement of the two-tier system over the one-tier system was observed to diminish as the degree of randomness in the mobility model is reduced scenarios where the one-tier system outperforms the two-tier system are given. Load balancing schemes based on the concept of reversible handoffs are introduced and their performance improvements are analyzed. Comparison results on the percentage of terminal coverage are presented. An analytical model to compute the new call and handoff blocking probabilities in TMWN is given and evaluated. The model extends the Markov chain approach previously used in hierarchical architectures with stationary base stations and uses a corrected derivation for the handoff blocking probability

    Performance analysis of microcellization for supporting two mobility classes in cellular wireless networks

    Full text link

    Dynamic channel allocation in interference-limited cellular systems with uneven traffic distribution

    Full text link
    • …
    corecore