scholarly journals EATMR: An Energy-Aware Trust Algorithm Based the AODV Protocol and Multi-path Routing Approach in Wireless Sensor Networks

2021 ◽  
Author(s):  
Huaying Yin ◽  
Hongmei Yang ◽  
Maryam Hajiee
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Denial Of Service ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Second Phase ◽  
Energy Aware ◽  
Aodv Protocol

Abstract Rapid developments in radio technology and processors have led to the emergence of small sensor nodes that provide communication over Wireless Sensor Networks (WSNs). The crucial issues in these networks are energy consumption management and reliable data exchange. Due to the limited resources of sensor nodes, WSNs become a vulnerable target against many security attacks. Thus, energy-aware trust-based techniques have become a powerful tool for detecting nodes’ behavior and providing security solutions in WSN. Clustering-based routings are one of the most effective methods in increasing the WSN performance. In this paper, an Energy-Aware Trust algorithm based on the AODV protocol and Multi-path Routing approach (EATMR) is proposed to improve the security of WSNs. EATMR consists of two main phases: firstly, the nodes are clustered based on the Open-Source Development Model Algorithm (ODMA), and then in the second phase, clustering-based routing is applied. In this paper, the routing process follows the AODV protocol and multi-path routes approach with considering energy-aware trust. Here, the optimal and safe route is determined based on various parameters, namely energy, trust, hop-count, and distance. In this regard, we emphasize the evaluation of node trust using direct trust, indirect trust, and a multi-objective function. The simulation has been performed in MATLAB software in the presence of a Denial of Service (DoS) attack. The simulation results show that EATMR performs better than other approaches such as M-CSO and SQEER in terms of successfully detecting malicious nodes and enhancing network lifetime, energy consumption, and packet delivery ratio.

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

An Energy Aware Routing Based on Swarm Intelligence for Wireless Sensor Networks

2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Lifetime ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Energy Efficient Routing

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.

scholarly journals EGCIR: Energy-Aware Graph Clustering and Intelligent Routing Using Supervised System in Wireless Sensor Networks

Energies ◽  
2020 ◽  
Vol 13 (16) ◽  
pp. 4072
Author(s):  
Tanzila Saba ◽  
Khalid Haseeb ◽  
Ikram Ud Din ◽  
Ahmad Almogren ◽  
Ayman Altameem ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Graph Clustering ◽  
Base Station ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Intelligent Routing

In recent times, the field of wireless sensor networks (WSNs) has attained a growing popularity in observing the environment due to its dynamic factors. Sensor data are gathered and forwarded to the base station (BS) through a wireless transmission medium. The data from the BS is further distributed to end-users using the Internet for their post analysis and operations. However, all sensors except the BS have limited constraints in terms of memory, energy and computational resources that degrade the network performance concerning the network lifetime and trustworthy routing. Therefore, improving energy efficiency with reliable and secure transmissions is a valuable debate among researchers for critical applications based on low-powered sensor nodes. In addition, security plays a significant cause to achieve responsible communications among sensors due to their unfixed and variable infrastructures. Keeping in view the above-mentioned issues, this paper presents an energy-aware graph clustering and intelligent routing (EGCIR) using a supervised system for WSNs to balance the energy consumption and load distribution. Moreover, a secure and efficient key distribution in a hierarchy-based mechanism is adopted by the proposed solution to improve the network efficacy in terms of routes and links integrity. The experimental results demonstrated that the EGCIR protocol enhances the network throughput by an average of 14%, packet drop ratio by an average of 50%, energy consumption by an average of 13%, data latency by an average of 30.2% and data breaches by an average of 37.5% than other state-of-the-art protocols.

scholarly journals Implementation of ITREE-MAC Protocol for Effective Power Management and Time Synchronization in Wireless Sensor Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 863-868
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Power Management ◽  
Time Synchronization ◽  
Mac Protocol ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Packet Delivery

The advent of wireless sensor networks (WSN) has led in recent revolutionary modifications in electronic and communication systems .Various applications in wireless network needs time synchronization as a basic requirement. Wireless sensor nodes are tiny in size and operated at low energy to record the required physical parameters for low-duty apps. Because nodes have a tiny battery with a lower life span, power management is crucial for long-term working with the sensors. Wireless Sensor Network is a set of sensor nodes used to send and receive data packets from one sensor node to another. This work aims to propose three protocols such as Receiver Centric MAC protocol (RC-MAC), Improved Receiver Centric MAC protocol (IRC-MAC) and Intelligent Traffic and Resource Elastic Energy MAC protocol (ITREE-MAC) for the WSN environment and based on the application. These protocols help in studying the parametric measures such as delay, energy consumption, packet delivery ratio and throughput. The comparative analysis is carried out to select the more efficient protocol for the application of wireless sensor networks. This research work is implemented and simulated by using NS 2.35 Simulator. Based on the simulation results obtained for proposed protocols using the NS2 simulator. The performance of ITREE-MAC protocol shows better results for parameters end to end delay, energy consumption, throughput, packet delivery ratio. So the overall performance of ITREE-MAC protocol is much better than other three IEEE802.11 MAC, RC-MAC and IRC-MAC protocols. As per results obtained, energy consumption is less in ITREE-MAC protocol and save the power in wireless sensor network applications

An Adaptive Location Updates and Propagation Scheme for Mobile Sinks

2010 ◽  
Vol 44-47 ◽  
pp. 772-776
Author(s):  
Shi Qiang Ma ◽  
Xiao Gang Qi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Delivery Ratio ◽  
Mobile Sinks ◽  
Location Updates

Mobile sink can be used to balance energy consumption of sensor nodes in Wireless Sensor Networks (WSNs). Sink is required to inform sensors about its new location information whenever necessary. However, frequent location updates of mobile sink can lead to both rapid energy consumption of sensor nodes and increased collisions in wireless transmissions. We propose ALUPS (A New Solution with Adaptive Location Update and Propagation Scheme) for mobile sinks to resolve this problem. When a sink moves, it only needs to broadcast its location information within a local adaptive area other than among the entire network. The overhearing feature of wireless transmission is employed when the adaptive location information is transferred. Compared with LURP (Local update-based routing protocol in wireless sensor networks with mobile sinks) and SLPS (Simple Location Propagation Scheme for Mobile Sink in Wireless Sensor Networks), ALUPS performs better both in low energy consumption and success delivery ratio.

scholarly journals Reliability and Energy Efficiency of DEAR Protocol with Cooperative Caching in IEEE802.15.4 based large ubiquitous Wireless Sensor Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 2140-2145
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cooperative Caching ◽  
Sink Node ◽  
Energy Aware ◽  
The Impact

Reliability and Energy Consumption issues in large ubiquitous Wireless Sensor Networks are a cause of concern especially because there is an inherent conflict between the two: an increase in reliability usually leads to an increase in energy consumption. Conversely, energy conservation has been a priority research concern in wireless sensor nodes. Data aggregation from various nodes and its transmission to the sink node through multiple hops which is important for network reliability increases the overall energy consumption in the network. Several schemes were proposed in the past to address the reliability needs and also to minimize the energy consumption in the network. In this context, this paper proposes a novel strategy for IEEE802.15.4/ZigBee based networks by incorporating a Distributed Energy Aware Routing (DEAR) protocol with a localized Cooperative Caching algorithm that addresses the query generated by a requester node or sink node with datum already existing in the locally available cache memory or in the memory of its one-hop neighbors or by the source node. The DEAR protocol considers battery level as a key factor to include nodes in its routing path. The proposed model is evaluated on the basis of three scenarios which were considered to illustrate the impact of energy consumption on the reliability of WSNs.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document