A Distributed Routing Method for Dynamic Multicasting

Single point, sender based control does not scale well for multicast delivery. For applications, such as group video or teleconferencing a low total cost multicast tree is required. In this article we present a destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration. In this heuristic approach we considered the staying duration of participants are available at the time of joining. The performance of our algorithm is analyzed through extensive simulation and evaluated against several other existing dynamic multicast routing and also against one well known near optimum heuristic algorithm used for solving Steiner tree problem. We have further tested our algorithm using erroneous information given by the joining participants. Simulation results show that its performance does not degrade that much even when the range of error is considerably high, which proves the robustness of our algorithm.     

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     

Desalination by distillation and by reverse osmosis — trends towards the future

As the requirement for fresh water increases worldwide, there is a need for more and more plants that are able to treat non-conventional water sources. Sea water has become an important source of fresh water in many arid regions. This feature provides an overview of recent process improvements in sea water desalination using reverse osmosis, multi-stage flash, multi-effect distillation and electrodialysis. Areas discussed include the use of alternative energy sources (wind energy, solar energy and nuclear energy) for reverse osmosis or distillation processes, and the impact of the different desalination process on the environment. Also covered are the implementation of hybrid processes in sea water desalination, and the pretreatment of desalination plants by pressure-driven membrane processes.     

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.     

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.