T.F. Abdelzaher

Publications (2)0 Total impact

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

  Yong Yang, Lu Su, Yan Gao, T.F. Abdelzaher
  [show abstract] [hide abstract]
  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.
  INFOCOM, 2010 Proceedings IEEE; 04/2010
• Source

  Available from: Bolin Ding

  Conference Proceeding: oCast: Optimal multicast routing protocol for wireless sensor networks

  Lu Su, Bolin Ding, Yong Yang, T.F. Abdelzaher, Guohong Cao, J.C. Hou
  [show abstract] [hide abstract]
  ABSTRACT: In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermittent connectivity that results from duty-cycling further complicates the problem. Nevertheless, we present both a centralized and distributed algorithm that are provably optimal when the number of destinations is small. This model is motivated by scenarios where sensors report to a small number of base stations or where data needs to be replicated on a small number of other nodes. We further propose an extended version of oCast, called delay bounded oCast (DB-oCast), which can discover optimal multicast trees under a predefined delay bound. Finally, we demonstrate the advantages of our schemes through both theoretical analysis and simulations.
  Network Protocols, 2009. ICNP 2009. 17th IEEE International Conference on; 11/2009