Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks
![Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks](https://ardhindie.com/assets/pdf.png)
DOWNLOAD
Download Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks
DOWNLOAD
Author : Nessrine Chakchouk
language : en
Publisher:
Release Date : 2012
Resource Allocation Methods For Quality Of Service Provisioning In Heterogeneous Wireless Networks written by Nessrine Chakchouk and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2012 with Resource allocation categories.
The increased use of mobile wireless devices that we have recently been witnessing, such as smartphones, tablets, e-readers, and WiFi enabled devices in general, is driving an unprecedented increase in the amount of data traffic. This fast market adoption of the wireless technology along with the tremendous success of multimedia applications brought about higher capacity, connectivity, and Quality of Service (QoS) requirements that can no longer be met with traditional networking paradigms. As a result, heterogeneous wireless networks have recently emerged as a potential solution for meeting such new requirements. Hybrid wireless mesh networks and femtocell/macrocell networks are examples of these newly emerging heterogeneous networks. While mesh networks are viewed as the backbone/core network, femtocell and cellular networks are viewed as the access networks linking end-users with the backbone networks. In this dissertation, we address the problem of resource allocation in heterogeneous networks. We investigate both types of networks/architectures: next-generation wireless backbone networks or simply wireless mesh networks (WMNs) and next-generation wireless access networks or simply femtocell (FC) networks. WMNs were first introduced to foster the availability of Internet services anywhere and at anytime. However, capacity limitation has been a fundamental challenge to WMNs, mainly due to the interference arising from the wireless nature of the environment as well as to the scarcity of the radio/channel resources. To overcome this problem, we propose in this dissertation an efficient scheduling scheme that reduces interference among active links via wise time and frequency assignments to the wireless mesh routers. The developed scheme is traffic aware in that it maximizes the capacity of wireless links but while accounting for their traffic loads, thus meeting the end-to-end bandwidth requirements as much as possible. In the second part of this thesis, we focus on developing power allocation techniques for FC networks. FCs have recently emerged as a key networking solution that has great potential for improving the capacity and coverage of traditional macrocell (MC) networks through high-speed indoor coverage. Their deployment, however, has given rise to new interference challenges which are mainly due to the FCs' autonomous nature and to the unreliability of the wireless medium. Driven by this fact, in the second part of this thesis, we first design a fully-distributed estimation-based power allocation scheme that aims at fairly maximizing the capacity of FC networks. Second, we propose a novel distributed stochastic power control scheme that aims at maintaining the users' minimum= required QoS. Finally, we provide cross-layer performance analysis of two-tier FC networks, in which we characterize the uplink interference and study its impact on the data-link layer QoS performance in FC networks.
Resource Management For Heterogeneous Wireless Networks
DOWNLOAD
Author : Amila Tharaperiya Gamage
language : en
Publisher: Springer
Release Date : 2017-08-18
Resource Management For Heterogeneous Wireless Networks written by Amila Tharaperiya Gamage and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-08-18 with Technology & Engineering categories.
This book provides an in-depth discussion on how to efficiently manage resources of heterogeneous wireless networks and how to design resource allocation algorithms to suit real world conditions. Efficiently managing resources of the networks is more crucial now, than ever before, to meet users’ rapidly increasing demand for higher data rates, better quality-of-service (QoS) and seamless coverage. Some of the techniques that can be incorporated within heterogeneous wireless networks to achieve this objective are interworking of the networks, user multi-homing and device-to-device (D2D) communication. Designing resource allocation algorithms to suit real world conditions is also important, as the algorithms should be deployable and perform well in real networks. For example, two of the conditions considered in this book are resource allocation intervals of different networks are different and small cell base stations have limited computational capacity. To address the first condition, resource allocation algorithms for interworking systems are designed to allocate resources of different networks at different time-scales. To address the second condition, resource allocation algorithms are designed to be able to run at cloud computing servers. More of such conditions, algorithms designed to suit these conditions, modeling techniques for various networks and performance analysis of the algorithms are discussed in the book. This book concludes with a discussion on the future research directions on the related fields of study. Advanced-level students focused on communication and networking will use this book as a study guide. Researchers and experts in the fields of networking, converged networks, small-cell networks, resource management, and interference management, as well as consultants working in network planning and optimization and managers, executives and network architects working in the networking industry will also find this book useful as a reference.
Resource Allocation For Cellular Wlan Integrated Networks
DOWNLOAD
Author : Wei Song
language : en
Publisher:
Release Date : 2007
Resource Allocation For Cellular Wlan Integrated Networks written by Wei Song and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2007 with categories.
Resource Allocation For Heterogeneous Wireless Networks
DOWNLOAD
Author : Amila Pradeep Kumara Tharaperiya Gamage
language : en
Publisher:
Release Date : 2015
Resource Allocation For Heterogeneous Wireless Networks written by Amila Pradeep Kumara Tharaperiya Gamage and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2015 with Heterogeneous computing categories.
Demand for high volumes of mobile data traffic with better quality-of-service (QoS) support and seamless network coverage is ever increasing, due to growth of the number of smart mobile devices and the applications that run on these devices. Also, most of these high volumes of data traffic demanding areas are covered by heterogeneous wireless networks, such as cellular networks and wireless local area networks (WLANs). Therefore, interworking mechanisms can be used in these areas to enhance the network capacity, QoS support and coverage. Interworking enhances network capacity and QoS support by jointly allocating resources of multiple networks and enabling user multi-homing, where multi-homing allows users to simultaneously communicate over multiple networks. It widens network coverage by merging coverage of individual networks. However, there are areas where interworking cannot improve network capacity or QoS support, such as the areas with coverage of only one networks. Therefore, to achieve network-wide uniform capacity and QoS support enhancements, interworking can be integrated with device-to-device (D2D) communication and small cell deployment techniques. One of the challenging issues that need to be solved before these techniques can be applied in practical networks is the efficient resource allocation, as it has a direct impact on the network capacity and QoS support. Therefore, this thesis focuses on studying and developing efficient resource allocation schemes for interworking heterogeneous wireless networks which apply D2D communication and small cell deployment techniques. First, uplink resource allocation for cellular network and WLAN interworking to provide multi-homing voice and data services is investigated. The main technical challenge, which makes the resource allocation for this system complicated, is that resource allocation decisions need to be made capturing multiple physical layer (PHY) and medium access control layer (MAC) technologies of the two networks. This is essential to ensure that the decisions are feasible and can be executed at the lower layers. Thus, the resource allocation problem is formulated based on PHY and MAC technologies of the two networks. The optimal resource allocation problem is a multiple time-scale Markov decision process (MMDP) as the two networks operate at different time-scales, and due to voice and data service requirements. A resource allocation scheme consisting of decision policies for the upper and the lower levels of the MMDP is derived. To reduce the time complexity, a heuristic resource allocation algorithm is also proposed. Second, resource allocation for D2D communication underlaying cellular network and WLAN interworking is investigated. Enabling D2D communication within the interworking system further enhances the spectrum efficiency, especially at areas where only one network is available. In addition to the technical challenges encountered in the first interworking system, interference management and selection of users' communication modes for multiple networks to maximize hop and reuse gains complicate resource allocation for this system. To address these challenges, a semi-distributed resource allocation scheme that performs mode selection, allocation of WLAN resources, and allocation of cellular network resources in three different time-scales is proposed. Third, resource allocation for interworking macrocell and hyper-dense small cell networks is studied. Such system is particularly useful for interference prone and high capacity demanding areas, such as busy streets and city centers, as it uses license frequency bands and provides a high spectrum efficiency through frequency reuse and bringing network closer to the users. The key challenge for allocating resources for this system is high complexity of the resource allocation scheme due to requirement to jointly allocate resources for a large number of small cells to manage co-channel interference (CCI) in the system. Further, the resource allocation scheme should minimize the computational burden for low-cost small cell base stations (BSs), be able to adapt to time-varying network load conditions, and reduce signaling overhead in the small cell backhauls with limited capacity. To this end, a resource allocation scheme which operates on two time-scales and utilizes cloud computing to determine resource allocation decisions is proposed. Resource allocation decisions are made at the cloud in a slow time-scale, and are further optimized at the BSs in a fast time-scale in order to adapt the decisions to fast varying wireless channel conditions. Achievable throughput and QoS improvements using the proposed resource allocation schemes for all three systems are demonstrated via simulation results. In summary, designing of the proposed resource allocation schemes provides valuable insights on how to efficiently allocate resources considering PHY and MAC technologies of the heterogeneous wireless networks, and how to utilize cloud computing to assist executing a complex resource allocation scheme. Furthermore, it also demonstrates how to operate a resource allocation scheme over multiple time-scales. This is particularly important if the scheme is complex and requires a long time to execute, yet the resource allocation decisions are needed to be made within a short interval.
Adaptive Resource Allocation For Statistical Qos Provisioning In Mobile Wireless Communications And Networks
DOWNLOAD
Author : Qinghe Du
language : en
Publisher:
Release Date : 2012
Adaptive Resource Allocation For Statistical Qos Provisioning In Mobile Wireless Communications And Networks written by Qinghe Du and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2012 with categories.
Due to the highly-varying wireless channels over time, frequency, and space domains, statistical QoS provisioning, instead of deterministic QoS guarantees, has become a recognized feature in the next-generation wireless networks. In this dissertation, we study the adaptive wireless resource allocation problems for statistical QoS provisioning, such as guaranteeing the specified delay-bound violation probability, upper-bounding the average loss-rate, optimizing the average goodput/throughput, etc., in several typical types of mobile wireless networks. In the first part of this dissertation, we study the statistical QoS provisioning for mobile multicast through the adaptive resource allocations, where different multicast receivers attempt to receive the common messages from a single base-station sender over broadcast fading channels. Because of the heterogeneous fading across different multicast receivers, both instantaneously and statistically, how to design the efficient adaptive rate control and resource allocation for wireless multicast is a widely cited open problem. We first study the time-sharing based goodput-optimization problem for non-realtime multicast services. Then, to more comprehensively characterize the QoS provisioning problems for mobile multicast with diverse QoS requirements, we further integrate the statistical delay-QoS control techniques -- effective capacity theory, statistical loss-rate control, and information theory to propose a QoS-driven optimization framework. Applying this framework and solving for the corresponding optimization problem, we identify the optimal tradeoff among statistical delay-QoS requirements, sustainable traffic load, and the average loss rate through the adaptive resource allocations and queue management. Furthermore, we study the adaptive resource allocation problems for multi-layer video multicast to satisfy diverse statistical delay and loss QoS requirements over different video layers. In addition, we derive the efficient adaptive erasure-correction coding scheme for the packet-level multicast, where the erasure-correction code is dynamically constructed based on multicast receivers̕ packet-loss statuses, to achieve high error-control efficiency in mobile multicast networks. In the second part of this dissertation, we design the adaptive resource allocation schemes for QoS provisioning in unicast based wireless networks, with emphasis on statistical delay-QoS guarantees. First, we develop the QoS-driven time-slot and power allocation schemes for multi-user downlink transmissions (with independent messages) in cellular networks to maximize the delay-QoS-constrained sum system throughput. Second, we propose the delay-QoS-aware base-station selection schemes in distributed multiple-input-multiple-output systems. Third, we study the queueaware spectrum sensing in cognitive radio networks for statistical delay-QoS provisioning. Analyses and simulations are presented to show the advantages of our proposed schemes and the impact of delay-QoS requirements on adaptive resource allocations in various environments.
Unified Quality Of Service Provisioning Framework For The Heterogeneous Wireless Next Generation Networks
DOWNLOAD
Author : Joswill Victor Pajaro Rodriguez
language : en
Publisher:
Release Date : 2015
Unified Quality Of Service Provisioning Framework For The Heterogeneous Wireless Next Generation Networks written by Joswill Victor Pajaro Rodriguez and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2015 with Broadband communication systems categories.
In this research, Radio Resource Management (RRM) schemes and Quality of Service (QoS) support were investigated for wireless network technologies such as Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), and Wireless Fidelity (WiFi). The goal was to design a QoS framework that works for integrated heterogeneous networks and improves the traffic performance defined by the application requirements for each technology.
Efficient Resource Allocation And Network Design In Heterogeneous Wireless Networks
DOWNLOAD
Author : Haiping Liu
language : en
Publisher:
Release Date : 2010
Efficient Resource Allocation And Network Design In Heterogeneous Wireless Networks written by Haiping Liu and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2010 with categories.
Wireless networks provide flexible and ubiquitous access to the telephone networks or the Internet. Multiple technologies have been developed to provide wireless access including cellular/3G/LTE, WiFi, and WiMAX. The cellular network is the most popular network, which provides the stable and constant service under most types of mobility. Its future version, LTE Advanced, is the most advanced wireless access technology, and supports the current or future bandwidth-sensitive and/or delay-sensitive applications, such as Voice over IP and real-time video streaming. The WiFi network has been aggressively deployed in many areas and provide access to laptops, PDAs and smartphones. These are referred to as WiFi hotspots. The basic WiFi infrastructure usually offers flexible and easy to deploy wireless access inside a small area at a low cost. The WiMAX network has its own advantages to provide higher transmission speed for a point-to-point communication over longer transmission distances. In many areas, these wireless networks co-exist, overlap and interlace with one another to create a heterogeneous wireless network. Instead of functioning independently, significant benefits can be accrued through cooperation and coordination among these networks by leveraging their unique advantages. This is possible as user devices come with multiple network interfaces to connect to each of these networks. In order to exploit the advantages of these heterogeneous networks, it is important to implement an efficient resource allocation algorithm to coordinate the resources of multiple wireless networks and also have a good design of the heterogeneous network. The dissertation makes contributions in both the above areas. In current WiFi networks, the overall spectrum is divided among multiple overlapping channels. The adjacent access points need to operate on orthogonal channels to avoid the interference. In Chapter II, we give a precise analysis of the interference among different channels and discuss the potential possibility of utilizing partially overlapping channels in the multi-hop mesh networks. It is possible to optimize different network performance metric, such as throughput, by balancing parallel transmissions and partially received transmission power offers the best system performance, such as throughput. In the multi-hop mesh networks, some mesh nodes are highly congested either due to the interferences from multiple neighbors, or when they are located at the intersection of multiple routing paths. These highly congested mesh nodes significantly degrade the network performance, since the throughput of a path is limited by the node with minimum capacity. In Chapter III, we discuss the efficient cooperation between a WiFi-based mesh network and a WiMAX network to mitigate the impact of congested nodes. The WiMAX network, with its longer transmission range, can be leveraged to bypass the traffic from some highly congested mesh nodes. The load balancing makes the throughput of the heterogeneous network higher than the sum of the throughput from the WiFi and WiMAX networks if they operate independently. In the widely deployed wireless networks, the infrastructure mode is used, where customer devices only communicate with the base stations. This mode is suitable for normal Internet access. However, some emerging applications, such as P2P file sharing, teleconferencing, network games, require frequent communications among terminals that may be in the coverage of the same base station. The exiting infrastructure mode of the network architecture results in high resource waste due to the unnecessary transmissions via the base station even when both the user could directly communicate. In Chapter IV, we propose a novel network architecture, Local-Interest-Group (LIG), in which all nodes can communicate in any ways according to the application requirements. The real-time algorithm and protocol minimize the interferences among co-existing LIGs and maximize the bandwidth utilization, which greatly improves the overall system performance under multiple performance metrics. In network planning, it is difficult to efficiently locate base stations due to the inaccuracies in the prediction of the traffic density. The movement of traffic to different parts in the city during different times of a day makes fixed base stations either operate at very low load or become highly congested at different time periods. Fortunately, the detailed analysis based on network measurement shows that the movement of traffic density is predicable. In Chapter V, we propose a new network component, Traffic-Tracing Gateway (TTG), which works as the base station but traces the traffic movement taking the advantage of the heterogeneous wireless networks. By following the optimal trajectories, TTGs cover the maximum traffic and provide much better system performance in both single-hop or multi-hop networks. This dissertation proposes efficient resource allocation methods in heterogenous wireless access network with partially overlapping channels and the cooperation between WiFi and WiMAX networks. In the dissertation, we also propose the novel network designs based on local-interest-groups and traffic-tracing gateways, to augment existing wireless access networks and making them more resource efficient while providing higher end-to-end performance.
Efficient Quality Of Service Provision Techniques In Next Generation Wireless Networks
DOWNLOAD
Author : Kuheli L. Haldar
language : en
Publisher:
Release Date : 2014
Efficient Quality Of Service Provision Techniques In Next Generation Wireless Networks written by Kuheli L. Haldar and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014 with categories.
Recent evolution of communication networks comprises of different segments and technologies, where each segment maybe implemented using different QoS. Further, the proposed all-IP core infrastructure of the future networks will offer varying QoS level multimedia services to the users. However, IP being a best effort service, seamless provision of end-to-end QoS guarantees is extremely important. In today's world, devices with multiple networking capabilities is quite common. The traditional approach in networking includes grouping identical traffic and allocating them to the network that has the maximum available data rate. This creates unbalanced traffic load in the network, leading to poor utilization of the associated resources. This problem can be greatly alleviated if the traffic can be allocated intelligently to the networks. For fair traffic distribution, we modeled the AP of each network as a single queuing server. Then, suitable equations and algorithms are designed to divide the incoming traffic flow into multiple subflows and allocated to the APs based on their available data rates. Network selection in a heterogeneous cognitive radio wireless Network is a challenging task, since the users need to select the appropriate channels of the network in addition to the network itself. The varying levels of interference experienced by the secondary user (SUs) is due to the presence of primary user (PU)s in the adjacent channels. Hence, SUs transmitting highly sensitive data must find a channel that is interference free. In this dissertation, we develop a novel network and channel selection scheme that categorizes both the user applications and the network channels depending on their sensitivity level for interference and select them using a bipartite graph matching algorithm. The effectiveness of cognitive radios is based on opportunistic access of the licensed channels by SUs while protecting the PU transmission. But channel sensing incurs cost in terms of time overhead and energy consumption. However, infrequent sensing also results in loss of transmission opportunity for the SUs. Hence, an interesting and challenging question arise: when should the SU sense the channel, sleep or transmit, to minimize the total cost? In this dissertation, we developed a novel scheme for deriving the optimal inter-sensing duration in a cognitive radio network, on the requirement of protecting the PUs' communications while minimizing the cost for the SUs. The scheme has been presented for both non-erroneous and erroneous channel sensing conditions. Handling the "mobile data tsunami" in the future and providing indoor coverage is a significant challenge for the operators. The answer is LTE femtocells. However, limited spectrum availability in the cellular networks causes severe interference in the neighboring femtocell users that are transmitting in the same radio band. In densely deployed environments, interference problems in co-channel femtocells causes significant degradation in performance. In this dissertation, we proposed a CASFR scheme, that assigns distinct set of PRBs to each interfering femtocells in the downlink. In the uplink we proposed a PSE algorithm to further reduce any interference that may remain after performing CASFR. Finally, the topics for future work have been clearly identified.
Quality Of Service Provisioning Through Resource Allocation And Data Aggregation In Wireless Sensor Networks
DOWNLOAD
Author : Carl Larsen
language : en
Publisher:
Release Date : 2009
Quality Of Service Provisioning Through Resource Allocation And Data Aggregation In Wireless Sensor Networks written by Carl Larsen and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2009 with Ad hoc networks (Computer networks) categories.
"In this dissertation, improvement of quality of service (QoS) provisioning in wireless sensor networks (WSN) is examined using four different methods. The first two focus on allocation of limited resources in the face of changing network and channel conditions, and thus improving performance in terms of throughput and delay. The second two methods focus on using data aggregation to minimize the size and number of packet transmissions reducing the energy consumption and improving network lifetime. Therefore, in the first paper a novel adaptive and distributed fair scheduling (ADFS) protocol for WSN is presented that allocates the channel bandwidth in proportion to the weight of the packet flows, which are updated dynamically in order to ensure fairness while provisioning other QoS parameters such as throughput and packet losses. In the second paper, a routing-aware predictive congestion control (RPCC) scheme for WSN is presented by using a combination of a hop-by-hop congestion control mechanism and a dynamic routing scheme in order to forward the packets through less congested nodes while minimizing packet losses and end-to-end delays. By contrast, in the third paper, a data aggregation scheme is presented that uses least squares to fit a nonlinear function to multiple sensor data values, but only transmits the parameters of that polynomial over the network. This process is iterated along each node in the chain. However, in the fourth paper a different, but complementary, method of data aggregation, referred to as a nonlinear adaptive pulse coded modulation-based compression (NADPCMC), is introduced and its performance verified in the presence of noise, distortion, and quantization errors. The Lyapunov approach is utilized to verify analytically the performance of the proposed energy-efficient compression protocol"--Abstract, leaf iv.
Multiuser Diversity And Fair Resource Allocation In Wireless Heterogeneous Networks
DOWNLOAD
Author : Anh H. Nguyen
language : en
Publisher:
Release Date : 2014
Multiuser Diversity And Fair Resource Allocation In Wireless Heterogeneous Networks written by Anh H. Nguyen and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014 with categories.
In wireless communications, it is of utmost importance to exploit multi-user diversity and at the same time provide satisfactory quality of service for all users. However, these two goals often conflict with each other. On one hand, multiuser diversity is maximized by selecting the user with the best channel condition. On the other, ensuring fairness among users demands the allocation of network resources to those who do not necessarily have the best channel conditions. Whenever a user with a poorer channel condition is selected, there is a certain loss in the overall system throughput. The major objective of this thesis is to find scheduling algorithms that guarantee fairness with minimal performance tradeoff. First, we consider multi-user diversity in a multi-user MIMO system. When zero-forcing beam-forming transmission technique is used, the system needs to find a subset of users such that the transmission to these users results in the highest throughput. As the number of users grows, the complexity of the user subset selection increases exponentially. To address this issue, simple user-subset-selection algorithms have been developed that can perform well and are very close to the optimal ones found through an exhaustive search. Maximizing system throughput is a key factor in ensuring high network performance, but guaranteeing service provision to all users is no less important. To support fairness among users, cumulative distribution function (CDF) scheduling is utilized because of the its capability to precisely control allocation for each user. The CDF scheduling algorithm requires knowledge of the channel distribution among all users. However, the channel distribution or even an approximation of it is hard to obtain in real systems. In this dissertation, two classes of practical, CDF-based scheduling algorithms are developed. They are the non-parametric CDF scheduling (NPCS), used when the channel model is unknown, and the parametric CDF scheduling (PCS), used when the channel model is known. These algorithms are shown to frequently outperform the well-known Proportional Fair (PF) scheduling method, and may be viable alternatives to it. The performance of the developed scheduling technique is then carefully analyzed and verified through simulations under various channel models. In order to apply them in real systems, these algorithms are first proposed for continuous rate transmission. Modified versions are then developed for finite rate transmission and limited feedback resources. Lastly, we analyze throughput of heterogeneous relay OFDMA systems using CDF scheduling with partial feedback. The scheduling problem is even more challenging with the incorporation of relays because of the different coherent time on their two hops. The CDF scheduling algorithm is modified to satisfy short-term fairness among users. In addition, performance of different feedback schemes in a wideband multi-user system are compared. Among the considered schemes, thresholding feedback is numerically shown to have the lowest feedback requirement, given a certain probability of feedback availability.