10,247 research outputs found

    Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks

    Get PDF
    Currently, wireless sensor networks (WSNs) are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC) algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO) is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO) and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP) hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i) selection of optimal number of subregions and further subregion parts, (ii) cluster head selection using ABC algorithm, and (iii) efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS). The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively

    Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks

    Get PDF
    In this report, we study the issue of delay optimization and energy efficiency in grid wireless sensor networks (WSNs). We focus on STDMA (Spatial Reuse TDMA)) scheduling, where a predefined cycle is repeated, and where each node has fixed transmission opportunities during specific slots (defined by colors). We assume a STDMA algorithm that takes advantage of the regularity of grid topology to also provide a spatially periodic coloring ("tiling" of the same color pattern). In this setting, the key challenges are: 1) minimizing the average routing delay by ordering the slots in the cycle 2) being energy efficient. Our work follows two directions: first, the baseline performance is evaluated when nothing specific is done and the colors are randomly ordered in the STDMA cycle. Then, we propose a solution, ORCHID that deliberately constructs an efficient STDMA schedule. It proceeds in two steps. In the first step, ORCHID starts form a colored grid and builds a hierarchical routing based on these colors. In the second step, ORCHID builds a color ordering, by considering jointly both routing and scheduling so as to ensure that any node will reach a sink in a single STDMA cycle. We study the performance of these solutions by means of simulations and modeling. Results show the excellent performance of ORCHID in terms of delays and energy compared to a shortest path routing that uses the delay as a heuristic. We also present the adaptation of ORCHID to general networks under the SINR interference model

    Design, analysis and optimization of visible light communications based indoor access systems for mobile and internet of things applications

    Get PDF
    Demands for indoor broadband wireless access services are expected to outstrip the spectrum capacity in the near-term spectrum crunch . Deploying additional femtocells to address spectrum crunch is cost-inefficient due to the backhaul challenge and the exorbitant system maintenance. According to an Alcatel-Lucent report, most mobile Internet access traffic happens indoors. To alleviate the spectrum crunch and the backhaul challenge problems, visible light communication (VLC) emerges as an attractive candidate for indoor wireless access in the 5G architecture. In particular, VLC utilizes LED or fluorescent lamps to send out imperceptible flickering light that can be captured by a smart phone camera or photodetector. Leveraging power line communication and the available indoor infrastructure, VLC can be utilized with a small one-time cost. VLC also facilitates the great advantage of being able to jointly perform illumination and communications. Integration of VLC into the existing indoor wireless access networks embraces many challenges, such as lack of uplink infrastructure, excessive delay caused by blockage in heterogeneous networks, and overhead of power consumption. In addition, applying VLC to Internet-of-Things (IoT) applications, such as communication and localization, faces the challenges including ultra-low power requirement, limited modulation bandwidth, and heavy computation and sensing at the device end. In this dissertation, to overcome the challenges of VLC, a VLC enhanced WiFi system is designed by incorporating VLC downlink and WiFi uplink to connect mobile devices to the Internet. To further enhance robustness and throughput, WiFi and VLC are aggregated in parallel by leveraging the bonding technique in Linux operating system. Based on dynamic resource allocation, the delay performance of heterogeneous RF-VLC network is analyzed and evaluated for two different configurations - aggregation and non-aggregation. To mitigate the power consumption overhead of VLC, a problem of minimizing the total power consumption of a general multi-user VLC indoor network while satisfying users traffic demands and maintaining an acceptable level of illumination is formulated. The optimization problem is solved by the efficient column generation algorithm. With ultra-low power consumption, VLC backscatter harvests energy from indoor light sources and transmits optical signals by modulating the reflected light from a reflector. A novel pixelated VLC backscatter is proposed and prototyped to address the limited modulation bandwidth by enabling more advanced modulation scheme than the state-of-the-art on-off keying (OOK) scheme and allowing for the first time orthogonal multiple access. VLC-based indoor access system is also suitable for indoor localization due to its unique properties, such as utilization of existing ubiquitous lighting infrastructure, high location and orientation accuracy, and no interruption to RF-based devices. A novel retroreflector-based visible light localization system is proposed and prototyped to establish an almost zero-delay backward channel using a retroreflector to reflect light back to its source. This system can localize passive IoT devices without requiring computation and heavy sensing (e.g., camera) at the device end

    Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

    Get PDF
    The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack optimization for similarity queries of events. In this paper, a DCS scheme with metric based similarity searching (DCSMSS) is proposed. DCSMSS takes motivation from vector distance index, called iDistance, in order to transform the issue of similarity searching into the problem of an interval search in one dimension. In addition, a sector based distance routing algorithm is used to efficiently route messages. Extensive simulation results reveal that DCSMSS is highly efficient and significantly outperforms previous approaches in processing similarity search queries

    Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

    Full text link
    Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

    Energy Disaggregation Using Elastic Matching Algorithms

    Get PDF
    © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/)In this article an energy disaggregation architecture using elastic matching algorithms is presented. The architecture uses a database of reference energy consumption signatures and compares them with incoming energy consumption frames using template matching. In contrast to machine learning-based approaches which require significant amount of data to train a model, elastic matching-based approaches do not have a model training process but perform recognition using template matching. Five different elastic matching algorithms were evaluated across different datasets and the experimental results showed that the minimum variance matching algorithm outperforms all other evaluated matching algorithms. The best performing minimum variance matching algorithm improved the energy disaggregation accuracy by 2.7% when compared to the baseline dynamic time warping algorithm.Peer reviewedFinal Published versio

    Spectrum Sharing, Latency, and Security in 5G Networks with Application to IoT and Smart Grid

    Get PDF
    The surge of mobile devices, such as smartphones, and tables, demands additional capacity. On the other hand, Internet-of-Things (IoT) and smart grid, which connects numerous sensors, devices, and machines require ubiquitous connectivity and data security. Additionally, some use cases, such as automated manufacturing process, automated transportation, and smart grid, require latency as low as 1 ms, and reliability as high as 99.99\%. To enhance throughput and support massive connectivity, sharing of the unlicensed spectrum (3.5 GHz, 5GHz, and mmWave) is a potential solution. On the other hand, to address the latency, drastic changes in the network architecture is required. The fifth generation (5G) cellular networks will embrace the spectrum sharing and network architecture modifications to address the throughput enhancement, massive connectivity, and low latency. To utilize the unlicensed spectrum, we propose a fixed duty cycle based coexistence of LTE and WiFi, in which the duty cycle of LTE transmission can be adjusted based on the amount of data. In the second approach, a multi-arm bandit learning based coexistence of LTE and WiFi has been developed. The duty cycle of transmission and downlink power are adapted through the exploration and exploitation. This approach improves the aggregated capacity by 33\%, along with cell edge and energy efficiency enhancement. We also investigate the performance of LTE and ZigBee coexistence using smart grid as a scenario. In case of low latency, we summarize the existing works into three domains in the context of 5G networks: core, radio and caching networks. Along with this, fundamental constraints for achieving low latency are identified followed by a general overview of exemplary 5G networks. Besides that, a loop-free, low latency and local-decision based routing protocol is derived in the context of smart grid. This approach ensures low latency and reliable data communication for stationary devices. To address data security in wireless communication, we introduce a geo-location based data encryption, along with node authentication by k-nearest neighbor algorithm. In the second approach, node authentication by the support vector machine, along with public-private key management, is proposed. Both approaches ensure data security without increasing the packet overhead compared to the existing approaches

    Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

    Get PDF
    We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative. We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other approaches, they produce significantly better results. They are very robust against variations in node degree and do not rely on simplified assumptions of the communication model. Moreover, they are much easier to implement on real sensor nodes than most existing approaches.Comment: extended version of accepted submission to SEA 201
    corecore