Machine-to-machine (M2M) communication's severe power limitations challenge the interconnectivity, access management, and reliable communication of data. In densely deployed M2M networks, controlling and aggregating the generated data is critical. We propose an energy efficient data aggregation scheme for a hierarchical M2M network. We develop a coverage probability-based optimal data aggregation scheme for M2M devices to minimize the average total energy expenditure per unit area per unit time or simply the energy density of an M2M communication network. Our analysis exposes the key tradeoffs between the energy density of the M2M network and the coverage characteristics for successive and parallel transmission schemes that can be either half-duplex or full-duplex. Comparing the rate and energy performances of the transmission models, we observe that successive mode and half-duplex parallel mode have better coverage characteristics compared to full-duplex parallel scheme. Simulation results show that the uplink coverage characteristics dominate the trend of the energy consumption for both successive and parallel schemes.
Because low-power M2M devices may not be able to communicate with the BS directly, hierarchical architectures may be necessary. Hence, critical design issues also include optimizing hierarchical organization of the devices and energy efficient data aggregation. Although these issues have not been studied in the context of M2M, there is prior work on distributed networks in the context of wired communications. In @cite_25 , energy consumption is optimized by studying a distributed protocol for stationary ad hoc networks. In @cite_20 , a distribution problem which consists of subscribers, distribution and concentration points for a wired network model is studied to minimize the cost by optimizing the density of distribution points. In @cite_11 , a hierarchical network including sinks, aggregators and sensors is proposed, which yields significant energy savings.
@cite_25 @cite_20 @cite_11
2110519532 2540490069 2069443635 2114102402
Energy-efficiency, one of the major design goals in wireless cellular networks, has received much attention lately, due to increased awareness of environmental and economic issues for network operators. In this paper, we develop a theoretical framework for BS energy saving that encompasses dynamic BS operation and the related problem of user association together. Specifically, we formulate a total cost minimization that allows for a flexible tradeoff between flow-level performance and energy consumption. For the user association problem, we propose an optimal energy-efficient user association policy and further present a distributed implementation with provable convergence. For the BS operation problem (i.e., BS switching on off), which is a challenging combinatorial problem, we propose simple greedy-on and greedy-off algorithms that are inspired by the mathematical background of submodularity maximization problem. Moreover, we propose other heuristic algorithms based on the distances between BSs or the utilizations of BSs that do not impose any additional signaling overhead and thus are easy to implement in practice. Extensive simulations under various practical configurations demonstrate that the proposed user association and BS operation algorithms can significantly reduce energy consumption. In this paper, we study resource allocation for a multicarrier-based cognitive radio (CR) network. More specifically, we investigate the problem of secondary users’ energy-efficiency (EE) maximization problem under secondary total power and primary interference constraints. First, assuming cooperation among the secondary base stations (BSs), a centralized approach is considered to solve the EE optimization problem for the CR network where the primary and secondary users are using either orthogonal frequency-division multiplexing (OFDM) or filter bank based multicarrier (FBMC) modulations. We propose an alternating-based approach to solve the joint power-subcarrier allocation problem. More importantly, in the first place, subcarriers are allocated using a heuristic method for a given feasible power allocation. Then, we conservatively approximate the nonconvex power control problem and propose a joint successive convex approximation-Dinkelbach algorithm (SCADA) to efficiently obtain a solution to the nonconvex power control problem. The proposed algorithm is shown to converge to a solution that coincides with the stationary point of the original nonconvex power control subproblem. Moreover, we propose a dual decomposition-based decentralized version of the SCADA. Second, under the assumption of no cooperation among the secondary BSs, we propose a fully distributed power control algorithm from the perspective of game theory. The proposed algorithm is shown to converge to a Nash-equilibrium (NE) point. Moreover, we propose a sufficient condition that guarantees the uniqueness of the achieved NE. Extensive simulation analyses are further provided to highlight the advantages and demonstrate the efficiency of our proposed schemes. The energy consumption of the information and communication technology (ICT) industry, which has become a serious problem, is mostly due to the network infrastructure rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of base stations (BSs) by adjusting their working modes (active or sleep). Specifically, the objective is to minimize the energy consumption while satisfying quality of service (QoS, e.g., blocking probability) requirement and, at the same time, avoiding frequent mode switching to reduce signaling and delay overhead. The problem is modeled as a dynamic programming (DP) problem, which is NP-hard in general. Based on cooperation among neighboring BSs, a low-complexity algorithm is proposed to reduce the size of state space as well as that of action space. Simulations demonstrate that, with the proposed algorithm, the active BS pattern well meets the time variation and the non-uniform spatial distribution of system traffic. Moreover, the tradeoff between the energy saving from BS sleeping and the cost of switching is well balanced by the proposed scheme. Green communications has received much attention recently. For cellular networks, the base stations (BSs) account for more than 50 percent of the energy consumption of the networks. Therefore, reducing the power consumption of BSs is crucial to achieve green cellular networks. With the development of green energy technologies, BSs are able to be powered by green energy in order to reduce the on-grid energy consumption, thus reducing the CO2 footprints. In this paper, we envision that the BSs of future cellular networks are powered by both on-grid energy and green energy. We optimize the energy utilization in such networks by maximizing the utilization of green energy, and thus saving on-grid energy. The optimal usage of green energy depends on the characteristics of the energy generation and the mobile traffic, which exhibit both temporal and spatial diversities. We decompose the problem into two sub-problems: the multi-stage energy allocation problem and the multi-BSs energy balancing problem. We propose algorithms to solve these sub-problems, and subsequently solve the green energy optimization problem. Simulation results demonstrate that the proposed solution achieves significant on-grid energy savings.