Proof-of-Concept Implementation of the Ahoy Discovery Protocol for Ad-hoc Networks

The context discovery protocol Ahoy has been proposed ear- lier for resource-limited fully-distributed ad-hoc networks. Ahoy has been proven as an efficient context discovery pro- tocol, which generates only little network traffic, in both static and dynamic ad-hoc networks. In this report, we im- plement the prototype of Ahoy and test it on UNIX-like platforms. We show the possibility to implement Ahoy in the real world

Searching in Unstructured Overlays Using Local Knowledge and Gossip

This paper analyzes a class of dissemination algorithms for the discovery of distributed contents in Peer-to-Peer unstructured overlay networks. The algorithms are a mix of protocols employing local knowledge of peers' neighborhood and gossip. By tuning the gossip probability and the depth k of the k-neighborhood of which nodes have information, we obtain different dissemination protocols employed in literature over unstructured P2P overlays. The provided analysis and simulation results confirm that, when properly configured, these schemes represent a viable approach to build effective P2P resource discovery in large-scale, dynamic distributed systems.Comment: A revised version of the paper appears in Proc. of the 5th International Workshop on Complex Networks (CompleNet 2014) - Studies in Computational Intelligence Series, Springer-Verlag, Bologna (Italy), March 201

A new security architecture for SIP based P2P computer networks

Many applications are transferred from C/S (Client/Server) mode to P2P (Peer-to-Peer) mode such as VoIP (Voice over IP). This paper presents a new security architecture, i.e. a trustworthy authentication algorithm of peers, for Session Initialize Protocol (SIP) based P2P computer networks. A mechanism for node authentication using a cryptographic primitive called one-way accumulator is proposed to secure the P2P SIP computer networks. It leverages the distributed nature of P2P to allow for distributed resource discovery and rendezvous in a SIP network, thus eliminating (or at least reducing) the need for centralized servers. The distributed node authentication algorithm is established for the P2P SIP computer networks. The corresponding protocol has been implemented in our P2P SIP experiment platform successfully. The performance study has verified the proposed distributed node authentication algorithm for SIP based P2P computer networks

Hybrid CoAP-based resource discovery for the Internet of Things

Enabling automatic, efficient and scalable discovery of the resources provided by constrained low-power sensor and actuator networks is an important element to empower the transformation towards the Internet of Things (IoT). To this end, many centralized and distributed resource discovery approaches have been investigated. Clearly, each approach has its own motivations, advantages and drawbacks. In this article, we present a hybrid centralized/distributed resource discovery solution aiming to get the most out of both approaches. The proposed architecture employs the well-known Constrained Application Protocol (CoAP) and features a number of interesting discovery characteristics including scalability, time and cost efficiency, and adaptability. Using such a solution, network nodes can automatically and rapidly detect the presence of Resource Directories (RDs), via a proactive RD discovery mechanism, and perform discovery tasks through them. Nodes may, alternatively, fall back automatically to efficient fully-distributed discovery operations achieved through Trickle-enabled, CoAP-based technics. The effectiveness of the proposed architecture has been demonstrated by formal analysis and experimental evaluations on dedicated IoT platforms

A Fitted Random Sampling Scheme for Load Distribution in Grid Networks

Grid networks provide the ability to perform higher throughput computing by taking advantage of many networked computer’s resources to solve large-scale computation problems. As the popularity of the Grid networks has increased, there is a need to efficiently distribute the load among the resources accessible on the network. In this paper, we present a stochastic network system that gives a distributed load-balancing scheme by generating almost regular networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node is refers to its free resources, and job assignment and resource discovery processes required for load balancing is accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources accessible on Grid networks

Performance Evaluation of a Cluster-Based Service Discovery Protocol for Heterogeneous Wireless Sensor Networks

Abstract—This paper evaluates the performance in terms of resource consumption of a service discovery protocol proposed for heterogeneous Wireless Sensor Networks (WSNs). The protocol is based on a clustering structure, which facilitates the construction of a distributed directory. Nodes with higher capabilities are chosen to be clusterheads. We measure the energy and memory costs depending on the capabilities and the roles of the nodes in the clustering structure, both during the maintenance of the structure and discovery of services. We show that the service discovery protocol succeeds in alleviating the resource-lean sensor nodes of heavy tasks, while delegating more consuming duties to the more powerful nodes