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.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) have emerged as means of providing automated monitoring, target tracking, and intrusion detection. Solar-powered WSNs that adopt innovative sensors with low power consumption and forefront networking technologies can provide rapidly deployable situational awareness and effective security control at the border at low cost. In our paper, we introduce the prototype of our new solar-powered WSN platform for Border Security. We consider practical issues in WSNs, including sensing environment classification, survivability under harsh weather conditions, and efficient solar energy harvesting. Experimental results demonstrate the performance of our new solar-powered WSN.
    Proceedings of SPIE - The International Society for Optical Engineering 05/2012; DOI:10.1117/12.919200 · 0.20 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The design of Wireless Sensor Networks is a challenge, requiring to correctly balancing between performance, time, cost and energy. But the main problem with rechargeable WSNs is to predict at design time which will be the total system autonomy. Moreover, it depends on the energy harvested from the environment, and we know that weather may be very unsettled. Thus, it is crucial to design and fine scale the entire power supply chain in order to produce a robust WSN. In this article, we propose an energy estimator able to handle environment like weather parameters to estimate the system autonomy. The key innovation comes from the capability to dynamically rebuild the models all along the project evolution with real measurements on the hardware and to include weather forecasts as dynamic parameters of the DPM policy. Finally, we have experiment various configurations and compared the hardware WSN against the simulator. The results have validated the relevance of the estimator for prospecting various energy problems. By experiment, the estimator has shown that most environmental energy was wasted due to the battery charging constraints. This will foresee the opportunities of energy gains, and the definition of newer extra power modes for the Dynamic Power Management. This work contributes to the domain for WSN design methodology, energy scavenging and energy management to optimize system autonomy.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Existing scheduling schemes for stochastic event capture with rechargeable sensors either adopt simplified assumptions on event staying time or provide no performance guarantee. Considering the stochasticity of event staying time, we investigate the sensor scheduling problem aiming to maximize the overall Quality of Monitoring (QoM) in events capture application of wireless rechargeable sensor networks. We first provide a paradigm to calculate the QoM of a point of interests (PoI) and formulate the scheduling problem into an optimization problem. Although we find that that this problem is NP-complete, we prove that the objective function of the optimization problem is monotone submodular. Therefore we can express the problem as a maximization of a submodular function subject to a matroid constraint. Accordingly we can design an approximation algorithm which achieves a factor of 1/2 of the optimum. We evaluate the performance of our solution through simulations, and simulation results show that our scheme outperforms former works.
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE; 01/2013