An analytical model for coding-based reprogramming protocols in lossy wireless sensor networks

Li, J, Li, S, Zhang, Y, Gu, T, Law, Y, Yang, Z, Zhou, X and Palaniswami, M 2017, 'An analytical model for coding-based reprogramming protocols in lossy wireless sensor networks', IEEE Transactions on Computers, vol. 66, no. 1, pp. 24-37.

Document type: Journal Article
Collection: Journal Articles

Title An analytical model for coding-based reprogramming protocols in lossy wireless sensor networks
Author(s) Li, J
Li, S
Zhang, Y
Gu, T
Law, Y
Yang, Z
Zhou, X
Palaniswami, M
Year 2017
Journal name IEEE Transactions on Computers
Volume number 66
Issue number 1
Start page 24
End page 37
Total pages 14
Publisher IEEE
Abstract Multi-hop over-the-air reprogramming is essential for remote installation of software patches and upgrades in wireless sensor networks (WSNs). Several recent coding-based reprogramming protocols have been proposed to enable efficient code dissemination in high packet loss environments. An accurate and formal analysis of the performance of these protocols, however, has not been studied sufficiently in the literature. In this paper, we present a novel high-fidelity analytical model based on the shortest path algorithm to measure the completion time by incorporating overhearing and packet coding. This model can be applied to any coding-based reprogramming protocol by substituting the coding part with protocol specific operations. We conduct extensive testbed experiments to evaluate the performance of our proposed model. Based on the analytical and numerical experiments, we find that 1) overhearing causes significant reduction of the completion time in dense wireless sensor networks, particularly, it reduces 50-70 percent of the total completion time when the packet reception rate is 0.896; 2) coding delay plays a key role in the total completion time compared to the communication delay when the packet coding parameters are selected appropriately, for example, the communication delay is about 65 percent of the coding delay when the number of packets per page is 16 for the finite field size 28 ; 3) the total completion time can be minimized when the number of packets per page is close to 24 and the finite field size is close to 24 .
Subject Networking and Communications
Mobile Technologies
Keyword(s) reprogramming
code dissemination
network coding
analytical model
lossy wireless sensor networks
DOI - identifier 10.1109/TC.2016.2560805
Copyright notice © 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission
ISSN 0018-9340
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 95 Abstract Views  -  Detailed Statistics
Created: Thu, 05 Jan 2017, 07:51:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us