Conference Paper

SolarCode: Utilizing Erasure Codes for Reliable Data Delivery in Solar-powered Wireless Sensor Networks

Dept. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
DOI: 10.1109/INFCOM.2010.5462283 Conference: INFOCOM, 2010 Proceedings IEEE
Source: IEEE Xplore


Solar-powered sensor nodes have incentive to spend extra energy, especially when the battery is fully charged, because this energy surplus would be wasted otherwise. In this paper, we consider the problem of utilizing such energy surplus to adaptively adjust the redundancy level of erasure codes used in communication, so that the delivery reliability is improved while the network lifetime is still conserved. We formulate the problem as maximizing the end-to-end packet delivery probability under energy constraints. This formulated problem is hard to solve because of the combinatorics involved and the special curvature of its objective function. By exploiting its inherent properties, we propose an effective solution called SolarCode, which has a constant approximation ratio. We evaluate SolarCode in the context of our solar-powered sensor network testbed. Experiments show that SolarCode is successful in utilizing energy surplus and leads to higher data delivery reliability.

17 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: Solar sensor nodes, equipped with micro-solar subsystems [1], provide a new way to harvest ambient energy and also bring new challenges. This paper constructs an Energy Efficient Data Aggregation Tree (EDAT) based on a Maximal Weighted Connected Dominator Set (MaCDS). EDAT arms to prolong the network lifetime by minimizing the difference of energy consumption among solar nodes while we consider that harvested energy H{\mathcal{H}} randomly and uniformly distributes in the interval [Hmin,Hmax]{[{\mathcal{H}}_{min},{\mathcal{H}}_{max}]}. The total energy consumption difference of EDAT is at most \frac5[`(H)]|S|2n-1\frac{5{\overline{\mathcal{H}}}|{\mathcal{S}}|^2}{n-1}, where [`(H)]=|[Hmin,Hmax]|{\overline{\mathcal{H}}}=|{[{\mathcal{H}}_{min},{\mathcal{H}}_{max}]}| and S{\mathcal{S}} is the dominator set.
    Wireless Algorithms, Systems, and Applications - 6th International Conference, WASA 2011, Chengdu, China, August 11-13, 2011. Proceedings; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Energy is the most limiting factor in wireless sensor networks. Harvesting solar energy is a feasible solution to overcome the energy-constraint in some applications. It enables a theoretically infinite network lifetime, sustaining a mode of operation termed energy neutral consumption rate. The challenge arises, how can the harvested energy be utilized to maximize the performance of the sensor network. Considering a field monitoring application the performance is measured as the sustained sampling rate of the sensors. Maximizing the sampling rate needs to take the spatio-temporal distribution of load and energy into account, to prevent the overloading of nodes. In [12] they introduced a optimal, theoretical solution based on perfect global knowledge. In this paper we propose the solar-aware distributed flow (SDF) approach. SDF enables each node to predict the harvested energy, calculate a sustainable flow and control its local neighborhood. Extensive simulations confirmed that SDF achieves over 80% of the theoretical optimum, while introducing negligible overhead.
    IEEE 36th Conference on Local Computer Networks, LCN 2011, Bonn, Germany, October 4-7, 2011; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: M2M wireless communications network is a novel research topic, while the green communications is advocated in the subject, which can be reflected by the use of renewable energy. In this paper, we discuss the M2M network together with green communications. We design the flow control and transmission algorithm for the M2M network where there exist nodes using renewable energy. The algorithm need not know about the statistics knowledge of data rate, energy condition and the network condition, and the complexity is low. The aim is to reach an optimal or asymptotically optimal performance together with fairness.
Show more

Similar Publications