Analytical model of coding-based reprogramming protocols in lossy wireless sensor networks

Date

2013

Authors

Li, J.
Li, S.
Zhang, Y.
Law, Y.W.
Zhou, X.
Palaniswami, M.

Editors

Advisors

Journal Title

Journal ISSN

Volume Title

Type:

Conference paper

Citation

2013 National Conference on Communications, NCC 2013, 2013, pp.1867-1871

Statement of Responsibility

Conference Name

IEEE International Conference on Communications (9 Jun 2013 - 13 Jun 2013 : Budapest, Hungary)

Abstract

Multi-hop over-the-air reprogramming is essential for the remote installation of software patches and upgrades in wireless sensor networks (WSNs). Recently, coding-based reprogramming protocols are proposed to address efficient code dissemination in environments with high packet loss rate. The problem of analyzing the performance of these protocols, however, has not been explored in the literature. In this paper, we present a high-fidelity analytical model based on Dijkstra’s shortest path algorithm to measure the completion time of codingbased reprogramming protocols. Our model takes into account not only page pipelining and negotiation, but also coding computation. Results from extensive simulations of a representative coding-based reprogramming protocol called Rateless Deluge are in good agreement with the performance predicted by our model, thus validating our approach. Our analytical results show both the number of packets per page and the finite field size have significant impact on completion time. Most notably, the time overhead of coding computation exceeds that of communication when the number of packets per page is 24 and the finite field size is at least 24.

School/Discipline

Dissertation Note

Provenance

Description

Access Status

Rights

Copyright 2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

License

Grant ID

Call number

Persistent link to this record