In this paper, the distributed cooperative communication of unmanned aerial vehicles (UAVs) is studied, where the condition number (CN) and the inner product (InP) are used to measure the quality of communication links. By optimizing the relative position of UAVs, large channel capacity and stable communication links can be obtained. Using the spherical wave model under the line of sight (LOS) channel, CN expression of the channel matrix is derived when there are Nt transmitters and two receivers in the system. In order to maximize channel capacity, we derive the UAVs position constraint equation (UAVs-PCE), and the constraint between BS elements distance and carrier wavelength is analyzed. The result shows there is an area where no matter how the UAVs' positions are adjusted, the CN is still very large. Then a special scenario is considered where UAVs form a rectangular lattice array, and the optimal constraint between communication distance and UAVs distance is derived. After that, we derive the InP of channel matrix and the gradient expression of InP with respect to UAVs' position. The particle swarm optimization (PSO) algorithm is used to minimize the CN and the gradient descent (GD) algorithm is used to minimize the InP by optimizing UAVs' position iteratively. Both of the two algorithms present great potentials for optimizing the CN and InP respectively. Furthermore, a hybrid algorithm named PSO-GD combining the advantage of the two algorithms is proposed to maximize the communication capacity with lower complexity. Simulations show that PSO-GD is more efficient than PSO and GD. PSO helps GD to break away from local extremum and provides better positions for GD, and GD can converge to an optimal solution quickly by using the gradient information based on the better positions. Simulations also reveal that a better channel can be obtained when those parameters satisfy the UAVs position constraint equation (UAVs-PCE), meanwhile, theory analysis also explains the abnormal phenomena in simulations.

Among the five carrier aggregation (CA) deployment scenarios, the most preferred scenario is Scenario 1, which maximizes CA gain by fully overlapping a primary cell (PCell) and one or more secondary cells (SCells). It is possible since the same frequency band is used between component carriers (CCs) so nearly the same coverage is expected. However, Scenario 1 cannot guarantee high throughput in multi-radio access technology carrier aggregation (multi-RAT CA) which is actively being researched. Different carrier frequency characteristics in multi-RAT CA makes it hard to accurately match different frequency ranges. If the ranges of PCell and SCell differ, high throughput may not be obtained despite the CA operation. We found a coverage mismatch of approximately 37% between the PCell and SCell in the deployed network and realized a reduced CA gain in those areas. In this paper, we propose a novel PCell change approach named “PCell frequency switching (PFS)” to guarantee high throughput against cell coverage mismatch in multi-RAT CA deployment scenario 1. The experiment results show that the throughput increased by 9.7% on average and especially by 80.9% around the cell edge area when PFS is applied instead of the legacy CA handover operation.

This letter proposes performance evaluation of phase-only correlation (POC) functions using signal-to-noise ratio (SNR) and peak-to-correlation energy (PCE). We derive the general expressions of SNR and PCE of the POC functions as correlation performance measures. SNR is expressed by simple fractional function of circular variance. PCE is simply given by squared peak value of the POC functions, and its expectation can be expressed in terms of circular variance.

The optimization of polarimetric contract enhancement (OPCE) is one of the important problems in radar polarimetry since it provides a substantial benefit for target enhancement. Considering different scattering mechanisms between the desired targets and the undesired targets, Yang et al. extended the OPCE model to the generalized OPCE (GOPCE) problem. Based on a modified GOPCE model and the linear discriminant analysis, a ship detector is proposed in this paper to improve the detection performance for polarimetric Synthetic Aperture Radar (SAR) imagery. In the proposed method, we modify the combination form of the three polarimetric parameters (i.e., the plane scattering similarity parameter, the diplane scattering similarity parameter and the Cloude entropy), then use an optimization function resembling the classical Fisher criterion to optimize the optimal polarization states corresponding to the radar received power and the fusion vector corresponding to the polarimetric parameters. The principle of the optimization detailed in this paper lies in maximizing the difference between the desired targets and sea clutter, and minimizing the clutter variance at the same time. RADARSAT-2 polarimetric SAR data acquired over Tanggu Port (Tianjin, China) on June 23, 2011 are used for validation. The experimental results show that the proposed method improves the contrast of the targets and sea clutter and meanwhile reduces the clutter variance. In comparison to another GOPCE based ship detector and the classical polarimetric whitening filter (PWF), the proposed method shows a better performance for weak targets. In addition, we also use the RADARSAT-2 data acquired over San-Francisco on April 9, 2008 to further demonstrate the improvement of this method for target contrast.

Recently, the GMPLS controlled WSON has emerged as a promising optical transport network. In order to guarantee the optical signal transmission feature without deformation, the optoelectronic 3R regenerators still need to be sparsely placed in the network, termed as translucent networks. The growing size and complexity of the translucent network requires a transition of control plane to move from the traditional centralized model to a fully distributed architecture in the future. However, centrally designed routing, wavelength assignment, and 3R regenerator allocation approaches become unfeasible under the distributed paradigm due to the outdated and inconsistent network state information. A common solution is to accelerate the update frequency of network state, but the fundamental problem remains that the inaccurate state information is still inevitable. Furthermore, it adds a significant increase to the control traffic volume which adversely degrades the performance and scalability of the network control system. In order to mitigate the impact of having inaccurate state information on network performance in the distributed systems, a novel RWA approach is proposed in this paper, termed as routing and distributed wavelength assignment with top ranked probing wavelength set computation. In our proposal, the wavelength assignment is performed by signalling process with a set of carefully preselected probing wavelengths. This set is dynamically computed based on the resource utilization each time the network state is refreshed. The PCE module is adopted in WSON control plane to be responsible for the computation of RWA and 3R allocation. The performance of the proposed approach is studied by extensive simulations. The experiment results reveal that by employing the proposed scheme, without loss on the blocking performance the inaccuracy of the wavelength availability information can be well tolerated, and the set-up delay in lightpath provisioning can be kept at a low level.

A translucent wavelength switched optical network (WSON) is a cost-efficient infrastructure between opaque networks and transparent optical networks, which aims at seeking a graceful balance between network cost and service provisioning performance. In this paper, we experimentally present a resilient translucent WSON with the control of an enhanced path computation element (PCE) and extended generalized multi-protocol label switching (GMPLS) controllers. An adaptive routing and wavelength assignment scheme with the consideration of accumulated physical impairments, wavelength availabilities and regenerator allocation is experimentally demonstrated and evaluated for dynamic provisioning of lightpaths. By using two different network scenarios, we experimentally verify the feasibility of the proposed solutions in support of translucent WSON, and quantitatively evaluate the path computation latency, network blocking probability and service disruption time during end-to-end lightpath restoration. We also deeply analyze the experimental results and discuss the synchronization between the PCE and the network status. To the best of our knowledge, the most significant progress and contribution of this paper is that, for the first time, all the proposed methodologies in support of PCE/GMPLS controlled translucent WSON, including protocol extensions and related algorithms, are implemented in a network testbed and experimentally evaluated in detail, which allows verifying their feasibility and effectiveness when being potentially deployed into real translucent WSON.

The optimization of polarimetric contrast enhancement (OPCE) is a widely used method for maximizing the received power ratio of a desired target versus an undesired target (clutter). In this letter, a new model of the OPCE is proposed based on the Fisher criterion. By introducing the well known two-class problem of linear discriminant analysis (LDA), the proposed model is to enlarge the normalized distance of mean value between the target and the clutter. In addition, a cross-iterative numerical method is proposed for solving the optimization with a quadratic constraint. Experimental results with the polarimetric SAR (POLSAR) data demonstrate the effectiveness of the proposed method.

A high-efficiency CMOS rectifier circuit for UHF RFID applications was developed. The rectifier utilizes a self-Vth-cancellation (SVC) scheme in which the threshold voltage of MOSFETs is cancelled by applying gate bias voltage generated from the output voltage of the rectifier itself. A very simple circuit configuration and zero power dissipation characteristics in biasing enable excellent power conversion efficiency (PCE), especially under small RF input power conditions. At higher RF input power conditions, the PCE of the rectifier automatically decreases. This is the built-in self-power-regulation function. The proposed SVC CMOS rectifier was fabricated with a 0.35-µm CMOS process and the measured performance was compared with those of conventional nMOS, pMOS, and CMOS rectifiers and other types of Vth cancellation rectifiers as well. The SVC CMOS rectifier achieves 32% of PCE at the -10 dBm RF input power condition. This PCE is larger than rectifiers reported to date under this condition.

This paper evaluates three inter-domain redundancy path computation methods based on PCE (Path Computation Element). Some inter-domain paths carry traffic that must be assured of high quality and high reliability transfer such as telephony over IP and premium virtual private networks (VPNs). It is, therefore, important to set inter-domain redundancy paths, i.e. primary and secondary paths. The first scheme utilizes an existing protocol and the basic PCE implementation. It does not need any extension or modification. In the second scheme, PCEs make a virtual shortest path tree (VSPT) considering the candidates of primary paths that have corresponding secondary paths. The goal is to reduce blocking probability; corresponding secondary paths may be found more often after a primary path is decided; no protocol extension is necessary. In the third scheme, PCEs make a VSPT considering all candidates of primary and secondary paths. Blocking probability is further decreased since all possible candidates are located, and the sum of primary and secondary path cost is reduced by choosing the pair with minimum cost among all path pairs. Numerical evaluations show that the second and third schemes offer only a few percent reduction in blocking probability and path pair total cost, while the overheads imposed by protocol revision and increase of the amount of calculation and information to be exchanged are large. This suggests that the first scheme, the most basic and simple one, is the best choice.

This paper proposes the Path Computation Element (PCE)-based backbone network architecture and verifies its feasibility through implementation and experiments. PCE communication Protocol (PCEP) is implemented for communication between the PCE and the management system to control and manage Generalized Multi-Protocol Label Switching (GMPLS)-based backbone networks.

In the Next-Generation Network (NGN), accommodating a wide variety of customer networks through virtual private network (VPN) technologies is one of the key issues. In particular, a core network provider has to provide bandwidth-assured and secured data transmission for individual private networks while performing optimal and flexible path selection. We present hierarchically distributed path computation elements (HDPCEs) that enable a virtual private network (VPN) provider to guarantee end-to-end required bandwidth and to maintain the secrecy of the link-state information of each customer from other customers. In previous studies, a VPN provider only considered link states in the provider network and did not consider customer domains connected by the provider network. HDPCEs, which are distributed to customer domains, communicate with an HDPCE for the provider network, and these HDPCEs enable the guarantee of necessary bandwidth for a data transmission from one customer domain to another via a provider network. We propose a new path-selection algorithm in each HDPCE and cooperation scheme to interwork HDPCEs, which are suitable for VPN requirements. In the evaluation, the superiority of HDPCE-based VPN path selection over legacy OSPF-TE-based VPN path selection is demonstrated in two typical VPN models: the dedicated model and shared model.

We survey traffic matrix models, whose elements represent the traffic demand between source-destination pair nodes. Modeling the traffic matrix is useful for multilayer Traffic Engineering (TE) in IP optical networks. Multilayer TE techniques make the network so designed flexible and reliable. This is because it allows reconfiguration of the virtual network topology (VNT), which consists of a set of several lower-layer (optical) paths and is provided to the higher layer, in response to fluctuations (diurnal) in traffic demand. It is, therefore, important to synthetically generate traffic matrices as close to the real ones as possible to maximize the performance of multilayer TE. We compare several models and clarify their applicability to VNT design and control. We find that it is difficult in practice to make an accurate traffic matrix with conventional schemes because of the high cost for data measurement and the complicated calculations involved. To overcome these problems, we newly introduce a simplified traffic matrix model that is practical; it well mirrors real networks. Next, this paper presents our developed server, the IP Optical TE server. It performs multilayer TE in IP optical networks. We evaluate the effectiveness of multilayer TE using our developed IP Optical server and the simplified traffic matrix. We confirm that multilayer TE offers significant CAPEX savings. Similarly, we demonstrate basic traffic control in IP optical networks, and confirm the dynamic control of the network and the feasibility of the IP Optical TE server.

Recently, integration of multiple network domains, such as optical fiber domains and packet domains, has been required by network providers and users. To achieve this interdomain integration, generalized multiprotocol label switching (GMPLS) is now receiving more attention. One of the main features of a GMPLS network is its multilayered complexity, which sometimes places a large burden on source GMPLS routers to determine optimal routes to destinations in other domains and causes label switching path (LSP)-setup delays. To reduce this source-router burden, we propose hierarchically distributed path computation equipment (HDPCE) that cooperates with each other to determine interdomain routes, reduce setup delay, and conduct flexible interdomain route creation taking individual GMPLS domain routing policies into consideration. Each domain routing policy can be set independently from that of other domains, and this routing information is not revealed to other peer domains because each HDPCE is allocated to every domain, including an interdomain, which has several underlying domains under it. Each underlying domain's HDPCE flexibly chooses three types of routing policies depending on the domain's requirement, and the interdomain HDPCE conducts interdomain route creation in accordance with underlying domain policies. OSPF routing protocol is now being applied to interdomain routing on GMPLS networks. Therefore, we compare the proposed HDPCE-based interdomain route creation with OSPF-based route creation in terms of performance and applicability, and we evaluate the effects of each underlying domain policy on interdomain route creation.