CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Multiple and replicated random walkers analysis for service discovery in fog computing IoT environments
Authors
K. Skiadopoulos Oikonomou, K. Avlonitis, M. Giannakis, K. Kogias, D. Stavrakakis, I.
Publication date
1 January 2019
Publisher
Abstract
The multiple random walkers mechanism is revisited in this paper for service discovery purposes considering modern dynamic network environments like the Internet of Things (IoT), where there is a need for certain services (e.g., virtual network functions) to be available to the end users through fog computing devices. Network coverage is analytically investigated here considering multiple random walkers in soft random geometric graph topologies of various densities. It is shown that as the number of random walkers increases, then coverage linearly increases in the considered topologies. The analytical findings of this work are shown to be in accordance with other results in the literature (e.g., coverage under multiple random walkers for fully connected network topologies). Moreover, for certain coverage and time constraints (i.e., the minimum fraction of network nodes to be covered within a certain time period that is of practical importance in the considered environment), the required minimum number of random walkers satisfying these constraints is also analytically derived. A replication mechanism that allows random walkers to replicate themselves after a fixed number of time steps is also analytically investigated here with respect to coverage for various topology densities. Simulation results demonstrate the effectiveness of multiple random walkers for service discovery purposes in the considered fog computing IoT environment and support the claims and expectations of the analysis for both the multiple random walkers and the replicated multiple random walkers mechanism. © 2019 Elsevier B.V
Similar works
Full text
Available Versions
Pergamos : Unified Institutional Repository / Digital Library Platform of the National and Kapodistrian University of Athens
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:lib.uoa.gr:uoadl:3071299
Last time updated on 10/02/2023