Routing, Localization And Positioning Protocols For Wireless Sensor And Actor Networks

Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events. This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication. We also present a multi-hop localization approach for enriching the information collected from the river with the estimated locations of mobile sensor nodes without using positioning adapters. As an extension to this application, we model the movements of sensor nodes by a subsurface meandering current mobility model with random surface motion. Then we adapt the introduced routing and network organization methods to model a complete primate monitoring system. A novel spatial cut-off preferential attachment model and iii center of mass concept are developed according to the characteristics of the primate groups. We also present a role determination algorithm for primates, which uses the collection of spatial-temporal relationships. We apply a similar approach to human social networks to tackle the problem of automatic generation and organization of social networks by analyzing and assessing interaction data. The introduced routing and localization protocols in this dissertation are also extended with a novel three dimensional actor positioning strategy inspired by the molecular geometry. Extensive simulations are conducted in OPNET simulation tool for the performance evaluation of the proposed protocol

Contrasting Views of Complexity and Their Implications For Network-Centric Infrastructures

There exists a widely recognized need to better understand and manage complex “systems of systems,” ranging from biology, ecology, and medicine to network-centric technologies. This is motivating the search for universal laws of highly evolved systems and driving demand for new mathematics and methods that are consistent, integrative, and predictive. However, the theoretical frameworks available today are not merely fragmented but sometimes contradictory and incompatible. We argue that complexity arises in highly evolved biological and technological systems primarily to provide mechanisms to create robustness. However, this complexity itself can be a source of new fragility, leading to “robust yet fragile” tradeoffs in system design. We focus on the role of robustness and architecture in networked infrastructures, and we highlight recent advances in the theory of distributed control driven by network technologies. This view of complexity in highly organized technological and biological systems is fundamentally different from the dominant perspective in the mainstream sciences, which downplays function, constraints, and tradeoffs, and tends to minimize the role of organization and design

Monitoring well utility in a heterogeneous DNAPL source zone area : Insights from proximal multilevel sampler wells and sampling capture-zone modelling

Groundwater-quality assessment at contaminated sites often involves the use of short-screen (1.5 to 3 m) monitoring wells. However, even over these intervals considerable variation may occur in contaminant concentrations in groundwater adjacent to the well screen. This is especially true in heterogeneous dense non-aqueous phase liquid (DNAPL) source zones, where cm-scale contamination variability may call into question the effectiveness of monitoring wells to deliver representative data. The utility of monitoring wells in such settings is evaluated by reference to high-resolution multilevel sampler (MLS) wells located proximally to short-screen wells, together with sampling capture-zone modelling to explore controls upon well sample provenance and sensitivity to monitoring protocols. Field data are analysed from the highly instrumented SABRE research site that contained an old trichloroethene source zone within a shallow alluvial aquifer at a UK industrial facility. With increased purging, monitoring-well samples tend to a flow-weighted average concentration but may exhibit sensitivity to the implemented protocol and degree of purging. Formation heterogeneity adjacent to the well-screen particularly, alongside pump-intake position and water level, influence this sensitivity. Purging of low volumes is vulnerable to poor reproducibility arising from concentration variability predicted over the initial 1 to 2 screen volumes purged. Marked heterogeneity may also result in limited long-term sample concentration stabilization. Development of bespoke monitoring protocols, that consider screen volumes purged, alongside water-quality indicator parameter stabilization, is recommended to validate and reduce uncertainty when interpreting monitoring-well data within source zone areas. Generalised recommendations on monitoring well based protocols are also developed. A key monitoring well utility is their proportionately greater sample draw from permeable horizons constituting a significant contaminant flux pathway and hence representative fraction of source mass flux. Acquisition of complementary, high-resolution, site monitoring data, however, vitally underpins optimal interpretation of monitoring-well datasets and appropriate advancement of a site conceptual model and remedial implementation

Modelling and planning reliable wireless sensor networks based on multi-objective optimization genetic algorithm with changeable length

Wireless sensor networks (WSN) have shown their potentials in various applications, which bring a lot of benefits to users from different working areas. However, due to the diversity of the deployed environments and resource constraints, it is difficult to predict the performance of a topology. Besides the connectivity, coverage, cost, network longevity and service quality should all be considered during the planning procedure. Therefore, efficiently planning a reliable WSN is a challenging task, which requires designers coping with comprehensive and interdisciplinary knowledge. A WSN planning method is proposed in this work to tackle the above mentioned challenges and efficiently deploying reliable WSNs. First of all, the above mentioned metrics are modeled more comprehensively and practically compared with other works. Especially 3D ray tracing method is used to model the radio link and sensing signal, which are sensitive to the obstruction of obstacles; network routing is constructed by using AODV protocol; the network longevity, packet delay and packet drop rate are obtained via simulating practical events in WSNet simulator, which to the best of our knowledge, is the first time that network simulator is involved in a planning algorithm. Moreover, a multi-objective optimization algorithm is developed to cater for the characteristics of WSNs. Network size is changeable during evolution, meanwhile the crossovers and mutations are limited by certain constraints to eliminate invalid modifications and improve the computation efficiency. The capability of providing multiple optimized solutions simultaneously allows users making their own decisions, and the results are more comprehensive optimized compared with other state-of-the-art algorithms. Practical WSN deployments are also realized for both indoor and outdoor environments and the measurements coincident well with the generated optimized topologies, which prove the efficiency and reliability of the proposed algorithm

Cost-efficient deployment of multi-hop wireless networks over disaster areas using multi-objective meta-heuristics

Nowadays there is a global concern with the growing frequency and magnitude of natural disasters, many of them associated with climate change at a global scale. When tackled during a stringent economic era, the allocation of resources to efficiently deal with such disaster situations (e.g., brigades, vehicles and other support equipment for fire events) undergoes severe budgetary limitations which, in several proven cases, have lead to personal casualties due to a reduced support equipment. As such, the lack of enough communication resources to cover the disaster area at hand may cause a risky radio isolation of the deployed teams and ultimately fatal implications, as occurred in different recent episodes in Spain and USA during the last decade. This issue becomes even more dramatic when understood jointly with the strong budget cuts lately imposed by national authorities. In this context, this article postulates cost-efficient multi-hop communications as a technological solution to provide extended radio coverage to the deployed teams over disaster areas. Specifically, a Harmony Search (HS) based scheme is proposed to determine the optimal number, position and model of a set of wireless relays that must be deployed over a large-scale disaster area. The approach presented in this paper operates under a Pareto-optimal strategy, so a number of different deployments is then produced by balancing between redundant coverage and economical cost of the deployment. This information can assist authorities in their resource provisioning and/or operation duties. The performance of different heuristic operators to enhance the proposed HS algorithm are assessed and discussed by means of extensive simulations over synthetically generated scenarios, as well as over a more realistic, orography-aware setup constructed with LIDAR (Laser Imaging Detection and Ranging) data captured in the city center of Bilbao (Spain)

Trade marketing analytics in consumer goods industry

Project Work presented as the partial requirement for obtaining a Master's degree in Information Management, specialization in Information Systems and Technologies ManagementWe address transparency of trade spends in consumer goods industry and propose a set of business performance indicators that follow Pareto (80/20) rule – a popular concept in optimization problem solving. Discovery of power laws in behaviors of travelling sales persons, buying patterns of customers, popularity of products, and market demand fluctuations – all that leads to better-informed decisions among all those involved into planning, execution, and post-promotion evaluation. Practical result of our work is a prototype implementation of proposed measures. The most remarkable finding – consistency of travelling sales person journey between customer locations. Loyalty to brand, or brand market power – whatever forces field sales representatives to put at least one product of market player of interest into nearly every market basket – fits into small world model. This behavior not only changes from person to person, but also remains the same after reassignment into different territory. For industrialization stage of this project, we outline key design considerations for information system capable of handling real-time workload scalable to petabytes. We built our analyses for collaborative processes of integrated planning that requires joint effort of multidisciplinary team. Field tests demonstrate how insights from data can trigger business transformation. That is why we end up with recommendation for system integrators to include Knowledge Discovery into information system deployment projects