Real-Time Pricing Strategy Based on the Stability of Smart Grid for Green Internet of Things

The ever increasing demand of energy efficiency and the strong awareness of environment have led to the enhanced interests in green Internet of things (IoTs). How to efficiently deliver power, especially, with the smart grid based on the stability of network becomes a challenge for green IoTs. Therefore, in this paper we present a novel real-time pricing strategy based on the network stability in the green IoTs enabled smart grid. Firstly, the outage is analyzed by considering the imbalance of power supply and demand as well as the load uncertainty. Secondly, the problem of power supply with multiple-retailers is formulated as a Stackelberg game, where the optimal price can be obtained with the maximal profit for retailers and users. Thirdly, the stability of price is analyzed under the constraints. In addition, simulation results show the efficiency of the proposed strategy

Maximizing Routing Throughput with Applications to Delay Tolerant Networks

abstract: Many applications require efficient data routing and dissemination in Delay Tolerant Networks (DTNs) in order to maximize the throughput of data in the network, such as providing healthcare to remote communities, and spreading related information in Mobile Social Networks (MSNs). In this thesis, the feasibility of using boats in the Amazon Delta Riverine region as data mule nodes is investigated and a robust data routing algorithm based on a fountain code approach is designed to ensure fast and timely data delivery considering unpredictable boat delays, break-downs, and high transmission failures. Then, the scenario of providing healthcare in Amazon Delta Region is extended to a general All-or-Nothing (Splittable) Multicommodity Flow (ANF) problem and a polynomial time constant approximation algorithm is designed for the maximum throughput routing problem based on a randomized rounding scheme with applications to DTNs. In an MSN, message content is closely related to users’ preferences, and can be used to significantly impact the performance of data dissemination. An interest- and content-based algorithm is developed where the contents of the messages, along with the network structural information are taken into consideration when making message relay decisions in order to maximize data throughput in an MSN. Extensive experiments show the effectiveness of the above proposed data dissemination algorithm by comparing it with state-of-the-art techniques.Dissertation/ThesisDoctoral Dissertation Computer Science 201