Crowdsourcing Measurements of Mobile Network Performance and Mobility During a Large Scale Event

2016 ◽  
pp. 70-82 ◽  
Author(s):  
Alexander Frömmgen ◽  
Jens Heuschkel ◽  
Patrick Jahnke ◽  
Fabio Cuozzo ◽  
Immanuel Schweizer ◽  
...  
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Mobile Network

scholarly journals FDD LTE MIMO CLOSED-LOOP VS OPEN-LOOP PERFORMANCE EVALUATION IN COMMERCIAL NETWORK

2021 ◽  
Vol 13 (0) ◽  
pp. 1-6
Author(s):  
Darius Chmieliauskas
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Closed Loop ◽  
Mobile Network ◽  
Network Capacity ◽  
Open Loop ◽  
Lte Networks ◽  
Commercial Network ◽  
Mobile Network Operators ◽  
Growing Network

With a growing network traffic Mobile Network Operators (MNO) looking for ways to increase network capacity and improve customer experience. One of the ways is to find the best parameters from the set defined by 3GPP. In the study, closed-loop MIMO was compared to open-loop MIMO on the LTE FDD network. Network performance was evaluated in 3 different scenarios: slow and fast-moving UE under different SINR levels and large scale on 2T2R and 4T4R cells. The result shows gains of using closed-loop and it is recommended to use it commercial LTE networks.

scholarly journals Intrusion detection and avoidance of black and grey hole attacks using AODV protocol based MANET

2017 ◽  
Vol 7 (1.2) ◽  
pp. 110
Author(s):  
Uzma Shaikh ◽  
Arokia Paul Rajan
Keyword(s):  
Ad Hoc Network ◽  
Large Scale ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Network ◽  
Malicious Nodes ◽  
Aodv Protocol ◽  
Distance Vector ◽  
Mobile Ad Hoc

Mobile Ad-hoc Network (MANET) is a mobile network which has a large scale of self-directed nodes which is powerful to form a short-term means of communication network, without any use of prior communications. Due to its uniqueness like partial resources, varying loops and shortfall of controlling the networks, these networks are exposed to diverse network layer issues. The “Ad hoc on demand distance vector” is a self-starting directing procedure whose security is compromised with the distinct form of attack named as “Black-Hole” and “Grey Hole” attacks. This “malicious node” publicize as such, it contains the supreme track to the target during the route discovery process and thus interrupt the real communication and corrupt network performance. This paper introduces a new method in which a base node is introduced in the network that increases the probability of detecting multiple malicious nodes in the network and further separate them from taking part in any communication. It detects the corrupted nodes and prevent it by causing an effect for the communication. The proposed method has been experimented using NS2 and the results found to be efficient.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

CSMC

2021 ◽  
Vol 5 (4) ◽  
pp. 1-22
Author(s):  
Hai Wang ◽  
Baoshen Guo ◽  
Shuai Wang ◽  
Tian He ◽  
Desheng Zhang
Keyword(s):  
Large Scale ◽  
Mobile Network ◽  
Signal Propagation ◽  
Spectrum Management ◽  
External Information ◽  
Temporal Uncertainty ◽  
Large Area ◽  
Fine Grained ◽  
Map Construction ◽  
Spatio Temporal

The rise concern about mobile communication performance has driven the growing demand for the construction of mobile network signal maps which are widely utilized in network monitoring, spectrum management, and indoor/outdoor localization. Existing studies such as time-consuming and labor-intensive site surveys are difficult to maintain an update-to-date finegrained signal map within a large area. The mobile crowdsensing (MCS) paradigm is a promising approach for building signal maps because collecting large-scale MCS data is low-cost and with little extra-efforts. However, the dynamic environment and the mobility of the crowd cause spatio-temporal uncertainty and sparsity of MCS. In this work, we leverage MCS as an opportunity to conduct the city-wide mobile network signal map construction. We propose a fine-grained city-wide Cellular Signal Map Construction (CSMC) framework to address two challenges including (i) the problem of missing and unreliable MCS data; (ii) spatio-temporal uncertainty of signal propagation. In particular, CSMC captures spatio-temporal characteristics of signals from both inter- and intra- cellular base stations and conducts missing signal recovery with Bayesian tensor decomposition to build large-area fine-grained signal maps. Furthermore, CSMC develops a context-aware multi-view fusion network to make full use of external information and enhance signal map construction accuracy. To evaluate the performance of CSMC, we conduct extensive experiments and ablation studies on a large-scale dataset with over 200GB MCS signal records collected from Shanghai. Experimental results demonstrate that our model outperforms state-of-the-art baselines in the accuracy of signal estimation and user localization.

scholarly journals Relationship-Oriented Software Defined AS-Level Fast Rerouting for Multiple Link Failures

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Chunxiu Li ◽  
Xin Li ◽  
Ke Li ◽  
Jiafu Huang ◽  
Zhansheng Feng ◽  
...  
Keyword(s):  
Distributed Control ◽  
Large Scale ◽  
Network Performance ◽  
Failure Recovery ◽  
Internet Routing ◽  
Link Failures ◽  
Significant Control ◽  
Control Overhead ◽  
Fast Reroute ◽  
Multiple Link Failures

Large-scale deployments of mission-critical services have led to stringent demands on Internet routing, but frequently occurring network failures can dramatically degrade the network performance. However, Border Gateway Protocol (BGP) can not react quickly to recover from them. Although extensive research has been conducted to deal with the problem, the multiple failure scenarios have never been properly addressed due to the limit of distributed control plane. In this paper, we propose a local fast reroute approach to effectively recover from multiple link failures in one administrative domain. The principle of Software Defined Networking (SDN) is used to achieve the software defined AS-level fast rerouting. Considering AS relationships, efficient algorithms are proposed to automatically and dynamically find protection paths for multiple link failures; then OpenFlow forwarding rules are installed on routers to provide data forwarding continuity. Our approach is able to ensure applicability to ASes with flexibility and adaptability to multiple link failures, contributing toward improving the network performance. Through experimental results, we show that our proposal provides effective failure recovery and does not introduce significant control overhead to the network.

scholarly journals A comprehensive evaluation of cache utilization characteristics in large scale WSN considering network driven cache replacement techniques

2018 ◽  
Vol 188 ◽  
pp. 05004
Author(s):  
Christos Panagiotou ◽  
Christos Antonopoulos ◽  
Stavros Koubias
Keyword(s):  
Smart City ◽  
Large Scale ◽  
Network Performance ◽  
Comprehensive Evaluation ◽  
Resource Conservation ◽  
Data Sources ◽  
Data Cache ◽  
Cache Replacement ◽  
Large Scale Networks ◽  
Result Analysis

WSNs as adopted in current smart city deployments, must address demanding traffic factors and resilience in failures. Furthermore, caching of data in WSN can significantly benefit resource conservation and network performance. However, data sources generate data volumes that could not fit in the restricted data cache resources of the caching nodes. This unavoidably leads to data items been evicted and replaced. This paper aims to experimentally evaluate the prominent caching techniques in large scale networks that resemble the Smart city paradigm regarding network performance with respect to critical application and network parameters. Through respective result analysis valuable insights are provided concerning the behaviour of caching in typical large scale WSN scenarios.

scholarly journals Towards a software-based mobility management for 5G: An experimental approach for flattened network architectures

2020 ◽  
Vol 17 (1) ◽  
pp. 51-70
Author(s):  
Jesús Calle-Cancho ◽  
José-Manuel Mendoza-Rubio ◽  
José-Luis González-Sánchez ◽  
David Cortés-Polo ◽  
Javier Carmona-Murillo
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Network Performance ◽  
Mobile Network ◽  
Network Control ◽  
Network Services ◽  
Smart Devices ◽  
Network Architectures ◽  
Data Traffic ◽  
Management Capability

The number of mobile subscribers, as well as the data traffic generated by them, is increasing exponentially with the growth of wireless smart devices and the number of network services that they can support. This significant growth is pushing mobile network operators towards new solutions to improve their network performance and efficiency. Thus, the appearance of Software Defined Networking (SDN) can overcome the limitations of current deployments through decoupling the network control plane from the data plane, allowing higher flexibility and programmability to the network. In this context, the process of handling user mobility becomes an essential part of future mobile networks. Taking advantage of the benefits that SDN brings, in this article we present a novel mobility management solution. This proposal avoids the use of IP-IP tunnels and it adds the dynamic flow management capability provided by SDN. In order to analyse performance, an analytical model is developed to compare it with NB-DMM (Network-based DMM), one of the main DMM (Distributed Mobility Management) solutions. Additionally, performance is also evaluated with an experimental testbed. The results allow handover latency in real scenarios and numerical investigations to be measured, and also show that SR-DMM achieves better efficiency in terms of signaling and routing cost than NB-DMM solution.

Sign in / Sign up

Export Citation Format

Share Document