Spelling suggestions: "subject:"cross layer"" "subject:"gross layer""
11 |
Algorithms and Optimization for Wireless NetworksShi, Yi 09 November 2007 (has links)
Recently, many new types of wireless networks have emerged for both civil and military applications, such as wireless sensor networks, ad hoc networks, among others. To improve the performance of these wireless networks, many advanced communication techniques have been developed at the physical layer. For both theoretical and practical purposes, it is important for a network researcher to understand the performance limits of these new wireless networks. Such performance limits are important not only for theoretical understanding, but also in that they can be used as benchmarks for the design of distributed algorithms and protocols. However, due to some unique characteristics associated with these networks, existing analytical technologies may not be applied directly. As a result, new theoretical results, along with new mathematical techniques, need to be developed. In this dissertation, we focus on the design of new algorithms and optimization techniques to study theoretical performance limits associated with these new wireless networks.
In this dissertation, we mainly focus on sensor networks and ad hoc networks. Wireless sensor networks consist of battery-powered nodes that are endowed with a multitude of sensing modalities. A wireless sensor network can provide in-situ, unattended, high-precision, and real-time observation over a vast area. Wireless ad hoc networks are characterized by the absence of infrastructure support. Nodes in an ad hoc network are able to organize themselves into a multi-hop network. An ad hoc network can operate in a stand-alone fashion or could possibly be connected to a larger network such as the Internet (also known as mesh networks).
For these new wireless networks, a number of advanced physical layer techniques, e.g., ultra wideband (UWB), multiple-input and multiple-output (MIMO), and cognitive radio (CR), have been employed. These new physical layer technologies have the potential to improve network performance. However, they also introduce some unique design challenges. For example, CR is capable of reconfiguring RF (on the fly) and switching to newly-selected frequency bands. It is much more advanced than the current multi-channel multi-radio (MC-MR) technology. MC-MR remains hardware-based radio technology: each radio can only operate on a single channel at a time and the number of concurrent channels that can be used at a wireless node is limited by the number of radio interfaces. While a CR can use multiple bands at the same time. In addition, an MC-MR based wireless network typically assumes there is a set of "common channels" available for all nodes in the network. While for CR networks, each node may have a different set of frequency bands based on its particular location. These important differences between MC-MR and CR warrant that the algorithmic design for a CR network is substantially more complex than that under MC-MR.
Due to the unique characteristics of these new wireless networks, it is necessary to consider models and constraints at multiple layers (e.g., physical, link, and network) when we explore network performance limits. The formulations of these cross-layer problems are usually in very complex forms and are mathematically challenging. We aim to develop some novel algorithmic design and optimization techniques that provide optimal or near-optimal solutions.
The main contributions of this dissertation are summarized as follows.
1. Node lifetime and rate allocation
We study the sensor node lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network. For fairness, we maximize node lifetimes under the lexicographic max-min (LMM) criteria. Our contributions are two-fold. First, we develop a polynomial-time algorithm based on a parametric analysis (PA) technique, which has a much lower computational complexity than an existing state-of-the-art approach. We also present a polynomial-time algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Second, we show that the same approach can be employed to address a different but related problem, called LMM rate allocation problem. More important, we discover an elegant duality relationship between the LMM node lifetime problem and the LMM rate allocation problem. We show that it is sufficient to solve only one of the two problems and that important insights can be obtained by inferring the duality results.
2. Base station placement
Base station location has a significant impact on sensor network lifetime. We aim to determine the best location for the base station so as to maximize the network lifetime. For a multi-hop sensor network, this problem is particularly challenging as data routing strategies also affect the network lifetime performance. We present an approximation algorithm that can guarantee (1- ε)-optimal network lifetime performance with any desired error bound ε > 0. The key step is to divide the continuous search space into a finite number of subareas and represent each subarea with a "fictitious cost point" (FCP). We prove that the largest network lifetime achieved by one of these FCPs is (1- ε)-optimal. This approximation algorithm offers a significant reduction in complexity when compared to a state-of-the-art algorithm, and represents the best known result to this problem.
3. Mobile base station
The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. Our main result hinges upon a novel transformation of the joint base station movement and flow routing problem from the time domain to the space domain. Based on this transformation, we first show that if the base station is allowed to be present only on a set of pre-defined points, then we can find the optimal sojourn time for the base station on each of these points so that the overall network lifetime is maximized. Based on this finding, we show that when the location of the base station is un-constrained (i.e., can move to any point in the two-dimensional plane), we can develop an approximation algorithm for the joint mobile base station and flow routing problem such that the network lifetime is guaranteed to be at least (1- ε) of the maximum network lifetime, where ε can be made arbitrarily small. This is the first theoretical result with performance guarantee on this problem.
4. Spectrum sharing in CR networks
Cognitive radio is a revolution in radio technology that promises unprecedented flexibility in radio communications and is viewed as an enabling technology for dynamic spectrum access. We consider a cross-layer design of scheduling and routing with the objective of minimizing the required network-wide radio spectrum usage to support a set of user sessions. Here, scheduling considers how to use a pool of unequal size frequency bands for concurrent transmissions and routing considers how to transmit data for each user session. We develop a near-optimal algorithm based on a sequential fixing (SF) technique, where the determination of scheduling variables is performed iteratively through a sequence of linear programs (LPs). Upon completing the fixing of these scheduling variables, the value of the other variables in the optimization problem can be obtained by solving an LP.
5. Power control in CR networks
We further consider the case of variable transmission power in CR networks. Now, our objective is minimizing the total required bandwidth footprint product (BFP) to support a set of user sessions. As a basis, we first develop an interference model for scheduling when power control is performed at each node. This model extends existing so-called protocol models for wireless networks where transmission power is deterministic. As a result, this model can be used for a broad range of problems where power control is part of the optimization space. An efficient solution procedure based on the branch-and-bound framework and convex hull relaxations is proposed to provide (1- ε)-optimal solutions. This is the first theoretical result on this important problem. / Ph. D.
|
12 |
Brand X, A Cross-Layer Architecture for Quality of Transport (QoT)De Hart, Gregory Arthur 30 June 2006 (has links) (PDF)
Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. Autonomous transport switching technologies rely on information regarding current network status and the ambient wireless environment in order to make intelligent decisions. This thesis proposes Brand X, a cross-layer architecture designed for a QoT environment to provide timely and accurate environment information in order to facilitate autonomous transport switching. This thesis also presents a performance analysis of network protocol stack latency in a QoT environment considering the various cross-layer mechanisms utilized in Brand X and other architectures.
|
13 |
Design of interface selection protocols for multi-homed wireless networksJerjees, Zina January 2010 (has links)
The IEEE 802.11/802.16 standards conformant wireless communication stations have multi-homing transmission capability. To achieve greater communication efficiency, multi-homing capable stations use handover mechanism to select appropriate transmission channel according to variations in the channel quality. This thesis presents three internal-linked handover schemes, (1) Interface Selection Protocol (ISP), belonging to Wireless Local Area Network (WLAN)- Worldwide Interoperability for Microwave Access (WiMAX) environment (2) Fast Channel Scanning (FCS) and (3) Traffic Manager (TM), (2) and (3) belonging to WiMAX Environment. The proposed schemes in this thesis use a novel mechanism of providing a reliable communication route. This solution is based on a cross-layer communication framework, where the interface selection module uses various network related parameters from Medium Access Control (MAC) sub-layer/Physical Layer (PHY) across the protocol suite for decision making at the Network layer. The proposed solutions are highly responsive when compared with existing multi-homed schemes; responsiveness is one of the key factors in the design of such protocols. Selected route under these schemes is based on the most up to date link-layer information. Therefore, such a route is not only reliable in terms of route optimization but it also fulfils the application demands in terms of throughput and delay. Design of ISP protocol use probing frames during the route discovery process. The 802.11 mandates the use of different rates for data transmission frames. The ISP-metric can be incorporated into various routing aspects and its applicability is determined by the possibility of provision of MAC dependent parameters that are used to determine the best path metric values. In many cases, higher device density, interference and mobility cause variable medium access delays. It causes creation of ‘unreachable zones’, where destination is marked as unreachable. However, by use of the best path metric, the destination has been made reachable, anytime and anywhere, because of the intelligent use of the probing frames and interface selection algorithm implemented. The IEEE 802.16e introduces several MAC level queues for different access categories, maintaining service requirement within these queues; which imply that frames from a higher priority queue, i.e. video frames, are serviced more frequently than those belonging to lower priority queues. Such an enhancement at the MAC sub-layer introduces uneven queuing delays. Conventional routing protocols are unaware of such MAC specific constraints and as a result, these factors are not considered which result in channel performance degradation. To meet such challenges, the thesis presents FCS and TM schemes for WiMAX. For FCS, Its solution is to improve the mobile WiMAX handover and address the scanning latency. Since minimum scanning time is the most important issue in the handover process. This handover scheme aims to utilize the channel efficiently and apply such a procedure to reduce the time it takes to scan the neighboring access stations. TM uses MAC and physical layer (PHY) specific information in the interface metric and maintains a separate path to destination by applying an alternative interface operation. Simulation tests and comparisons with existing multi-homed protocols and handover schemes demonstrate the effectiveness of incorporating the medium dependent parameters. Moreover, show that suggested schemes, have shown better performance in terms of end-to-end delay and throughput, with efficiency up to 40% in specific test scenarios.
|
14 |
Distributed Cross-layer Monitoring in Wireless Mesh NetworksYe, Panming, Zhou, Yong January 2009 (has links)
<p>Wireless mesh networks has rapid development over the last few years. However, due to properties such as distributed infrastructure and interference, which strongly affect the performance of wireless mesh networks, developing technology has to face the challenge of architecture and protocol design issues. Traditional layered protocols do not function efficiently in multi-hop wireless environments. To get deeper understanding on interaction of the layered protocols and optimize the performance of wireless mesh network, more recent researches are focusing on cross-layer measurement schemes and cross-layer protocol design. The goal of this project is to implement a distributed monitoring mechanism for IEEE802.11 based wireless mesh networks. This module is event-based and has modular structure that makes it flexible to be extended. This project results a novel Cross-Layer Monitoring Module, CLMM, which is a prototype that monitors each layer of the nodes locally and dynamically, calculates the average values of the metrics, compares these values with thresholds and handles the cross-layer messages of each node. The CLMM also has a routing module structure that can be extended to distribute the metrics to its neighbors.</p>
|
15 |
Cross layer scheduling and resource allocation algorithms for cellular wireless networksAli, Syed Hussain 11 1900 (has links)
This thesis considers the problem of cross layer scheduling and radio resource allocation of multiple users in the downlink of time-slotted and frequency-slotted cellular data networks. For these networks, opportunistic scheduling algorithms improve system performance by exploiting time variations of the radio channel. Within the broader framework of opportunistic scheduling, this thesis solves three distinct problems and proposes efficient and scalable solutions for them. First, we present novel optimal and approximate opportunistic scheduling algorithms that combine channel fluctuation and user mobility information in their decision rules. The algorithms propose the use of dynamic fairness constraints. These fairness constraints adapt according to the user mobility. The optimal algorithm is an off-line algorithm that precomputes constraint values according to a known mobility model. The approximate algorithm is an on-line algorithm that relies on the future prediction of the user mobility locations in time. We show that the use of mobility information increases channel capacity. We also provide analytical bounds on the performance of the approximate algorithm. Second, this thesis presents a new opportunistic scheduling solution that maximizes the aggregate user performance subject to certain minimum and maximum performance constraints. By constraining the performance experienced by individual users, who share a common radio downlink, to some upper bounds, it is possible to provide the system operator with a better control of radio resource allocations and service differentiation among different classes of users. The proposed solution offers better performance than existing solution under practical channel conditions. Finally, we present a dynamic subcarrier allocation solution for fractional frequency reuse in multicell orthogonal frequency division multiple access systems. We formulate the subcarrier allocation as an equivalent set partitioning problem and then propose an efficient hierarchical solution which first partitions subcarriers into groups and next schedules subcarriers opportunistically to users. Simulation results for three solutions illustrate the usefulness of the proposed schemes.
|
16 |
Resource allocation for OFDM-based cognitive radio systemsZhang, Yonghong 05 1900 (has links)
Cognitive radio (CR) is a novel wireless communication approach that may alleviate the looming spectrum-shortage crisis. Orthogonal frequency division multiplexing (OFDM) is an attractive modulation candidate for CR systems. In this thesis, we study resource allocation (RA) for OFDM-based CR systems using both aggressive and protective sharing.
In aggressive sharing, cognitive radio users (CRUs) can share both non-active and active primary user (PU) bands. We develop a model that describes aggressive sharing, and formulate a corresponding multidimensional knapsack problem (MDKP). Low-complexity suboptimal RA algorithms are proposed for both single and multiple CRU systems. A simplified model is proposed which provides a faster suboptimal solution. Simulation results show that the proposed suboptimal solutions are close to optimal, and that aggressive sharing of the whole band can provide a substantial performance improvement over protective sharing, which makes use of only the non-active PU bands.
Although aggressive sharing generally yields a higher spectrum-utilization efficiency than protective sharing, aggressive sharing may not be feasible in some situations. In such cases, sharing only non-active PU bands is more appropriate. When there are no fairness or quality of service (QoS) considerations among CRUs, both theoretical analysis and simulation results show that plain equal power allocation (PEPA) yields similar performance as optimal power allocation in a multiuser OFDM-based CR system. We propose a low-complexity discrete bit PEPA algorithm. To improve spectrum-utilization
efficiency, while considering the time-varying nature of the available spectrum
as well as the fading characteristics of wireless communication channels and providing QoS provisioning and fairness among users, this thesis introduces the
following novel algorithms: (1) a distributed RA algorithm that provides both fairness and efficient spectrum usage for ad hoc systems; (2) a RA algorithm for non-real-time (NRT) services that maintains average user rates proportionally on the downlink of multiuser OFDM-based CR systems; and (3) cross-layer RA algorithms for the downlink of multiuser OFDM-based CR systems for both real-time (RT) services and mixed (RT and NRT) services. Simulation results show that the proposed algorithms provide satisfactory QoS to all supported services and perform better than existing algorithms designed for multiuser OFDM systems.
|
17 |
Quality-Driven Cross-Layer Protocols for Video Streaming over Vehicular Ad-Hoc NetworksAsefi, Mahdi 30 August 2011 (has links)
The emerging vehicular ad-hoc networks (VANETs) offer a variety of applications
and new potential markets related to safety, convenience and entertainment, however,
they suffer from a number of challenges not shared so deeply by other types of existing
networks, particularly, in terms of mobility of nodes, and end-to-end quality of service
(QoS) provision. Although several existing works in the literature have attempted to
provide efficient protocols at different layers targeted mostly for safety applications, there remain many barriers to be overcome in order to constrain the widespread use of such networks for non-safety applications, specifically, for video streaming: 1) impact of high
speed mobility of nodes on end-to-end QoS provision; 2) cross-layer protocol design while keeping low computational complexity; 3) considering customer-oriented QoS metrics in the design of protocols; and 4) maintaining seamless single-hop and multi-hop connection between the destination vehicle and the road side unit (RSU) while network is moving.
This thesis addresses each of the above limitations in design of cross-layer protocols for video streaming application. 1) An adaptive MAC retransmission limit selection scheme is proposed to improve the performance of IEEE 802.11p standard MAC protocol for video streaming applications over VANETs. A multi-objective optimization framework, which jointly minimizes the probability of playback freezes and start-up delay of the streamed video at the destination vehicle by tuning the MAC retransmission limit with respect to channel statistics as well as packet transmission rate, is applied at road side unit (RSU). Two-hop transmission is applied in zones in which the destination
vehicle is not within the transmission range of any RSU. In the multi-hop scenario, we
discuss the computation of access probability used in the MAC adaptation scheme and propose a cross-layer path selection scheme; 2) We take advantage of similarity between multi-hop urban VANETs in dense traffic conditions and mesh connected networks. First, we investigate an application-centric routing scheme for video streaming over mesh connected overlays. Next, we introduce the challenges of urban VANETs compared to mesh networks and extend the proposed scheme in mesh network into a protocol for urban VANETs. A classification-based method is proposed to select an optimal path for video streaming over multi-hop mesh networks. The novelty is to translate the path selection
over multi-hop networks to a standard classification problem. The classification is based on minimizing average video packet distortion at the receiving nodes. The classifiers are trained offline using a vast collection of video sequences and wireless channel conditions in order to yield optimal performance during real time path selection. Our method substantially reduces the complexity of conventional exhaustive optimization methods and results in high quality (low distortion). Next, we propose an application-centric routing scheme for real-time video transmission over urban multi-hop vehicular ad-hoc network
(VANET) scenarios. Queuing based mobility model, spatial traffic distribution and prob-
ability of connectivity for sparse and dense VANET scenarios are taken into consideration
in designing the routing protocol. Numerical results demonstrate the gain achieved by
the proposed routing scheme versus geographic greedy forwarding in terms of video frame distortion and streaming start-up delay in several urban communication scenarios for various vehicle entrance rate and traffic densities; and 3) finally, the proposed quality-driven
routing scheme for delivering video streams is combined with a novel IP management
scheme. The routing scheme aims to optimize the visual quality of the transmitted video
frames by minimizing the distortion, the start-up delay, and the frequency of the streaming freezes. As the destination vehicle is in motion, it is unrealistic to assume that the vehicle will remain connected to the same access router (AR) for the whole trip. Mobile IP management schemes can benefit from the proposed multi-hop routing protocol in order to adapt proxy mobile IPv6 (PMIPv6) for multi-hop VANET for video streaming applications. The proposed cross-layer protocols can significantly improve the video streaming quality in terms of the number of streaming freezes and start-up delay over VANETs while achieving low computational complexity by using pattern classification methods for optimization.
|
18 |
Cross-layer Cooperative Transmission scheme in Mobile Wireless NetworksYang, Kai-Ting 23 November 2012 (has links)
Driven by the ambition for ubiquitous networking, wireless networks had gained substantial technical advances in recent years. Using radio signals in air as data links, wireless networks can get rid of the tangling of wired cables. However, due to the inherent limitations of wireless channels and legacy protocol design, users of wireless networks today still suffer from the problems on low bandwidth and high error rates.
The seven-layer Open System Interconnection (OSI) model was originally designed with wired network environments in mind. Following the seven-layer OSI model, each layer is responsible for handling specific tasks without communicating with each other. Due to the relative stability of wired channels, the strictly-layered approach works well in wired network environments. However, its adequacy is a controversy in wireless environments, since wireless networks have completely different characteristics from its wired counterparts. In wireless environments, channel conditions are highly time-varying and are affected by many factors. External interference or signal degradation may lead to severe packet loss. Even signal-to-noise ratios are fine, transmissions may still fail due to collisions when contention-based MAC protocols are adopted. Conventional protocols developed with wired network environments in mind cannot appropriately response to the characteristics of wireless channels and may make wrong reactions. For these reasons, a flexible framework to capture the rapid change conditions of wireless channels and respond to them immediately is necessary. In this dissertation, we design a cross-layer framework with the consideration of wireless network characteristics. By the coordination between the involved layers, the cross-layer framework can adapt to wireless channel conditions and significantly improve QoS in wireless networks. In order to reduce collision probabilities in wireless networks, we propose a novel protocol named Wait-and-Transmit, which effectively alleviates contentions in wireless networks. By reducing collision probabilities of wireless networks, transmission delays can be shortened and throughputs can be significantly improved. Aiming at the transmission paths containing at least one wireless link, a flexible and efficient cross-layer transmission scheme is also present in this dissertation, which separates the rapid change conditions such as collision probabilities from the relatively stable conditions and well responds to these changes.
The proposed approaches significantly improve the performance of wireless networks. We believe that these approaches can contribute to the development of wireless networking.
|
19 |
Cross Layer Coding Schemes for Broadcasting and RelayingJohn Wilson, Makesh Pravin 2010 May 1900 (has links)
This dissertation is divided into two main topics. In the first topic, we study the
joint source-channel coding problem of transmitting an analog source over a Gaussian
channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information about the source known only to the
receiver. We introduce hybrid digital analog forms of the Costa and Wyner-Ziv coding schemes. We present random coding based schemes in contrast to lattice based
schemes proposed by Kochman and Zamir. We also discuss superimposed digital and
analog schemes for the above problems which show that there are infinitely many
schemes for achieving the optimal distortion for these problems. This provides an
extension of the schemes proposed by Bross and others to the interference/source
side information case. The result of this study shows that the proposed hybrid digital analog schemes are more robust to a mismatch in channel signal-to-noise ratio
(SNR), than pure separate source coding followed by channel coding solutions. We
then discuss applications of the hybrid digital analog schemes for transmitting under
a channel SNR mismatch and for broadcasting a Gaussian source with bandwidth
compression. We also study applications of joint source-channel coding schemes for
a cognitive setup and also for the setup of transmitting an analog Gaussian source
over a Gaussian channel, in the presence of an eavesdropper.
In the next topic, we consider joint physical layer coding and network coding
solutions for bi-directional relaying. We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitter
and relay nodes exchange data over synchronized, average power constrained additive
white Gaussian noise channels. We propose structured coding schemes using lattices
for this problem. We study two decoding approaches, namely lattice decoding and
minimum angle decoding. Both the decoding schemes can be shown to achieve the
upper bound at high SNRs. The proposed scheme can be thought of as a joint physical
layer, network layer code which outperforms other recently proposed analog network
coding schemes. We also study extensions of the bi-directional relay for the case with
asymmetric channel links and also for the multi-hop case. The result of this study
shows that structured coding schemes using lattices perform close to the upper bound
for the above communication system models.
|
20 |
Cross layer scheduling and resource allocation algorithms for cellular wireless networksAli, Syed Hussain 11 1900 (has links)
This thesis considers the problem of cross layer scheduling and radio resource allocation of multiple users in the downlink of time-slotted and frequency-slotted cellular data networks. For these networks, opportunistic scheduling algorithms improve system performance by exploiting time variations of the radio channel. Within the broader framework of opportunistic scheduling, this thesis solves three distinct problems and proposes efficient and scalable solutions for them. First, we present novel optimal and approximate opportunistic scheduling algorithms that combine channel fluctuation and user mobility information in their decision rules. The algorithms propose the use of dynamic fairness constraints. These fairness constraints adapt according to the user mobility. The optimal algorithm is an off-line algorithm that precomputes constraint values according to a known mobility model. The approximate algorithm is an on-line algorithm that relies on the future prediction of the user mobility locations in time. We show that the use of mobility information increases channel capacity. We also provide analytical bounds on the performance of the approximate algorithm. Second, this thesis presents a new opportunistic scheduling solution that maximizes the aggregate user performance subject to certain minimum and maximum performance constraints. By constraining the performance experienced by individual users, who share a common radio downlink, to some upper bounds, it is possible to provide the system operator with a better control of radio resource allocations and service differentiation among different classes of users. The proposed solution offers better performance than existing solution under practical channel conditions. Finally, we present a dynamic subcarrier allocation solution for fractional frequency reuse in multicell orthogonal frequency division multiple access systems. We formulate the subcarrier allocation as an equivalent set partitioning problem and then propose an efficient hierarchical solution which first partitions subcarriers into groups and next schedules subcarriers opportunistically to users. Simulation results for three solutions illustrate the usefulness of the proposed schemes.
|
Page generated in 0.0656 seconds