V. S. Anil Kumar
Madhav V. Marathe
ABSTRACT
This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993. Google Scholar
Digital Library
- D. J. Baker, J. E. Wieselthier, and A. Ephremides. A distributed algorithm for scheduling the activation of links in self-organizing mobile radio networks. In IEEE Int. Conference Communications, pages 2F6.1--2F6.5, 1982.Google Scholar
- Challenges in Reliable Data Transport Over Heterogeneous Wireless Networks. Ph.D. Thesis, Department of Computer Science, University of California at Berkeley, 1998.Google Scholar
- H. Balakrishnan, C. Barrett, V. S. Anil Kumar, M. Marathe, and S. Thite. The distance 2-matching problem and its relationship to the mac layer capacity of ad-hoc wireless networks. Technical Report LA-UR-03-5980, Los Alamos National Laboratory. To appear in IEEE J. Selected Areas in Communications, 22(6), August, 2004. Google ScholarDigital Library
- N. Bansal and Z. Liu, Capacity, delay and mobility in wireless ad-hoc networks, IEEE INFOCOM, April 2003.Google ScholarCross Ref
- C. L. Barrett, M. Drozda, A. Marathe, and M. V. Marathe. Characterizing the interaction between routing and MAC protocols in ad-hoc networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing, pages 92--103, 2002. Google ScholarDigital Library
- D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 134--146, 2003. Google ScholarDigital Library
- N. Garg and J. Koenemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 300. IEEE Computer Society, 1998. Google ScholarDigital Library
- P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388--404, March 2000. Google ScholarDigital Library
- M. Grossglauser and D. Tse. Mobility increases the capacity of ad-hoc wireless networks Proc. IEEE INFOCOM 2001.Google ScholarCross Ref
- B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Transactions on Information Theory, 34:910--917, 1988.Google ScholarDigital Library
- F. Meyer auf der Heide, C. Schindelhauer, K. Volbert and M. Grünewald Energy, Congestion and Dilation in Radio Networks Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA), Mannitoba, 2002. Google ScholarDigital Library
- K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu. Impact of interference on multi-hop wireless network performance. In Proceedings of the 9th annual international conference on Mobile computing and networking}, pages 66--80. ACM Press, 2003. Google ScholarDigital Library
- K. Kar, M. Kodialam, T. V. Lakshman, and L. Tassiulas. Routing for network capacity maximization in energy-constrained ad-hoc networks. In IEEE INFOCOM, 2003.Google ScholarCross Ref
- U. Kozat and L. Tassiulas. Throughput Capacity in Random Ad-hoc Networks with Infrastructure Support, Proc. 9th Annual ACM International Conference on Mobile computing and networking, Sept. 2003. Google ScholarDigital Library
- M. Kodialam and T. Nandagopal. Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. In Proceedings of the 9th annual international conference on Mobile computing and networking, pages 42--54. ACM Press, 2003. Google ScholarDigital Library
- V. S. Anil Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan. End-to-end packet scheduling in ad hoc networks. In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1014--1023, 2004. Google ScholarDigital Library
- B. Liu, Z. Liu, D. Towsley, On the capacity of hybrid wireless networks Proc. IEEE INFOCOM, April 2003.Google ScholarCross Ref
- R. Negi and A. Rajeswaran, Capacity of Power Constrained Ad-hoc Networks, IEEE INFOCOM, 2004.Google ScholarCross Ref
- Jitendra Padhye, Richard Draves, Brian Zill Routing in multi-radio, multi-hop wireless mesh networks Proc. MOBICOM, 2004. Google ScholarDigital Library
- C. Peraki and S. Servetto. On the maximum stable throughput problem in random networks, Proc. ACM MobiHoc, 2003. Google ScholarDigital Library
- Bozidar Radunovic and Jean-Yves Le Boudec. Rate Performance Objectives of Multihop Wireless Networks, IEEE Trans. on Mobile Computing 3(4): 334--349, 2004. Google ScholarDigital Library
- Siuli Roy, Dola Saha, S. Bandyopadhyay, Tetsuro Ueda and Shinsuke Tanaka A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, 2003. Google ScholarDigital Library
- E. Royer, S. Lee and C. Perkins. The Effects of MAC Protocols on Ad hoc Network Communications. Proc. IEEE Wireless Communications and Networking Conference, Chicago, IL, September 2000.Google ScholarCross Ref
- T.I. Seidman. 'First come first serve' can be unstable, IEEE Trans. Autom. Cont., 39, pp 2166--2171 (1994).Google ScholarCross Ref
- A. Srinivas and E. Modiano. Minimum energy disjoint path routing in wireless ad-hoc networks. In Proceedings of the 9th annual international conference on Mobile computing and networking, pages 122--133, 2003. Google ScholarDigital Library
- K. Tang, M. Correa and M. Gerla, Effects of Ad Hoc MAC Layer Medium Access Mechanisms under TCP. MONET 6(4): 317--329 2001. Google ScholarDigital Library
- TRANSIMS.http://transims.tsasa.lanl.gov/.Google Scholar
- Romit Roy Choudhury, Xue Yang, Ram Ramanathan, and Nitin Vaidya. Using Directional Antennas for Medium Access Control in Ad Hoc Networks In Proceedings of the Conference on Mobile Computing and Networking (MobiCom), ACM MobiCom, September, 2002. Google ScholarDigital Library
- S. Yi, Y. Pei and S. Kalyanaraman, On the capacity improvement of ad hoc wireless networks using directional antennas. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 108--116, 2003. Google ScholarDigital Library
Index Terms
- Algorithmic aspects of capacity in wireless networks
Recommendations
Algorithmic aspects of capacity in wireless networks
Performance evaluation reviewThis paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their ...
Capacity of wireless networks under SINR interference constraints
A fundamental problem in wireless networks is to estimate their throughput capacity--given a set of wireless nodes and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction ...
Performance of multichannel wireless ad hoc networks
This paper addresses the design of Medium Access Control (MAC) protocols for wireless ad hoc networks that derive benefits from using multiple orthogonal channels for data transmission. Each node is assumed to have a single half-duplex transceiver that ...
Comments