Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

An achievable capacity for hierarchical multicast 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

2 Author(s)
Chaker, O. ; Electr. Eng. Dept., Ecole Polytech. de Montreal, Montreal, QC ; Conan, J.

In this paper, we consider a dense ad hoc network with multicast type of traffic handling using a hierarchical routing with clustering. We investigate the scaling of throughput capacity versus the number of nodes and destinations. We construct an elementary spatial-temporal routing scheme that achieves the throughput capacity of a dense ad hoc wireless network with high probability as the number of nodes increases. The derived lower bound on the throughput capacity under the proposed routing strategy holds with probability one as the number of nodes goes to infinity. Finally, we provide numerical validation of the achievable throughput using a multicast capacity simulator based on the proposed constructive scheme.

Published in:

Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on

Date of Conference:

15-18 Sept. 2008