BROWSE
Detail
Conference Paper
LACONIC: History-Based Code Dissemination in Programmable Wireless Sensor Networks
Cited 1 time in 
Share 
Share
- Authors
- Seung Ki Hong, Yeon Jun Choi, Yang Yu, Loren J. Rittle
- Issue Date
- 2008-12
- Citation
- International Conference on Mobile Ad-hoc and Sensor Networks (MSN) 2008, pp.234-241
- Language
- English
- Type
- Conference Paper
- Abstract
- Reprogramming over the network is an essential requirement in large-scale, long term wireless sensor network deployments. In this paper, we present LACONIC, a history-based code dissemination technique, for programmable wireless sensor networks supporting multiple applications. In order to attain network traffic abatement and timely code delivery, LACONIC exploits (1) application calling history and (2) code dissemination history. The application calling history is modeled by a Application Call Graph(ACG) which represents the calling relationships among multiple applications. Second, the code dissemination history as a set of observed previous code forwarding paths indicates previous code forwarding path of the associated application in the context of the application calling history. Therefore, the code request triggered by a requester is reached to the responder by traveling along the path, not being consecutively flooded. Using a flooding-based existing code dissemination work as the baseline, we show the effectiveness of Laconic in terms of network traffic and time delay through both probability model-based analysis and simulation results. © 2008 IEEE.
- KSP Keywords
- Analysis and simulation, Associated application, Call Graph, Code Dissemination, Model-based analysis, Multiple Applications, Network Traffic, Probability Model, Time Delay, Wireless sensor networks(WSNs), history-based