Joint Power Control, Scheduling and Routing for Multihop Energy Harvesting Sensor Networks

We study wireless multihop energy harvesting sensor networks employed for random field estimation. The sensors sense the random field and generate data that is to be sent to a fusion node for estimation. Each sensor has an energy harvesting source and can operate in two modes: Wake and Sleep. We consider the problem of obtaining jointly optimal power control, routing and scheduling policies that ensure a fair utilization of network resources. This problem has a high computational complexity. Therefore, we develop a computationally efficient suboptimal approach to obtain good solutions to this problem. We study the optimal solution and performance of the suboptimal approach through some numerical examples.

Inventory Routing - A Strategic Management Accounting Perspective

This dissertation develops a strategic management accounting perspective of inventory routing. The thesis studies the drivers of cost efficiency gains by identifying the role of the underlying cost structure, demand, information sharing, forecasting accuracy, service levels, vehicle fleet, planning horizon and other strategic factors as well as the interaction effects among these factors with respect to performance outcomes. The task is to enhance the knowledge of the strategic situations that favor the implementation of inventory routing systems, understanding cause-and-effect relationships, linkages and gaining a holistic view of the value proposition of inventory routing. The thesis applies an exploratory case study design, which is based on normative quantitative empirical research using optimization, simulation and factor analysis. Data and results are drawn from a real world application to cash supply chains. The first research paper shows that performance gains require a common cost component and cannot be explained by simple linear or affine cost structures. Inventory management and distribution decisions become separable in the absence of a set-dependent cost structure, and neither economies of scope nor coordination problems are present in this case. The second research paper analyzes whether information sharing improves the overall forecasting accuracy. Analysis suggests that the potential for information sharing is limited to coordination of replenishments and that central information do not yield more accurate forecasts based on joint forecasting. The third research paper develops a novel formulation of the stochastic inventory routing model that accounts for minimal service levels and forecasting accuracy. The developed model allows studying the interaction of minimal service levels and forecasting accuracy with the underlying cost structure in inventory routing. Interestingly, results show that the factors minimal service level and forecasting accuracy are not statistically significant, and subsequently not relevant for the strategic decision problem to introduce inventory routing, or in other words, to effectively internalize inventory management and distribution decisions at the supplier. Consequently the main contribution of this thesis is the result that cost benefits of inventory routing are derived from the joint decision model that accounts for the underlying set-dependent cost structure rather than the level of information sharing. This result suggests that the value of information sharing of demand and inventory data is likely to be overstated in prior literature. In other words, cost benefits of inventory routing are primarily determined by the cost structure (i.e. level of fixed costs and transportation costs) rather than the level of information sharing, joint forecasting, forecasting accuracy or service levels.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.

Nature of nitrogen adsorbed on transition metal surfaces as revealed by electron spectroscopy and cognate techniques

The nature of the chemisorbed states of nitrogen on various transition metal surfaces is discussed comprehensively on the basis of the results of electron spectroscopic investigations augmented by those from other techniques such as LEED and thermal desorption. A brief discussion of the photoemission spectra of free N2, a comparison of adsorbed N2 and CO as well as of physisorption of N2 on metal surfaces is also presented. We discuss the chemisorption of N2 on the surfaces of certain metals (e.g. Ni, Fe, Ru and W) in some detail, paying considerable attention to the effect of electropositive and electronegative surface modifiers. Features of the various chemisorbed states (one or more weakly chemisorbed gamma-states, strongly chemisorbed alpha-states with bond orders between 1 and 2. and dissociative chemisorbed beta-states) on different surfaces are described and relations between them indicated. While the gamma-state could be a precursor of the alpha-state, the alpha-state could be the precursor of the beta-state and this kind of information is of direct relevance to ammonia synthesis. The nature of adsorption of N2 on the surfaces of some metals (e.g. Cr, Co) deserves further study and such investigations might as well suggest alternative catalysts for ammonia synthesis.

Visualization of enantiomers and determination of homo- and hetero-nuclear residual dipolar and scalar couplings: The natural abundant C-13 edited J/D-resolved NMR techniques

The simple two dimensional C-13-satellite J/D-resolved experiments have been proposed for the visualization of enantiomers, extraction of homo- and hetero-nuclear residual dipolar couplings and also H-1 chemical shift differences between the enantiomers in the anisotropic medium. The significant advantages of the techniques are in the determination of scalar couplings of bigger organic molecules. The scalar couplings specific to a second abundant spin such as F-19 can be selectively extracted from the severely overlapped spectrum. The methodologies are demonstrated on a chiral molecule aligned in the chiral liquid crystal medium and two different organic molecules in the isotropic solutions. (C) 2010 Elsevier B.V. All rights reserved.

Nature inspired optimization techniques for the design optimization of laminated composite structures using failure criteria

The design optimization of laminated composites using naturally inspired optimization techniques such as vector evaluated particle swarm optimization (VEPSO) and genetic algorithms (GA) are used in this paper. The design optimization of minimum weight of the laminated composite is evaluated using different failure criteria. The failure criteria considered are maximum stress (MS), Tsai-Wu (TW) and failure mechanism based (FMB) failure criteria. Minimum weight of the laminates are obtained for different failure criteria using VEPSO and GA for different combinations of loading. From the study it is evident that VEPSO and GA predict almost the same minimum weight of the laminate for the given loading. Comparison of minimum weight of the laminates by different failure criteria differ for some loading combinations. The comparison shows that FMBFC provide better results for all combinations of loading. (C) 2010 Elsevier Ltd. All rights reserved.

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

An investigation of well-characterized small gold clusters by photoelectron spectroscopy, tunneling spectroscopy, and cognate techniques

After microscopic characterization of the size distributions of gold clusters, deposited on carbon substrates by vacuum evaporation or by soft landing, Au(4f') binding energy of the clusters has been measured as a function of the mean cluster size. Similar measurements have been carried out on Au clusters prepared from sols by chemical means and high-nuclearity cluster compounds. In general, small clusters with a mean diameter of $2 nm show significantly larger binding energies than the bulk metal value, due to the onset of nonmetallicity. Nonmetallicity manifests itself in terms of a tunneling conductance gap only in clusters of diameter ;5 1 nm containing 40 atoms or fewer.

Investigation of the (PEG)xLiCl system using conductivity, DSC and NMR techniques

Electrolytes based on polyethylene glycol (PEG, mol.wt.8000) and LiCl of compositions, (PEG)(x)LiCl, x=4, 6, 8, 10, 12, 40, 60, where x is the O/Li ratio, were prepared by solution casting from methanol solutions. FTIR studies indicate that the ether oxygens of the polymer chain participate in Li+ ion conduction. The presence of a salt-polymer complex that melts around 190 degrees C was evidenced by DSC measurements for the electrolytes with compositions x<12. The highest conductivity was obtained at the composition x=10 which was attributed to the presence of a mostly amorphous compound. NMR measurements indicated two regions of motional narrowing, one attributable to the glass transition and another to translational diffusion.

Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks

IEEE 802.16 standards for Wireless Metropolitan Area Networks (WMANs) include a mesh mode of operation for improving the coverage and throughput of the network. In this paper, we consider the problem of routing and centralized scheduling for such networks. We first fix the routing, which reduces the network to a tree. We then present a finite horizon dynamic programming framework. Using it we obtain various scheduling algorithms depending upon the cost function. Next we consider simpler suboptimal algorithms and compare their performances.

Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks

Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) Top-K-max algorithm, ii) maximizing the minimum residual energy (Max-Min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations.

Understanding changes in the Himalayan cryosphere using remote sensing techniques

In the Himalayas, a large area is covered by glaciers and seasonal snow and changes in its extent can influence availability of water in the Himalayan Rivers. In this paper, changes in glacial extent, glacial mass balance and seasonal snow cover are discussed. Glacial retreat was estimated for 1868 glaciers in 11 basins distributed in the Indian Himalaya since 1962. The investigation has shown an overall reduction in glacier area from 6332 to 5329km2 from 1962 to 2001/2 - an overall deglaciation of 16%. Snow line at the end of ablation season on the Chhota Shigri glacier observed using field and satellite methods suggests a change in altitude from 4900 to 5200m from the late 1970s to present. Seasonal snow cover was monitored in the 28 river sub-basins using normalized difference snow index (NDSI) technique in Central and Western Himalaya. The investigation has shown that in the early part of winter, i.e. from October to December, a large amount of snow retreat was observed. For many basins located in lower altitude and in the south of the Pir Panjal range, snow ablation was observed throughout the winter season. In addition, average stream runoff of the Baspa basin for the month of December increased by 75%. This combination of glacial retreat, negative mass balance, early melting of seasonal snow cover and winter-time increase in stream runoff might suggest an influence of global warming on the Himalayan cryosphere.

Reduced Order Suboptimal Control Design for a Class of Nonlinear Distributed Parameter Systems Using POD and /spl thetas/-D Techniques

A new computational tool is presented in this paper for suboptimal control design of a class of nonlinear distributed parameter systems. First proper orthogonal decomposition based problem-oriented basis functions are designed, which are then used in a Galerkin projection to come up with a low-order lumped parameter approximation. Next, a suboptimal controller is designed using the emerging /spl thetas/-D technique for lumped parameter systems. This time domain sub-optimal control solution is then mapped back to the distributed domain using the same basis functions, which essentially leads to a closed form solution for the controller in a state feedback form. Numerical results for a real-life nonlinear temperature control problem indicate that the proposed method holds promise as a good suboptimal control design technique for distributed parameter systems.