On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The design and implementation of an intentional naming system
ACM SIGOPS Operating Systems Review
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
A Strategy for Application-Transparent Integration of Nomadic Computing Domains
SEUS '05 Proceedings of the Third IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems
Toward Distributed Service Discovery in Pervasive Computing Environments
IEEE Transactions on Mobile Computing
Scalable percolation search on complex networks
Theoretical Computer Science - Complex networks
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Convergence agent model for developing u-healthcare systems
Future Generation Computer Systems
Hi-index | 0.00 |
The diffusion of ubiquitous and pervasive computing applications, providing advanced services anytime and everywhere across heterogeneous mobile networks, is fostering the development of new architectures and models, based on the emerging peer-to-peer paradigm, to allow the effective use of multiple replicated resources and services without the scalability and adaptiveness limitations characterizing traditional client-server organizations. In this scenario, effective service discovery facilities are needed to minimize the administrative overhead and increase the overall usability and perceived service quality. However, most of the currently available implementations lack efficiency due to the highly dynamic and hierarchically flat nature of the underlying wireless mobile networking environment, that make any traditional solution based on centralized schemes and statically defined roles practically unfeasible. Accordingly we proposed a novel service discovery approach based on a fully distributed and parallel search model, that does not require any centralized intelligence, fixed roles and stable communication infrastructure. It exploits, in a dynamic scale-free scenario characterized by competition for links and balanced node insertion and removal rates, a widely known random walk-based search paradigm benefitting from bond percolation in power law organizations to automatically limit the search space (by shielding low connectivity nodes from search traffic) and drastically reduce the total control overhead. We analyzed the effectiveness and performance of the proposed solution by using discrete event-driven simulation, whose results were satisfactory also in highly mobile ad-hoc environments. This indicates that the proposed ideas are promising and deserve further exploitation by practical application solutions designers.