Paper Info
Title
An Analytical Model for Coding-Based Reprogramming Protocols in Lossy Wireless Sensor Networks.
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 $2^8$ ; 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 $2^4$ .
Year
DOI
Venue
2017
10.1109/TC.2016.2560805
IEEE Trans. Computers
Keywords
Field
DocType
Encoding,Protocols,Analytical models,Delays,Wireless sensor networks,Packet loss
Linear network coding,Key distribution in wireless sensor networks,Computer science,Network packet,Testbed,Computer network,Packet loss,Real-time computing,Coding (social sciences),Wireless sensor network,Dijkstra's algorithm
Journal
Volume
Issue
ISSN
66
1
0018-9340
Citations 
PageRank 
References 
1
0.35
38
Authors
8
Name
Order
Citations
PageRank
Jun-Wei Li110.35
Shining Li26415.32
Yu Zhang331.07
Tao Gu42034118.58
Yee Wei Law529023.84
Zhe Yang641.11
Xingshe Zhou7283.80
M. Palaniswami84107290.84