Routing Correlated Data with Fusion Cost in Wireless Sensor Networks

In this paper, we propose a routing algorithm called minimum fusion Steiner tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transmission cost, but also incorporates the cost for data fusion, which can be significant for emerging sensor networks with vectorial data and/or security requirements. By employing a randomized algorithm that allows fusion points to be chosen according to the nodes' data amounts, MFST achieves an approximation ratio of 5/4log(k + 1), where k denotes the number of source nodes, to the optimal solution for extremely general system setups, provided that fusion cost and data aggregation are nondecreasing against the total input data. Consequently, in contrast to algorithms that only excel in full or nonaggregation scenarios without considering fusion cost, MFST can thrive in a wide range of applications     

Formation of a geometric pattern with a mobile wireless sensor network

Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These self‐organizing, distributed networks of sensors, processors, and actuators that are capable of movement have a broad range of potential applications, including military reconnaissance, surveillance, planetary exploration, and geophysical mapping. In many of the foreseen applications, the MWSN will need to form a geometric pattern without assistance from the user. In military reconnaissance, for example, the nodes will be dropped onto the battlefield from a plane and land at random positions. The nodes will be expected to arrange themselves into a predetermined formation in order to perform a specific task. Thus, we present algorithms for forming a line, circle, and regular polygon from a given set of random positions. The algorithms are distributed and use no communication between the nodes to minimize energy consumption. Unlike past studies of geometric problems where algorithms are either tested in simulations where each node has global knowledge of all the other nodes or implemented on a small number of robots, the robustness of our algorithms has been studied with simulations that model the sensor system in detail. The simulations demonstrate that the algorithms are robust against random errors in the sensors and actuators. © 2004 Wiley Periodicals, Inc.     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.     

Mobility management for VoIP service: Mobile IP vs. SIP

Wireless Internet access has gained significant attention as wireless/mobile communications and networking become widespread. The voice over IP service is likely to play a key role in the convergence of IP-based Internet and mobile cellular networks. We explore different mobility management schemes from the perspective of VoIP services, with a focus on Mobile IP and session initiation protocol. After illustrating the signaling message flows in these two protocols for diverse cases of mobility management, we propose a shadow registration concept to reduce the interdomain handoff (macro-mobility) delay in the VoIP service in mobile environments. We also analytically compute and compare the delay and disruption time for exchanging signaling messages associated with the Mobile IP and SIP-based solutions.     

Bounds on the number of samples needed for neural learning.

The relationship between the number of hidden nodes in a neural network, the complexity of a multiclass discrimination problem, and the number of samples needed for effect learning are discussed. Bounds for the number of samples needed for effect learning are given. It is shown that Omega(min (d,n) M) boundary samples are required for successful classification of M clusters of samples using a two-hidden-layer neural network with d-dimensional inputs and n nodes in the first hidden layer.     

Springback analysis of thin rectangular bars of non-linear work-hardening materials under torsional loading

A theoretical analysis of the springback of narrow rectangular strips of non-linear work-hardening material under torsional loading has been carried out. This theoretical analysis is supported by experimental results for rectangular mild steel strips of different thicknesses and lengths. Finally an analytical generalized expression relating angle of twist to twisting moment and residual angle of twist per unit length for rectangular strips under plastic torsion is obtained in non-dimensionalized form. A comparison between the results obtained for bars of non- linear and linear work-hardening materials loaded under torsion is also made.     

Modeling and assimilation of root zone soil moisture using remote sensing observations in Walnut Gulch Watershed during SMEX04

Soil moisture status in the root zone is an important component of the water cycle at all spatial scales (e.g., point, field, catchment, watershed, and region). In this study, the spatio-temporal evolution of root zone soil moisture of the Walnut Gulch Experimental Watershed (WGEW) in Arizona was investigated during the Soil Moisture Experiment 2004 (SMEX04). Root zone soil moisture was estimated via assimilation of aircraft-based remotely sensed surface soil moisture into a distributed Soil-Water-Atmosphere-Plant (SWAP) model. An ensemble square root filter (EnSRF) based on a Kalman filtering scheme was used for assimilating the aircraft-based soil moisture observations at a spatial resolution of 800 m × 800 m. The SWAP model inputs were derived from the SSURGO soil database, LAI (Leaf Area Index) data from SMEX04 database, and data from meteorological stations/rain gauges at the WGEW. Model predictions are presented in terms of temporal evolution of soil moisture probability density function at various depths across the WGEW. The assimilation of the remotely sensed surface soil moisture observations had limited influence on the profile soil moisture. More specifically, root zone soil moisture depended mostly on the soil type. Modeled soil moisture profile estimates were compared to field measurements made periodically during the experiment at the ground based soil moisture stations in the watershed. Comparisons showed that the ground-based soil moisture observations at various depths were within ± 1 standard deviation of the modeled profile soil moisture. Density plots of root zone soil moisture at various depths in the WGEW exhibited multi-modal variations due to the uneven distribution of precipitation and the heterogeneity of soil types and soil layers across the watershed.     

Clarification of a wheat straw‐derived medium with ion‐exchange resins for xylitol crystallization

BACKGROUND: Xylitol bioproduction from lignocellulosic residues comprises hydrolysis of the hemicellulose, detoxification of the hydrolysate, bioconversion of the xylose, and recovery of xylitol from the fermented hydrolysate. There are relatively few reports on xylitol recovery from fermented media. In the present study, ion‐exchange resins were used to clarify a fermented wheat straw hemicellulosic hydrolysate, which was then vacuum‐concentrated and submitted to cooling in the presence of ethanol for xylitol crystallization. RESULTS: Sequential adsorption into two anion‐exchange resins (A‐860S and A‐500PS) promoted considerable reductions in the content of soluble by‐products (up to 97.5%) and in medium coloration (99.5%). Vacuum concentration led to a dark‐colored viscous solution that inhibited xylitol crystallization. This inhibition could be overcome by mixing the concentrated medium with a commercial xylitol solution. Such a strategy led to xylitol crystals with up to 95.9% purity. The crystallization yield (43.5%) was close to that observed when using commercial xylitol solution (51.4%). CONCLUSION: The experimental data demonstrate the feasibility of using ion‐exchange resins followed by cooling in the presence of ethanol as a strategy to promote the fast recovery and purification of xylitol from hemicellulose‐derived fermentation media. Copyright © 2008 Society of Chemical Industry