Conference Proceeding

MCP: An Energy-Efficient Code Distribution Protocol for Multi-Application WSNs.

01/2009; DOI:10.1007/978-3-642-02085-8_19 In proceeding of: Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings
Source: DBLP

ABSTRACT In this paper, we study the code distribution problem in multi-application wireless sensor networks (MA-WSNs), i.e., sensor net- works that can support multiple applications. While MA-WSNs have many advantages over traditional WSNs, they tend to require frequent code movements in the network, and thus here new challenges for de- signing energy efficient code dissemination protocols. We propose MCP, a stateful Multicast based Code redistribution Proto- col for achieving energy efficiency. Each node in MCP maintains a small table to record the interesting information of known applications. The ta- ble enables sending out multicast-based code dissemination requests such that only a subset of neighboring sensors contribute to code dissemina- tion. Compared to broadcasting based schemes, MCP greatly reduces signal collision and saves both the dissemination time and reduces the number of dissemination messages. Our experiments results show that MCP can reduce dissemination time by 25% and message overhead by 20% under various network settings.

0 0
  • [show abstract] [hide abstract]
    ABSTRACT: One of the arising issues in wireless sensor networks is running multiple applications to reduce deployment, administrative and management costs. In this paper we assume a sensor network in which nodes of a group have a set of same applications in their external flash memory that some of them are loaded and running. Occasionally, these applications should be updated for reasons that are manifold ranging from fixing software bugs to retasking. It is often that updates for a subset of applications happen at the same time, for example when a routing protocol shared among a subset of applications is changed. To bring the sensor nodes up to date with the new versions of the applications, existing strategies transfer the delta code, a smaller code obtained from the differential compression between the binary representations of the old and the new version of each application, and let the sensor nodes rebuild the new version from the received delta and the old version. We discuss that these strategies are blind to the order of updates when a set of updates occurs simultaneously. We introduce a heuristic planner that yields a sequence for a set of simultaneous updates, which minimizes the total delta size without adding overhead on the sensor nodes. We illustrate the efficiency of our planner on some TinyOS applications.
    Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, Kerkyra, Corfu, Greece, June 28 - July 1, 2011; 01/2011