Next Article in Journal
WaterSpy: A High Sensitivity, Portable Photonic Device for Pervasive Water Quality Analysis
Next Article in Special Issue
PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks
Previous Article in Journal
Bearing-Only Obstacle Avoidance Based on Unknown Input Observer and Angle-Dependent Artificial Potential Field
Previous Article in Special Issue
Energy-Efficient Online Resource Management and Allocation Optimization in Multi-User Multi-Task Mobile-Edge Computing Systems with Hybrid Energy Harvesting
Article Menu
Issue 1 (January-1) cover image

Export Article

Open AccessArticle

Cost-Effective Edge Server Placement in Wireless Metropolitan Area Networks

1
School of Software, Central South University, Changsha 410083, China
2
Department of Computer Science, New York Institute of Technology, New York, NY 10023, USA
*
Authors to whom correspondence should be addressed.
Sensors 2019, 19(1), 32; https://doi.org/10.3390/s19010032
Received: 5 November 2018 / Revised: 6 December 2018 / Accepted: 6 December 2018 / Published: 21 December 2018
(This article belongs to the Special Issue Edge/Fog/Cloud Computing in the Internet of Things)
  |  
PDF [946 KB, uploaded 25 December 2018]
  |  

Abstract

Remote clouds are gradually unable to achieve ultra-low latency to meet the requirements of mobile users because of the intolerable long distance between remote clouds and mobile users and the network congestion caused by the tremendous number of users. Mobile edge computing, a new paradigm, has been proposed to mitigate aforementioned effects. Existing studies mostly assume the edge servers have been deployed properly and they just pay attention to how to minimize the delay between edge servers and mobile users. In this paper, considering the practical environment, we investigate how to deploy edge servers effectively and economically in wireless metropolitan area networks. Thus, we address the problem of minimizing the number of edge servers while ensuring some QoS requirements. Aiming at more consistence with a generalized condition, we extend the definition of the dominating set, and transform the addressed problem into the minimum dominating set problem in graph theory. In addition, two conditions are considered for the capacities of edge servers: one is that the capacities of edge servers can be configured on demand, and the other is that all the edge servers have the same capacities. For the on-demand condition, a greedy based algorithm is proposed to find the solution, and the key idea is to iteratively choose nodes that can connect as many other nodes as possible under the delay, degree and cluster size constraints. Furthermore, a simulated annealing based approach is given for global optimization. For the second condition, a greedy based algorithm is also proposed to satisfy the capacity constraint of edge servers and minimize the number of edge servers simultaneously. The simulation results show that the proposed algorithms are feasible. View Full-Text
Keywords: edge server placement; mobile edge computing; minimum dominating set; simulated annealing edge server placement; mobile edge computing; minimum dominating set; simulated annealing
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zeng, F.; Ren, Y.; Deng, X.; Li, W. Cost-Effective Edge Server Placement in Wireless Metropolitan Area Networks. Sensors 2019, 19, 32.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top