Search arXivSearch

arXiv · 1804.05771

Performance Evaluation of a Deployed 4G LTE Network

Abstract

In Ghana and many countries within Sub-Sahara Africa, Long Term Evolution (LTE) is being considered for use within the sectors of Governance, Energy distribution and transmission, Transport, Education and Health. Subscribers and Governments within the region have high expectations for these new networks and want to leverage the promised enhanced coverage and high data rates for development. Recent performance evaluations of deployed WiMAX networks in Ghana showed promising performance of a wireless broadband technology in supporting the capacity demands needed in the peculiar Sub-Saharan African terrain. The deployed WiMAX networks, however could not achieve the optimal quality of service required for providing a seamless wireless connectivity demands needed for emerging mobile applications. This paper evaluates the performance of some selected key network parameters of a newly deployed LTE network in the 2600 MHz band operating in the peculiar Sub-Saharan African terrain under varied MIMO Antenna Configurations. We adopted simulation and field measurement to aid us in our evaluation. Genex Unet has been used to simulate network coverage and throughput performance of 2X2, 4X4 and 8X8 MIMO configurations of the deployed networks. The average simulated throughput per sector of 4X4 MIMO configuration was seen to be better than the 2X2 configuration. However, the percentage coverage for users under the 2x2 MIMO simulation scenario was better than that of the adaptive 4x4 MIMO configuration with 2x2 MIMO achieving 60.41% of coverage area having throughput values between 1 - 40Mbps as against 55.87% achieved by the 4x4 MIMO configuration in the peculiar deployment terrain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

E. T. Tchao, J. D. Gadze, J. O. Agyapong. 2018-04-02. Performance Evaluation of a Deployed 4G LTE Network. https://arxiv.org/abs/1804.05771

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Formal Abstractions for Packet Scheduling

Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees are not well understood. This paper studies PIFO trees from a programming language perspective. We formalize the syntax and semantics of PIFO trees in an operational model that decouples the scheduling policy running on a tree from the topology of the tree. Building on this formalization, we develop compilation algorithms that allow the behavior of a PIFO tree written against one topology to be realized using a tree with a different topology. Such a compiler could be used to optimize an implementation of PIFO trees, or realize a logical PIFO tree on a target with a fixed topology baked into the hardware. To support experimentation, we develop a software simulator for PIFO trees, and we present case studies illustrating its behavior on standard and custom algorithms.

cs.NI

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI