Selective Reprogramming in Sensor Networks

D. Kruger; D. Pfisterer; C. Buschmann

doi:10.1109/NTMS.2011.5721055

Selective Reprogramming in Sensor Networks

D. Kruger, D. Pfisterer, C. Buschmann

Institute of Telematics

Abstract

This paper introduces a selective reprogramming scheme for wireless sensor networks, which is reliable, robust and scalable. Selective wireless code replacements are mandatory for real-world deployments where no wired connections exist to a majority of the nodes and where different hardware or different roles lead to a heterogeneous network. The presented scheme is based on the idea that nodes to be updated share missing program parts with each other. We show by real-world experiments and simulations that it reduces the duration of the update process and the number of transmitted messages compared to related work. Even in extremely lossy networks, it reprograms 225 nodes in less than 120 seconds.

Original language	English
Title of host publication	2011 4th IFIP International Conference on New Technologies, Mobility and Security
Number of pages	5
Publisher	IEEE
Publication date	01.02.2011
Pages	1-5
ISBN (Print)	978-1-4244-8705-9
ISBN (Electronic)	978-1-4244-8704-2
DOIs	https://doi.org/10.1109/NTMS.2011.5721055
Publication status	Published - 01.02.2011
Event	4th IFIP International Conference on New Technologies, Mobility and Security - Paris, France Duration: 07.02.2011 → 10.02.2011

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being
SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities
SDG 12 Responsible Consumption and Production

Access to Document

10.1109/NTMS.2011.5721055

Cite this

@inproceedings{aa931b17cd0541ba8425c4bc478e69d4,

title = "Selective Reprogramming in Sensor Networks",

abstract = "This paper introduces a selective reprogramming scheme for wireless sensor networks, which is reliable, robust and scalable. Selective wireless code replacements are mandatory for real-world deployments where no wired connections exist to a majority of the nodes and where different hardware or different roles lead to a heterogeneous network. The presented scheme is based on the idea that nodes to be updated share missing program parts with each other. We show by real-world experiments and simulations that it reduces the duration of the update process and the number of transmitted messages compared to related work. Even in extremely lossy networks, it reprograms 225 nodes in less than 120 seconds.",

author = "D. Kruger and D. Pfisterer and C. Buschmann",

year = "2011",

month = feb,

day = "1",

doi = "10.1109/NTMS.2011.5721055",

language = "English",

isbn = "978-1-4244-8705-9",

series = "International Conference on New Technologies, Mobility and Security",

publisher = "IEEE",

pages = "1--5",

booktitle = "2011 4th IFIP International Conference on New Technologies, Mobility and Security",

note = "4th IFIP International Conference on New Technologies, Mobility and Security, NTMS 2011 ; Conference date: 07-02-2011 Through 10-02-2011",

}

Kruger, D, Pfisterer, D & Buschmann, C 2011, Selective Reprogramming in Sensor Networks. in 2011 4th IFIP International Conference on New Technologies, Mobility and Security. International Conference on New Technologies, Mobility and Security, IEEE, pp. 1-5, 4th IFIP International Conference on New Technologies, Mobility and Security, Paris, France, 07.02.11. https://doi.org/10.1109/NTMS.2011.5721055

TY - GEN

T1 - Selective Reprogramming in Sensor Networks

AU - Kruger, D.

AU - Pfisterer, D.

AU - Buschmann, C.

PY - 2011/2/1

Y1 - 2011/2/1

N2 - This paper introduces a selective reprogramming scheme for wireless sensor networks, which is reliable, robust and scalable. Selective wireless code replacements are mandatory for real-world deployments where no wired connections exist to a majority of the nodes and where different hardware or different roles lead to a heterogeneous network. The presented scheme is based on the idea that nodes to be updated share missing program parts with each other. We show by real-world experiments and simulations that it reduces the duration of the update process and the number of transmitted messages compared to related work. Even in extremely lossy networks, it reprograms 225 nodes in less than 120 seconds.

AB - This paper introduces a selective reprogramming scheme for wireless sensor networks, which is reliable, robust and scalable. Selective wireless code replacements are mandatory for real-world deployments where no wired connections exist to a majority of the nodes and where different hardware or different roles lead to a heterogeneous network. The presented scheme is based on the idea that nodes to be updated share missing program parts with each other. We show by real-world experiments and simulations that it reduces the duration of the update process and the number of transmitted messages compared to related work. Even in extremely lossy networks, it reprograms 225 nodes in less than 120 seconds.

UR - https://www.scopus.com/pages/publications/79952823257

U2 - 10.1109/NTMS.2011.5721055

DO - 10.1109/NTMS.2011.5721055

M3 - Conference contribution

SN - 978-1-4244-8705-9

T3 - International Conference on New Technologies, Mobility and Security

SP - 1

EP - 5

BT - 2011 4th IFIP International Conference on New Technologies, Mobility and Security

PB - IEEE

T2 - 4th IFIP International Conference on New Technologies, Mobility and Security

Y2 - 7 February 2011 through 10 February 2011

ER -

Selective Reprogramming in Sensor Networks

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this