The existence of coverageholes in cellular networks is a common problem for mobile operators. Traditionally, the cellular coverage is computed using sophisticated planning tools, and then optimized through drive test...
详细信息
ISBN:
(纸本)9781612848242
The existence of coverageholes in cellular networks is a common problem for mobile operators. Traditionally, the cellular coverage is computed using sophisticated planning tools, and then optimized through drive tests. With the drive tests information, the operators detect the poorly covered areas and take actions to eliminate them. The introduction of self-organized or "cognitive" techniques, would allow the operators to maximize the network's information obtained through drive tests or reported by the mobile users. In this paper we propose the use of spatial Bayesian geo-statistics to build a Radio Environment Map (REM) for real coverage hole detection purposes. Results show that the number of pixels forming the coverageholes, as well as the probability of detecting them, can be significantly increased with the use of REMs, compared to the case where only network measurements are used.
The paper proposes a framework to identify and avoid the coveragehole in an indoor industry environment. We assume an edge cloud co-located controller that followers the Automated Guided Vehicle (AGV) movement on a f...
详细信息
ISBN:
(纸本)9798350311143
The paper proposes a framework to identify and avoid the coveragehole in an indoor industry environment. We assume an edge cloud co-located controller that followers the Automated Guided Vehicle (AGV) movement on a factory floor over a wireless channel. The coverageholes are caused due to blockage, path-loss, and fading effects. An AGV in the coveragehole may lose connectivity to the edge-cloud and become unstable. To avoid connectivity loss, we proposed a framework that identifies the position of coveragehole using a Support-Vector Machine (SVM) classifier model and constructs a binary coveragehole map incorporating the AGV trajectory re-planning to avoid the identified coveragehole. The AGV's re-planned trajectory is optimized and selected to avoid coveragehole the shortest coverage-hole-free trajectory. We further investigated the look-ahead time's impact on the AGV's re-planned trajectory performance. The results reveal that an AGV's re-planned trajectory can be shorter and further optimized if the coveragehole position is known ahead of time.
Wireless Sensor Networks (WSNs) are critical for various applications ranging from environment monitoring to industrial monitoring. The varying and continuously growing interest in this field demands an understanding ...
详细信息
Wireless Sensor Networks (WSNs) are critical for various applications ranging from environment monitoring to industrial monitoring. The varying and continuously growing interest in this field demands an understanding of the sensor node distribution to ensure robustness and to improve resource utilization for data processing and decision making. In this paper, we focus on reconstructing the boundaries of a wireless sensor network, which also has a lot of applications in IoT and Robotics. As these sensor node locations can be considered as a set of points in the 2D plane, boundary detection of a WSN can be related to classical shape reconstruction problem in Computational Geometry. In this paper, we extend a simple and generic strategy for holedetection to a geometric solution for boundary/shape reconstruction. Furthermore, we introduce a simple and controllable heuristic algorithm to patch the coverageholes identified by our boundary reconstruction algorithm. Not only does this study improve the reliability of WSNs, but it also provides a useful tool for the extensive domain of computational geometry and shape analysis. Our different experiments show that the proposed reconstruction algorithm outperforms the existing state-of-the-art methods, and hole patching gives a simple and controllable solution for mobile node placement.
We focus on the full coveragehole problem in the context of Cloud Radio Access Networks while considering joint holes detection and cells interferences minimization. We propose a Branch and Cut algorithm describing t...
详细信息
ISBN:
(纸本)9781538647271
We focus on the full coveragehole problem in the context of Cloud Radio Access Networks while considering joint holes detection and cells interferences minimization. We propose a Branch and Cut algorithm describing the convex hull of this NP-Hard problem. New valid inequalities based on chordless cycles detection and network connectivity are added to this formulation to accelerate convergence time and detect rapidly coverageholes. Our Branch and Cut algorithm finds optimal solutions in acceptable times even for large problem instances. Simulation results and comparison to the state of the art highlight the efficiency and the usefulness of our approach.
暂无评论