scholarly journals Data Exchange in Cluster Structure for Longevity of IoT

2020 ◽  
Vol 12 (2) ◽  
pp. 32
Author(s):  
Soobin Jeon
Keyword(s):  
Energy Consumption ◽  
Data Exchange ◽  
Cluster Structure ◽  
Information Aggregation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Exchange Method ◽  
Cluster Network ◽  
Clustering Property ◽  
Saving Effect

In the Internet of Things (IoT), the scope of wireless sensor nodes is extended to things deployed in a pervasive world. For various IoT service applications, things can gather and share their information with each other through self-decision-making. Therefore, we cannot apply the existing information aggregation methods of wireless sensor networks to the IoT environment, which aim to transmit the collected data to only a sink node or a central server. Moreover, since the existing methods involve all the sensor nodes in the process of data exchange, they can cause an increase in the network traffic, delay of data transmission, and amount of energy consumed by things. In this paper, we propose a clustering-property-based data exchange method for efficient energy consumption in IoT networks. First, the proposed method assigns properties to each thing according to the characteristics of the obtained data. Second, it constructs a cluster network considering the location of things and their energy consumption. Finally, the things in a cluster communicate with other things in a different cluster based on their properties. In the experiment, the proposed method exhibits a better performance than the existing method. Owing to the energy-saving effect, we demonstrate that the proposed method results in a more reliable network and improves the longevity of IoT networks.

scholarly journals Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Structure ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Energy Efficient Clustering

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.

Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.

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.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

scholarly journals Using Mobile Elements as Dynamic Bridges in Sparse Wireless Sensor Networks

2014 ◽  
pp. 107
Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Data Transfer ◽  
Mobile Elements ◽  
Sensor Nodes ◽  
Pollution Monitoring ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Road Distance

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.

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

Sign in / Sign up

Export Citation Format

Share Document