Buffer occupation in wireless social networks

Authors:
Tuo Yu;Xiaohua Tian;Feng Yang;Xinbing Wang
Affiliations:
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Year:
2013

Citing 10
Cited 0

Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs

Proceedings of the 43rd annual Design Automation Conference
Scaling laws for ad hoc wireless networks: an information theoretic approach

Foundations and Trends® in Networking
Analysis of topological characteristics of huge online social networking services

Proceedings of the 16th international conference on World Wide Web
Measurement and analysis of online social networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Recommending Social Events from Mobile Phone Location Data

ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

IEEE Transactions on Information Theory
A community based vaccination strategy over mobile phone records

Proceedings of the Second ACM Workshop on Mobile Systems, Applications, and Services for HealthCare
Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the buffer occupation in wireless social networks. n source nodes are randomly distributed in the networks, and each of them chooses several friend nodes, whose number follows power-law distribution. Two different strategies are proposed to achieve optimal buffer occupation or throughput, and the upper bound and lower bound for buffer size and throughput are also investigated. The results show that there exists trade-off between buffer occupation and throughput, and we also find that the buffer occupation for each node will not increase when the size of network becomes larger, which is opposite to our intuitive understanding.