Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
Abstract The node buffer size has a large influence on the performance of Mobile Opportunistic Networks (MONs). This is mainly because each node should temporarily cache packets to deal with the intermittently connected links. In this paper, we study fundamental bounds on node buffer size below whic...
Saved in:
Main Authors: | Peiyan Yuan, Honghai Wu, Xiaoyan Zhao, Zhengnan Dong |
---|---|
Format: | article |
Language: | EN |
Published: |
Nature Portfolio
2017
|
Subjects: | |
Online Access: | https://doaj.org/article/02f2b0dc1ca14df0900d48ca52be0ccf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.
by: Mahendra Piraveenan, et al.
Published: (2013) -
A Survey on Caching in Mobile Edge Computing
by: Yuhan Zhao, et al.
Published: (2021) -
Finding influential nodes for integration in brain networks using optimal percolation theory
by: Gino Del Ferraro, et al.
Published: (2018) -
Network percolation reveals adaptive bridges of the mobility network response to COVID-19.
by: Hengfang Deng, et al.
Published: (2021) -
Network percolation reveals adaptive bridges of the mobility network response to COVID-19
by: Hengfang Deng, et al.
Published: (2021)