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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Peiyan Yuan, Honghai Wu, Xiaoyan Zhao, Zhengnan Dong
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2017
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/02f2b0dc1ca14df0900d48ca52be0ccf
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:02f2b0dc1ca14df0900d48ca52be0ccf
record_format	dspace
spelling	oai:doaj.org-article:02f2b0dc1ca14df0900d48ca52be0ccf2021-12-02T12:32:30ZPercolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks10.1038/s41598-017-05988-52045-2322https://doaj.org/article/02f2b0dc1ca14df0900d48ca52be0ccf2017-07-01T00:00:00Zhttps://doi.org/10.1038/s41598-017-05988-5https://doaj.org/toc/2045-2322Abstract 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 which the network system can not achieve the expected performance such as the transmission delay and packet delivery ratio. Given the condition that each link has the same probability p to be active in the next time slot when the link is inactive and q to be inactive when the link is active, there exists a critical value p c from a percolation perspective. If p > p c , the network is in the supercritical case, where we found that there is an achievable upper bound on the buffer size of nodes, independent of the inactive probability q. When p < p c , the network is in the subcritical case, and there exists a closed-form solution for buffer occupation, which is independent of the size of the network.Peiyan YuanHonghai WuXiaoyan ZhaoZhengnan DongNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 7, Iss 1, Pp 1-10 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Peiyan Yuan Honghai Wu Xiaoyan Zhao Zhengnan Dong Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
description	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 which the network system can not achieve the expected performance such as the transmission delay and packet delivery ratio. Given the condition that each link has the same probability p to be active in the next time slot when the link is inactive and q to be inactive when the link is active, there exists a critical value p c from a percolation perspective. If p > p c , the network is in the supercritical case, where we found that there is an achievable upper bound on the buffer size of nodes, independent of the inactive probability q. When p < p c , the network is in the subcritical case, and there exists a closed-form solution for buffer occupation, which is independent of the size of the network.
format	article
author	Peiyan Yuan Honghai Wu Xiaoyan Zhao Zhengnan Dong
author_facet	Peiyan Yuan Honghai Wu Xiaoyan Zhao Zhengnan Dong
author_sort	Peiyan Yuan
title	Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
title_short	Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
title_full	Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
title_fullStr	Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
title_full_unstemmed	Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
title_sort	percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
publisher	Nature Portfolio
publishDate	2017
url	https://doaj.org/article/02f2b0dc1ca14df0900d48ca52be0ccf
work_keys_str_mv	AT peiyanyuan percolationtheoreticboundsonthecachesizeofnodesinmobileopportunisticnetworks AT honghaiwu percolationtheoreticboundsonthecachesizeofnodesinmobileopportunisticnetworks AT xiaoyanzhao percolationtheoreticboundsonthecachesizeofnodesinmobileopportunisticnetworks AT zhengnandong percolationtheoreticboundsonthecachesizeofnodesinmobileopportunisticnetworks
_version_	1718394017547288576

Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks

Ejemplares similares