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.
Hierarchical networks can provide efficient data aggregation in M2M or other power-limited systems to enable successful end-to-end transmission. Despite previous research efforts, e.g., @cite_15 , @cite_1 and @cite_18 , to the best of our knowledge, there has been no study focusing on data aggregation schemes for M2M networks together with the rate coverage characteristics, especially from an energy optimal design perspective. Providing such a study is the main contribution of this paper.
@cite_15 @cite_1 @cite_18
2167465093 2069417310
A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center. As wireless sensor networks utilize battery-operated nodes, energy efficiency is of paramount importance at all levels of system design. In order to save energy in the transfer of data from the sensor nodes to one or more sinks, the data may be routed through other nodes rather than transmitting it directly to the sink(s). In this article, we investigate the problem of energy-efficient transmission of data over a noisy channel, focusing on the setting of physical-layer parameters. We derive a metric called the energy per successfully received bit, which specifies the expected energy required to transmit a bit successfully over a particular distance given a channel noise model. By minimizing this metric, we can find, for different modulation schemes, the energy-optimal relay distance and the optimal transmit energy as a function of channel noise level and path loss exponent. These results enable network designers to select the hop distance, transmit power, and or modulation scheme that maximize network lifetime.