Capacity of Content-Centric Hybrid Wireless Networks

Zhang, Guanglin; Liu, Jian; Ren, Jiajie; Wang, Lin; Zhang, Jinbei

doi:10.1109/access.2017.2669111

Cited by 8 publications

(6 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The achievable throughput of each mobile node is determined by the scheduling and routing scheme. Hence, we obtain the throughput performance as (24). Corollary 8.…”

Section: Routing Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks

Ren

Zhang

et al. 2021

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

Content-centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content-centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache-enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell-partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.

show abstract

“…The achievable throughput of each mobile node is determined by the scheduling and routing scheme. Hence, we obtain the throughput performance as (24). Corollary 8.…”

Section: Routing Schemesmentioning

confidence: 99%

“…The authors further consider the optimal cache strategy for two kinds of networks. Zhang et al [24] investigate the capacity of static hybrid content-centric wireless networks. In [25,26], the authors study how the content popularity impact the network throughput.…”

Section: Introductionmentioning

confidence: 99%

Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks

Ren

Zhang

et al. 2021

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Liu et al showed in [24] how correlated mobility affects the network performance. In addition, caching in IoT networks was extended to static infrastructure-supported IoT networks using multihop communication [25], [26]-each macro base station was assumed to be connected to the core network via infinite-speed backhaul, which has an access to all content objects stored in the whole file library.…”

Section: Prior Workmentioning

confidence: 99%

How to Cache in Mobile Hybrid IoT Networks?

Anh¹,

Jeon

Shin³

2019

IEEE Access

View full text Add to dashboard Cite

Content-centric mobile hybrid Internet-of-Things (IoT) networks consisting of mobile devices and static femto access points (FAPs) are studied, where each device moves according to the random walk mobility model and requests a content object from the library independently at random according to a Zipf popularity distribution. Instead of allowing access to content objects at macro base stations via costly backhaul providing connection to the core network, we consider a more practical scenario where mobile devices and static FAPs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile devices or static FAPs. Under a general multihop-based content delivery protocol, we analyze the order-optimal throughput-delay trade-off by presenting a new cache allocation strategy. In particular, under a given caching strategy, we first characterize a throughput-delay trade-off in terms of scaling laws along with the general content delivery multihop routing protocol. Then, the order-optimal throughput-delay trade-off is characterized by presenting the order-optimal cache allocation strategy, which jointly finds the replication sets at mobile devices and static FAPs via a novel variable decoupling approach. In our mobile IoT network, an interesting observation is that highly popular content objects are mainly served by mobile devices while the rest of content objects are served by static FAPs. We perform numerical evaluation to validate our analytical results. We also show that the order-optimal strategy strictly outperforms a baseline approach, where the replication sets at mobile devices and static FAPs are optimized separately.

show abstract

“…The hybrid network which contained both static and mobile sensors was studied in paper [10][11][12][13][14][15][16]. Wang et al [10] employed the geometrical approaches, and the mainly steps including divided monitoring area into many cells by Voronoi diagram [11], estimated the coverage holes by static sensors and commanded mobile sensors to move to the target location to heal the holes.…”

Section: Related Workmentioning

confidence: 99%

Estimation and Healing of Coverage Hole in Hybrid Sensor Networks: A Simulation Approach

Zhang

et al. 2017

Sustainability

Self Cite

View full text Add to dashboard Cite

Nowadays, wireless sensor network which consists of numerous tiny sensors has been widely used. One of the major challenges in such networks is how to cover the sensing area effectively and maintain longer network lifetime with limited energy simultaneously. In this paper, we study hybrid sensor network which contains both static and mobile sensors. We divide monitoring area into Delaunay Triangulation (DT) by using of Delaunay theory, estimate static sensors coverage holes, calculate the number of assistant mobile sensors and then work out the positions of assisted mobile nodes in each triangle. Next, mobile sensors will move to heal the coverage holes. Compared with the similarity methods, the algorithm HCHA we proposed is simpler, the advantages of our algorithm mainly represents in the following aspects. Firstly, it is relatively simple to estimate coverage hole based on Delaunay in our proposed algorithm. Secondly, we figure out the quantitative number range of assisted sensors those need to heal the coverage holes. Thirdly, we come up with a kind of deployment rule of assisted sensors.

show abstract

Capacity of Content-Centric Hybrid Wireless Networks

Cited by 8 publications

References 25 publications

Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks

Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks

How to Cache in Mobile Hybrid IoT Networks?

Estimation and Healing of Coverage Hole in Hybrid Sensor Networks: A Simulation Approach

Contact Info

Product

Resources

About