Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Computer Science Faculty Publications

Sensor networks

Publication Year

Articles 1 - 4 of 4

Full-Text Articles in Computer Engineering

Smart Communities: From Sensors To Internet Of Things And To A Marketplace Of Services, Stephan Olariu, Nirwan Ansari (Editor), Andreas Ahrens (Editor), Cesar Benavente-Preces (Editor) Jan 2020

Smart Communities: From Sensors To Internet Of Things And To A Marketplace Of Services, Stephan Olariu, Nirwan Ansari (Editor), Andreas Ahrens (Editor), Cesar Benavente-Preces (Editor)

Computer Science Faculty Publications

Our paper was inspired by the recent Society 5.0 initiative of the Japanese Government that seeks to create a sustainable human-centric society by putting to work recent advances in technology: sensor networks, edge computing, IoT ecosystems, AI, Big Data, robotics, to name just a few. The main contribution of this work is a vision of how these technological advances can contribute, directly or indirectly, to making Society 5.0 reality. For this purpose we build on a recently-proposed concept of Marketplace of Services that, in our view, will turn out to be one of the cornerstones of Society 5.0. Instead of …


Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle Jan 2009

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle

Computer Science Faculty Publications

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …


Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti Jan 2007

Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti

Computer Science Faculty Publications

This paper considers the security of sensor network applications. Our approach creates multicast regions that use symmetric key cryptography for communications. Each multicast region contains a single keyserver that is used to perform key management and maintain the integrity of a multicast region. Communications between two multicast regions is performed by nodes that belong to both regions. To ease the network management burden, it is desirable for the networks to self-organize into regions and dynamically select their keyservers. This paper shows how to determine the number of keyservers (k) to use and the size in the number of hops (h) …


Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic Jan 2005

Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic

Computer Science Faculty Publications

(First paragraph) We are very proud and honored to have been entrusted to be Guest Editors for this special issue. Papers were sought to comprehensively cover the algorithmic issues in the “hot” area of sensor networking. The concentration was on network layer problems, which can be divided into two groups: data communication problems and topology control problems. We wish to briefly introduce the five papers appearing in this special issue. They cover specific problems such as time division for reduced collision, fault tolerant clustering, self-stabilizing graph optimization algorithms, key pre-distribution for secure communication, and distributed storage based on spanning trees …