Resource allocation for qo s support in wireless mesh networks
Download as DOCX, PDF0 likes97 views
The document proposes a framework for maximizing the aggregate utility of traffic flows in a wireless mesh network while meeting minimum rate requirements and accounting for interference. It formulates the problem as an optimization that assigns transmission parameters like power, channels, and time slots. If minimum rates cannot be met for all flows, the framework intelligently rejects some flows and recalculates resource allocation. It aims to enhance quality of service support compared to prior work in wired networks by addressing self-interference challenges in wireless multi-hop networks.
Resource allocation for qo s support in wireless mesh networks
- 1. Resource Allocation for QoS Support in Wireless Mesh Networks ABSTRACT: Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements in order to ensure satisfactory quality as perceived by end-users. In this paper, we develop a framework to address the problem of maximizing the aggregate utility of traffic flows in a multi-hop wireless network, with constraints imposed both due to self-interference and minimum rate requirements. The parameters that are tuned in order to maximize the utility are (i) transmission powers of individual nodes and (ii) the channels assigned to the different communication links. Our framework is based on using across- decomposition technique that takes both inter-flow interference and self- interference into account. The output of our framework is a schedule that dictates what links are to be activated in each slot and the parameters associated with each of those links. If the minimum rate constraint cannot be satisfied for all of the flows, the framework intelligently rejects a sub-set of the flows and recomputes a schedule for the remaining flows. We also design an admission control module that determines if new flows can be admitted without violating the rate requirements of
- 2. the existing flows in the network. We provide numerical results to demonstrate the efficacy of our framework. EXISTING SYSTEM: The problem of resource allocation and congestion control in wired networks has received a lot of attention. In their seminal work, Kelly et al. have modeled the problem of flow control as an optimization problem where the objective is to maximize the aggregate utility of elastic traffic sources subject to capacity constraints on the links that compose the network. Inspired by Kelly’s work, there has been follow up work, where TCP congestion control is modeled a convex optimization problem, the objective being the maximization of an aggregate user utility; in these efforts distributed primaldual solutions to the problem are proposed. DISADVANTAGES OF EXISTING SYSTEM: In contrast with wireline networks, the capacity of a wireless link is not dependent on other flows in the network but on other flows that use links on the same channel (and that are close enough) and external interference. The dependencies between flows is regulated by the protocols at both the link and transport layers. However, these prior efforts do not consider the provision of quality-of-service in terms of supporting minimum rates to the flows that share the network. More importantly,
- 3. the QoS needs to be provided under conditions of self-interference, where the packets of a flow interfere with other packets that belong to the same flow along a multi-hop path. PROPOSED SYSTEM: In this paper, we propose a framework for maximizing the aggregate utility of traffic sources while adhering to the capacity constraints of each link and the minimum rate requirements imposed by each of the sources. The framework takes into account the self-interference of flows and assigns (a) channels (b) transmission power levels and (c) time slots to each link such that the above objective is achieved. It dictates the rates at which each traffic source will send packets such that the minimum rate requirements of all coexisting flows are met. If the minimum rate requirements of all the flows cannot be met, the framework rejects a subset of flows (based on fairness considerations) and recomputes the schedule and allocates resources to each of the remaining flows. ADVANTAGES OF PROPOSED SYSTEM: The framework maximizes the aggregate utility of flows taking into account constraints that arise due to self-interference (wireless channel imposed constraints) and minimum rate requirements of sources (QoS requirements).
- 4. If a solution is not feasible, the framework selectively drops a few of the sources and redistributes the resources among the others in a way that their QoS requirements are met. The proposed framework readily leads to a simple and effective admission control mechanism. We demonstrate the efficacy of our approach with numerical results. We also theoretically compute performance bounds with our network, as compared with an optimal strategy. SYSTEM CONFIGURATION:- HARDWARE REQUIREMENTS:- Processor - Pentium –IV Speed - 1.1 Ghz RAM - 256 MB Hard Disk - 20 GB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse
- 5. Monitor - SVGA SOFTWARE REQUIREMENTS: • Operating system : - Windows XP. • Coding Language : C#.Net. REFERENCE: Tae-Suk Kim, Yong Yang, Jennifer C. Hou,Fellow, IEEE,and Srikanth V. Krishnamurthy,Fellow, IEEE “Resource Allocation for QoS Support in Wireless Mesh Networks” - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013