Broadcasting operation is used to distribute the information from one WSNs node to all nodes. In this paper, we develop a protocol for energy efficient Broadcasting based on Ant colony system Optimization Algorithm that is called BAOA. We present the procedure of BAOA including six steps when searching the optimized broadcasting path in WSNs and design BAOA with UML. We also simulate BAOA with C++ language and the results show the lifetime of BAOA is longer and the total energy consumption is less than BIP.

A game theoretic method was proposed to adaptively maintain the energy efficiency in distributed wireless sensor networks. Based on a widely used transmission paradigm, the utility function was formulated under a proposed noncooperative framework and then the existence of Nash Equilibrium (NE) has been proved to guarantee system stability. To pursuit NE, an NPC algorithm was proposed to regulate heterogeneous nodes with various communication demands given the definition of urgency level. Results from both simulation and real testbed presented the robustness and rapid convergence of NPC algorithm. Furthermore, the network performance can remain in a promising state while the energy consumption is greatly decreased.

Kelly's network utility maximisation (NUM) problems and solutions are aimed to maximise the aggregate utility subject to link capacity constraints. They are formulated and solved by using the individual flow rate vector. Because of the architecture of the current networks such as the Internet, the individual flow rates are generally not measurable directly at the routers for the network service provider. However, the aggregate flow rates are more convenient to obtain and to adjust. In this paper, we still study the NUM problems for communication networks but from a router‐level bandwidth allocation standpoint. With the use of the generalised matrix inverse, we propose a general model of utility‐optimised router‐level bandwidth allocation and its solution, where the objective function and the constraints are formulated in terms of the aggregate flow rate vector rather than from the individual flow rate vector as in the usual NUM problem. We find that the new proposed models are equivalent to Kelly's NUM model in the sense that they lead to the same optimum and their solutions satisfy the given routing scheme. We also discuss the special cases where the routing matrix is of full row rank and where there is one single‐hop flow in every link in the network. We suggest a direct application to Internet Protocol‐based virtual private network of the latter case. We present the mathematical models and solution procedures that lead to the utility‐optimised aggregate flow rate vector and further illustrate them by numerical examples. We believe our approach is promising for deployment in communication networks. Copyright © 2012 John Wiley & Sons, Ltd.

No abstract

China, as the world's largest cement producer, accounts for more than 60% of global cement production. With the continuous development of the Chinese economy, resource and environmental constraints are becoming increasingly serious, and energy saving and emission reduction has become one of the choices with which all industries are faced in the process of development. The cement industry is one of the major sources of China's carbon dioxide emissions and its effect on energy saving and emissions' reduction determines the realization of the national goals of energy conservation and emissions reduction. Taking China's cement industry as the main focus, this paper carries out quantitative analysis of the relationship between energy consumption in the cement industry and a number of variables: energy structure, energy prices, energy efficiency and total output value of the cement industry based on a cointegration model. The study further analyzes the energy saving potential of the cement industry by assuming different scenarios. The research results show that the energy saving potential of the cement industry is 19.06% and 33.69%, with medium and high energy efficiency, respectively.