Home Engineering Modeling and Optimization for Mobile Social Networks
Algorithm Design for Scheme Implementation
Based on the above analysis of four-stage Stackelberg game, we present an iteration algorithm to implement our scheme. For the cloud resource, it can update its cloud resource price to obtain a maximum utility and then announce this price to all brokers. Since the media cloud is not aware of the duration of each adjustment, the media cloud sets a waiting time Twmc for the next strategy update. Similarly, as each broker is not aware of the duration of each evolution, it sets a waiting Tw,b for the next strategy to update the size of the purchased cloud resource and the price to charge users. In the evolutionary game, each user randomly selects a broker to connect initially, and then changes his strategy to maximize his own utility. If a users utility is lower than the average utility of his community, this user may change his connection with a probability, denoted by
where Uj is the average utility of community j. When all users in the same community obtain an equal utility, the evolution will be completed. We present the algorithm by Algorithm 1.
Algorithm 1: Resource allocation iteration algorithm
|< Prev||CONTENTS||Next >|