Abstract
In this paper, we consider a wireless machine-to-machine network composed of end-devices with energy harvesters that periodically transmit data to a gateway. While energy harvesting allows for perpetual operation, the uncertain amount of harvested energy may not guarantee fully continuous operation due to temporary energy shortages. This fact needs to be addressed at the medium access control layer. We thus investigate the performance of an energy harvesting-aware contention tree-based access (EH-CTA) protocol, which uses a tree-splitting algorithm to resolve collisions and takes energy availability into account. We derive a theoretical model to compute the probability of delivery and the time efficiency . In addition, we conduct a performance comparison of EH-CTA using an EH-aware dynamic frame slotted-ALOHA (EH-DFSA) as a benchmark. We determine the parameters that maximize performance and analyze how it is influenced by the amount of harvested energy and the number of end-devices. Results reveal the superior performance of EH-CTA over EH-DFSA. While EH-DFSA requires an estimate of the number of contending end-devices per frame to adapt the frame length, EH-CTA uses short and fixed frame lengths, which enables scalability and facilitates synchronization as the network density increases.
Highlights
Wireless Machine-to-Machine (M2M) networks aim at interconnecting and providing end-devices, e.g., sensors or actuators, with Internet connectivity
Motivated by the promising results, in this paper we extend the analysis of Energy Harvestingaware Contention Tree-based Access (EH-Contention Tree Algorithm (CTA)) with the following contributions: 1) Using a Markov chain model to analyze the evolution of the available energy in an end-device, we determine the configuration parameters of energy harvesting (EH)-CTA that maximize (i) the probability of delivery, which measures the ability of the Medium Access Control (MAC) protocol to successfully transmit data to the gateway from the end-devices without depleting their energy reserves, and (ii) the time efficiency, which measures the average number of data packets received by the coordinator per time slot
In particular we consider an ideal EHDFSA protocol in which the number of contenders in each frame is perfectly estimated, and the number of slots per frame is dynamically configured to be equal to the number of contenders per frame in order to minimize the time to resolve the contention in a Data Collection Rounds (DCR)
Summary
Wireless Machine-to-Machine (M2M) networks aim at interconnecting and providing end-devices, e.g., sensors or actuators, with Internet connectivity. This fact needs to be considered for the design of Medium Access Control (MAC) protocols which make an efficient use of the available energy and take the energy-harvesting process into account Motivated by this need, in this paper we focus on data collection scenarios using wireless M2M area networks where hundreds or thousands of end-devices equipped with energy-harvesters periodically transmit data upon request from a gateway. In the subsequent (k + 1)-th DCR, end-device 1 is in energy shortage, while end-devices 2, 3, Data collection round k TR
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Green Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
