Marc Barcelo

A reduced complexity approach to IAA beamforming for efficient DOA estimation of coherent sources

We address the 2D direction-of-arrival (DOA) estimation problem in scenarios with coherent sources. More specifically, we adopt beamforming solutions based on the iterative adaptive approach (IAA) recently proposed in the literature. The motivation of such adoption mainly comes from the excellent behavior these beamformers provide in scenarios with coherent sources. Nonetheless, these strategies suffer from a prohibitive computational complexity, especially in 2D scenarios. In order to alleviate the, we propose two reduced-complexity (RC) versions of the IAA and IAA based on maximum likelihood (IAA-ML) algorithms. The proposed beamformers are referred to as IAA-RC and IAA-ML-RC and provide similar results to those obtained with their original counterparts. Computational complexity, however, is further reduced. Numerical results presented in the paper show that the computational burden can be decreased by a 52% with our proposed solutions in the considered scenarios.

Enhanced Inertial-Aided Indoor Tracking System for Wireless Sensor Networks: A Review

In recent years, there has been a growing interest in localization algorithms for indoor environments. In this paper, we have developed an enhanced filtering method for indoor positioning and tracking applications using a wireless sensor network. The method combines position, speed, and heading measurements with the aim of achieving more accurate position estimates both in the short and the long term. Using as a base, the well-known extended Kalman filter, we have incorporated two novel measurement covariance matrix tuning methods. The power threshold covariance matrix tuning method and the distance statistics covariance matrix tuning method, both based on the statistical characteristics of the distance estimations. In addition, we take into account the inertial measurements obtained from a nine-degrees of freedom inertial measurement unit. The system has been validated in real scenarios and results show that it provides long-term accuracy, that is, the accuracy remains below 1 m during a 20-min test. In summary, our methods benefit from the reduced observation error of the inertial sensors in the short term and extend it over a long period of time.

IoT-Cloud Service Optimization in Next Generation Smart Environments

The impact of the Internet of Things (IoT) on the evolution toward next generation smart environments (e.g., smart homes, buildings, and cities) will largely depend on the efficient integration of IoT and cloud computing technologies. With the predicted explosion in the number of connected devices and IoT services, current centralized cloud architectures, which tend to consolidate computing and storage resources into a few large data centers, will inevitably lead to excessive network load, end-to-end service latencies, and overall power consumption. Thanks to recent advances in network virtualization and programmability, highly distributed cloud networking architectures are a promising solution to efficiently host, manage, and optimize next generation IoT services in smart environments. In this paper, we mathematically formulate the service distribution problem (SDP) in IoT-Cloud networks, referred to as the IoT-CSDP, as a minimum cost mixed-cast flow problem that can be efficiently solved via linear programming. We focus on energy consumption as the major driver of todays network and cloud operational costs and characterize the heterogeneous set of IoT-Cloud network resources according to their associated sensing, computing, and transport capacity and energy efficiency. Our results show that, when properly optimized, the flexibility of IoT-Cloud networks can be efficiently exploited to deliver a wide range of IoT services in the context of next generation smart environments, while significantly reducing overall power consumption.

Addressing Mobility in RPL With Position Assisted Metrics

Mobility is still an open challenge in wireless sensor networks (WSNs). Energy efficient routing strategies designed for static WSNs, such as routing protocol for low-power and lossy networks (RPL), generally have a slow response to topology changes. Moreover, their high signalling cost to keep up-to-date routes in the presence of mobile nodes makes them inefficient in these scenarios. In this paper, we introduce Kalman positioning RPL (KP-RPL), a novel routing strategy for WSNs with both static and mobile nodes, based on RPL. The objective of KP-RPL is to provide robust and reliable routing, considering the positioning inaccuracies and node disconnections that arise in real-life WSNs. This considers the original RPL for the communication among static nodes and position-based routing for mobile nodes, which use a novel RPL metric that combines Kalman positioning and blacklisting. The simulation results show that the reliability and the robustness of the network in harsh conditions are enhanced compared with geographical routing. Moreover, KP-RPL reduces the density and the number of simultaneously active anchor nodes for positioning. As a result, the infrastructure cost is lower, and the network lifetime is extended.

A Review of Pedestrian Indoor Positioning Systems for Mass Market Applications

In the last decade, the interest in Indoor Location Based Services (ILBS) has increased stimulating the development of Indoor Positioning Systems (IPS). In particular, ILBS look for positioning systems that can be applied anywhere in the world for millions of users, that is, there is a need for developing IPS for mass market applications. Those systems must provide accurate position estimations with minimum infrastructure cost and easy scalability to different environments. This survey overviews the current state of the art of IPSs and classifies them in terms of the infrastructure and methodology employed. Finally, each group is reviewed analysing its advantages and disadvantages and its applicability to mass market applications.

Joint routing and transmission power control for Collection Tree Protocol in WSN

Wireless sensor networks (WSNs) have strict energy consumption requirements. Moreover, the complexity constraints of the nodes and the wireless dynamics must be considered in real life implementations. CTP (Collection Tree Protocol) is a state-of-the-art routing protocol that considers the main issues that arise in practical WSN applications. Nowadays, commercial wireless sensors can adjust their transmission power to reduce the energy consumption and the collision probability of the network. Since nodes in CTP transmit at a predefined power, the reliability and the lifetime of the network may be reduced. To solve this, this paper proposes an alternative routing metric for CTP, referred to as MaxPDR, that includes a transmission power control in the routing process. With this strategy, the incompatibility issues and the additional signaling that may arise with the combination of individual techniques are avoided. MaxPDR has been implemented in commercial motes to evaluate its performance and compare it with the routing metrics used by the original CTP and ZigBee.

Data Aggregation and Principal Component Analysis in WSNs

Data aggregation plays an important role in wireless sensor networks (WSNs) as far as it reduces power consumption and boosts the scalability of the network, especially in topologies that are prone to bottlenecks (e.g. cluster-trees). Existing works in the literature use clustering approaches, principal component analysis (PCA) and/or compressed sensing (CS) strategies. Our contribution is aligned with PCA and explores whether a projection basis that is not the eigenvectors basis may be valid to sustain a normalized mean squared error (NMSE) threshold in signal reconstruction and reduce the energy consumption. We derivate first the NSME achieved with the new basis and elaborate then on the Jacobi eigenvalue decomposition ideas to propose a new subspace-based data aggregation method. The proposed solution reduces transmissions among the sink and one or more data aggregation nodes (DANs) in the network. In our simulations, we consider without loss of generality a single cluster network and results show that the new technique succeeds in satisfying the NMSE requirement and gets close in terms of energy consumption to the best possible solution employing subspace representations. Additionally, the proposed method alleviates the computational load with respect to an eigenvector-based strategy (by a factor of six in our simulations).

Cooperative interaction among multiple RPL instances in wireless sensor networks

Advanced Wireless Sensor Networks (WSNs) applications may need to develop multiple tasks that involve sensing, processing and gathering data from different sensing units. This heterogeneous data may have multiple and sometimes opposite sets of requirements. In these scenarios, different networking strategies must be combined, and therefore traditional single-tree routing approaches are not efficient. On the contrary, the well-known RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) protocol virtually splits the network into multiple RPL Instances, that transport each kind of data according to its particular objective function. However, this protocol does not define any mechanism to decide the nodes that must belong to each instance, and this decision has a strong impact in the network energy consumption and performance. With this in mind, in this paper we introduce C-RPL (Cooperative-RPL). This creates multiple instances following a cooperative strategy among nodes with different sensing tasks. As a result, the energy consumption, the complexity and the cost of the nodes is reduced compared to RPL, since they are active less time, perform fewer tasks and are equipped with less sensing hardware. In this paper we also propose a novel fairness analysis for networks with multiple instances, showing that C-RPL achieves a better tradeoff, in terms of performance and energy consumption, than RPL with non-cooperative instances.

The cloud service distribution problem in distributed cloud networks

The cloud service distribution problem (CSDP) is to find the placement of both content and virtual cloud service functions (vCSFs) over a distributed cloud network platform, that meets user requests, satisfies network resource capacities and minimizes overall network cost. We formulate the CSDP as a minimum cost mixed-cast flow problem in which cloud services are represented by a service graph that encodes the relationship between input and output information flows via the virtual functions that create them. As a result, the CSDP can be efficiently formulated using only linear constraints and solved via integer linear programming (ILP). Our solution jointly optimizes the use of compute, storage and transport resources in arbitrary cloud network topologies, and is able to capture flexible service chaining, resource consolidation savings, unicast and multicast delivery, and latency constraints. We further provide conditions for which a relaxed version of the presented ILP leads to optimal polynomial-time solutions. We finally present results for an illustrative sample of cloud services that show the advantage of optimizing the placement of content and vCSFs over a programmable distributed cloud network.

Novel Routing Approach for the TSCH mode of IEEE 802.15.14e in Wireless Sensor Networks with Mobile Nodes

Wireless Sensor Networks (WSNs) are planned to support a wide range of industrial applications in the near future. The Timeslotted Channel Hopping (TSCH) mode of the IEEE 802.15.4e protocol has been specially designed for harsh industrial environments. In this context, the IETF 6TiSCH working group is currently defining how this standard must be adapted to Low-power and Lossy Networks (LLNs), such as WSNs. The uncertainty and dynamics of industrial environments, combined with the mobility of certain nodes complicates routing. In this paper, we present an extension of the 6TiSCH routing approach to handle the mobility of certain nodes in industrial scenarios. Routing among static nodes is managed using the same approach as 6TiSCH (RPL - IPv6 Routing Protocol for Low- Power and Lossy Networks). Then, we apply a novel position based approach to enhance the communications among mobile and static nodes. This combines end-to-end reliability estimations with a blacklisting process based on the node location. As a result, we can take advantage of the high reliability achieved by gradient-based routing techniques, and also handle the node mobility of non-static nodes. The simulation results indicate that the reliability of the communications among mobile and static nodes is increased, even with high positioning errors, compared to existent geographical routing approaches. As a result, the reliability and the robustness of the IEEE 802.15.4e WSNs with mobile nodes is enhanced even in harsh conditions.