scholarly journals A Time-Driven Cloudlet Placement Strategy for Workflow Applications in Wireless Metropolitan Area Networks

2021 ◽  
Author(s):  
Jianshan zhang ◽  
Ming Li ◽  
Xianghan Zheng ◽  
Ching-Hsien Hsu
Keyword(s):  
Mobile Devices ◽  
Metropolitan Area ◽  
Rapid Development ◽  
Computation Offloading ◽  
Metropolitan Area Networks ◽  
Placement Problem ◽  
Data Dependencies ◽  
Wireless Metropolitan Area Networks ◽  
Computational Resources ◽  
The Impact

Abstract With the rapid development of mobile technology, mobile applications have increasing requirements for computational resources, and mobile devices can no longer meet these requirements. Mobile edge computing (MEC) has emerged in this context and has brought innovation into the working mode of traditional cloud computing. By provisioning edge server placement, the computing power of the cloud centre is distributed to the edge of the network. The abundant computational resources of edge servers compensate for the lack of mobile devices and shorten the communication delay between servers and users. Constituting a specific forms of edge servers, cloudlets have been widely studied within academia and industry in recent years. However, existing studies have mainly focused on computation offloading for general computing tasks under fixed cloudlet placement positions. They ignored the impact on computation offloading results from cloudlet placement positions and data dependencies among mobile application components. In this paper, we study the cloudlet placement problem based on Workflow Applications (WAs) in Wireless Metropolitan Area Networks (WMANs). We devise a cloudlet placement strategy based on a Particle swarm optimization algorithm using Genetic algorithm operators with the Encoding Library updating mode (PGEL), which enables the cloudlet to be placed in appropriate positions. The simulation results show that the proposed strategy can obtain a near-optimal cloudlets placement scheme, and compared with other classic algorithms, this algorithm can reduce the execution time of WAs by 15.04%-44.99%.

scholarly journals An IoT-Oriented Offloading Method with Privacy Preservation for Cloudlet-Enabled Wireless Metropolitan Area Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3030 ◽  
Author(s):  
Zhanyang Xu ◽  
Renhao Gu ◽  
Tao Huang ◽  
Haolong Xiang ◽  
Xuyun Zhang ◽  
...  
Keyword(s):  
Mobile Devices ◽  
Metropolitan Area ◽  
Data Transmission ◽  
Mobile Applications ◽  
Privacy Preservation ◽  
Differential Evolution Algorithm ◽  
Metropolitan Area Networks ◽  
Personal Privacy ◽  
Multi Objective ◽  
Wireless Metropolitan Area Networks

With the development of the Internet of Things (IoT) technology, a vast amount of the IoT data is generated by mobile applications from mobile devices. Cloudlets provide a paradigm that allows the mobile applications and the generated IoT data to be offloaded from the mobile devices to the cloudlets for processing and storage through the access points (APs) in the Wireless Metropolitan Area Networks (WMANs). Since most of the IoT data is relevant to personal privacy, it is necessary to pay attention to data transmission security. However, it is still a challenge to realize the goal of optimizing the data transmission time, energy consumption and resource utilization with the privacy preservation considered for the cloudlet-enabled WMAN. In this paper, an IoT-oriented offloading method, named IOM, with privacy preservation is proposed to solve this problem. The task-offloading strategy with privacy preservation in WMANs is analyzed and modeled as a constrained multi-objective optimization problem. Then, the Dijkstra algorithm is employed to evaluate the shortest path between APs in WMANs, and the nondominated sorting differential evolution algorithm (NSDE) is adopted to optimize the proposed multi-objective problem. Finally, the experimental results demonstrate that the proposed method is both effective and efficient.

Security and Privacy Approaches for Wireless Local and Metropolitan Area Networks (LANs & MANs)

2008 ◽  
pp. 732-746
Author(s):  
Giorgos Kostopoulos ◽  
Nicolas Sklavos ◽  
Odysseas Koufopavlou
Keyword(s):  
Metropolitan Area ◽  
Local Area Network ◽  
Wireless Lans ◽  
Security Protocol ◽  
Communication Overhead ◽  
Area Network ◽  
Security Threats ◽  
Metropolitan Area Networks ◽  
Wired Networks ◽  
Wireless Metropolitan Area Networks

Wireless communications are becoming ubiquitous in homes, offices, and enterprises with the popular IEEE 802.11 wireless local area network (LAN) technology and the up-and-coming IEEE 802.16 wireless metropolitan area networks (MAN) technology. The wireless nature of communications defined in these standards makes it possible for an attacker to snoop on confidential communications or modify them to gain access to home or enterprise networks much more easily than with wired networks. Wireless devices generally try to reduce computation overhead to conserve power and communication overhead to conserve spectrum and battery power. Due to these considerations, the original security designs in wireless LANs and MANs used smaller keys, weak message integrity protocols, weak or one-way authentication protocols, and so forth. As wireless networks became popular, the security threats were also highlighted to caution users. A security protocol redesign followed first in wireless LANs and then in wireless MANs. This chapter discusses the security threats and requirements in wireless LANs and wireless MANs, with a discussion on what the original designs missed and how they were corrected in the new protocols. It highlights the features of the current wireless LAN and MAN security protocols and explains the caveats and discusses open issues. Our aim is to provide the reader with a single source of information on security threats and requirements, authentication technologies, security encapsulation, and key management protocols relevant to wireless LANs and MANs.

scholarly journals Cost-Effective Edge Server Placement in Wireless Metropolitan Area Networks

Sensors ◽  
2018 ◽  
Vol 19 (1) ◽  
pp. 32 ◽  
Author(s):  
Feng Zeng ◽  
Yongzheng Ren ◽  
Xiaoheng Deng ◽  
Wenjia Li
Keyword(s):  
Metropolitan Area ◽  
Dominating Set ◽  
Cost Effective ◽  
Mobile Users ◽  
Metropolitan Area Networks ◽  
New Paradigm ◽  
Long Distance ◽  
On Demand ◽  
Wireless Metropolitan Area Networks ◽  
Definition Of

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.

Sign in / Sign up

Export Citation Format

Share Document