Performance analysis of adaptive physical layer network coding for wireless two-way Relaying

The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. Depending on the signal set used at the end nodes, the minimum distance of the effective constellation seen at the relay becomes zero for a finite number of channel fade states referred as the singular fade states. The singular fade states fall into the following two classes: (i) the ones which are caused due to channel outage and whose harmful effect cannot be mitigated by adaptive network coding called the non-removable singular fade states and (ii) the ones which occur due to the choice of the signal set and whose harmful effects can be removed called the removable singular fade states. In this paper, we derive an upper bound on the average end-to-end Symbol Error Rate (SER), with and without adaptive network coding at the relay, for a Rician fading scenario. It is shown that without adaptive network coding, at high Signal to Noise Ratio (SNR), the contribution to the end-to-end SER comes from the following error events which fall as SNR-1: the error events associated with the removable and nonremovable singular fade states and the error event during the BC phase. In contrast, for the adaptive network coding scheme, the error events associated with the removable singular fade states fall as SNR-2, thereby providing a coding gain over the case when adaptive network coding is not used. Also, it is shown that for a Rician fading channel, the error during the MA phase dominates over the error during the BC phase. Hence, adaptive network coding, which improves the performance during the MA phase provides more gain in a Rician fading scenario than in a Rayleigh fading scenario. Furthermore, it is shown that for large Rician factors, among those removable singular fade states which have the same magnitude, those which have the least absolute value of the phase - ngle alone contribute dominantly to the end-to-end SER and it is sufficient to remove the effect of only such singular fade states.

An adaptive modulation scheme for two-user fading MAC with quantized fade state feedback

For transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the inputs, we propose a scheme which uses only quantized knowledge of fade state at users with the feedback overhead being nominal. One of the users rotates its constellation without varying the transmit power to adapt to the existing channel conditions, in order to meet certain pre-determined minimum Euclidean distance requirement in the equivalent constellation at the destination. The optimal modulation scheme has been described for the case when both the users use symmetric M-PSK constellations at the input, where M = 2λ, λ being a positive integer. The strategy has been illustrated by considering examples where both the users use QPSK signal set at the input. It is shown that the proposed scheme has considerable better error performance compared to the conventional non-adaptive scheme, at the cost of a feedback overhead of just [log2 (M2/8 - M/4 + 2)] + 1 bits, for the M-PSK case.

Interference-Constrained Optimal Power-Adaptive Amplify-and-Forward Relaying and Selection for Underlay Cognitive Radios

In an underlay cognitive radio (CR) system, a secondary user can transmit when the primary is transmitting but is subject to tight constraints on the interference it causes to the primary receiver. Amplify-and-forward (AF) relaying is an effective technique that significantly improves the performance of a CR by providing an alternate path for the secondary transmitter's signal to reach the secondary receiver. We present and analyze a novel optimal relay gain adaptation policy (ORGAP) in which the relay is interference aware and optimally adapts both its gain and transmit power as a function of its local channel gains. ORGAP minimizes the symbol error probability at the secondary receiver subject to constraints on the average relay transmit power and on the average interference caused to the primary. It is different from ad hoc AF relaying policies and serves as a new and fundamental theoretical benchmark for relaying in an underlay CR. We also develop a near-optimal and simpler relay gain adaptation policy that is easy to implement. An extension to a multirelay scenario with selection is also developed. Our extensive numerical results for single and multiple relay systems quantify the power savings achieved over several ad hoc policies for both MPSK and MQAM constellations.

Diffusive Wave Solutions for Open Channel Flows with Uniform and Concentrated Lateral Inflow

The diffusive wave equation with inhomogeneous terms representing hydraulics with uniform or concentrated lateral inflow intoa river is theoretically investigated in the current paper. All the solutions have been systematically expressed in a unified form interms of response function or so called K-function. The integration of K-function obtained by using Laplace transform becomesS-function, which is examined in detail to improve the understanding of flood routing characters. The backwater effects usuallyresulting in the discharge reductions and water surface elevations upstream due to both the downstream boundary and lateral infloware analyzed. With a pulse discharge in upstream boundary inflow, downstream boundary outflow and lateral inflow respectively,hydrographs of a channel are routed by using the S-functions. Moreover, the comparisons of hydrographs in infinite, semi-infiniteand finite channels are pursued to exhibit the different backwater effects due to a concentrated lateral inflow for various channeltypes.

Flood Routing Models in Confluent and Dividing Channels

By introducing a water depth connecting formula, the hydraulic equations in the dividing channel system were coupled and the relation of discharge distribution between the branches of the dividing channels can be yielded. In this manner, a numerical model for the confluent channels was established to study the variation of backwater effects with the parameters in the channel junction. The meeting of flood peaks in the mainstream and tributary can be analyzed with this model. The flood peak meeting is found to be a major factor for the extremely high water level in the mainstream during the 1998 Yangtze River flood. Subsequently the variations of discharge distribution and water level with channel parameters between each branch in this system were studied as well. As a result, flood evolution caused by Jingjiang River shortcut and sediment deposition in the entrance of dividing channels of the Yangtze River may be qualitatively elucidated. It is suggested to be an effective measure for flood mitigation to enhance regulation capability of reservoirs available upstream of the tributaries and harness branch entrance channels.

Analysis of channel quality reporting mechanisms and their impact into 4G and beyond technologies

206 p.

High-current adaptive impedance matching in narrowband power-line communication systems

This paper proposes a high current impedance matching method for narrowband power-line communication (NPLC) systems. The impedance of the power-line channel is time and location variant; therefore, coupling circuitry and the channel are not usually matched. This not only results in poor signal integrity at the receiving end, but also leads to a higher transmission power requirement to secure the communication process. To offset this negative effect, a high-current adaptive impedance circuit to enable impedance matching in power-line networks is reported. The approach taken is to match the channel impedance of N-PLC systems is based on the General Impedance Converter (GIC). In order to achieve high current a special coupler in which the inductive impedance can be altered by adjusting a microcontroller controlled digital resistor is demonstrated. It is shown that the coupler works well with heavy load current in power line networks. It works in both low and high transmitting current modes, a current as high as 760 mA has been obtained. Besides, compared with other adaptive impedance couplers, the advantages include higher matching resolution and a simple control interface. Experimental results are presented to demonstrate the operation of the coupler. © 2011 IEEE.

Negligible penalty all-optical routing using a 12 × 12 passive InP wavelength-selective router

This work demonstrates transmission at 2.5 Gbit/s across two wavelength-division multiplexing (WDM) network nodes, constructed using counter-propagating semiconductor optical amplifier (SOA) wavelength converters and an integrated wavelength-selective router separated by 45 km of fiber, with an overall penalty of 0.6 dB. Minimal degradation of the eye diagram is evident across the whole system. Full utilization of the capacity of the router would allow an aggregate 360-Gbit/s node capacity for a WDM channel of 2.5 Gb/s.

Adaptive modulation induced WDM impairment reduction in optical OFDM PONs

The transmission performance of multi-channel adaptively modulated optical OFDM (AMOOFDM) signals is numerically investigated, for the first time, in optical amplification- and chromatic dispersion compensation-free, intensity-modulation and direct-detection systems incorporating directly modulated DFB lasers (DMLs). It is shown that adaptive modulation not only reduces significantly the nonlinear WDM impairments induced by the effects of cross-phase modulation and four-wave mixing, but also compensates effectively for the DML-induced frequency chirp effect. In comparison with identical modulation, adaptive modulation improves the maximum achievable signal transmission capacity of a central channel by a factor of 1.3 and 3.6 for 40km and 80km SMFs, respectively, with corresponding dynamic input optical power ranges being extended by approximately 5dB. In addition, adaptive modulation also enables cross-channel complementary modulation format mapping, leading to an improved transmission capacity of the entire WDM system. Copyright © 2010 The authors.

First real-time experimental demonstrations of 11.25Gb/s optical OFDMA PONs with adaptive dynamic bandwidth allocation.

End-to-end real-time experimental demonstrations are reported, for the first time, of aggregated 11.25Gb/s over 26.4km standard SMF, optical orthogonal frequency division multiple access (OOFDMA) PONs with adaptive dynamic bandwidth allocation (DBA). The demonstrated intensity-modulation and direct-detection (IMDD) OOFDMA PON system consists of two optical network units (ONUs), each of which employs a DFB-based directly modulated laser (DML) or a VCSEL-based DML for modulating upstream signals. Extensive experimental explorations of dynamic OOFDMA PON system properties are undertaken utilizing identified optimum DML operating conditions. It is shown that, for simultaneously achieving acceptable BERs for all upstream signals, the OOFDMA PON system has a >3dB dynamic ONU launch power variation range, and the BER performance of the system is insusceptible to any upstream symbol offsets slightly smaller than the adopted cyclic prefix. In addition, experimental results also indicate that, in addition to maximizing the aggregated system transmission capacity, adaptive DBA can also effectively reduce imperfections in transmission channel properties without affecting signal bit rates offered to individual ONUs.

Unicast Routing: Cost-Performance Tradeoffs

The objective of unicast routing is to find a path from a source to a destination. Conventional routing has been used mainly to provide connectivity. It lacks the ability to provide any kind of service guarantees and smart usage of network resources. Improving performance is possible by being aware of both traffic characteristics and current available resources. This paper surveys a range of routing solutions, which can be categorized depending on the degree of the awareness of the algorithm: (1) QoS/Constraint-based routing solutions are aware of traffic requirements of individual connection requests; (2) Traffic-aware routing solutions assume knowledge of the location of communicating ingress-egress pairs and possibly the traffic demands among them; (3) Routing solutions that are both QoS-aware as (1) and traffic-aware as (2); (4) Best-effort solutions are oblivious to both traffic and QoS requirements, but are adaptive only to current resource availability. The best performance can be achieved by having all possible knowledge so that while finding a path for an individual flow, one can make a smart choice among feasible paths to increase the chances of supporting future requests. However, this usually comes at the cost of increased complexity and decreased scalability. In this paper, we discuss such cost-performance tradeoffs by surveying proposed heuristic solutions and hybrid approaches.

Adaptive Weighing Designs for Keyword Value Computation

Attributing a dollar value to a keyword is an essential part of running any profitable search engine advertising campaign. When an advertiser has complete control over the interaction with and monetization of each user arriving on a given keyword, the value of that term can be accurately tracked. However, in many instances, the advertiser may monetize arrivals indirectly through one or more third parties. In such cases, it is typical for the third party to provide only coarse-grained reporting: rather than report each monetization event, users are aggregated into larger channels and the third party reports aggregate information such as total daily revenue for each channel. Examples of third parties that use channels include Amazon and Google AdSense. In such scenarios, the number of channels is generally much smaller than the number of keywords whose value per click (VPC) we wish to learn. However, the advertiser has flexibility as to how to assign keywords to channels over time. We introduce the channelization problem: how do we adaptively assign keywords to channels over the course of multiple days to quickly obtain accurate VPC estimates of all keywords? We relate this problem to classical results in weighing design, devise new adaptive algorithms for this problem, and quantify the performance of these algorithms experimentally. Our results demonstrate that adaptive weighing designs that exploit statistics of term frequency, variability in VPCs across keywords, and flexible channel assignments over time provide the best estimators of keyword VPCs.

Search Space Reduction in QoS Routing

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called DCCR (for Delay-Cost-Constrained Routing), is a variant of the k-shortest path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use the method proposed by Blokh and Gutin to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm SSR+DCCR (for Search Space Reduction+DCCR). Through extensive simulations, we confirm that SSR+DCCR performs very well compared to the optimal but very expensive solution.

An Adaptive Policy Management Approach to BGP Convergence

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently adopt a set of local policies that specify which routes it accepts and advertises from/to other networks, as well as which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme (APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially-conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts (policy conflict-avoidance vs. -control mode), each AS dynamically adjusts its own path preferences—increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the substability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, routing load, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.

An Adaptive Management Approach to Resolving Policy Conflicts

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently define a set of local policies on which routes it accepts and advertises from/to other networks, as well as on which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme(APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts, each AS dynamically adjusts its own path preferences---increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the sub-stability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.