Two energy-efficient, timesaving improvement mechanisms of network reprogramming in wireless sensor network

Authors:
Bibo Wang;Yu Chen;Hongliang Gu;Jian Yang;Tan Zhao
Affiliations:
School of Software, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China
Venue:
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Year:
2005

Citing 7
Cited 0

System architecture directions for networked sensors

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Maté: a tiny virtual machine for sensor networks

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Efficient code distribution in wireless sensor networks

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
MNP: Multihop Network Reprogramming Service for Sensor Networks

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
An Ultra Low Power System Architecture for Sensor Network Applications

Proceedings of the 32nd annual international symposium on Computer Architecture
Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Loading program code to sensor nodes is a basic function of wireless sensor network. However, it is infeasible to gather all sensor nodes once they are deployed. Thus, network reprogramming is greatly required. In this paper, we present two improvement mechanisms to current network reprogramming approaches: the resident mechanism to reduce the size of binary code to be disseminated and stored, and the hierarchical full indexing with sliding window mechanism to record lost code capsules. Both mechanisms can reduce radio transmission and storage access, which are main consumers of energy and time. Accordingly, our mechanisms are energy-efficient and timesaving.