scholarly journals Performance Analysis of Q-Leach Algorithm in WSN

2020 ◽  
Vol 5 (10) ◽  
pp. 1-4
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Short Range ◽  
Sensor Node ◽  
Life Time ◽  
Time Span ◽  
Sensor Nodes ◽  
Wireless Sensor

Sensor nodes are exceedingly energy compelled instrument, since it is battery operated instruments. In wsn network, every node is liable to the data transmission through the wireless mode [1]. Wireless sensor networks (WSN) is made of a huge no. of small nodes with confined functionality. The essential theme of the wireless sensor network is energy helpless and the WSN is collection of sensor. Every sensor terminal is liable to sensing, store and information clan and send it forwards into sink. The communication within the node is done via wireless network [3].Energy efficiency is the main concentration of a desining the better routing protocol. LEACH is a protocol. This is appropriate for short range network, since imagine that whole sensor node is capable of communication with inter alia and efficient to access sink node, which is not always correct for a big network. Hence, coverage is a problem which we attempt to resolve [6]. The main focus within wireless sensor networks is to increase the network life-time span as much as possible, so that resources can be utilizes efficiently and optimally. Various approaches which are based on the clustering are very much optimal in functionality. Life-time of the network is always connected with sensor node’s energy implemented at distant regions for stable and defect bearable observation [10].

scholarly journals A Data-Based Fault-Detection Model for Wireless Sensor Networks

2019 ◽  
Vol 11 (21) ◽  
pp. 6171 ◽  
Author(s):  
Jangsik Bae ◽  
Meonghun Lee ◽  
Changsun Shin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Data Transmission ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sensors And Actuators ◽  
Detection Model ◽  
Management Platform

With the expansion of smart agriculture, wireless sensor networks are being increasingly applied. These networks collect environmental information, such as temperature, humidity, and CO2 rates. However, if a faulty sensor node operates continuously in the network, unnecessary data transmission adversely impacts the network. Accordingly, a data-based fault-detection algorithm was implemented in this study to analyze data of sensor nodes and determine faults, to prevent the corresponding nodes from transmitting data; thus, minimizing damage to the network. A cloud-based “farm as a service” optimized for smart farms was implemented as an example, and resource management of sensors and actuators was provided using the oneM2M common platform. The effectiveness of the proposed fault-detection model was verified on an integrated management platform based on the Internet of Things by collecting and analyzing data. The results confirm that when a faulty sensor node is not separated from the network, unnecessary data transmission of other sensor nodes occurs due to continuous abnormal data transmission; thus, increasing energy consumption and reducing the network lifetime.

scholarly journals Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

scholarly journals AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Farzad Kiani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Search Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Second Phase

Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase), the sensors are placed into virtual layers. The second phase (data transmission) is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

scholarly journals Comparison of LEACH and PEGASIS Hierarchical Routing Protocols in WSN

2020 ◽  
Vol 16 (09) ◽  
pp. 159
Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Geographical Area ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing ◽  
Power Efficient

<p>Wireless Sensor Networks is a group of sensor nodes dispatched in a geographical area for a defined objective. These sensor nodes are characterized by limited capacity of communicating, computing and especially of energy. The performance of these WSN is resting on a good routing protocol, hence the need to choose the routing protocol able to satisfy the wsn's objectives, and to satisfy the common challenge to prolong network life time.</p><p>Several routing concepts have been proposed for the WSN, hierarchical routing is one of the most used concepts. It is divided into 3 types: cluster based routing, grid based routing and chain based protocol. In this paper, we are interested to Study, analyse and compare two popular routing protocols for Wireless sensor networks (WSNs), Low-Energy Adaptive Clustering Hierarchy (LEACH) using clusters based concept and Power-Efficient Gathering in Sensor Information System (PEGASIS) with chain based concept. The both protocols are simulated with Matlab simulator, in order to evaluate its performances against the different users and the WSNs objectives defined.</p>

scholarly journals Communication Availability-Based Scheduling for Fair Data Collection with Path-Constrained Mobile Sink in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Youngtae Jo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Data Transmission ◽  
Sensor Node ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Sink Node

To effectively transfer sensing data to a sink node, system designers should consider the characteristic of wireless sensor networks in the way of data transmission. In particular, sensor nodes surrounding a fixed sink node have routinely suffered from concentrated network traffic so that their battery energy is rapidly exhausted. The lifetime of wireless sensor networks decreases due to the rapid power consumption of these sensor nodes. To address the problem, a mobile sink model has recently been chosen for traffic load distribution among sensor nodes. However, since a mobile sink continuously changes its location in sensor networks, it has a time limitation to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, fair and stable data collection policy between a mobile sink and sensor nodes is necessary in this circumstance. In this paper, we propose a new scheduling policy to support fair and stable data collection for a mobile sink in wireless sensor networks. The proposed policy performs data collection scheduling based on the communication availability of data transmission between sensor nodes and a mobile sink.

scholarly journals Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime.

scholarly journals AMPC: A Lightweight Hybrid Cryptographic Algorithm for Wireless Sensor Networks

2020 ◽  
Vol 5 (6) ◽  
pp. 1142-1146
Author(s):  
Md. Navid Bin Anwar ◽  
Maherin Mizan Maha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Transmission ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computational Time ◽  
Cryptographic Algorithm ◽  
Autonomous Sensor

Wireless sensor network (WSN) is a group of several autonomous sensor nodes attached to each other. Wireless sensor networks are commonly used in a lot of applications and are expected to have a cheap deployment cost. The network of sensors continues to grow aiding the need of the system. Due to that, sensors become vulnerable to attacks and need strong security mechanism. To strengthen the security of data which are transmitted through sensors in WSN, different cryptographic schemes are used. As WSN has limited energy source, therefore, complex cryptographic algorithms may require excessive computational time which not only make the data transmission slow but the life time of sensor network will be significantly affected. To overcome these challenges a new hybrid cryptographic scheme, AES and Modified Playfair Cipher (AMPC), is introduced in this paper.

Wireless Sensor Networks Data Transmission Based on Congestion by Cognized Routing Protocol

2012 ◽  
Vol 433-440 ◽  
pp. 3692-3702
Author(s):  
Fan Jun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Transmission Efficiency ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Time Stamps ◽  
Link Congestion

In wireless sensor networks (WSNs), sensor nodes share wireless channels to communicate with each other. So, link congestion often occurs and induces data retransmission easily. To avoid these issues, data transmission efficiency would be greatly enhanced and the energy consumption of network would save a lot. Based on this idea, we have designed a transmission-effective congestion-cognized (TECC) routing protocol in the paper. Routings are selected probabilistically and real-timely, according to the out-bound nodes’ satisfactory degrees of forwarding. Also, time stamps are used to control nodes’ status, effectively reducing the occurrence probability of conflict and link congestion in networks. Simulation results show that, TECC routing protocol has good performances of low-latency and energy-consuming equilibrium, which could significantly improve energy utilization and data transmission efficiency of network.

scholarly journals An Evaluation on Game Theory Problem of RSSI Localization Technique in Wireless Sensor Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 5729-5733
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Essential Requirement ◽  
Localization Technique ◽  
Research Areas

The most interesting and challenging research areas in WSNs are routing protocol based on RSSI localization technique in wireless sensor networks. Get-up-and-go safeguarding is the most important experiment for WSNs and make the most of the energy efficiently during routing is an essential requirement and is a demanding task for all other research areas in WSNs. Enhancing the lifespan of the network be contingent on game theory based on RSSI localization technique in wireless sensor networks are the foremost purposes in Machiavellian WSNs since the course-plotting up for theory based on RSSI sensor nodes are battery operated and cannot be replenished or recharged frequently. Here game theory based on RSSI localization for increasing the Wireless Sensor Network life-time using Ant Colony Optimization metaheuristics.

Sign in / Sign up

Export Citation Format

Share Document