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

ABSTRACT 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.

0 Followers
 · 
83 Views
  • 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: In this paper, we provide a quality of information (QoI) based data selection and transmission service for classification missions in sensor networks. We first identify the two aspects of QoI, data reliability and data redundancy, and then propose metrics to estimate them. In particular, reliability implies the degree to which a sensor node contributes to the classification mission, and can be estimated through exploring the agreement between this node and the majority of others. On the other hand, redundancy represents the information overlap among different sensor nodes, and can be measured via investigating the similarity of their clustering results. Based on the proposed QoI metrics, we formulate an optimization problem that aims at maximizing the reliability of sensory data while eliminating their redundancies under the constraint of network resources. We decompose this problem into a data selection sub problem and a data transmission sub problem, and develop a distributed algorithm to solve them separately. The advantages of our schemes are demonstrated through the simulations on not only synthetic data but also a set of real audio records.
    Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Solar sensor nodes equipped with micro-solar subsystems [1] provide a novel approach to harvest ambient energy, which partially alleviated the energy-limitation in traditional wireless sensor networks. However, it also poses new challenges that the amounts of energy harvested by nodes are dynamic and unbalanced among them thus network life cannot be necessarily prolonged if no well-designed energy-scheduling is adopted. Herein, we present an algorithm to construct Energy-efficient Data Aggregation Tree (EDAT) based on a Maximum-Weighted Connected Dominating Set (MaCDS). The EDAT aims to prolong network life by minimizing differences in energy consumption among sensor nodes. Here we assume that the amount of harvested energy H randomly and uniformly distributes in the interval [Hmin,Hmax], where Hmax and Hmin are respectively the maximum and the minimum of H. The total energy consumption difference of an EDAT is at most 5H∼|S|2n-1, where H∼=|[Hmin,Hmax]|, and S is the dominating set and n the total number of nodes. Furthermore, we designed a link-scheduling algorithm to minimize the number of time slots necessary for scheduling all links in the whole network based on EDAT. The number of time slots is bounded in the interval [4δ−1,2lkϱ2], where lk is determined by hops k,ϱ=maxΔ,HmaxHmin, and δ and Δ are respectively the minimal and maximal degree of the network. We found the most efficient work period is not determined by the node with the minimum harvested energy but by the one with the minimum Hd, where d is the node’s degree in the EDAT. We determine the necessary condition required for every node to have sufficient energy to support consecutive operation.
    Computer Communications 12/2011; 34(18):2217-2226. DOI:10.1016/j.comcom.2011.06.011 · 1.35 Impact Factor