Articles
Sustainable Computing: Informatics and Systems (22105379)46
To reduce latency and save energy, cloudlet computing enables tasks to be offloaded from user equipment to Cloudlet Servers (CSs). Determining the optimal number of CSs and the appropriate locations for their placement are two major challenges in building an efficient computing platform. Placing a CS at the closest location to the user can improve the QoS. Additionally, providing additional CSs to cover each user ensures that the user's needs are met even if the designated server is unable to provide services. However, to minimize energy consumption and costs, service providers tend to use a minimum number of CSs. Since the coverage zones of different CSs may overlap, fewer additional servers need to be deployed in such areas. This paper examines the problem of CS placement in a Wireless Metropolitan Area Network (WMAN) and introduces a three-objective model that aims to optimize transmission distance, coverage with overlap control, and energy consumption. To obtain an appropriate Pareto front, the performance of the NSGA-II, binary MOPSO, and binary MOGWO algorithms is examined through four different scenarios under the Shanghai Telecom dataset. Comparing the results of the Hyper-Volume (HV) indicator reveals that the NSGA-II algorithm has higher values in all studied scenarios. A higher HV value means that the solution set is closer to an optimal Pareto set. In the best and worst case, the HV values for the NSGA-II were equal to 0.2275 and 0.1883, respectively. © 2025 Elsevier Inc.
Computing (14365057)107(6)
Consolidating the Internet of Things (IoT) and Software Defined Networks (SDN) has been a great concern among researchers. In IoT, Wireless Sensor Network (WSN) is important communication component. Due to the large volume of data generated in IoT and the limitations of WSN, load distribution in these networks is a serious challenge. The Base Station (BS) in these networks may experience a lot of delay due to high processing. Also, data of applications in these networks must inform to users with the lowest delay. Therefore, in addition to load distribution, reducing response time is also one of the factors that must be considered. Therefore, load distribution among BS’s seems to be crucial Considering several BSs and their relationships with the network nodes and preventing them from overloading through load distribution may solve the problem. This can be implemented by applying the common nodes that belong to several BSs. That is, to reduce the load of the overloaded BS, the common node in the cluster corresponding to BS and the other BSs is selected to send common node load to the other BSs. The common node is selected through the load-balancing node-finder algorithm. Load transfer is done through the forwarding node, which is specified in the proposed routing process. The Colored Petri Nets (CPN) s are applied to implement the proposed method. Here, queue length, residual energy, nodes, BSs, and delay time are simulated in three scenarios. The results show that most of the nodes are applied in the proposed algorithm to implement load balancing between the nodes and BSs. The results show the proposed SDN-based algorithm reduces the residual energy to 18%, the queue length to 9.5%, and the delay to 35%. © The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2025.