Percolation-Theoretic Bounds on the Cache Size of Nodes in Mobile Opportunistic Networks

Scientific Reports - United Kingdom
doi 10.1038/s41598-017-05988-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Mobile Crowdsensing in Software Defined Opportunistic Networks

IEEE Communications Magazine
Computer NetworksElectronic EngineeringComputer Science ApplicationsElectricalCommunications
2017English

Finding Influential Nodes for Integration in Brain Networks Using Optimal Percolation Theory

Nature Communications
AstronomyGeneticsMolecular BiologyBiochemistryChemistryPhysics
2018English

Preference-Aware Content Dissemination in Opportunistic Mobile Social Networks

2012English

Opportunistic Software Deployment in Disconnected Mobile Ad Hoc Networks

English

Extremal Bounds for Bootstrap Percolation in the Hypercube

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2018English

A Novel Energy Efficiency Algorithm in Green Mobile Networks With Cache

Eurasip Journal on Wireless Communications and Networking
Computer NetworksComputer Science ApplicationsSignal ProcessingCommunications
2015English

Multiple Social Metrics Based Routing Protocol in Opportunistic Mobile Social Networks

Advances in Science, Technology and Engineering Systems
EngineeringAstronomyPhysicsManagement of TechnologyInnovation
2019English

On the Steady-State of Cache Networks

2013English

Locating Nodes in Mobile Sensor Networks More Accurately and Faster

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy