scholarly journals Performance of Transmission Delay and Energy Consumption of Adaptive Listening Mechanism for Wireless Sensor Networks

2019 ◽  
Vol 8 (6) ◽  
pp. 3215-3220
Author(s):  
Yung-Fa Huang ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Transmission Delay ◽  
Wireless Sensor

scholarly journals An adaptive retransmit mechanism for delay differentiated services in industrial WSNs

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Ye Chen ◽  
Wei Liu ◽  
Tian Wang ◽  
Qingyong Deng ◽  
Anfeng Liu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Internet Of Things ◽  
Differentiated Services ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
The Internet ◽  
The Impact ◽  
The Internet Of Things

AbstractThe Internet of Things (IoT) is the latest Internet development, with billions of Internet-connected devices and a wide range of industrial applications. Wireless sensor networks are an important part of the Internet of Things. It has received extensive attention from researchers due to its large-scale, self-organizing, and dynamic characteristics and has been widely used in industry, traffic information, military, environmental monitoring, and so on. With the development of microprocessor technology, sensor nodes are becoming more and more powerful, which enables the same wireless sensor networks (WSNs) platform to meet the different quality of service (QoS) requirements of many applications. Applications for industrial wireless sensor networks range from lower physical layers to higher application layers. The same wireless sensor network sometimes needs to process information from different layers. Traditional protocols lack differentiated services and cannot make full use of network resources. In this paper, an Adaptive Retransmit Mechanism for Delay Differentiated Services (ARM-DDS) scheme is proposed to meet different levels of delays of applications. Firstly, we analyze the impact of different retransmit mechanisms and parameter optimization on delays and energy consumption. Based on the results of the analysis, in ARM-DDS scheme, for routes with transmission delay tolerance, energy-saving retransmission mechanisms are used, and low-latency retransmission mechanisms are used for latency-sensitive routes. In this way, the data routing delays of different applications are guaranteed within bound and the energy consumption of the network is reduced. What is more, ARM-DDS scheme makes full use of the residual energy of the network and uses a small delay routing retransmit mechanism in the far-sink area to reduce end-to-end delay. Both theoretical analysis and simulation experiments show that under the premise of the same reliability requirements, ARM-DDS scheme reduces data transmission delay 12.1% and improves network energy utilization 28%. Given that the reliability requirements of the data stream are different, the scheme can also extend the network lifetime.

scholarly journals Delay optimal opportunistic pipeline routing scheme for cognitive radio sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877253 ◽  
Author(s):  
Anfeng Liu ◽  
Wei Chen ◽  
Xiao Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Duty Cycle ◽  
Data Transmission ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
Cognitive Radio Sensor Networks ◽  
Routing Scheme

In order to solve the problem of spectrum scarcity in wireless sensor networks, cognitive radio technology can be introduced into wireless sensor networks, giving rising to cognitive radio sensor networks. Delay-sensitive data applications in cognitive radio sensor networks require efficient real-time communication. Opportunistic pipeline routing is a potential technology to reduce the delay, which can use nodes outside the main forwarding path forward data opportunistically when the transmission fails. However, the energy efficiency of cognitive radio sensor networks with opportunistic pipeline routing is low, and the data transmission delay can be further optimized. In view of this situation, we propose the delay optimal opportunistic pipeline routing scheme named Variable Duty Cycle for Opportunistic Pipeline Routing (VDCOPR). In the Variable Duty Cycle for Opportunistic Pipeline Routing scheme, the nodes employ high duty cycle in the area far from the sink, and low duty cycle in the area near to the sink, which can achieve the balance of energy consumption and reduce the data transmission delay while not affecting network lifetime. The theoretical analysis and experimental results show that, compared with previous opportunistic pipeline routing, energy consumption of network is relatively balanced and the data transmission delay can be reduced by 36.6% in the Variable Duty Cycle for Opportunistic Pipeline Routing scheme.

scholarly journals A Lifetime Optimization Algorithm Limited by Data Transmission Delay and Hops for Mobile Sink-Based Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Yourong Chen ◽  
Xiaowen Lv ◽  
Siyi Lu ◽  
Tiaojuan Ren
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Optimization Algorithm ◽  
Data Transmission ◽  
Mobile Sink ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
Lifetime Optimization

To improve the lifetime of mobile sink-based wireless sensor networks and considering that data transmission delay and hops are limited in actual system, a lifetime optimization algorithm limited by data transmission delay and hops (LOA_DH) for mobile sink-based wireless sensor networks is proposed. In LOA_DH, some constraints are analyzed, and an optimization model is proposed. Maximum capacity path routing algorithm is used to calculate the energy consumption of communication. Improved genetic algorithm which modifies individuals to meet all constraints is used to solve the optimization model. The optimal solution of sink node’s sojourn grid centers and sojourn times which maximizes network lifetime is obtained. Simulation results show that, in three node distribution scenes, LOA_DH can find the movement solution of sink node which covers all sensor nodes. Compared with MCP_RAND, MCP_GMRE, and EASR, the solution improves network lifetime and reduces average amount of node discarded data and average energy consumption of nodes.

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.

Sign in / Sign up

Export Citation Format

Share Document