Design and performance analysis of MAC schemes for Wireless Sensor Networks Powered by Ambient Energy Harvesting

详细信息    查看全文

• 作者：Zhi Ang Eu^a ; ^{euzhiang@nus.edu.sg} ; Hwee-Pink Tan^b ; ^{hptan@i2r.a-star.edu.sg} ; Winston K.G. Seah^c ; ^{Winston.Seah@ecs.vuw.ac.nz} [Author vitae]
• 关键词：Wireless sensor networks ; Medium access control ; CSMA ; Probabilistic polling ; Energy harvesting
• 刊名：Ad Hoc Networks
• 出版年：2011
• 出版时间：May 2011
• 年：2011
• 卷：9
• 期：3
• 页码：300-323
• 全文大小：3381 K

文摘

Energy consumption is a perennial issue in the design of wireless sensor networks (WSNs) which typically rely on portable sources like batteries for power. Recent advances in ambient energy harvesting technology have made it a potential and promising alternative source of energy for powering WSNs. By using energy harvesters with supercapacitors, WSNs are able to operate perpetually until hardware failure and in places where batteries are hard or impossible to replace. In this paper, we study the performance of different medium access control (MAC) schemes based on CSMA and polling techniques for WSNs which are solely powered by ambient energy harvesting using energy harvesters. We base the study on (i) network throughput (S), which is the rate of sensor data received by the sink, (ii) fairness index (F), which determines whether the bandwidth is allocated to each sensor node equally and (iii) inter-arrival time (γ) which measures the average time difference between two packets from a source node. For CSMA, we compare both the slotted and unslotted variants. For polling, we first consider identity polling. Then we design a probabilistic polling protocol that takes into account the unpredictability of the energy harvesting process to achieve good performance. Finally, we present an optimal polling MAC protocol to determine the theoretical maximum performance. We validate the analytical models using extensive simulations incorporating experimental results from the characterization of different types of energy harvesters. The performance results show that probabilistic polling achieves high throughput and fairness as well as low inter-arrival times.