scholarly journals A Binary Adaptive Clone Shuffled Frog Leaping Algorithm for Three-Dimensional Low-Energy Target Coverage Optimization in Environmental Monitoring Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Bao Liu ◽  
Rui Yang ◽  
Mengying Xu ◽  
Jie Zhou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Environmental Monitoring ◽  
Three Dimensional ◽  
Physical World ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Process ◽  
Shuffled Frog Leaping

In recent years, more and more researchers have paid attention to the three-dimensional target coverage of environmental monitoring wireless sensor networks (EMWSNs) under real environmental conditions. However, the target coverage method studied in the traditional two-dimensional plane is full of loopholes when applied in the real three-dimensional physical world. Most coverage algorithms usually only optimize for a single problem of target coverage or network energy consumption and cannot reduce network energy consumption while improving coverage. This paper proposes a novel binary adaptive clone shuffled leapfrog algorithm (BACSFLA) suitable for EMWSNs. BACSFLA has an excellent performance in the coverage of three-dimensional nodes, which can significantly reduce the network energy consumption of ENWSNs in the coverage process, and greatly improve the coverage of nodes. Through simulation experiments, BACSFLA was compared with simulated annealing (SA) and genetic algorithm (GA) in the same conditional parameters. The coverage rate of BACSFLA in EMWSNs is 3.9 % higher than that of GA and 5.4 % higher than that of SA. The network energy consumption of BACSFLA is 36.0 % lower than GA and 35.9 % lower than SA. Moreover, BACSFLA can significantly reduce the calculation time and get better results in a shorter time.

scholarly journals A data forwarding algorithm based on Markov thought in underwater wireless sensor networks

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769198
Author(s):  
Dongwei Li ◽  
Jingli Du ◽  
Linfeng Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Success Rate ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Data Forwarding ◽  
Bottom To Top

The underwater wireless sensor networks composed of sensor nodes are deployed underwater for monitoring and gathering submarine data. Since the underwater environment is usually unpredictable, making the nodes move or be damaged easily, such that there are several vital objectives in the data forwarding issue, such as the delivery success rate, the error rate, and the energy consumption. To this end, we propose a data forwarding algorithm based on Markov thought, which logically transforms the underwater three-dimensional deployment model into a two-dimensional model, and thus the nodes are considered to be hierarchically deployed. The data delivery is then achieved through a “bottom to top” forwarding mode, where the delivery success rate is improved and the energy consumption is reduced because the established paths are more stable, and the proposed algorithm is self-adaptive to the dynamic routing loads.

A Wireless Sensor Networks Monitoring Device Based on ZigBee

2014 ◽  
Vol 513-517 ◽  
pp. 2077-2081
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Environmental Monitoring ◽  
Real Time ◽  
Cluster Head ◽  
Life Time ◽  
Wireless Sensor ◽  
Network Cluster ◽  
Routing Strategy

environmental monitoring should have real-time, reliability and sustainability,the article design a device which can meet the request of environmental monitoring. the wireless sensor networks device based on ZigBee is described in detailed, meanwhile, a new routing strategy based on LEACH algorithm is proposed,implement of the strategy is described in the thesis.The new routing strategy is suitable for the long time monitoring, and realized the establishment of network cluster head nodes, broadcasting, selection and scheduling. According to the distance and energy consumption of nodes make a decision that the node joining a cluster or as a separate node directly communicate with the control node.The simulation results show that the device can real-time collection and remote transmission environmental temperature, humidity and other information, reduce energy consumption of data transmission, Prolong the network life-time, improve the network quality, and ensure the wireless sensor networks stable wrok,realize the network optimization.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

PERFORMANCE EVALUATION ANALYSIS OF WIRELESS SENSOR NETWORKS ROUTING PROTOCOLS IN SMART GRIDS

2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Smart Grids ◽  
Network Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Delay Jitter ◽  
La Red

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.

scholarly journals Proficient QoS-Based Target Coverage Problem in Wireless Sensor Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 74315-74325 ◽  
Author(s):  
Manju ◽  
Samayveer Singh ◽  
Sandeep Kumar ◽  
Anand Nayyar ◽  
Fadi Al-Turjman ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem ◽  
Target Coverage Problem
Sign in / Sign up

Export Citation Format

Share Document