scholarly journals FQ-MEC: Fuzzy-Based Q-Learning Approach for Mobility-Aware Energy-Efficient Clustering in MANET

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Naghma Khatoon ◽  
Prashant Pranav ◽  
Sharmistha Roy ◽  
Amritanjali
Keyword(s):  
Network Lifetime ◽  
Energy Efficient ◽  
Optimization Problems ◽  
Behavioral Pattern ◽  
Delivery Ratio ◽  
Learning Approach ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Q Learning ◽  
Energy Efficient Clustering

Different schemes have been proposed for increasing network lifetime in mobile ad hoc networks (MANETs) where nodes move uncertainly in any direction. Mobility awareness and energy efficiency are two inescapable optimization problems in such networks. Clustering is an important technique to improve scalability and network lifetime, as it relies on grouping mobile nodes into logical subgroups, called clusters, to facilitate network management. One of the challenging issues in this domain is to design a real-time routing protocol that efficiently prolongs the network lifetime in MANET. In this paper, a novel fuzzy-based Q-learning approach for mobility-aware energy-efficient clustering (FQMEC) is proposed that relies on deciding the behavioral pattern of the nodes based on their stability and residual energy. Also, Chebyshev’s inequality principle is applied to get node connectivity for load balancing by taking history from the monitoring phase to increase the learning accuracy. Extensive simulations are performed using the NS-2 network simulator, and the proposed scheme is compared with reinforcement learning (RL). The obtained results show the effectiveness of the proposed protocol regarding network lifetime, packet delivery ratio, average end-to-end delay, and energy consumption.

Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC) for Wireless Sensor Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam
Keyword(s):  
Network Lifetime ◽  
Routing Protocols ◽  
Energy Efficient ◽  
High Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Stability Period ◽  
Energy Efficient Clustering

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.

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 Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 477
Author(s):  
Joshua Reginald Pullagura ◽  
D Venkata Rao
Keyword(s):  
Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Life Time ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Mechanism ◽  
Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing  protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable  routing in ad hoc networks.

scholarly journals Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Network

2021 ◽  
Vol 13 (1) ◽  
pp. 75-92
Author(s):  
Lakshmi M ◽  
Prashanth C R
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Mac Layer ◽  
Optimum Energy ◽  
Heterogeneous Wireless Sensor Network ◽  
Energy Efficient Clustering ◽  
Secured Data

Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.

The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET

2013 ◽  
Vol 5 (2) ◽  
pp. 46-57
Author(s):  
Naseer Ali Husieen ◽  
Suhaidi Hassan ◽  
Osman Ghazali ◽  
Lelyzar Siregar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobility Model ◽  
Network Size ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Dynamic Source

This paper evaluates the performance of Reliable Multipath Dynamic Source Routing Protocol (RM-DSR) protocol with different network size compared to DSR protocol. RM-DSR developed in the mobile ad-hoc network to recover from the transient failure quickly and divert the data packets into a new route before the link is disconnected. The performance of RM-DSR protocol is tested in the Network Simulator (NS-2.34) under the random way point mobility model with varying number of mobile nodes. The network size parameter is used to investigate the robustness and the efficiency of RM-DSR protocol compared to DSR protocol. The network size affects the time of the route discovery process during the route establishment and the route maintenance process which could influence the overall performance of the routing protocol. The simulation results indicate that RM-DSR outperforms DSR in terms of the packet delivery ratio, routing overhead, end-to-end delay, normalized routing load and packet drop.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

scholarly journals Energy Efficient Clustering in Wireless SensorNetworks Using Fuzzy Approach to Improve LEACH Protocol

2016 ◽  
Vol 11 (2) ◽  
pp. 2641-2656
Author(s):  
Basim Abood ◽  
Aliaa Hussien ◽  
Yu Li ◽  
Desheng Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Inference System ◽  
Multiple Parameters ◽  
Leach Protocol ◽  
Energy Efficient Clustering

The most important consideration in designing protocols for wireless sensor networks is the energy constraint of nodes because in most cases battery recharging is inconvenient or impossible. Therefore, many researches have been done to overcome this demerit. Clustering is one of the main approaches in designing scalable and energy-efficient protocols for wireless sensor networks. The cluster heads take the task of data aggregation and data routing to decrease the amount of communication and this prolongs the network lifetime. LEACH protocol is one of the famous of them. In this paper, we proposed a novel scheme to investigate the cluster, the Fuzzy Logic Cluster Leach Protocol (FUZZY-LEACH), which uses Fuzzy Logic Inference System (FIS) in the cluster process. We demonstrate that using multiple parameters in cluster reduces energy consumption. We compare our technique with the LEACH protocol to show that using a multi parameter FIS enhances the network lifetime significantly. Simulation results demonstrate that the network lifetime achieved by the proposed method could be increased by nearly 28.5% more than that obtained by LEACH protocol in  scenario, and by nearly 26.4% more than that LEACH protocol in  scenario.

scholarly journals An Energy Efficient Clustering based Distributed Load Balancing Technique for Mobile Adhoc Networks

2019 ◽  
Vol 8 (9) ◽  
pp. 1869-1877
Keyword(s):  
Energy Efficiency ◽  
Load Balancing ◽  
Network Lifetime ◽  
Fault Tolerant ◽  
Mobile Nodes ◽  
Battery Lifetime ◽  
Mobile Adhoc Network ◽  
Distributed Load ◽  
Adhoc Network ◽  
Energy Efficient Clustering

In a mobile adhoc network (MANET), energy efficiency and mobility prediction are the two main challenging design issues due to the mobile nature of the nodes in any direction with limited battery lifetime, thus leads to adequate topology modifications. These two issues are mainly considered to maximize the lifetime of MANET. Load-balancing and reliable data transmission among the mobile nodes is mandatory to increase the network lifetime. To achieve this, clustering techniques can be employed to minimize the topology size and to aggregate the details related to the topology. In this paper, we introduce a new clustering based distributed load balancing (D-CALB) algorithm to maximize energy efficiency and network lifetime. Furthermore, a fault tolerant feature is included in the D-CALB algorithm, which maintains a secondary CH as a backup node in case of the failure of the present CH. The presented ZXCD- CALB algorithm has undergone an extensive set of experimentation under a varying number of nodes and speed. The detailed investigation of the experimental results verified the superior nature of the presented D-CALB algorithm over compared ones under several measures.

scholarly journals Multi-Objective Spider Monkey Optimization for Energy Efficient clustering and Routing in wireless sensor networks

2021 ◽  
Author(s):  
Duraimurugan Samiayya ◽  
Avudaiammal Ramalingam
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Fitness Function ◽  
Heavy Traffic ◽  
Spider Monkey ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Multi Objective ◽  
Spider Monkey Optimization

Abstract In wireless sensor network (WSN), the gateways far away from the base station (BS) uses the gateways nearer to the BS to forward the data. It causes heavy traffic to the gateways in proximity with the BS. They need to manage this heavy traffic load but it leads to additional energy consumption and reduction in network lifetime. In order to overcome these issues, loads around the gateways need to be balanced. In this paper, multi objective based spider monkey optimization (MOSMO) has been presented to balance the load and to improve the network lifetime through energy efficient routing and clustering. The objective functions such as routing fitness and clustering fitness have been considered for optimal routing and clustering. The routing fitness function is found by incorporating both the minimum distance traversed by the gateways and minimum number of the gateway hops. The clustering fitness function is the minimum fitness function of gateways. The fitness function of each gateway is computed based on both the mean load of gateways as well as the distance between gateways and BS. The performance of the proposed MOSMO based routing and clustering scheme is compared with the existing Particle Swarm Optimization (PSO) and Grey Wolf Optimization (GWO) based routing and clustering scheme. The QoS features such as delay, energy consumption, delivery ratio, throughput and network lifetime with various node density are analyzed. The proposed work is simulated using MATLAB. The results show that, the reduction in delay and energy consumption is about 18% and 17% respectively whereas improvement in delivery ratio, throughput and network life time is about 15%, 24% and 19% respectively when compared to the existing PSO and GWO methods.

Sign in / Sign up

Export Citation Format

Share Document