On the Scalability of Ad Hoc Networks: A Traffic Analysis at the Center of a Network

Published

May 1, 2004

Author(s)

B-J Kwak, N-O Song, Leonard E. Miller

Abstract

We investigate the inherent scalability problem of ad hoc networks originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter, of a network D = 2k, that guarantees the network is scalable, is obtained. The upper bound is given by C/r 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.

Proceedings Title

2004, IEEE Wireless Communications and Networking Conference

Conference Dates

March 21-25, 2004

Conference Title

IEEE Wireless Communications and Networking Conference

Pub Type

Conferences

Download Paper

Local Download

Keywords

ad hoc, network, scalability

Citation

Kwak, B. , Song, N. and Miller, L. (2004), On the Scalability of Ad Hoc Networks: A Traffic Analysis at the Center of a Network, 2004, IEEE Wireless Communications and Networking Conference, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151137 (Accessed October 16, 2025)