Content-Centric Wireless Networks With Limited Buffers: When Mobility Hurts

We analyze throughput-delay scaling laws of mobile ad hoc networks under a content-centric traffic scenario, where users are mainly interested in retrieving contents cached by other nodes. We assume limited buffer size available at each node and Zipf-like content popularity. We consider nodes unifor...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 24; no. 1; pp. 299 - 311
Main Authors Alfano, Giusi, Garetto, Michele, Leonardi, Emilio
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Ad hoc networks
Adaptation models
content-centric networking
delay-throughput tradeoff
Delays
Mobile communication
Protocols
Receivers
scaling laws
Throughput
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:We analyze throughput-delay scaling laws of mobile ad hoc networks under a content-centric traffic scenario, where users are mainly interested in retrieving contents cached by other nodes. We assume limited buffer size available at each node and Zipf-like content popularity. We consider nodes uniformly visiting the network area according to a random-walk mobility model, whose flight size varies from the typical distance among the nodes (quasi-static case) up to the edge length of the network area (reshuffling mobility model). Our main findings are: (1) the best throughput-delay tradeoffs are achieved in the quasi-static case: increasing the mobility degree of nodes leads to worse and worse performance; (ii) the best throughput-delay tradeoffs can be recovered by power control (i.e., by adapting the transmission range to the content) even in the complete reshuffling case.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2014.2361935