Conference Paper

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

DOI: 10.1007/978-3-642-02085-8_19 Conference: 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 Followers
 · 
73 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: As the applications of Wireless Sensor Networks increase rapidly, the number of deployed sensor devices proliferates, which prompts the research community to work towards their integration in the so-called "Internet of Things" to gather real time information and make the maximum out of their use towards enhancing the user experience. The capability to reconfigure/reprogram them remotely not only enables easy maintenance and code updates, which is mandatory in large sensor network deployments, but also provides an unprecedented flexibility regarding the use of all available resources of different types. However, the design of a reliable dissemination protocol is a real challenge and the reason is threefold: the desired reprogramming requirements differ from use case to use case (e.g. tolerated reprogramming time, affordable overhead), the wireless medium is characterized by low reliability, and the devices are severely resource constrained. For this reason, in this paper we first explore the reprogramming requirements and the intricacies of WSNs and then review the already proposed network protocols for reprogramming wireless sensor networks placing emphasis on the their features to guide both prospect users and designers efforts.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An energy-efficient online reprogramming protocol called EEORP is proposed. Based on Deluge framework, EEORP introduces two methods to reduce the consumption of energy during the dissemination of an image. Firstly EEORP separates the reprogramming protocol as an alone program image and implements the application as another program image equipped with the ability to listen to new code updates. During program image dissemination, only the application program image needs to be disseminated. In addition EEORP improves the dynamic adjustment algorithm of transmit rate of advertisement to reserve the energy. Our algorithm is based on Deluge. Hence it can easily be integrated into Deluge and has good prospects.
  • [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
Show more

Preview

Download
0 Downloads