By Topic

Topology-based capacity analysis for ad hoc networks with end-to-end delay constraints

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)

Capacity analysis for an ad hoc network supporting delay-sensitive traffic is addressed in this paper. In contrast, most previous capacity analysis work focused on ad hoc networks carrying delay-tolerant traffic and improved the network capacity at the expense of increased transmission delay. In this paper, ad hoc networks are modeled with adjacency matrices. Based on these adjacency matrices, two efficient algorithms, MSDA and CSDA is designed, to derive the capacity of the ad hoc networks carrying delay-sensitive traffic through a sequence of matrix operations. An algorithm to estimate the average hop count of the network is also designed in this paper.

Published in:

Emerging Technologies: Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on  (Volume:2 )

Date of Conference:

31 May-2 June 2004