Integrating peer-to-peer functionalities and routing in mobile ad-hoc networks

Mobile Ad-hoc Networks (MANETs) impose strict requirements in terms of battery life, communication overhead and network latency, therefore optimization should be made to applications and services such as domain name service (DNS), dynamic host configuration protocol (DHCP) and session initiation protocol (SIP) if they are to be considered for use on MANETs. Due to the decentralized and self-organizing nature of MANETs, such applications could utilize a distributed name resolution/data storage service. Distributed Hash Tables (DHTs) enable these features by virtually organizing the network topology in a peer-to-peer (P2P) overlay. P2P overlays have been designed to operate on the application layer without knowledge of the underlying network thus causing poor performance. To address this problem, we propose and evaluate two different DHTs integrated with MANET routing in order to optimize the overall performance of MANET communications when P2P applications and services are used. Both architectures share the same functionality such as decentralization, self-reorganization, and self-healing but differ in MANET routing protocol. Performance evaluation using the NS2 simulator shows that these architectures are suited to different scenarios namely increasing network size and peer velocity. Comparisons with other well-known solutions have proven their efficiency with regard to the above requirements

On Constructing Persistent Identifiers with Persistent Resolution Targets

Persistent Identifiers (PID) are the foundation referencing digital assets in scientific publications, books, and digital repositories. In its realization, PIDs contain metadata and resolving targets in form of URLs that point to data sets located on the network. In contrast to PIDs, the target URLs are typically changing over time; thus, PIDs need continuous maintenance -- an effort that is increasing tremendously with the advancement of e-Science and the advent of the Internet-of-Things (IoT). Nowadays, billions of sensors and data sets are subject of PID assignment. This paper presents a new approach of embedding location independent targets into PIDs that allows the creation of maintenance-free PIDs using content-centric network technology and overlay networks. For proving the validity of the presented approach, the Handle PID System is used in conjunction with Magnet Link access information encoding, state-of-the-art decentralized data distribution with BitTorrent, and Named Data Networking (NDN) as location-independent data access technology for networks. Contrasting existing approaches, no green-field implementation of PID or major modifications of the Handle System is required to enable location-independent data dissemination with maintenance-free PIDs.Comment: Published IEEE paper of the FedCSIS 2016 (SoFAST-WS'16) conference, 11.-14. September 2016, Gdansk, Poland. Also available online: http://ieeexplore.ieee.org/document/7733372

User-Relative Names for Globally Connected Personal Devices

Nontechnical users who own increasingly ubiquitous network-enabled personal devices such as laptops, digital cameras, and smart phones need a simple, intuitive, and secure way to share information and services between their devices. User Information Architecture, or UIA, is a novel naming and peer-to-peer connectivity architecture addressing this need. Users assign UIA names by "introducing" devices to each other on a common local-area network, but these names remain securely bound to their target as devices migrate. Multiple devices owned by the same user, once introduced, automatically merge their namespaces to form a distributed "personal cluster" that the owner can access or modify from any of his devices. Instead of requiring users to allocate globally unique names from a central authority, UIA enables users to assign their own "user-relative" names both to their own devices and to other users. With UIA, for example, Alice can always access her iPod from any of her own personal devices at any location via the name "ipod", and her friend Bob can access her iPod via a relative name like "ipod.Alice".Comment: 7 pages, 1 figure, 1 tabl

A practical guide on using SPOT-GPR, a freeware tool implementing a SAP-DoA technique

This is a software paper, which main objective is to provide practical information on how to use SPOT-GPR release 1.0, a MATLAB®-based software for the analysis of ground penetrating radar (GPR) profiles. The software allows detecting targets and estimating their position in a two-dimensional scenario, it has a graphical user interface and implements an innovative sub-array processing method. SPOT-GPR was developed in the framework of the COST Action TU1208 “Civil Engineering Applications of Ground Penetrating Radar” and is available for free download on the website of the Action (www.GPRadar.eu)

BaseFs - Basically Acailable, Soft State, Eventually Consistent Filesystem for Cluster Management

A peer-to-peer distributed filesystem for community cloud management. https://github.com/glic3rinu/basef

Exploiting the Synergy Between Gossiping and Structured Overlays

In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes