The capacity of an arbitrary ad-hoc network is difficult to estimate due to interference between the links. We use a conflict graph that models this interference relationship to determine if a set of flow rates can be accommodated. Using the cliques (complete subgraphs) of the conflict graph, we

and admission control for QoS routing. We also evaluate, compare and discuss the performance of the derived sufficient conditions through simulation studies. I.

I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present

Ad-hoc NETworks (MANET) has been a research topic in the last years. In this paper we describe a QoS reserva-tion mechanism for Multirate Ad-hoc Networks. By mul-tirate we refer to those networks where the mobile nodes can dynamically switch between several link rates. This al-lows the mobile nodes

high level performance for existing real-time flows that may not tolerate serious performance degrada-tion. In this paper, we focus on the issue of providing sufficient QoS in networks with moderate to high node mobility. We first introduce route available bandwidth (RAB), a major index for prediction

flows. Many aspects of sensor networks such as routing, preservation of battery power, adaptive self-configuration, etc., have already been studied in previous papers [e.g., 1, 2, 3]. However, to the best knowledge of the authors, the area of sensor network Quality of Service (QoS) remains largely open

as an optimization problem which maximizes the overall network performance while sat-isfying QoS constraints of individual flows. We also proposed COS, a distributed Cooperative and Opportunistic Scheduling algorithm, which modifies IEEE 802.11 protocol to implement the optimal scheduling policy by introducing

For wireless ad hoc networks with multihop transmissions and Rayleigh fading, this paper maximizes the overall system throughput subject to QoS constraints on power, probability of outage, and data rates. Formulations are also given which minimize delay and optimize network resources in a wireless

network size and mobility. By simulation results, it has been shown that, this architecture allows us to provide reliable QoS in ad-hoc networks increases the available bandwidth, performs load balancing in the network and increases lifetime.

QoS provisioning is a complex and challenging issue in mobile ad hoc networks, especially when there are multiple QoS con-straints. In this paper, we propose an adaptive QoS routing scheme supported by cross-layer cooperation in ad hoc networks. The cross-layer mechanism provides up-to-date local