We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are known as “network flow models.” You will also see that if a network flow model has “integer-valued data,” the simplex method finds an optimal solution that is integer-valued.

Flows in Networks

Annual Energy Outlook 2008 With Projections to 2030

Energy efficiency is increasingly important for future information and communication technologies (ICT), because the increased usage of ICT, together with increasing energy costs and the need to reduce green house gas emissions call for energy-efficient technologies that decrease the overall energy consumption of computation, storage and communications. Cloud computing has recently received considerable attention, as a promising approach for delivering ICT services by improving the utilization of data centre resources. In principle, cloud computing can be an inherently energy-efficient technology for ICT provided that its potential for significant energy savings that have so far focused on hardware aspects, can be fully explored with respect to system operation and networking aspects. Thus this paper, in the context of cloud computing, reviews the usage of methods and technologies currently used for energy-efficient operation of computer hardware and network infrastructure. After surveying some of the current best practice and relevant literature in this area, this paper identifies some of the remaining key research challenges that arise when such energy-saving techniques are extended for use in cloud computing environments.

Energy-Efficient Cloud Computing

The great amounts of energy consumed by large-scale computing and network systems, such as data centers and supercomputers, have been a major source of concern in a society increasingly reliant on information technology. Trying to tackle this issue, the research community and industry have proposed myriad techniques to curb the energy consumed by IT systems. This article surveys techniques and solutions that aim to improve the energy efficiency of computing and network resources. It discusses methods to evaluate and model the energy consumed by these resources, and describes techniques that operate at a distributed system level, trying to improve aspects such as resource allocation, scheduling, and network traffic management. This work aims to review the state of the art on energy efficiency and to foster research on schemes to make network and computing resources more efficient.

https://hal.inria.fr/hal-00767582/document

A survey on techniques for improving the energy efficiency of large-scale distributed systems

In this paper, we address the problem of deploying heterogeneous mobile sensors over a target area. Traditional approaches to mobile sensor deployment are specifically designed for homogeneous networks. Nevertheless, network and device homogeneity is an unrealistic assumption in most practical scenarios, and previous approaches fail when adopted in heterogeneous operative settings. For this reason, we introduce VorLag, a generalization of the Voronoi-based approach which exploits the Laguerre geometry. We theoretically prove the appropriateness of our proposal to the management of heterogeneous networks. In addition, we demonstrate that VorLag can be extended to deal with dynamically generated events or uneven energy depletion due to communications. Finally, by means of simulations, we show that VorLag provides a very stable sensor behavior, with fast and guaranteed termination and moderate energy consumption. We also show that VorLag performs better than its traditional counterpart and other methods based on virtual forces.

/pdf/autonomous-deployment-of-heterogeneous-mobile-sensors-3w4o852r0y.pdf

Autonomous Deployment of Heterogeneous Mobile Sensors

Over 500 million host computers, three billion PCs and mobile devices consume over a billion kilowatts of electricity. As part of this “system” computer networks consume an increasing amount of energy, and help reduce energy expenditure from other sources through E-Work, E-Commerce and E-Learning. Traditionally, network design seeks to minimise network cost and maximise quality of service (QoS). This paper examines some approaches for dynamically managing wired packet networks to minimise energy consumption while meeting users' QoS needs, by automatically turning link drivers and/or routers on/off in response to changes in network load.

Reducing power consumption in wired networks

Mobile sensor networks are important for several strategic applications devoted to monitoring critical areas. In such hostile scenarios, sensors cannot be deployed manually and are either sent from a safe location or dropped from an aircraft. Mobile devices permit a dynamic deployment reconfiguration that improves the coverage in terms of completeness and uniformity. 
In this paper we propose a distributed algorithm for the autonomous deployment of mobile sensors called Push&Pull. According to our proposal, movement decisions are made by each sensor on the basis of locally available information and do not require any prior knowledge of the operating conditions or any manual tuning of key parameters. 
We formally prove that, when a sufficient number of sensors are available, our approach guarantees a complete and uniform coverage. Furthermore, we demonstrate that the algorithm execution always terminates preventing movement oscillations. 
Numerous simulations show that our algorithm reaches a complete coverage within reasonable time with moderate energy consumption, even when the target area has irregular shapes. Performance comparisons between Push&Pull and one of the most acknowledged algorithms show how the former one can efficiently reach a more uniform and complete coverage under a wide range of working scenarios.

Push & Pull: autonomous deployment of mobile sensors for a complete coverage

This paper proposes a framework for contingency management using smart loads, which are realized through the emerging paradigm of the Internet of things. The framework involves the system operator, the load serving entities (LSEs), and the end-users with smart home management systems that automatically control adjustable loads. The system operator uses an efficient linear equation solver to quickly calculate the load curtailment needed at each bus to relieve congested lines after a contingency. Given this curtailment request, an LSE calculates a power allowance for each of its end-use customers to maximize the aggregate user utility. This large-scale NP-hard problem is approximated to a convex optimization for efficient computation. A smart home management system determines the appliances allowed to be used in order to maximize the user’s utility within the power allowance given by the LSE. Since the user’s utility depends on the near-future usage of the appliances, the framework provides the Welch-based reactive appliance prediction (WRAP) algorithm to predict the user behavior and maximize utility. The proposed framework is validated using the New England 39-bus test system. The results show that power system components at risk can be quickly alleviated by adjusting a large number of small smart loads. Additionally, WRAP accurately predicts the users’ future behavior, minimizing the impact on the aggregate users’ utility.

Managing Contingencies in Smart Grids via the Internet of Things

Mobile sensor networks are important for several strategic applications devoted to monitoring critical areas. In such hostile scenarios, sensors cannot be deployed manually and are either sent from a safe location or dropped from an aircraft. Mobile devices permit a dynamic deployment reconfiguration that improves the coverage in terms of completeness and uniformity. In this paper we propose a distributed algorithm for the autonomous deployment of mobile sensors called Push & Pull. According to our proposal, movement decisions are made by each sensor on the basis of locally available information and do not require any prior knowledge of the operating conditions or any manual tuning of key parameters. We formally prove that, when a sufficient number of sensors are available, our approach guarantees a complete and uniform coverage. Furthermore, we demonstrate that the algorithm execution always terminates preventing movement oscillations. Numerous simulations show that our algorithm reaches a complete coverage within reasonable time with moderate energy consumption, even when the target area has irregular shapes. Performance comparisons between Push & Pull and one of the most acknowledged algorithms show how the former one can efficiently reach a more uniform and complete coverage under a wide range of working scenarios.

/pdf/push-pull-autonomous-deployment-of-mobile-sensors-for-a-18vlu16uts.pdf

Simone Silvestri

Papers

Autonomous Deployment of Heterogeneous Mobile Sensors

Reducing power consumption in wired networks

Push & Pull: autonomous deployment of mobile sensors for a complete coverage

Managing Contingencies in Smart Grids via the Internet of Things

Push & Pull: autonomous deployment of mobile sensors for a complete coverage