By Topic

Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless 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)
Pan Li ; Dept. of Electr. & Comput. Eng., Mississippi State Univ., Starkville, MS, USA ; Yuguang Fang

In this paper, we investigate the throughput capacity in wireless hybrid networks with various network topologies and traffic patterns. Specifically, we consider n randomly distributed nodes, out of which there are n source nodes and nd (0 < d < 1) randomly chosen destination nodes, together with nb (0 < b < 1) base stations in a network area of [0, nw] times [0, n1-w] (0 < w les 1/2 ). We first study the throughput capacity when the base stations are regularly placed and their transmission power is large enough for them to directly transmit to any nodes associated with them. We show that a per-node throughput of max{min{nb-1, nd-1}, min {nw-1/radiclog n, nd-1}} bits/sec is achievable by all nodes. We then investigate the throughput capacity when the base stations are uniformly and randomly placed, and their transmission power is as small as that of the normal nodes. We present that each node can achieve a throughput of max{min{nb-1/log n, nd-1}, min {nw-1/radiclog n, nd-1}} bits/sec. In both settings, we observe that only when d > b and d > w, the maximum achievable throughput can be determined by both the number of base stations and the shape of network area. In all the other cases, the maximum achievable throughput is only constrained by the number of destination nodes. Moreover, the results in these two settings are the same except for the case d > b > w, in which the random placement of base stations will cause a degradation factor of log n on the maximum achievable throughput compared to the regular placement. Finally, we also show that our results actually hold for different power propagation models.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:8 ,  Issue: 12 )