Advertisement

Theoretical Capacity of Multi-Hop Wireless Ad Hoc Networks

  • Yue Fang
  • A. Bruce McDonald
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)

Abstract

The capacity of multi-hop wireless ad hoc networks is presented extending the cross-layer model for link capacity in [1]. Two semantics for network capacity are proposed and discussed. The effect of node location on capacity is analyzed within the context of the boundary condition and its impact on evaluation of network capacity. The main focus is on the bottleneck capacity referred to as the “maximum instantaneous network capacity” (MIC). The metric is intended to characterize the true information capacity of the network as a whole—reflecting all possible destinations. The optimization problem is shown to be NP-complete and heuristic algorithms are applied to bound the solution from above. The asymptotic results compare favorably to the well-known results of the highly abstract model in [2].

Keywords

Node Mobility Greedy Algorithm Channel Capacity Network Capacity Theoretical Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Yue Fang and A. Bruce McDonald, “Theoretical Channel Capacity in Multi-hop Ad Hoc Networks,” Proceedings of the 13th IEEE workshop on Local and Metropolitan Area Networks, April 25th–28th, 2004Google Scholar
  2. [2]
    P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388–404, March, 2000zbMATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    Yue Fang and A. Bruce Mcdonald, “Cross-Layer Performance Effects of Path Coupling in Wireless Ad Hoc Networks: Power and Throughput Implications of IEEE 802.11 MAC,” Proceedings of 21st IEEE International Performance, Computing, and Communications Conference (IPCCC 2002), April 3–5, pp. 281–29, 2002, Phoenix, ArizonaGoogle Scholar
  4. [4]
    Matthias Grossglauser and David N. C. Tse, “Mobility Increases the Capacity of Ad-hoc Wireless Networks,” INFOCOM, pp. 1360–1369, 2001Google Scholar
  5. [5]
    James Abello, Sergiy Butenko, Panos Paradalos and Mauricio G.C Resende, “Finding Independent sets in a graph using continuous multi-variable polynomial formulations,” Journal of Global Optimization, 2001, no. 21, pp. 111–137zbMATHCrossRefGoogle Scholar
  6. [6]
    Robert Endre Tarjan and Anthony E Trojanowski, “Finding a Maximum Independent Set,” SIAM Journal of Computing, September, 1977, vol. 6, no. 3, pp. 537–546.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Yue Fang
    • 1
  • A. Bruce McDonald
    • 1
  1. 1.RWIN-Lab, Department of Electrical & Computer EngineeringNortheastern UniversityBostonUSA

Personalised recommendations