An improving energy efficiency cooperation algorithm based on Nash bargaining solution in selfish user cooperative networks

A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.

Optimization Task Scheduling Using Cooperation Search Algorithm for Heterogeneous Cloud Computing Systems

Cloud computing has taken over the high-performance distributed computing area,and it currently provides on-demand services and resource polling over the web.As a result of constantly changing user service demand,the task scheduling problem has emerged as a critical analytical topic in cloud computing.The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions.Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system.The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system.As a result,an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan.This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem.The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution.We assess our algorithm’s performance by running it through three scenarios with varying numbers of tasks.The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm(NGA),Genetic Algorithm(GA),Whale Optimization Algorithm(WOA),Gravitational Search Algorithm(GSA),and Hybrid Heuristic and Genetic(HHG)by 7.9%,2.1%,8.8%,7.7%,3.4%respectively according to makespan.

Improved multi-objective artificial bee colony algorithm for optimal power flow problem

The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting objectives of OPF, instead of transforming multi-objective functions into a single objective function. The main idea of HMOABC is to extend original ABC algorithm to multi-objective and cooperative mode by combining the Pareto dominance and divide-and-conquer approach. HMOABC is then used in the 30-bus IEEE test system for solving the OPF problem considering the cost, loss, and emission impacts. The simulation results show that the HMOABC is superior to other algorithms in terms of optimization accuracy and computation robustness.

Cooperative detection algorithm of spectrum holes in cognitive radio

To improve the detection performance of sensing users for primary users in the cognitive radio, an optimal cooperative detection algorithm for many sensing users is proposed. In this paper, optimal decision thresholds of each sensing user are discussed. Theoretical analysis and simulation results indicate that the detection probability of optimal decision threshold rules is better than that of determined threshold rules when the false alarm of the fusion center is constant. The proposed optimal cooperative detection algorithm improves the detection performance of primary users as the attendees grow. The 2 dB gain of detection probability can be obtained when a new sensing user joins in, and there is a 17 dB improvement when the accumulation number increases from 1 to 50.

Designing price-contingent vegetable rotation schedules using agent-based simulation

Chinese vegetable production cooperatives supply their members, mostly smallholder farmers, with a rotation schedule for the year. Since vegetable prices are not stable throughout the year, designing a rotation schedule that maximizes expected profits, distributes farmers＇ profits more equitably, maintains the diversity of produce in the market, and reduces the risk of pests and diseases, requires adaptive, price-contingent rotation schedules（here, called ＂self-adaptive adjustment＂）. This study uses an agent-based simulation（ABS） to design self-adaptive rotation schedules that deliver these aims. The selfadaptive adjustment strategy was more profitable for farmers when faced with price volatility, and more equitable as well. This work provides a decision-support tool for managers of Chinese vegetable production cooperatives to provide farmers with more profitable and equitable rotation schedules.

CREATION OF OPTIMAL MOVEMENT STRATEGY OF PLURAL MOVING OB-JECTS BY GA

The topographic information of a closed world is expressed as a graph. The plural mov- ingobjects which go and back in it according to a single moving strategy are supposed.The moving strategy is expressed by numerical values as a decision table. Coding is performed with this table as chromosomes, and this is optimized by using genetic algorithm. These environments were realized on a computer, and the simulation was carried out. As the result, the learning of the method to act so that moving objects do not obstruct mutually was recognized, and it was confirmed that these methods are effective for optimizing moving strategy.

Simultaneous Position Estimation and Omnidirectional Camera Parameter Calibration for Multiple Mobile Robots

This paper proposed an algorithm on simultaneous position estimation and calibration of omnidirectional camera parameters for a group of multiple mobile robots. It is aimed at developing of exploration and information gathering robotic system in unknown environment. Here, each mobile robot is not possible to know its own position. It can only estimate its own position by using the measurement value including white noise acquired by two omnidirectional cameras mounted on it. Each mobile robot is able to obtain the distance to those robots observed from the images of two omnidirectional cameras while making calibration during moving but not in advance. Simulation of three robots moving straightly shows the effectiveness of the proposed algorithm.

A Stochastic Approach for Cooperative Position Estimation of Multiple Mobile Robots

This paper proposes the cooperative position estimation of a group of mobile robots, which pertbrms disaster relief tasks in a wide area. When searching the wide area, it becomes important to know a robot＇s position correctly. However, for each mobile robot, it is impossible to know its own position correctly. Therefore, each mobile robot estimates its position from the data of sensor equipped on it. Generally, the sensor data is incorrect since there is sensor noise, etc. This research considers two types of the sensor data errors from omnidirectional camera. One is the error of white noise of the image captured by omnidirectional camera and so on. Another is the error of position and posture between two omnidirectional cameras. To solve the error of latter case, we proposed a self-position estimation algorithm for multiple mobile robots using two omnidirectional cameras and an accelerometer. On the other hand, to solve the error of the former case, this paper proposed an algorithm of cooperative position estimation for multiple mobile robots. In this algorithm, each mobile robot uses two omnidirectional cameras to observe the surrounding mobile robot and get the relative position between mobile robots. Each mobile robot estimates its position with only measurement data of each other mobile robots. The algorithm is based on a Bayesian filtering. Simulations of the proposed cooperative position estimation algorithm for multiple mobile robots are performed. The results show that position estimation is possible by only using measurement value from each other robot.