Multi-hop wireless networks (MWNs) are networks where end-to-end paths consist of a number of consecutive, wireless hops. This new architecture enables a number of new applications, e.g. vehicular applications, environmental monitoring and disaster recovery communication, and improves the performance of existing services, e.g. Internet connectivity in airports, convention centers, and hospitals. MWNs differ significantly from wired and single-hop wireless networks, and require fundamentally different approaches to operate efficiently. For example, mobile MWNs tend to be partially connected, which makes traditional routing approaches fail. As another example, static MWNs suffer from complex interference, which makes traditional scheduling and transport protocols inefficient. The main goal of this proposal is to address fundamental architectural and design challenges of multi-hop wireless networks in all major networking layers, using formal mathematical tools, simulation, and experimentation. Specifically: (i) We will access the performance of scheduling protocols while taking into account both performance and implementation overhead. We will pay special attention to random access schedulers, as they have become the de facto standard, and study via formal analysis and simulations their performance gap from the optimal. (ii) We will design, analyze, and implement neighborhood-centric transport schemes for congestion control and rate allocation in the context of static MWNs. Both AIMD-based schemes and explicit rate notification schemes will be investigated, and fairness and efficiency issues will be thoroughly studied. (iii) We will design, optimize and implement mobility-assisted routing schemes in the context of mobile MWNs. Since the performance of any such scheme depends on the constantly changing level of network connectivity, we will also design automated distributed mechanisms that allow nodes to characterize on the fly how connected the network is.