Capacity and Delay Analysis for Large Social-Aware Mobile Ad Hoc Wireless Networks

Abstract

Most mobile ad hoc wireless networks have social features. It is a fundamental problem how to understand the performances of social-aware mobile ad hoc wireless networks. In this paper, we consider a wireless network area, with restricted mobility model and rank-based social model. On this basis, we investigate the upper bound of throughput capacity in such networks using the protocol interference model. By tessellating the network area into cells spatially and dividing time into slots temporally, we propose a multi-hop relay and slots allocation scheduling strategy. Then, we derive the achieved throughput capacity under this strategy. Results show per-node throughput is related to parameter of social model and range of node motion. In addition, we also study the delay varies by queueing theory in such network. Finally, we discuss capacity-delay tradeoffs in such networks. These results are beneficial to the design of network protocols in large social-aware mobile ad hoc wireless networks.