scholarly journals Charge critical sensors first: Minimize data loss in wireless rechargeable sensor networks

2018 ◽  
Vol 14 (7) ◽  
pp. 155014771878447
Author(s):  
Tong Li ◽  
Tang Liu ◽  
Jian Peng ◽  
Feng Lin ◽  
Wenzheng Xu

In this article, we study the scheduling of a charging vehicle to replenish sensor energy in a large-scale wireless sensor network, by utilizing the novel wireless energy transfer technology. We note that existing studies do not treat different sensors in the network discriminatively and consider only how to charge as many sensors as possible before their energy expirations. However, there are some critical sensors in the network, so that many other sensors have no alternative routing paths to upload their sensing data to the base station if the critical sensors die. Therefore, the energy expiration of a critical sensor will result in that not only the sensor itself cannot continue its monitoring task, but also many other sensors cannot send their data during the dead period of the critical sensor. Then, the monitoring quality of the sensor network will significantly deteriorate due to the energy expirations of the critical sensor. Unlike existing studies, we take into account the impact of energy depletions of critical sensors and investigate a charging scheduling problem for sensor networks, which is to schedule a charging vehicle to replenish a set of to-be-charged sensors, such that not only the amount of lost data by dead sensors is minimized, but also the traveling cost of the vehicle for charging sensors is minimized, too. We then propose a novel algorithm for the problem. We finally compare the proposed algorithm with existing studies and simulation results show that the amount of lost data by the proposed algorithm is only about 50% of those by the existing studies, and the weighted sum of the amount of lost data and the vehicle travel distance is about 70% of those by the existing ones.

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4577
Author(s):  
Florentin Delaine ◽  
Bérengère Lebental ◽  
Hervé Rivano

The drastically increasing availability of low-cost sensors for environmental monitoring has fostered a large interest in the literature. One particular challenge for such devices is the fast degradation over time of the quality of their data. Therefore, the instruments require frequent calibrations. Traditionally, this operation is carried out on each sensor in dedicated laboratories. This is not economically sustainable for dense networks of low-cost sensors. An alternative that has been investigated is in situ calibration: exploiting the properties of the sensor network, the instruments are calibrated while staying in the field and preferably without any physical intervention. The literature indicates there is wide variety of in situ calibration strategies depending on the type of sensor network deployed. However, there is a lack for a systematic benchmark of calibration algorithms. In this paper, we propose the first framework for the simulation of sensor networks enabling a systematic comparison of in situ calibration strategies with reproducibility, and scalability. We showcase it on a primary test case applied to several calibration strategies for blind and static sensor networks. The performances of calibration are shown to be tightly related to the deployment of the network itself, the parameters of the algorithm and the metrics used to evaluate the results. We study the impact of the main modelling choices and adjustments of parameters in our framework and highlight their influence on the results of the calibration algorithms. We also show how our framework can be used as a tool for the design of a network of low-cost sensors.


2021 ◽  
Vol 17 (12) ◽  
pp. 155014772110559
Author(s):  
Yingjue Chen ◽  
Yingnan Gu ◽  
Panfeng Li ◽  
Feng Lin

In wireless rechargeable sensor networks, most researchers address energy scarcity by introducing one or multiple ground mobile vehicles to recharge energy-hungry sensor nodes. The charging efficiency is limited by the moving speed of ground chargers and rough environments, especially in large-scale or challenging scenarios. To address the limitations, researchers consider replacing ground mobile chargers with lightweight unmanned aerial vehicles to support large-scale scenarios because of the unmanned aerial vehicle moving at a higher speed without geographical limitation. Moreover, multiple automatic landing wireless charging PADs are deployed to recharge unmanned aerial vehicles automatically. In this work, we investigate the problem of introducing the minimal number of PADs in unmanned aerial vehicle–based wireless rechargeable sensor networks. We propose a novel PAD deployment scheme named clustering-with-double-constraints and disks-shift-combining that can adapt to arbitrary locations of the base station, arbitrary geographic distributions of sensor nodes, and arbitrary sizes of network areas. In the proposed scheme, we first obtain an initial PAD deployment solution by clustering nodes in geographic locations. Then, we propose a center shift combining algorithm to optimize this solution by shifting the location of PADs and attempting to merge the adjacent PADs. The simulation results show that compared to existing algorithms, our scheme can charge the network with fewer PADs.


2018 ◽  
Vol 7 (2.4) ◽  
pp. 153
Author(s):  
Harkesh Sehrawat ◽  
Yudhvir Singh ◽  
Vikas Siwach

A Wireless Sensor Network (WSNs) is a collection of number of sensor nodes which are left open in an unsecured environment. Sensor nodes work and communicate together to attain the desired goals. They are placed at the locations where monitoring is otherwise impossible. Wireless Sensor Networks are resource constrained which may be computational power, memory capacity, battery power etc. As Wireless Sensor Networks are implemented in the unattended environment, they are prone to discrete type of security attacks. Because of their limitations these networks are easily targeted by intruders. Sinkhole attack is one of the security attacks which try to disturb the ongoing communication in wireless sensor network. In sinkhole attack, the intruder or the malicious node try to attract the network traffic towards itself, that sensor nodes will pass data packets through this compromised node thereby manipulating messages which sensor nodes are transferring to the base station. In this paper we analyze the impact of Sinkhole attack on AODV protocol under various conditions. We analyzed the impact of Sinkhole attack on AODV protocol with varying number of attacker nodes.  


2013 ◽  
Vol 24 (05) ◽  
pp. 625-653 ◽  
Author(s):  
ASHOK KUMAR DAS ◽  
SANTANU CHATTERJEE ◽  
JAMUNA KANTA SING

In a wireless sensor network, we often require the deployment of new nodes to extend the lifetime of the network because some sensor nodes may be lost due to power exhaustion problem or they may be also malicious nodes. In order to protect malicious nodes from joining the sensor network, access control mechanism becomes a major challenging problem in the design of sensor network protocols. Existing access control protocols designed for wireless sensor networks require either high communication overheads or they are not scalable due to involvement of the base station during authentication and key establishment processes. In this paper, we propose a new access control scheme for large-scale distributed wireless sensor networks, which not only identifies the identity of each node but it has also ability to differentiate between old nodes and new nodes. The proposed scheme does not require involvement of the base station during authentication and key establishment processes, and it can be easily implemented as a dynamic access control protocol. In addition, our scheme significantly reduces communication costs in order to authenticate neighbor nodes among each other and establish symmetric keys between neighbor nodes as compared with existing approaches. Further, our scheme is secure against different attacks and unconditionally secure against node capture attacks. The simulation results of our scheme using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool ensure that our scheme is safe.


Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4368
Author(s):  
Jitander Kumar Pabani ◽  
Miguel-Ángel Luque-Nieto ◽  
Waheeduddin Hyder ◽  
Pablo Otero

Underwater Wireless Sensor Networks (UWSNs) are subjected to a multitude of real-life challenges. Maintaining adequate power consumption is one of the critical ones, for obvious reasons. This includes proper energy consumption due to nodes close to and far from the sink node (gateway), which affect the overall energy efficiency of the system. These wireless sensors gather and route the data to the onshore base station through the gateway at the sea surface. However, finding an optimum and efficient path from the source node to the gateway is a challenging task. The common reasons for the loss of energy in existing routing protocols for underwater are (1) a node shut down due to battery drainage, (2) packet loss or packet collision which causes re-transmission and hence affects the performance of the system, and (3) inappropriate selection of sensor node for forwarding data. To address these issues, an energy efficient packet forwarding scheme using fuzzy logic is proposed in this work. The proposed protocol uses three metrics: number of hops to reach the gateway node, number of neighbors (in the transmission range of a node) and the distance (or its equivalent received signal strength indicator, RSSI) in a 3D UWSN architecture. In addition, the performance of the system is also tested with adaptive and non-adaptive transmission ranges and scalable number of nodes to see the impact on energy consumption and number of hops. Simulation results show that the proposed protocol performs better than other existing techniques or in terms of parameters used in this scheme.


2020 ◽  
Vol 93 (6) ◽  
pp. 343-350
Author(s):  
Molly O. Regelmann ◽  
Rushika Conroy ◽  
Evgenia Gourgari ◽  
Anshu Gupta ◽  
Ines Guttmann-Bauman ◽  
...  

<b><i>Background:</i></b> Pediatric endocrine practices had to rapidly transition to telemedicine care at the onset of the novel coronavirus disease 2019 (COVID-19) pandemic. For many, it was an abrupt introduction to providing virtual healthcare, with concerns related to quality of patient care, patient privacy, productivity, and compensation, as workflows had to change. <b><i>Summary:</i></b> The review summarizes the common adaptations for telemedicine during the pandemic with respect to the practice of pediatric endocrinology and discusses the benefits and potential barriers to telemedicine. <b><i>Key Messages:</i></b> With adjustments to practice, telemedicine has allowed providers to deliver care to their patients during the COVID-19 pandemic. The broader implementation of telemedicine in pediatric endocrinology practice has the potential for expanding patient access. Research assessing the impact of telemedicine on patient care outcomes in those with pediatric endocrinology conditions will be necessary to justify its continued use beyond the COVID-19 pandemic.


2018 ◽  
Vol 7 (2.26) ◽  
pp. 25
Author(s):  
E Ramya ◽  
R Gobinath

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations. 


2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.


2021 ◽  
Vol 14 (1) ◽  
pp. 270-280
Author(s):  
Abhijit Halkai ◽  
◽  
Sujatha Terdal ◽  

A sensor network operates wirelessly and transmits detected information to the base station. The sensor is a small sized device, it is battery-powered with some electrical components, and the protocols should operate efficiently in such least resource availability. Here, we propose a novel improved framework in large scale applications where the huge numbers of sensors are distributed over an area. The designed protocol will address the issues that arise during its communication and give a consistent seamless communication system. The process of reasoning and learning in cognitive sensors guarantees data delivery in the network. Localization in Scarce and dense sensor networks is achieved by efficient cluster head election and route selection which are indeed based on cognition, improved Particle Swarm Optimization, and improved Ant Colony Optimization algorithms. Factors such as mobility, use of sensor buffer, power management, and defects in channels have been identified and solutions are presented in this research to build an accurate path based on the network context. The achieved results in extensive simulation prove that the proposed scheme outperforms ESNA, NETCRP, and GAECH algorithms in terms of Delay, Network lifetime, Energy consumption.


Sign in / Sign up

Export Citation Format

Share Document