In energy harvesting sensor networks, maximizing the data collection throughput is one of the most challenging issues. In this paper, we consider the problem of data collection on a pre-specified path using a mobile sink which has a fixedmobility pattern. As a generalization of the previous works, we propose an optimization model for the problem which incorporates the effective and heterogeneous duration of sensors' transmission in each time slot. To improve the network throughput, a simple condition is proposed which determines the maximum number of available time slots to each sensor node. Accordingly, the proposed condition specifies the constant velocity of the mobile sink. The NP-Hardness of the problem under the proposed condition is proved and an online centralized algorithm with less complexity is designed to handle the problem. Its complexity is in polynomial order and is easily scalable to the networks with large number of sensor nodes. Furthermore, we address the effect of increase in time slot period on the total amount of collected data which has not been yet exploited well. Finally, through extensive simulations on different set of deployed nodes, we observe that the proposed algorithm significantly increases the network throughput when the travelled distance by sink per time slot is reduced down to the adjusted point.
Nearly all bitrate adaptive video content delivered today is streamed using protocols that run a purely client based adaptation logic. The resulting lack of coordination may lead to suboptimal user experience and resource utilization. As a response, approaches that include the network and servers in the adaptation process are emerging. In this article, we present an optimized solution for network assisted adaptation specifically targeted to mobile streaming in multi-access edge computing (MEC) environments. Due to NP-Hardness of the problem, we have designed a heuristic-based algorithm with minimum need for parameter tuning and having relatively low complexity. We then study the performance of this solution against two popular client-based solutions, namely Buffer-Based Adaptation (BBA) and Rate-Based Adaptation (RBA), as well as to another network assisted solution. Our objective is two fold: First, we want to demonstrate the efficiency of our solution and second to quantify the benefits of network-assisted adaptation over the client-based approaches in mobile edge computing scenarios. The results from our simulations reveal that the network assisted adaptation clearly outperforms the purely client-based DASH heuristics in some of the metrics, not all of them, particularly, in situations when the achievable throughput is moderately high or the link quality of the mobile clients does not differ from each other substantially. Index Terms-Server and network assisted DASH, multi-access edge computing (MEC), quality of experience, fairness, load balancing, integer nonlinear programming (INLP), greedy scheduling algorithm
Plug-in electric vehicles are becoming one of indispensable prosumer electronics components for smart households and therefore, their cost efficient energy scheduling is one of the main challenging issues. In the current schemas, the charging and discharging interval of the vehicles are normally announced by the owners in advance leading to the suboptimal profit gain in some situations and hence consumers dissatisfaction. In this paper, we propose an efficient charging/discharging scheduling mechanism for electric vehicles in multiple homes common parking lot for smart households prosumers. The proposed mechanism takes into account the optimal interval allocation considering the instantaneous electricity load and the vehicles request pattern. Based on the data from the vehicles, a mixed optimization model is formulated by the central scheduler which aims to maximize the profit of consumers and is then solved using an effective algorithm. The optimization results are then sent to the system controller determining the interval and energy trading patterns between the power grid and the vehicles. The proposed algorithm has low complexity and ensures the energy satisfaction for all consumers. The performance of the scheduling schema is verified through multiple simulation scenarios.
Variations in electricity tariffs arising due to stochastic demand loads on the power grids have stimulated research in finding optimal charging/discharging scheduling solutions for electric vehicles (EVs). Most of the current EV scheduling solutions are either centralized, which suffer from low reliability and high complexity, while existing decentralized solutions do not facilitate the efficient scheduling of on-move EVs in large-scale networks considering a smart energy distribution system. Motivated by smart cities applications, we consider in this paper the optimal scheduling of EVs in a geographically large-scale smart energy distribution system where EVs have the flexibility of charging/discharging at spatially-deployed smart charging stations (CSs) operated by individual aggregators. In such a scenario, we define the social welfare maximization problem as the total profit of both supply and demand sides in the form of a mixed integer non-linear programming (MINLP) model. Due to the intractability, we then propose an online decentralized algorithm with low complexity which utilizes effective heuristics to forward each EV to the most profitable CS in a smart manner. Results of simulations on the IEEE 37 bus distribution network verify that the proposed algorithm improves the social welfare by about 30% on average with respect to an alternative scheduling strategy under the equal participation of EVs in charging and discharging operations. Considering the best-case performance where only EV profit maximization is concerned, our solution also achieves upto 20% improvement in flatting the final electricity load. Furthermore, the results reveal the existence of an optimal number of CSs and an optimal vehicle-to-grid penetration threshold for which the overall profit can be maximized. Our findings serve as guidelines for V2G system designers in smart city scenarios to plan a cost-effective strategy for large-scale EVs distributed energy management.INDEX TERMS Electric vehicle-to-grid (V2G), distributed energy management, mixed integer non-linear programming, greedy-based algorithm, smart cities.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.