GI-Dagstuhl Seminar 16353 on Aware Machine to Machine Communication

@article{Sigg2017GIDagstuhlS1,
  title={GI-Dagstuhl Seminar 16353 on Aware Machine to Machine Communication},
  author={Stephan Sigg and Xiaoyan Wang},
  journal={Informatik-Spektrum},
  year={2017},
  volume={40},
  pages={466 - 491}
}
This article summarizes a five day GI-Dagstuhl Seminar on ’Aware machine-to-machine communication’ held from August 28th to September 2nd 2016. The seminar was a follow up of a DFG-JSPS seminar held in October 2015, in Karuizawa, Japan. The Karuizawa meeting focused on information-sharing in IoT, Crowd sensing and crowd steering, in-network data reduction, and Self-organizing data-collection networks. This second seminar focused on the aspects ’Security’, ’Services’, and ’Context’ in Machine-to… 

Figures from this paper

References

SHOWING 1-10 OF 31 REFERENCES

G-COPSS: A Content Centric Communication Infrastructure for Gaming Applications

Gaming over COPSS (G-COPSS) is proposed, a distributed communication infrastructure using a Content-Oriented Pub/Sub System (C COPSS) to enable efficient decentralized information dissemination in MMORPG, jointly exploiting the network and end-systems for player management and information dissemination.

COPSS: An Efficient Content Oriented Publish/Subscribe System

The proposed Content-Oriented Pub/Sub System (COPSS) enhances the heretofore inherently pull-based CCN architectures proposed by integrating a push based multicast capability at the content-centric layer and demonstrates that the architecture can achieve a scalable and efficient content centric pub/sub network.

Exploiting ICN for flexible management of software-defined networks

Function-Centric Service Chaining (FCSC) is proposed, a solution that exploits Information Centric Networking to provide flexibility in managing networks that utilize virtualization to dynamically place functions in the network as required.

The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks

A resurrecting duckling security policy model is presented, which describes secure transient association of a device with multiple serialised owners over the air in a short range wireless channel.

Vision: Augmenting WiFi Offloading with An Open-source Collaborative Platform

This position paper introduces an open-source platform for WiFi offloading that leverages the programmable feature of software-defined networking (SDN) to enhance extensibility and deployability in a collaborative manner, and exploits context awareness as a use case to demonstrate the efficacy of the solution.

Enabling energy-aware collaborative mobile data offloading for smartphones

  • A. DingB. Han S. Tarkoma
  • Computer Science
    2013 IEEE International Conference on Sensing, Communications and Networking (SECON)
  • 2013
A collaborative WiFi-based mobile data offloading architecture - Metropolitan Advanced Delivery Network (MADNet), targeting at improving the energy efficiency for smartphones, which design an energy-aware algorithm for energy-constrained devices to assist the offloading decision.

Comparison of naming schema in ICN

This paper provides both qualitative and quantitative comparison on the two naming schemas using these metrics, noting that they are interdependent.

Federated End-to-End Authentication for the Constrained Internet of Things Using IBC and ECC

This work proposes an efficient end-to-end authentication that assigns a robust and deployment-friendly federation scheme to gateways of IoT subnetworks, and has been evaluated with a modern twisted Edwards elliptic curve cryptography (ECC).

Secure Communication Based on Ambient Audio

This paper experimentally verified the feasibility of the proposed fuzzy-cryptography protocol in four different realistic settings and a laboratory experiment and applies statistical tests to show that the entropy of fingerprints based on ambient audio is high.

Information Leakage in Fuzzy Commitment Schemes

The analysis shows that fuzzy commitment is only optimal for the memoryless totally symmetric case if the scheme operates at the maximum secret-key rate, and it is demonstrated that for the general memoryless and stationary ergodic cases, the scheme leaks information on both the secret and biometric data.