Measured sensitivity of arc-induced long-period grating sensors in photonic crystal fibre

Reported are experimental results from investigations of the sensing properties of long-period gratings (LPGs) recorded in two different geometries of photonic crystal fibre (PCF): a large-mode area PCF and an endlessly single mode PCF. The LPGs have been characterised for their sensitivity to temperature, bending, surrounding index and strain. The LPGs in both fibres have been found to have negligible temperature sensitivity whilst exhibiting useful strain sensitivities. Strong directional bend sensitivity is shown by one PCF whilst the other shows good non-directional bend sensitivity. The fibres exhibit differing sensitivities to surrounding refractive index. © 2005 Elsevier B.V. All rights reserved.

Sensitivity of LPGs in PCFs fabricated by an electric arc to temperature, strain, and external refractive index

Sensing properties of long-period gratings (LPGs) fabricated in photonic crystal fibers by an electric arc are explained and quantified by semianalytical and numerical models. In particular, the grating's insensitivity to temperature and simultaneous sensitivity to strain and refractive index are simulated. The modeling procedure is generalized so that it can be applied to a wide range of LPGs in various fibers. © 2007 IEEE.

A new three phase method (SDP method) for the multi-objective vehicle routing problem with simultaneous delvery and pickup (VRPSDP)

Transportation service operators are witnessing a growing demand for bi-directional movement of goods. Given this, the following thesis considers an extension to the vehicle routing problem (VRP) known as the delivery and pickup transportation problem (DPP), where delivery and pickup demands may occupy the same route. The problem is formulated here as the vehicle routing problem with simultaneous delivery and pickup (VRPSDP), which requires the concurrent service of the demands at the customer location. This formulation provides the greatest opportunity for cost savings for both the service provider and recipient. The aims of this research are to propose a new theoretical design to solve the multi-objective VRPSDP, provide software support for the suggested design and validate the method through a set of experiments. A new real-life based multi-objective VRPSDP is studied here, which requires the minimisation of the often conflicting objectives: operated vehicle fleet size, total routing distance and the maximum variation between route distances (workload variation). The former two objectives are commonly encountered in the domain and the latter is introduced here because it is essential for real-life routing problems. The VRPSDP is defined as a hard combinatorial optimisation problem, therefore an approximation method, Simultaneous Delivery and Pickup method (SDPmethod) is proposed to solve it. The SDPmethod consists of three phases. The first phase constructs a set of diverse partial solutions, where one is expected to form part of the near-optimal solution. The second phase determines assignment possibilities for each sub-problem. The third phase solves the sub-problems using a parallel genetic algorithm. The suggested genetic algorithm is improved by the introduction of a set of tools: genetic operator switching mechanism via diversity thresholds, accuracy analysis tool and a new fitness evaluation mechanism. This three phase method is proposed to address the shortcoming that exists in the domain, where an initial solution is built only then to be completely dismantled and redesigned in the optimisation phase. In addition, a new routing heuristic, RouteAlg, is proposed to solve the VRPSDP sub-problem, the travelling salesman problem with simultaneous delivery and pickup (TSPSDP). The experimental studies are conducted using the well known benchmark Salhi and Nagy (1999) test problems, where the SDPmethod and RouteAlg solutions are compared with the prominent works in the VRPSDP domain. The SDPmethod has demonstrated to be an effective method for solving the multi-objective VRPSDP and the RouteAlg for the TSPSDP.

Ad hoc network state aware routing protocol

The environment of a mobile ad hoc network may vary greatly depending on nodes' mobility, traffic load and resource conditions. In this paper we categorize the environment of an ad hoc network into three main states: an ideal state, wherein the network is relatively stable with sufficient resources; a congested state, wherein some nodes, regions or the network is experiencing congestion; and an energy critical state, wherein the energy capacity of nodes in the network is critically low. Each of these states requires unique routing schemes, but existing ad hoc routing protocols are only effective in one of these states. This implies that when the network enters into any other states, these protocols run into a sub optimal mode, degrading the performance of the network. We propose an Ad hoc Network State Aware Routing Protocol (ANSAR) which conditionally switches between earliest arrival scheme and a joint Load-Energy aware scheme depending on the current state of the network. Comparing to existing schemes, it yields higher efficiency and reliability as shown in our simulation results. © 2007 IEEE.

A comparison of the spectral properties of high temperature annealed long period gratings inscribed by fs laser, UV and fusion-arc

Long period gratings have been inscribed in standard single mode fibre using a fs laser system, a fusion arc and a UV laser and a comparative study carried out of their thermal behaviour. The fs laser induced gratings can survive temperatures in excess of 800°C, however the inscription process can induce considerable birefringence within the device. Annealing studies have been carried out showing that below 600°C, all three grating types show a blue shift in their room temperature resonance wavelengths following cyclic heating, while above 600°C, the UV and arc induced LPGs exhibit a red shift, with the fs LPG showing an even stronger blue shift. High temperature annealing is also shown to considerably reduce the birefringence induced by the fs inscription process.

Efficient algorithm for routing optimization via statistical mechanics

Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used. © 2013 IEEE.

Chain routing:a new routing framework for the Internet based on complete orders

A new framework to perform routing at the autonomous system (AS) level is proposed here. This mechanism, called chain routing framework (CRF), uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a known topology, it is possible to use these acyclic structures to route consistently packets between a group of ASs. The adoption of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining CRF with other mechanisms that implement complete orders in time, the authors propose that it is possible to design a new routing protocol, which can be more reliable and stable than the border gateway protocol. © 2011 The Institution of Engineering and Technology.