scholarly journals Optimal Incentive Pricing on Relaying Services for Maximizing Connection Availability in Multihop Cellular Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-17
Author(s):  
Ming-Hua Lin ◽  
Hao-Jan Hsu

This paper investigates an incentive pricing problem for relaying services in multihop cellular networks. Providing incentives to encourage mobile nodes to relay data is a critical factor in building successful multihop cellular networks. Most existing approaches adopt fixed-rate or location-based pricing on rewarding packets forwarding. This study applies a mathematical programming model to determine an optimal incentive price for each intermediate node that provides relaying services. Under the obtained incentive price, the connection availability of the networks is maximized by using the same relaying costs as other pricing schemes. A signomial geometric programming problem is constructed, and a deterministic optimization approach is employed to solve the problem. Besides, quality-of-service constraints are added in the proposed model to mitigate the unfairness between connection availabilities of individual nodes. Computational results demonstrate that the proposed model obtains the optimal incentive price on relaying services to maximize connection availability of the networks.

Author(s):  
Xiang Li ◽  
Xin Yang ◽  
Hongwei Wang ◽  
Shuai Su ◽  
Wenzhe Sun

For subway systems, the energy put into accelerating the trains can be reconverted into electric energy by using the motors as generators during braking phase. Generally speaking, except a small part is used for on-board purposes, most of the recovery energy is transmitted backwards along the conversion chain and fed back into the catenary. However, since the low catenary voltage DC systems, the transmission losses are very high. In order to improve the utilization of recovery energy, this paper proposes an optimization approach to cooperate the acceleration and brake times of successive trains such that the recovery energy from the braking train can be directly used by the accelerating train. First, we formulate a quadratic programming model to optimize the cooperative degree with trip time constraint and time window constraints. Furthermore, we solve the optimal solution by using the Kuhn-Tucker conditions. Finally, we present a numerical example based on the operation data from Beijing Yizhuang subway line of China, which illustrates that the proposed model can improve the cooperative degree by 9.08%.


2021 ◽  
Author(s):  
Rajkumar M ◽  
Karthika J

Abstract MANET is a wireless topology mainly used to grouping several mobile nodes as network. This wireless network is highly vulnerable by several security threads. Blackhole attack, a severe thread that voluntarily disrupts the healthy nodes and turn it as malicious node. So, introducing security mechanism can forcefully work together to defeat the black hole attack. In this paper, a new approach of AntHoc based trust behavioural network (AntHoc-TBN) model is introduced. This model effectively discovers the route with trust based packet transmission take place. Here, the forward ant agent performs shortest distance computation to discover the route. So that, Dijikstra algorithm is employed to detect the shortest route of all other nodes from source. Then, trust procedure is applied to find that corresponding node is trustable or not. Based on trust threshold, the respective intermediate node is computed and stored the updated value in extended data routing information (EDRI) table. Once the condition is not satisfied, then updated value in EDRI table tends to be distrust node and the concerned node is eliminated from the routing table. Now, the trusted node becomes an active path after that the packet has to be sent. Likewise, the same process is repeated for backward ant agent to transfer the Ack message from destination to source. To simulate the process, the result reveals that the AntHoc-TBN model improves its efficiency by lowest delay, packet loss and routing overhead. And also, the technique gets highest value of packet delivery ratio. The performance measures of our proposed model achieves better outcome when compared to existing techniques such as AODV, AntNet and AntHoc Net.


2020 ◽  
Author(s):  
Ahmed Abdelmoaty ◽  
Wessam Mesbah ◽  
Mohammad A. M. Abdel-Aal ◽  
Ali T. Alawami

In the recent electricity market framework, the profit of the generation companies depends on the decision of the operator on the schedule of its units, the energy price, and the optimal bidding strategies. Due to the expanded integration of uncertain renewable generators which is highly intermittent such as wind plants, the coordination with other facilities to mitigate the risks of imbalances is mandatory. Accordingly, coordination of wind generators with the evolutionary Electric Vehicles (EVs) is expected to boost the performance of the grid. In this paper, we propose a robust optimization approach for the coordination between the wind-thermal generators and the EVs in a virtual<br>power plant (VPP) environment. The objective of maximizing the profit of the VPP Operator (VPPO) is studied. The optimal bidding strategy of the VPPO in the day-ahead market under uncertainties of wind power, energy<br>prices, imbalance prices, and demand is obtained for the worst case scenario. A case study is conducted to assess the e?effectiveness of the proposed model in terms of the VPPO's profit. A comparison between the proposed model and the scenario-based optimization was introduced. Our results confirmed that, although the conservative behavior of the worst-case robust optimization model, it helps the decision maker from the fluctuations of the uncertain parameters involved in the production and bidding processes. In addition, robust optimization is a more tractable problem and does not suffer from<br>the high computation burden associated with scenario-based stochastic programming. This makes it more practical for real-life scenarios.<br>


Fluids ◽  
2019 ◽  
Vol 4 (3) ◽  
pp. 162 ◽  
Author(s):  
Thorben Helmers ◽  
Philip Kemper ◽  
Jorg Thöming ◽  
Ulrich Mießner

Microscopic multiphase flows have gained broad interest due to their capability to transfer processes into new operational windows and achieving significant process intensification. However, the hydrodynamic behavior of Taylor droplets is not yet entirely understood. In this work, we introduce a model to determine the excess velocity of Taylor droplets in square microchannels. This velocity difference between the droplet and the total superficial velocity of the flow has a direct influence on the droplet residence time and is linked to the pressure drop. Since the droplet does not occupy the entire channel cross-section, it enables the continuous phase to bypass the droplet through the corners. A consideration of the continuity equation generally relates the excess velocity to the mean flow velocity. We base the quantification of the bypass flow on a correlation for the droplet cap deformation from its static shape. The cap deformation reveals the forces of the flowing liquids exerted onto the interface and allows estimating the local driving pressure gradient for the bypass flow. The characterizing parameters are identified as the bypass length, the wall film thickness, the viscosity ratio between both phases and the C a number. The proposed model is adapted with a stochastic, metaheuristic optimization approach based on genetic algorithms. In addition, our model was successfully verified with high-speed camera measurements and published empirical data.


Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3615
Author(s):  
Adelaide Cerveira ◽  
Eduardo J. Solteiro Pires ◽  
José Baptista

Green energy has become a media issue due to climate changes, and consequently, the population has become more aware of pollution. Wind farms are an essential energy production alternative to fossil energy. The incentive to produce wind energy was a government policy some decades ago to decrease carbon emissions. In recent decades, wind farms were formed by a substation and a couple of turbines. Nowadays, wind farms are designed with hundreds of turbines requiring more than one substation. This paper formulates an integer linear programming model to design wind farms’ cable layout with several turbines. The proposed model obtains the optimal solution considering different cable types, infrastructure costs, and energy losses. An additional constraint was considered to limit the number of cables that cross a walkway, i.e., the number of connections between a set of wind turbines and the remaining wind farm. Furthermore, considering a discrete set of possible turbine locations, the model allows identifying those that should be present in the optimal solution, thereby addressing the optimal location of the substation(s) in the wind farm. The paper illustrates solutions and the associated costs of two wind farms, with up to 102 turbines and three substations in the optimal solution, selected among sixteen possible places. The optimal solutions are obtained in a short time.


2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.


Author(s):  
Zahra Homayouni ◽  
Mir Saman Pishvaee ◽  
Hamed Jahani ◽  
Dmitry Ivanov

AbstractAdoption of carbon regulation mechanisms facilitates an evolution toward green and sustainable supply chains followed by an increased complexity. Through the development and usage of a multi-choice goal programming model solved by an improved algorithm, this article investigates sustainability strategies for carbon regulations mechanisms. We first propose a sustainable logistics model that considers assorted vehicle types and gas emissions involved with product transportation. We then construct a bi-objective model that minimizes total cost as the first objective function and follows environmental considerations in the second one. With our novel robust-heuristic optimization approach, we seek to support the decision-makers in comparison and selection of carbon emission policies in supply chains in complex settings with assorted vehicle types, demand and economic uncertainty. We deploy our model in a case-study to evaluate and analyse two carbon reduction policies, i.e., carbon-tax and cap-and-trade policies. The results demonstrate that our robust-heuristic methodology can efficiently deal with demand and economic uncertainty, especially in large-scale problems. Our findings suggest that governmental incentives for a cap-and-trade policy would be more effective for supply chains in lowering pollution by investing in cleaner technologies and adopting greener practices.


Sign in / Sign up

Export Citation Format

Share Document