A Hybrid Energy-Efficient Itinerary Planning for Mobile Agents in Wireless Sensor Networks

2013 ◽  
Author(s):  
Yu-Cheng Chou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Large Scale ◽  
Evolutionary Process ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computing Power ◽  
Itinerary Planning ◽  
Hybrid Energy

Wireless sensor networks (WSNs) are limited to resources including computing power, storage capacity, and especially energy supply. Thus, energy consumption of sensor nodes has become a dominant performance index for a WSN. In addition, data transmission between sensor nodes is a main energy consumer of WSNs. This paper presents a method called immune genetic algorithm based multiple-mobile-agent itinerary planning (IGA-M2IP) that addresses issues of energy consumption in large-scale WSNs. The IGA-M2IP preserves a GA’s advantages, and further improves a GA’s efficiency by restraining possible degenerative phenomena during the evolutionary process.

Energy-Aware and Time-Critical Geo-Routing in Wireless Sensor Networks

2008 ◽  
Vol 4 (4) ◽  
pp. 315-346 ◽  
Author(s):  
Yingqi Xu ◽  
Wang-Chien Lee ◽  
Jianliang Xu ◽  
Gail Mitchell
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Delivery Rate ◽  
Research Issues ◽  
Time Critical

Volunteer forwarding, as an emerging routing idea for large scale, location-aware wireless sensor networks, has recently received significant attention. However, several critical research issues raised by volunteer forwarding, including communication collisions, communication voids, and time-critical routing, have not been well addressed by the existing work. In this paper, we propose a priority-based stateless geo-routing (PSGR) protocol that addresses these issues. Based on PSGR, sensor nodes are able to locally determine their priority to serve as the next relay node using dynamically estimated network density. This effectively suppresses potential communication collisions without prolonging routing delays. PSGR also overcomes the communication void problem using two alternative stateless schemes, rebroadcast and bypass. Meanwhile, PSGR supports routing of time-critical packets with different deadline requirements at no extra communication cost. Additionally, we analyze the energy consumption and the delivery rate of PSGR as functions of the transmission range. Finally, an extensive performance evaluation has been conducted to compare PSGR with competing protocols, including GeRaf, IGF, GPSR, flooding, and MSPEED. Simulation results show that PSGR exhibits superior performance in terms of energy consumption, routing latency, and delivery rate, and soundly outperforms all of the compared protocols.

scholarly journals Intelligent Communication in Wireless Sensor Network

2018 ◽  
Author(s):  
Mostefa Bendjima ◽  
Mohammed Feham
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Large Scale ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Communication Architecture ◽  
Package Delivery ◽  
Intelligent Communication

Wireless Sensor Networks (WSN) is designed to collect information across a large number of limited battery sensor nodes. Therefore, it is important to minimize the energy consumption of each node, which leads to the extension of the network life. Our goal is to design an intelligent WSN that collects as much information as possible to process it intelligently. To achieve this goal, an agent has been migrated to each node in order to process the information and to cooperate with these neighboring nodes while Mobile Agents (MA) can be used to reduce information between nodes and send those to the base station (Sink). This work proposes to use communication architecture for wireless sensor networks based on the Multi Agent System (MAS) to ensure optimal information collection. The collaboration of these agents generates a simple message that summarizes the important information in order to transmit it by a mobile agent. To reduce the size of the MA, the nodes of the network have been grouped into sector. As for each MA, we have established an optimal itinerary, consuming a minimum amount of energy with the data aggregation efficiency in a minimum time. Successive simulations in large scale wireless sensor networks through the SINALGO simulator show the performance of our proposal, in terms of energy consumption and package delivery rate.

Analysis of PDORP Routing Protocol for WSN

2017 ◽  
Vol 7 (8) ◽  
pp. 347
Author(s):  
V. Balaji ◽  
A. Ravi Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Problem ◽  
Scale Range

In recent years, there has been a winged generation of research relating to wireless sensor networks (WSN), due to large-scale range of potential utilization there can be used for several applications such as, surveillance, hostile monitoring, target tracking, and security management. Sensor nodes can be defined as typically powered by batteries so it is having a limited amount of lifetime, and another problem can be considering is batteries cannot be recharged. The energy problem is extreme difficulty in wireless sensor networks. So we proposed advanced routing protocol PDORP, reduced the energy consumption as well as improving the quality of service (QoS), and better throughput which compared to another routing such as, LEACH, PEGASIS, DSR, and OLSR.

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.

scholarly journals Wireless Sensor Networks for Smart Cities: Network Design, Implementation and Performance Evaluation

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 218
Author(s):  
Ala’ Khalifeh ◽  
Khalid A. Darabkh ◽  
Ahmad M. Khasawneh ◽  
Issa Alqaisieh ◽  
Mohammad Salameh ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Experimental Evaluation ◽  
Large Scale ◽  
Performance Metrics ◽  
Smart Cities ◽  
Field Tests ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Real Field

The advent of various wireless technologies has paved the way for the realization of new infrastructures and applications for smart cities. Wireless Sensor Networks (WSNs) are one of the most important among these technologies. WSNs are widely used in various applications in our daily lives. Due to their cost effectiveness and rapid deployment, WSNs can be used for securing smart cities by providing remote monitoring and sensing for many critical scenarios including hostile environments, battlefields, or areas subject to natural disasters such as earthquakes, volcano eruptions, and floods or to large-scale accidents such as nuclear plants explosions or chemical plumes. The purpose of this paper is to propose a new framework where WSNs are adopted for remote sensing and monitoring in smart city applications. We propose using Unmanned Aerial Vehicles to act as a data mule to offload the sensor nodes and transfer the monitoring data securely to the remote control center for further analysis and decision making. Furthermore, the paper provides insight about implementation challenges in the realization of the proposed framework. In addition, the paper provides an experimental evaluation of the proposed design in outdoor environments, in the presence of different types of obstacles, common to typical outdoor fields. The experimental evaluation revealed several inconsistencies between the performance metrics advertised in the hardware-specific data-sheets. In particular, we found mismatches between the advertised coverage distance and signal strength with our experimental measurements. Therefore, it is crucial that network designers and developers conduct field tests and device performance assessment before designing and implementing the WSN for application in a real field setting.

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 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

Efficient Energy Conservation and Faulty Node Detection on Machine Learning-Based Wireless Sensor Networks

2021 ◽  
Vol 13 (2) ◽  
pp. 1-20
Author(s):  
Amarasimha T. ◽  
V. Srinivasa Rao
Keyword(s):  
Machine Learning ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Communication ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Support Vector ◽  
Faulty Node

Wireless sensor networks are used in machine learning for data communication and classification. Sensor nodes in network suffer from low battery power, so it is necessary to reduce energy consumption. One way of decreasing energy utilization is reducing the information transmitted by an advanced machine learning process called support vector machine. Further, nodes in WSN malfunction upon the occurrence of malicious activities. To overcome these issues, energy conserving and faulty node detection WSN is proposed. SVM optimizes data to be transmitted via one-hop transmission. It sends only the extreme points of data instead of transmitting whole information. This will reduce transmitting energy and accumulate excess energy for future purpose. Moreover, malfunction nodes are identified to overcome difficulties on data processing. Since each node transmits data to nearby nodes, the misbehaving nodes are detected based on transmission speed. The experimental results show that proposed algorithm provides better results in terms of reduced energy consumption and faulty node detection.

Sign in / Sign up

Export Citation Format

Share Document