End Delay Research Articles

Design of WSN Model with NS2 for Animal Tracking and Monitoring

Tracking and monitoring wild life is a significant ecological issue that cannot be overlooked. Especially getting fundamental indications of wild animal like Tigers is critical and evaluating their wellbeing without harming their habitat is another important task and recording their vital signs by sedating causes stress and injuries in animal. This paper proposes a design of wireless based tracking and health monitoring system for Tigers using WSN and Network simulator 2. The important physiological parameters like temperature of heart beat rate, sound signal, respiration rate, accelerometer signal and GPS data is transmitted and monitored through wireless sensor network (WSN).A sensor network is composed of different sensors which remotely communicate with each other and the information of each node are separated. Each node has ability to communicate among each other or to a specific node to communicate with sink node A Network simulator which acts as simulation tool for network of sensor nodes in tracking and monitoring system is employed to simulate the location and health of tigers. This system empowers veterinarians and forest guards to precisely and accurately take an animal's vital signs and analyses the health and location. We analyze the performance of simulation model by using metrics, such as average throughput of all nodes, end to end delay, packet received, packet dropped and packet delivery ratio (PDR), average good put and energy model.

Avoid Suspicious Route of Blackhole Nodes in MANET’s: Using A Cooperative Trapping

Mobile Ad hoc Network (MANET) is decentralized wireless network and can communicate without existing infrastructure in many areas. MANET is vulnerable to various attacks that affect its performance such as blackhole attack. Blackhole attacker, inject fault routing information to persuade the source node to select the path with malicious node as the shortest path. To eliminate malicious nodes from launching any collaborative attack. A cooperative Trapping Approach (CTA) was proposed based on modifying Ad-hoc On-demand Distance Vector (AODV) routing protocol and trapping the malicious nodes by responding to the trap request message. The approach aims to eliminate and rule out both single and collaborative malicious blackhole nodes from any attack. The approach realizes a backward tracking mechanism to perform the elimination process. The proposed algorithm (CTA) was executed using NS-2 network simulator. The performance metrics that has been considered to evaluate the performance of the proposed algorithm such as throughput, end to end delay, packet delivery ratio, and consuming energy. The experimental results have shown the performance metrics of the proposed approach outperformed other state of at algorithms.

Evaluation of Traffic Models under Multiple Black hole Attack in Wireless Mesh Network

Wireless networks are the networks in which data communication is done through the wireless channels and wireless nodes. In such type of the networks, cooperation of the all nodes is required. Due to which, chances of security attacks is possible and network performance and security is badly affected. Black hole attack is a security attack comes under the active, internal as well as external attacks. In black hole attack, malicious node presents a suitable, shortest and low cost path. If the above path is selected for data transmission, malicious node drops the received packets and as a result performance of the network is degraded. In this paper, impact of Random Direction (RD) and Reference Point Group Mobility (RPGM) models have been analyzed for wireless mesh network in the presence of multiple black hole attacks. By varying the number of network connections and node density, (Ad hoc on demand distance vector) AODV routing protocol is evaluated. Normalized routing load, average end to end delay, average throughput, and total number of packets received are considered as performance metrics. Bonn-motion tool has been used to create the scenario of mobility models. In the presence of black hole attack, and under RPGM mobility model, AODV routing protocol presents better results in respect of average throughput, normalized routing load. Simulation work has been carried out on network simulator version NS-2.35.

A Multi-Hop QoS-Aware and Predicting Link Quality Estimation (PLQE) Routing Protocol for Reliable WBSN

Technological advancements and miniaturization of sensor have made it possible to use tiny size sensors nodes to monitor patients’ physiological data in real-time at very low cost. The network of such small size sensor nodes is often called wireless body sensor networks (WBSNs). The patient’s data is highly sensitive which required to reach reliably and timely at the destination node. However, short range wireless nodes and postural body movements cause frequent topological changes and recurrent network partitioning. The network partitioning leads to delayed and significant loss of critical patient’s data such as Electrocardiogram (ECG), Electroencephalogram (EEG) and Electromyogram (EMG). Therefore, QoS requirement of WBSNs in terms of reliability, end-to-end delay and throughput are highly compromise. We in this paper propose a Predicting routing protocol PLQE to address reliable data transmission and network partitioning due to node mobility. The PLQE dynamically determines the efficient links by using beta probability density function, link quality and link delay estimation (LDE). The PLQE is composed of link reliability factor (LRF) and expected probability Indicator (EPI) to obtain most often updated status of the links to figure out stable and reliable end to end route to the destination node. The simulation results confirm the higher performance of the proposed scheme against state of the art routing protocols in terms of packet delivery ratio, end to end delay, throughput and normalized routing load.

Formulation and Implementation of Energy Efficient Routing Algorithm for MANET along with Performance Analysis

Mobile adhoc network (MANET) is composed of wireless mobile nodes/devices which are moving randomly in infrastructure-less adhoc environments. Topology among mobile nodes is dynamic in nature and keeps on changing regularly. The adhoc environment is open to all the genuine users as well as intruders/attackers. Moreover, the wireless connection between mobile nodes can break at any time on account of mobility of nodes. Also, the mobile notes depend on their battery power, which may go down because of exhaust of battery power. Hence, it is a very complex task to implement energy efficient routing over MANET. While handling energy efficient routing, the optimum utilization of batter power is required. In this research paper, efforts have been carried out to formulate an algorithm for energy efficient routing over MANET. Its performance has been studied through network simulator. The simulations have been carried out by writing self created network scenarios with 20, 60 and 100 mobile nodes. Moreover, analysis of the proposed energy efficient routing protocol has been done with AODV routing protocol by using various performance evaluation metrics viz. packet delivery ratio, normalized routing load, average end to end delay, packet loss, throughput, average energy consumed and average energy left. It was derived from the performance analysis that proposed protocol provides energy efficient routing over MANET and also gives better or almost same performance in comparison to AODV.

An optimized DEEC approach for efficient packet transmission in sensor based IoTs network

To cope up with the network energy requirements while maintaining the other quality of service (QoS) parameters in a continuously monitoring WSN assisted IOTS networks is quite a hard task. The optimization of two network QoS parameters such as throughput and delay at the same time have compelled the researchers to focus on the multi objective optimization paradigm. To achieve this, the routing algorithms are hybridized by using the optimization approach. To determine best multi objective optimal technique, a problem is formulated by the 2 state-of-the-art algorithms namely multi objective cuttlefish optimization algorithm (MOCFA) and the distributed energy efficient (DEEC) clustering. The DEEC routing protocol is a distributed protocol based on clustering approach, majorly used for the heterogeneous networks in a multi hop environment. The proposed methodology gives optimized network performance measures which are compared with other competent algorithms. The simulation shows that the proposed method outperforms other methods like speed constrained multi-objective (SMPSO) particle swarm optimization-based routing, optimized low energy adaptive clustering (Op-LEACH) hierarchy, fuzzy random multiple objective optimization (FRMOO) based routing and dynamic duty cycle (DDC) protocol. The parameters of comparison have been in respect of network scalability, throughput, end to end delay, energy efficacy. The proposed method gives 85.7% pruning in the consumption of energy of sensor nodes in the WSN assisted IOTS networks.

FCLR: Fuzzy Control-Based Layering Routing Protocol for Underwater Acoustic Networks

Because of their wide application in the underwater environment, underwater acoustic networks (UANs) have received increased attention.However, the intrinsic attributions of low bandwidth, long propagation delay, high bit error rate, and restricted energy bring about great challenges to data transmission in UANs. In this article, we propose a routing protocol for UANs called the fuzzy control-based layering routing (FCLR) protocol. With the FCLR protocol, an underwater node may learn or update its layer and the information of its neighbors from packets overhead before selecting the best forwarding node (BFN). A fuzzy control system (FCS) is used to select the BFN based on the input variables including residual energy and node density of neighbor nodes. Extensive experiments are conducted by the NS3 network simulator to evaluate the performance of the FCLR protocol. The results show that the FCLR protocol has superior performance in terms of packet delivery rate (PDR), endto- end delay (EED), and total energy consumption (TEC). Furthermore, the FCLR protocol is tested in Qinghai Lake, the largest saltwater lake in China, and its performance was evaluated in terms of PDR, throughput, and EED. When nodes are moving, the PDR can reach 92.6% and the throughput can reach 350.64 bps.

A MEC architecture for a better quality of service in an Autonomous Vehicular Network

Designing 5G networks and related applications such as the Internet of Things (IoT), Cellular and autonomous vehicular networks (AVNET) is a challenge. Indeed, these networks are subjected to a number of constraints that play a crucial role in the network’s quality of service (QoS). Among these constraints, we have the management of computing, storage, bandwidth resources and low latency requirements. If in the past cloud computing has been used to avoid networks being affected by some of the previous constraints, that technology negatively affects the low latency requirements required by AVNETs for example. Multi-access Edge Computing (MEC) has recently emerged as a palliative solution to cloud computing. MEC aims to bring computing and storage resources from Cloud Data Center to Edge Data Center nearer to the User Equipment (UEs) in order to reduce the UEs’ requests latency for an improvement of the network’s QoS. Many MEC architectures have been proposed for AVNET. These solutions make use of Software Defined Networking (SDN), Network Function Virtualization (NFV), Service Function Chaining (SFC) or Network Slicing (NS) technologies. Some of these techniques combine partially these technologies while others do not. But to the best of our knowledge, none of them combines all these technologies to obtain a better QoS. In this paper, we combine the SDN, NFV, SFC and NS technologies to efficiently manage the MEC server resources for guaranteeing the QoS requirements in AVNETs. The QoS parameters we consider are latency, computing, storage and bandwidth resources. In that way, we first present a MEC server mathematical resource management model, then, we propose a new MEC architecture adapted to AVNETs that uses the aforementioned technologies also as the mathematical model we first present to manage the bandwidth, computing, and storage resources. The simulation results show that these resources are well managed, resulting to a low end to end latency for autonomous vehicles (AVs) requests executing on edge/cloud servers when the direct communication of AVs with cloud server takes long end to end delays, ensuring a better QoS for the AVNET.

Instantaneous channel characteristics and progression factor based collaborative routing

Underwater acoustic sensor networks (UWASN) have enormous applications like investigating oceanographic environment, data gathering, scrutiny, calamity avoidance etc. Cooperative communication becomes mandatory when nodes are distributed far apart especially in the ocean environment. The existing relay selection techniques do not consider the instantaneous channel characteristics while selecting the relay nodes. The relays selected based on the outdated channel state information aggravates or worsens the performance of the rapidly changing or dynamic UWASN. Hence, this paper proposes an instantaneous channel characteristics and progression factor (ICPF) based collaborative routing for underwater acoustic sensor networks. It considers numerous indexes such as propagation delay, residual energy, progression factor, spreading, transmission and absorption loss in the forwarding relay node selection. These indexes are averaged and updated periodically to overcome the difficulties caused by the inconsistency and aggressive nature of underwater channel. The progression factor proposed in this work is a prime metric that facilitates efficient data forwarding. Simulation results show that the proposed technique outperforms the existing schemes in terms of packet delivery ratio (PDR), average end to end delay and energy consumption and is capable of achieving PDR of 90.1% for network comprising of 100 acoustic nodes.

PERFORMANCE ANALYSIS ON GPSR PROTOCOL IN VANETS ENVIRONMENT OF OVERLAY NETWORK AND FORWARDING NODE SELECTION METHODS

VANETs are technology in Intelligent Transport Systems (ITS) in driving safety and convenient network services for vehicle users. However, the high mobility of VANETs makes the topology change frequently, resulting in the unavailability of routes and causing communication failures between nodes. Greedy Perimeter Stateless Routing (GPSR) is a routing protocol that solves communication problems in the VANETs environment. GPSR is a geographic routing protocol that uses information on the location of neighbouring nodes and the transmission range to the nearest destination node. But, GPSR does not always find the optimal route because not all nearby nodes can forward packets to their destination during heavy traffic and many intersections. In this research, the overlay network and forwarding node selection methods will be used to solve problems in the GPSR routing protocol related to communication instability because of changing node positions. Based on the results of testing and analysis that has been carried out on a grid scenario with 50 nodes, the Packet Delivery Ratio results are 32.60. In contrast, the results for the real scenario with the same nodes produce a value of 64. The analysis of End to End Delay in the 50-node grid scenario produces 5.64, while the real scenario results with 50 nodes yield the value of 24.11. The analysis Routing Overhead in the grid scenario with 50 nodes produces a value of 39,978, while the results of the real scenario with 50 nodes get a value of 10,239. With the result of these two analysis methods, it is expected to increase the average value of package delivery.

TACRP: Traffic-Aware Clustering-Based Routing Protocol for Vehicular Ad-Hoc Networks

On account of the highly dynamic topology of vehicular networks, network congestion and energy utilization are greatly increased, which directly affects the performance of VANETs. So, managing traffic and reducing energy consumption in the network becomes a challenging task in such huge mobility-based VANET networks. Thus, in this paper a new traffic and cluster-based network method is introduced, namely, Traffic-Aware Clustering based Routing Protocol (TACRP). The main aim of the approach is to improve traffic management in the network as well as to reduce energy consumption in it. In the constructed network, a Traffic Management Unit (TMU) is introduced to control the entire network traffic with the help of RSUs. Vehicles with similar speed and direction are grouped into a cluster to increase the network stability and help to reduce the energy consumption of the network. The clustering model provides principles associated with vehicles leaving the clusters, joining the clusters, cluster updates and inter-cluster communication, which makes the network more stable and reliable. For instance, in the proposed work the CH selection is based on centralization, weight, distance, and energy calculation. Such network settings facilitate successfully clustering of vehicles on the road. Simulation experimental analysis showed that the proposed TACRP routing protocol achieved better results in terms of energy efficiency, throughput, packet delivery ratio, and end to end delay of the network when compared with earlier methods, such as ECHS and NRHCS.

Efficient Mobile Ad Hoc Route Maintenance Against Social Distances Using Attacker Detection Automation

In MANET, routing plays a vital role in packet interaction and data transmission. It is always easy to manage the data transmission over the MANET because of uncentralized control on the MANET nodes. Since the efficient route on MANET controls the packets and does not simplify the route between the source and destination. Hence the maintenance of route interaction becomes a crucial process. Methods: It is critical to enhance the route and decrease the attacker to sustain successful data transfers via the MANET Network. MANET, on the other hand, permits route interaction with security threads. The four processing schema are proposed in this study work to retain the security safeguards against Routing Protocols. The Rushing Attacker has significantly influenced MANET packet-based data transfer, particularly node communication. The Attacker Detection Automation of Bee Colony Optimization (ADABCP) Method is proposed in this article. Results: Existing ESCT, ZRDM-LFPM, and ENM-LAC techniques were compared to the suggested outcome. Consequently, routing and data transfer have enhanced the proposed illustration (SIRT-ADABCP-HRLD). Compared to the recommended approach, the end-to-end latency, communication overhead, packet delivery ratio, network lifetime, and energy usage are all improved. Discussion: The performance evaluation results of SIRT–ADABCP-HRLD with existing methods in terms of low End to End Delay (ms) of 49.8361% compared to existing methods ESCT, ENM-LAC, and ZRDM-LFPM. In terms of low Communication Overhead, an 81.4462% decrease compared to existing methods. However, it improves packet delivery by 56.9775%, more than ESCT, ENM-LAC, and ZRDM-LFPM. The energy consumption decreased by 36.31% less value than the existing process.

Hybrid security in AOMDV routing protocol with improved salp swarm algorithm in wireless sensor network

During these years the current trends shows a fast expansion in the field of wireless sensor network (WSN) based applications. Due to this much vulnerability are created and also coverage optimization becomes essential to improve overall performance. However, maximum of the model concentrates only on security or efficiency. In order to create a highly efficient protocol both concepts need to get concerted. So, we developed a protocol namely hybrid security in ad-hoc on-demand multipath distance vector (AOMDV) routing protocol with improved salp swarm algorithm (HSA-ISSA). This model is sub-divided into three sections. They are, wormhole attack and gray hole attack construction AOMDV protocol, improved salp swarm algorithm (SSA) model is used for weighted distance position updates which leads to improve the efficiency. And to secure the network from attacks we use hybrid security with the help of Diffie-Hellman key interchange algorithm and elliptic-curve cryptography (ECC) algorithm. During performance evaluation the proposed HS-ISSA protocol provide stable results in terms of message success rate (MSR), end to end delay (E2E_Delay), network throughput (NT), and average energy efficiency (AEE). Our HAS-ISSA protocol outperformed all the other earlier works by providing hybrid security, optimized coverage as well as energy efficiency to the wireless sensor networks.

The impact of channel model on the performance of distance-based schemes in vehicular named data networks

<span lang="EN-US">Distance-based schemes present one of the methods to avoid the broadcast problem in vehicular named data networks. However, such schemes overlook the most factor in performance evaluation which is the variation in received signal strength caused by the propagation model choice. Thus, they are evaluated under one propagation model while neglecting the effect of the others. This paper evaluates the impact of the propagation variation model over three distance-based schemes, namely rapid named data networking (RNDN), enhanced vehicle on named data networking (EVNDN) and opportunistic interest forwarding protocol (OIFP). Simulation experiments are performed over three propagation models. Simulation results show that Nakagami significantly degrades network performance. However, it has a noticeable positive effect over higher distance resulting in a higher interest satisfaction ratio as compared to the other models. The RNDN exhibits a higher number of retransmissions across the Nakagami. In contrast, a higher number of retransmissions is exhibited by EVNDN when compared to the other schemes over the Friis and random. The OIFP show a higher interest satisfaction ratio when compared to EVNDN and RNDN under all models. OIFP shows robustness towards the adverse fading effects resulting from the Nakagami and exhibits lower end to end delays.</span>

Interference Cancellation and Efficient Channel Allocation for Primary and Secondary Users Using Hybrid Cognitive (M2M) Mac Routing Protocol

It is projected that communication among cognitive machine-to-machine (M2M) in smart grid networks is necessary and vital in forthcoming years. The objective of this paper is to bring out the significance of cognitive medium access control (MAC) protocol focusing on the distinctive characteristics of the devices in M2M and requirements of the smart grid communication. Therefore, developing a cognitive radio system which supports dynamic access to the spectrum available that is recently considered as a novel solution for extending wireless systems. In this paper, MAC layer sensing approaches in cognitive radio networks are investigated by considering both proactive and reactive sensing. To evaluate the performance, analytical modeling and simulation studies are carried out by comparing with state of art methods. As a result, the proposed HCM2M-MACachieves 687.3 kbps of blocking probability, 368.6kbps of dropping probability, 96.4% bandwidth utilization, 67.3% end to end delay and 89.3% of throughput.

Effective and Enhanced Congestion Control Technique using Adaptive Routing Protocol to Improve the Performance of Crammed WSN

Nowadays, congestion on the network becomes a usual fact which is to be focused and to be addressed appropriately especially in Wireless Sensor Networks (WSN) for crammed type networks. Limited capacity on channel and wastage of energy are the root cause of congestion in WSN. The effects of congestion implies on QoS parameters, queue length, data arrival rate etc. Furthermore, data packets should be transmitted energy-efficiently to the sink node. In this regard, an Energy-Efficient Routing Protocol is offered to efficiently transmit the nodes to their end node or destination. To control congestion, an Adaptive Buffer trade-off and Improved Trust-based Energy Efficient Routing protocol are first presented, this method identifies the congestion free paths and the Buffer trade-off handles the buffer effectively. To route the protocol, a Cross-Layer Security-Based Fuzzy Logic Energy Efficient Packet Loss Preventive Routing Protocol has been developed. The proposed protocol routes the nodes and the protocol adopts a routing protocol that imparts security in terms of avoiding malicious nodes and preventing data loss. Consequently, to improve the lifetime of the network, a Density Aware Optimal Clustering Approach is presented. The proposed method is evaluated based on the Matlab software and the QoS performance metrics are Energy Consumption, Packet Delivery Ratio, Trust Value Computation, latency, reliability, energy efficiency, end-to end delay, Average Throughput, accuracy and network lifetime. The effectiveness of the research is evaluated by comparing it with other existing techniques, including Trust Aware Secure Routing Protocol (TASRP), Artificial Flora Algorithm Based Support Vector Machine (SVM-AF), Well-Organized Trust Estimation Based Routing Scheme (ETERS), Lion Fuzzy Bee, and Bat Fuzzy Bee Algorithm. Accordingly, the suggested method’s performance is higher than the existing methods for Packet delivery ratio, throughput, network lifetime, energy efficiency, and reliability. Consequently, the proposed method improves the congestion control performance in an energy-efficient manner, in future; a recently advanced technique is proposed to effectively improve the network performance respectively.

Energy Auditing and Broken Path Identification for Routing in Large-Scale Mobile Networks Using Machine Learning

In mobile computing, all nodes are movable nodes, which causes many problems for transmitting data packets in a sequence manner; since the mobile nodes are connected with each other, during movement, nodes make the connection fail or damaged. This kind of link damage is caused by nodes that travel out of range from the network limit and also affect the packet success rate. This reduces the network lifetime and detection efficiency and increases the communication overhead. Every mobile node in mobile computing is an unstable node, causing numerous problems for broadcasting data packets in a series method. When the mobile nodes are connected to each other, relay nodes cause the link to break or else sustain damage. This type of connection failure is brought on by nodes that leave the network’s permitted range, which also lowers the packet success rate. The link failure cannot be recovered by the multipath routing algorithm. As a result, the communication overhead is increased while the network lifetime and detection effectiveness are reduced. Then, the novel energy routing (NER) method that has been proposed is employed to support the energetic routing path across the middle nodes. It is challenging to locate the failed channels and carry on with the successful packet transfer. The master node selection algorithm is intended to identify the best relaying node, fault-free packet transmission process among the network structure’s relaying nodes. The master node is efficiently chosen in this manner. The master node, also known as the energy-based important node, is employed in the mobile network to carry out error-free packet transmission procedures. The other nodes are lower energy nodes that do not participate in packet forwarding, and this algorithm only detects the higher energy successful nodes. This lengthens the network’s lifespan, improves detection effectiveness, and lowers communication overhead. The energy-based heavy node is also known as the master node, which is used to perform a problem-free communication process in the mobile network. This algorithm only accepts the higher energy successful node; the remaining nodes are lower energy nodes which do not perform the communication process. This increases the network lifetime and detection efficiency and reduces the communication overhead. The performance metrics for the proposed system is evaluated by end to end delay, communication overhead, throughput, detection efficiency, network lifetime, and packet drop rate.

Enhance the performance of AODV routing protocol in mobile ad-hoc networks

Enhancing the quality of service is still facing various challenges due to nature and configuration of mobile ad-hoc network (MANET) such as free movement of nodes, unpredictable changes in network topology as no infrastructure exist in the network. The large usage of mobile ad-hoc network in various applications raises the demand to enhance the performance as well as reduce loss of packets through various factors. The routing protocols play the most important aspect in MANET. There are three kinds of routing protocols that are: reactive, proactive and hybrid that are utilized to optimize the network’s functionality. Ad-hoc on-demand Distance victor (AODV) routing protocol is the popular used to achieve best output result. The most important objectives of this paper are to enhance the performance of mobile ad-hoc network by using AODV protocol. This paper gives some changes in AODV routing protocols that’s assist the performance enhancement of AODV in mobile ad-hoc network. The simulation is carried out on the network simulator NS2 and the output result show the improved AODV has excellent performance in term of packet delivery ratio, secondly throughput, third is the routing overhead and finally is end to end delay.

Cross Layer based Congestion Free Route Selection in Vehicular Ad Hoc Networks

For creating a mobile network, the moving cars consider as nodes in the Vehicular Ad-Hoc Networks (VANETs). Each participating car is turned into a wireless router in the VANETs that allows the connecting and creating a network. To improve the comfort and safety of driving of automotive users, the vehicular environment system develops in the vehicular environment systems using the wireless access. The channel congestion causes the degradation of quality of service in such cases with higher vehicle density. The real-time and reliable communication is required for various safety applications of VANETs. The dense traffic network has included one of the major challenges as avoiding the communication channels’ degradation. To provide the network with efficient operation, most of the studies are recommended to use the appropriate congestion control methods. It’s important to note that many congestion control mechanisms are not implemented for event-driven real-time safety messages. Based on the congestion probability approach estimation, CFRS-CP-Congestion free route selection is introduced for minimizing the total number of data flow packets that passing through the congested nodes. At each node, the congestion probability is estimated using the proposed technique of CFRS-CP based on link quality, MAC overhead, neighbour density & vehicle velocity. Then, the estimated congestion probability is used for route assessment. The estimated probability value is appended to the control packets for comparison. All the available routes are assessed based on the estimated congestion probability which results in congestion free routing path for every round of data communication. The simulation results prove that the proposed method decreases end to end delay by 32% and improves PDR up to 30% and throughput up to 45% compared to the existing protocols.

A Cluster-Based Routing Protocol for WSN Based on Mahalanobis Distance and AODV Protocol

Wireless Sensor Network (WSN) has huge amount of sensor nodes that randomly deployed in the interested region to monitor the environment. In WSN, the energy efficiency is considered as a challenging task during data transmission. The mahalanobis distance based cluster head selection is proposed to solve the issues related to the energy constraint. Next, ad hoc on-demand distance vector routing protocol is used to find the optimal path between the source to base station via cluster heads. The performance of this mahalanobis method is analyzed in terms of energy consumption, throughput, packet loss ratio, End to End Delay (EED) and average delay ratio. The mahalanobis method is compared with Weighted Energy-efficient Clustering with Robust Routing (WECRR), improved Artificial Bee Colony (iABC), Adaptive Energy aware Cluster-based Routing (AECR), Evolutionary Multipath Energy-Efficient Routing (EMEER), K-means algorithm and Energy-aware Cluster-based Routing Protocol (ECRP). The energy consumption of the mahalanobis method is 0.641 J for 75 nodes, it is lesser than the existing methods.