A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Tu W
PROVIDER: S-EPMC5539798 | biostudies-other | 2017 Jul
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In Internet of Things (IoT) enabled Wireless Sensor Networks (WSNs), there are two major factors which degrade the performance of the network. One is the void hole which occurs in a particular region due to unavailability of forwarder nodes. The other is the presence of energy hole which occurs due to imbalanced data traffic load on intermediate nodes. Therefore, an optimum transmission strategy is required to maximize the network lifespan via hole alleviation. In this regard, we propose a heterogeneous network solution that is capable to balance energy dissipation among network nodes. In addition, the divide and conquer approach is exploited to evenly distribute number of transmissions over various network areas. An efficient forwarder node selection is performed to alleviate coverage and energy holes. Linear optimization is performed to validate the effectiveness of our proposed work in term of energy minimization. Furthermore, simulations are conducted to show that our claims are well grounded. Results show the superiority of our work as compared to the baseline scheme in terms of energy consumption and network lifetime.
| S-EPMC5539860 | biostudies-other
Project description:This research work proposes a novel priority aware schedule based charging algorithm that uses wireless power transfer (WPT) technique in order to charge embedded sensor nodes (SNs) in a wireless body area network (WBAN). Implanted sensor nodes in WBANs require energy for both information extraction and data transmission to the remote controller unit. Thus, energy shortage of these SNs deteriorates due to the data transmission process of the patient health monitoring system. However, continuous operation by means of electromagnetic induction for energy harvesting, obtained from ambient sources, reduces the overall efficiency of the primary unit. With this paradigm in sight, an algorithm demonstrating the modeling of a priority-based mechanism is proposed in order to ensure proper sensor voltage level and to reduce the transmission losses. Medium access control (MAC) protocols are used for inductive powering from the primary unit to the secondary unit in a collision-free centralized scheduling scheme. Therefore, the proposed wireless charging algorithm for implanted SNs in WBAN is designed as per carrier sense multiple access with collision avoidance (CSMA/CA) technique. Because of this, the overall power consumption of SNs for certain operation periods, successful charging probabilities for multiple SNs, and instantaneous power requirements are considered as key performance measures of analysis. It is assumed that proper energy storage in both transmitters and receivers can handle channel interference and traffic contention. Simulation results verify that a significant reduction in power consumption for the proposed priority aware algorithm will maintain almost similar output. For this reason, saturating class-C as well as class-E driver circuits have been used to justify the performance in two different circuit topologies. Effects of priority with respect to the full charge period have also been observed for the multi-node system. Furthermore, from performance analysis, it has been demonstrated that the scheduling scheme causes both single MOSFET composed saturating class-C and Lchoke modeled class-E associated driver circuits to be considerably more loss efficient than corresponding existing ones.
| S-EPMC6476470 | biostudies-literature
Project description:A sophisticated method for node deployment can efficiently reduce the energy consumption of a Wireless Sensor Network (WSN) and prolong the corresponding network lifetime. Pioneers have proposed many node deployment based lifetime optimization methods for WSNs, however, the retransmission mechanism and the discrete power control strategy, which are widely used in practice and have large effect on the network energy consumption, are often neglected and assumed as a continuous one, respectively, in the previous studies. In this paper, both retransmission and discrete power control are considered together, and a more realistic energy-consumption-based network lifetime model for linear WSNs is provided. Using this model, we then propose a generic deployment-based optimization model that maximizes network lifetime under coverage, connectivity and transmission rate success constraints. The more accurate lifetime evaluation conduces to a longer optimal network lifetime in the realistic situation. To illustrate the effectiveness of our method, both one-tiered and two-tiered uniformly and non-uniformly distributed linear WSNs are optimized in our case studies, and the comparisons between our optimal results and those based on relatively inaccurate lifetime evaluation show the advantage of our method when investigating WSN lifetime optimization problems.
| S-EPMC5706707 | biostudies-literature
Project description:Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols.
| S-EPMC4300191 | biostudies-literature
Project description:A new methodology is proposed for the analysis, modeling and forecasting of data collected from a wireless sensor network. Our approach is considered in the framework of a functional data analysis paradigm where observed data is represented in a functional form. To reduce dimensionality, functional principal components analysis is applied to highlight important underlying characteristics and find patterns of variations. The principal scores are modeled with tensor product smooths that allow for smoothing over space and time. The model is then used for simultaneous spatial prediction at unsampled locations and to forecast future observations. We consider soil temperature data from a wireless sensor network of 50 sensor nodes in two different land types (grassland and forest) observed during 60 consecutive days in private property close to Yass, New South Wales, Australia.
| S-EPMC4493908 | biostudies-literature
Project description:The time synchronization protocol is indispensable in various applications of wireless sensor networks, such as scheduling, monitoring, and tracking. Numerous protocols and algorithms have been proposed in recent decades, and many of them provide micro-scale resolutions. However, designing and implementing a time synchronization protocol in a practical wireless network is very challenging compared to implementation in a wired network; this is because its performance can be deteriorated significantly by many factors, including hardware quality, message delay jitter, ambient environment, and network topology. In this study, we measure the performance of the Flooding Time Synchronization Protocol (FTSP) and Gradient Time Synchronization Protocol (GTSP) in terms of practical network conditions, such as message delay jitter, synchronization period, network topology, and packet loss. This study provides insights into the operation and optimization of time synchronization protocols. In addition, the performance evaluation identifies that FTSP is highly affected by message delay jitter due to error accumulation over multi-hops. We demonstrate that the proposed extended version of the FTSP (E-FTSP) alleviates the effect of message delay jitter and enhances the overall performance of FTSP in terms of error, time, and other factors.
| S-EPMC6651869 | biostudies-literature
Project description:Wireless sensor networks (WSNs) are widely applied in industrial manufacturing systems. By means of centralized control, the real-time requirement and reliability can be provided by WSNs in industrial production. Furthermore, many approaches reserve resources for situations in which the controller cannot perform centralized resource allocation. The controller assigns these resources as it becomes aware of when and where accidents have occurred. However, the reserved resources are limited, and such incidents are low-probability events. In addition, resource reservation may not be effective since the controller does not know when and where accidents will actually occur. To address this issue, we improve the reliability of scheduling for emergency tasks by proposing a method based on a stealing mechanism. In our method, an emergency task is transmitted by stealing resources allocated to regular flows. The challenges addressed in our work are as follows: (1) emergencies occur only occasionally, but the industrial system must deliver the corresponding flows within their deadlines when they occur; (2) we wish to minimize the impact of emergency flows by reducing the number of stolen flows. The contributions of this work are two-fold: (1) we first define intersections and blocking as new characteristics of flows; and (2) we propose a series of distributed routing algorithms to improve the schedulability and to reduce the impact of emergency flows. We demonstrate that our scheduling algorithm and analysis approach are better than the existing ones by extensive simulations.
| S-EPMC5539495 | biostudies-other
Project description:Recently sink mobility has been exploited in numerous schemes to prolong the lifetime of wireless sensor networks (WSNs). Contrary to traditional WSNs where sensory data from sensor field is ultimately sent to a static sink, mobile sink-based approaches alleviate energy-holes issues thereby facilitating balanced energy consumption among nodes. In mobility scenarios, nodes need to keep track of the latest location of mobile sinks for data delivery. However, frequent propagation of sink topological updates undermines the energy conservation goal and therefore should be controlled. Furthermore, controlled propagation of sinks' topological updates affects the performance of routing strategies thereby increasing data delivery latency and reducing packet delivery ratios. This paper presents a taxonomy of various data collection/dissemination schemes that exploit sink mobility. Based on how sink mobility is exploited in the sensor field, we classify existing schemes into three classes, namely path constrained, path unconstrained, and controlled sink mobility-based schemes. We also organize existing schemes based on their primary goals and provide a comparative study to aid readers in selecting the appropriate scheme in accordance with their particular intended applications and network dynamics. Finally, we conclude our discussion with the identification of some unresolved issues in pursuit of data delivery to a mobile sink.
| S-EPMC3958281 | biostudies-other
Project description:This paper proposed a "Probabilistic and Deterministic Tree-based Routing for WSNs (PDTR)". The PDTR builds a tree from the leaves to the head (sink), according to the best elements in the initial probabilistic routing table, measured by the product of hops-count distribution, and transmission distance distribution, to select the best tree-paths. Each sender node forwards the received data to the next hop via the deterministic built tree. After that, when any node loses of its energy, PDTR updates the tree at that node. This update links probabilistically one of that node's children to a new parent, according to the updated probabilistic routing table, measured by the product of the updated: Hops-count distribution, transmission distance distribution, and residual energy distribution at the loss of ? e energy. By implementing the control parameters in each distribution, PDTR shows the impact of each distribution in the routing path. These control parameters are oriented by the user for different performances. The simulation results prove that selecting the initial best paths to root the packets via unicast, then improving the tree at the node with loss of energy by rooting the packets via anycast, leads to better performance in terms of energy consumption and network lifetime.
| S-EPMC7146286 | biostudies-literature
Project description:Wireless sensor networks (WSNs) are the core of the Internet of Things and require cryptographic protection. Cryptographic methods for WSN should be fast and consume low power as these networks rely on battery-powered devices and microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree, N, polynomials and is susceptible to the lattice basis reduction attack (LBRA). Congruential public key cryptosystem (CPKC), proposed by the NTRU authors, works on integers modulo q and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on degree N=0 polynomials modulo q, is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than q. RCPKC works as NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. RCPKC asymmetric encryption padding (RAEP), similar to its NTRU analog, NAEP, is IND-CCA2 secure. Due to the use of big numbers instead of high degree polynomials, RCPKC is about 27 times faster in encryption and decryption than NTRU. Furthermore, RCPKC is more than three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least thirty times, which allows increasing the life-time of unattended WSNs more than thirty times.
| S-EPMC7472001 | biostudies-literature