Algorithmic aspects of capacity in wireless networks
Authors:
Open Access
- 6 June 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 33 (1) , 133-144
Abstract
This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {( 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.Keywords
This publication has 24 references indexed in Scilit:
- Rate performance objectives of multihop wireless networksIEEE Transactions on Mobile Computing, 2004
- The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Wireless NetworksIEEE Journal on Selected Areas in Communications, 2004
- Impact of interference on multi-hop wireless network performance2003
- Characterizing achievable rates in multi-hop wireless networks2003
- Throughput capacity of random ad hoc networks with infrastructure support2003
- On the capacity improvement of ad hoc wireless networks using directional antennas2003
- Characterizing the interaction between routing and MAC protocols in ad-hoc networks2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- "First come, first served" can be unstable!IEEE Transactions on Automatic Control, 1994
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988