By Topic

A general framework for the capacity analysis of wireless ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hyunchul Kim ; Dept. of Electr. Eng., Univ. of California, Santa Cruz, Santa Cruz, CA ; Zheng Wang ; Sadjadpour, H.R. ; Garcia-Luna-Aceves, J.J.

In this paper, we introduce a general framework for computation of throughput capacity of wireless ad-hoc networks under all kinds of information modalities. We consider point-to-point communication for unicast, multicast, broadcast and any type of anycast routing and under physical model assumption. The general communication is denoted as (n, m, k)-cast where n is the number of nodes in the network, m+1 is the number of elements in (n, m, k)-cast group and k(klesm) is the number of destinations that receive packets from the source in each (n, m, k)-cast group. For example, (m=k=1) and (m=k=n) represent unicast and broadcast routings respectively. We demonstrate that the upper bound of throughput capacity is given by O(radicm(radic(nk))-1) bits/second. The lower bound of throughput capacity is computed as Omega(radicm((nkd)(n))-1), Omega((nkd2(n))-1) and Omega(n-1) bits/second when m=O(d-2(n)), Omega(k)=(d-2(n))=O(m) and Omega(d-2(n))=k respectively, where d(n) is a network parameter. The upper bound capacity is achieved based on (n, m, k)-cast tree constructed for routing and transport capacity while the lower bound capacity is achieved based on TDMA scheme and connected cell graph along (n, m, k)-cast tree.

Published in:

Military Communications Conference, 2008. MILCOM 2008. IEEE

Date of Conference:

16-19 Nov. 2008