End Delay Research Articles

Fault-Tolerant Backup Clustering Algorithm for Smart Connected Underwater Sensor Networks

This paper addresses poor cluster formation and frequent Cluster Head (CH) failure issues of underwater sensor networks by proposing an energy-efficient hierarchical topology-aware clustering routing (EEHTAC) protocol. In this paper, fault-tolerant backup clustering (FTBC) algorithms and multi-parameter cluster formation (MPCF) model were developed for the EEHTAC operation. The MPCF model tackles the issue of poor cluster formation performance by integrating multiple parameters to achieve effective clustering process. The FTBC algorithms tackle the issue of frequent CH failures to avoid interruption in data transmission. Performance of the MPCF model was evaluated using normal, high-fault, and high routing overhead network scenarios. Performance metrics employed for this analysis are temporal topology variation ratio (TTVR), CH load distribution (CLD), and cluster stability (STB). Obtained results show that operating with a CH retention period of 90s achieves better CH duty cycling per round and improves the MPCF process with values of 25.69%, 55.56%, and 60% for TTVR, CLD, and STB respectively. Performance of the FTBC-based EEHTAC was evaluated relative to Energy-balanced Unequal Layering Clustering (EULC) protocol. Performance indicators adopted for this evaluation are routing overhead (Ω), end to end delay (Δ), CH failures recovered (CFR), CH failures detected (CFD), received packets (θ), and energy consumption (Σ). With reference to the best obtained values, EEHTAC demonstrated performance improvement of58.40%, 29.94%,81.33%, 28.02%, 86.65%, and 54.35% over EULC variants in terms of Ω, Δ,CFR, CFD, θ, and Σ respectively. Obtained results displayed that the MPCF model is efficient for cluster formation performance and the FTBC-based EEHTACprotocolcan perform effectively well against an existing CBR protocol.

Building Flexible Drone Networks based on SDN

In the bygone years, Drone or also known as Unmanned Aerial Vehicle (UAV) technology has developed very quickly and has been vastly used in martial operations, medicinal rescue, ecological monitoring, and other fields. the programmability of Drone and self-leading are being the key point of future transportation and safety. Simultaneously, Software-Defined Networks (SDN) the upcoming widespread, trustworthy, and flexible networking for the future. The programmability and center control system of the SDN network It the most important features. that resource management and power-consuming is the main problem faced in the Drone environment. In this paper, we design a Drones network based on Software Defined Network (SDN) to solve these problems. moreover, simulation the proposed network in OMNET++ simulation tool. The proposed system was evaluated based on Throughput, Packet Delivery Ratio (PDR), Data Drop Rate, End to End Delay Time, Packet Losses, and Drone Power Consumption. The results show enhancement in network performance through the results obtained.

ENHANCEMENT OF CARMAC PROTOCOL FOR MULTICHANNEL WITH DIRECTIONAL ANTENNAS IN WIRELESS IOT NETWORKS

In this paper discussed The Internet of things (IoT) express physical devices that are set with sensor nodes, working capability, and other technologies that anchor and sharing data with other devices and systems over the internet. The nodes do not use any infrastructure for communication, such as a base station and wired access point. A critical problem arises in wireless sensor networks is power consumption. Another problem arises in wireless sensor networks is hidden terminal and Exposed terminal problem which reduced the throughput and increases End to End delay .To solve the problems used Directional antennas which is enhancing the performance of CARMAC Protocol by imposing transmission and receiving GPS signals on the wireless sensor nodes. In proposed work increases the sectors of the directional antennas and can be used to solve hidden terminal and exposed terminal problem by using ECARMAC protocol for wireless sensor network. Keywords: ECARMAC, Hidden terminal, Exposed terminal, Deafness, Directional antenna

A Neuro Fuzzy with Improved GA for Collaborative Spectrum Sensing in CRN

Cognitive Radio Networks (CRN) have recently emerged as an important solution for addressing spectrum constraint and meeting the stringent criteria of future wireless communication. Collaborative spectrum sensing is incorporated in CRNs for proper channel selection since spectrum sensing is a critical capability of CRNs. According to this viewpoint, this study introduces a new Adaptive Neuro Fuzzy logic with Improved Genetic Algorithm based Channel Selection (ANFIGA-CS) technique for collaborative spectrum sensing in CRN. The suggested method’s purpose is to find the best transmission channel. To reduce spectrum sensing error, the suggested ANFIGA-CS model employs a clustering technique. The Adaptive Neuro Fuzzy Logic (ANFL) technique is then used to calculate the channel weight value and the channel with the highest weight is selected for transmission. To compute the channel weight, the proposed ANFIGA-CS model uses three fuzzy input parameters: Primary User (PU) utilization, Cognitive Radio (CR) count and channel capacity. To improve the channel selection process in CRN, the rules in the ANFL scheme are optimized using an updated genetic algorithm to increase overall efficiency. The suggested ANFIGA-CS model is simulated using the NS2 simulator and the results are investigated in terms of average interference ratio, spectrum opportunity utilization, average throughput, Packet Delivery Ratio (PDR) and End to End (ETE) delay in a network with a variable number of CRs.

Investigation on thermal energy aware routing in integrated network for efficient energy storage

Mobile Ad hoc Network is one of most efficient and emergency networks where we can apply it for both commercial and domestic applications. It consists of mobile nodes where it transmits the packets without any administrator. Due to mobility, paths may be broken and attackers in the network may discover the unreliable routes to misroute the packets. In this research, a Dynamic Efficient Energy Load based Multi-hop Protocol (DEELMHP) is introduced for reliable path selection. In first phase, cluster region is formed and reliable node selection is done. In second phase, reliable routes are obtained based on packet delivery rate and path reliability cost metric. In third phase, both localization and data transmission phase was implemented to locate efficient node for packet transmission which is nearer to the destination node. The proposed protocol is evaluated and outperforms with parameters like packet delivery rate (25–86 pkts/sec), end to end delay (5.9–11.9 msec), throughput (58–21 pkts) and packet loss rate (4–21 pkts/sec).

VANET: Optimal Cluster Head Selection Using Opposition Based Learning

Traffic related accidents and route congestions remain to dwell significant issues in the globe. To overcome this, VANET was proposed to enhance the traffic management. However, there are several drawbacks in VANET such as collision of vehicles, data transmission in high probability of network fragmentation and data congestion. To overcome these issues, the Enhanced Pigeon Inspired Optimization (EPIO) and the Adaptive Neuro Fuzzy Inference System (ANFIS) based methods have been proposed. The Cluster Head (CH) has been selected optimally using the EPIO approach, and then the ANFIS has been used for updating and validating the CH and also for enhancing the data transmission procedures. The dijkstra’s algorithm has been used for identifying the shortest path for data transmission. The results showcases that the proposed technique has attained the maximum Packet Delivery Ratios (PDRs) as 73.23% at a sensor radius of 130 m and 70.42% at a velocity of 10 km/h. Moreover, the proposed method has outperformed the existing technique in terms of the CH formation delay, the end to end delay and the PDR.

Comparison of Routing Protocols and Communication Interfaces for the Implementation of Collision Avoidance Capabilities in Fleets of Industrial Mobile Robots

In this paper a novel approach to a collision avoidance system between forklifts based on a wireless communication is proposed in order to test its performance and feasibility. First of all an overview on collision avoidance systems between vehicles inside warehouses is introduced with their main advantages and disadvantages. Then the reasons that led to the study of the new solution proposed in this article are motivated. Subsequently, a brief survey on mobile ad hoc networks and their main routing protocols that allow multi-hop communication is presented. For the implementation of the simulations OMNeT++ and SUMO software were used, which allowed to develop the model and the warehouse scenarios. Furthermore, we report the collision avoidance algorithm used in this study for the generation of a plausible network data load in order to collect and analyze simulation statistics. In particular, two applications have been developed, DiscoveryApp and AnticollisionApp, which are run by each node. Several simulations were then carried out, varying the size of the scenario, the communication interface standards and the routing protocols. In particular, communication interfaces based on the IEEE 802.15.4 and 802.11g standards and AODV, DSDV, GPSR routing protocols were tested. The last part of the paper concerns the analysis of the results based on the metrics of average end to end delay, overhead, average goodput and packet delivery ratio in order to determine the best combination of technologies for an application of this type.

A QoS Aware Cluster Head Selection and Hybrid Cryptography Routing Protocol for Enhancing Efficiency and Security of VANETs

Nowadays, VANET (vehicular ad hoc network) is one of the key aspects of developing advanced intelligent transportation systems. Due to its huge mobility and rapid topology alteration, the network exposes to link failure that affects the firmness of the network and causes delay and congestion. Additionally, the dynamic change in the network routing affects the network’s security, makes it vulnerable to various attacks, and causes data loss. In order to overcome these drawbacks an efficient and highly secured routing protocol is needed. Subsequently, in this research, a new routing protocol is proposed that has the combination of quality of service (QoS)-aware cluster head (CH) selection and hybrid cryptography, which is named QoS+. The QoS+ protocol is mainly divided into QoS-based CH selection and hybrid cryptography modules. The CH selection module performs based on QoS parameters attempt to provide reliable and stable clusters and improve the firmness and connectivity during the communication process of the network. The hybrid cryptography module contains advanced encryption standard (AES) and elliptic curve cryptosystems (ECC) algorithms. It attempts to improve the security and privacy of the network. The QoS+ protocol is evaluated by a developed VANET simulator using NS2 software. The simulator consists of a network model, a load model, and an attack model. Various speed and transmission ranges and gray hole and wormhole attacks are used in the simulator. The outcome calculated from the performance analysis shows that the proposed QoS+ protocol has 7% to 24% higher message success rate, 500 to 800 higher packets normalized routing load, 350 to 550 Kbps higher throughput, 5% to 17% higher efficiency and 50ms to 12ms lower end to end delay when compared with the earlier works of ECHS and KMSUNET. The proposed QoS+ protocol also achieves superior performance in terms of CH efficiency, cluster member efficiency, and average cluster number with various speeds and transmission ranges.

Performance Evaluation of routing protocols with and without malicious nodes

Vehicular adhoc networks (VANETs) are made by applying the standards of mobile adhoc networks (MANETs)-the unconstrained making of a remote network of cell phones to the area of vehicles. VANETs were first referenced and presented in 2001 under ”vehicle to-vehicle specially appointed versatile correspondence and systems administration” applications, where networks can be shaped and data can be handed-off among vehicles. It was shown that vehicle-to- vehicle and vehicle-to-road side exchange designs will exist together in VANETs to give street security, route, and other side of the road administrations. VANETs are a vital piece of the intelligent transportation frameworks (ITS) system. At times, VANETs are known as Intelligent Transport Networks. They are perceived as having advanced into a more extensive “Web of vehicles”. Which itself is relied upon to eventually advance into a “Web of self-sufficient vehicles”. The vehicles send some data about street status and traffic. But sometimes the information send from one vehicle to another can be malicious. This malicious information is added by the intruders to cause problem in vehicular network so that accident can occur. In this report, we will analyse the throughput, packet delivery ratio and end to end delay in sending information from vehicle to vehicle when the network is attacked by some malicious nodes.

ASCP-IoMT: AI-Enabled Lightweight Secure Communication Protocol for Internet of Medical Things

The Internet of Medical Things (IoMT) is a unification of smart healthcare devices, tools, and software, which connect various patients and other users to the healthcare information system through the networking technology. It further reduces unnecessary hospital visits and the burden on healthcare systems by connecting the patients to their healthcare experts (i.e., doctors) and allows secure transmission of healthcare data over an insecure channel (e.g., the Internet). Since Artificial Intelligence (AI) has a great impact on the performance and usability of an information system, it is important to include its modules in a healthcare information system, which will be very helpful for the prediction of some phenomena, such as chances of getting a heart attack and possibility of a tumor, from the collected and analysed healthcare data. To mitigate these issues, in this paper, a new AI-enabled lightweight, secure communication scheme for an IoMT environment has been designed and named as ASCP-IoMT, in short. The security analysis of ASCP-IoMT is performed in different ways, such as an informal way and a formal way (through the random oracle model). ASCP-IoMT performs better than other similar schemes and provides superior security with extra functionality features as compared those for the existing state of art solutions. A practical implementation of ASCP-IoMT is also performed in order to measure its impact on various network performance parameters. The end to end delay values of ASCP-IoMT are 0.01587, 0.07440 and 0.17097 seconds and the throughput values of ASCP-IoMT are 5.05, 10.88 and 16.41 bps under the different considered cases, respectively. For AI-based Big data analytics phase, the values of computation time (seconds) for decision tree, support vector machine (SVM), and logistic regression are measured as 0.19, 0.23, and 0.27, respectively. Moreover, the different values of accuracy for decision tree, SVM and logistic regression are 84.24%, 87.57%, and 85.20%, respectively. From these values, it is clear that decision tree method requires less time than the other considered techniques, whereas accuracy is high in case of SVM.

Energy Efficient Mobile Harvesting Scheme for Clustered SDWSN with Beamforming Technique

Software Defined Wireless Sensor Networks (SDWSN) provides a centralized scheduling algorithm to decrease energy consumption compared to WSN. The sensor nodes have a finite battery capacity in the SDWSN that reduces the lifetime of the nodes. To harvest energy for energy depleted nodes without interfering with the eventful data transfer in the clustered SDWSN, an energy efficient mobile harvesting scheme with the Multiple Input Single Output (MISO) beamforming technique is proposed. The mobile harvesting scheme transfer the energy to the energy starving node and the beamforming algorithm which transmits the energy in the desired direction increases the lifetime of the nodes. The Secondary Cluster Head (SCH) node in a cluster is selected based on Particle Swarm Optimization (PSO) with the distance between mobile harvester and sensor node, the energy consumption rate of a node and lifetime of a nodes constraints for harvesting energy without interrupting data transfer to sink node in clustered SDWSN. The distributed scheduling algorithm and efficient path planning decrease the energy consumption of mobile harvester in the network. The optimization problem is formulated with Signal to Noise Ratio (SNR) and transmit power constraints to increase the harvested energy for sensor nodes in the network. The simulation results show the enhanced performance of the proposed algorithm compared to the existing algorithm in terms of residual energy, end to end delay, throughput, travel distance, service time and charging delay.

Performance Analysis of MANET under Security Attacks

In Mobile Ad hoc Network (MANET), performance of the routing protocols is degraded by various network attacks such as black hole attack and rushing attack. Mostly all layers of mobile ad hoc networks are vulnerable to several attacks. Routing protocols used in mobile ad hoc networks are designed by considering that all the nodes are trustable in communication mode. MANET is less secure network due to its features like no centralized administration control and no infrastructure is required. In this paper, Ad hoc On Demand distance Vector (AODV) routing protocol is evaluated under rushing attack, black hole attack, and grayhole attack. Under multiple attacking, single attacking, and without attacking modes, performance of network has been evaluated. By varying the speed, network size, node density, and number of attacking nodes, four different network scenarios have been generated. Performance metrics are considered as average throughput, average end to end delay and packet delivery ratio. Network simulator 2 is used to simulate the attacks over AODV routing protocol. Results show that all the above attacks are responsible for the poor throughput, heavy dropping packets and higher end to end delays in the network. Throughput is degraded as the numbers of attacking nodes are increased. AODV is less affected by rushing attack as compared to black hole and grayhole attacks.

Energy-Efficient Cluster in Wireless Sensor Network Using Life Time Delay Clustering Algorithms

Through Wireless Sensor Networks (WSN) formation, industrial and academic communities have seen remarkable development in recent decades. One of the most common techniques to derive the best out of wireless sensor networks is to upgrade the operating group. The most important problem is the arrangement of optimal number of sensor nodes as clusters to discuss clustering method. In this method, new client nodes and dynamic methods are used to determine the optimal number of clusters and cluster heads which are to be better organized and proposed to classify each round. Parameters of effective energy use and the ability to decide the best method of attachments are included. The Problem coverage find change ability network route due to which traffic and delays keep the performance to be very high. A newer version of Gravity Analysis Algorithm (GAA) is used to solve this problem. This proposed new approach GAA is introduced to improve network lifetime, increase system energy efficiency and end delay performance. Simulation results show that modified GAA performance is better than other networks and it has more advanced Life Time Delay Clustering Algorithms-LTDCA protocols. The proposed method provides a set of data collection and increased throughput in wireless sensor networks.

A Secured and Reliable Route Maintenance Mechanism for AODV Routing Protocol

Link failure between the nodes takes place due to reasons like channel interference and dynamic obstacles in mobile Ad Hoc networks, that give rise to severe performance degradation. In traditional AODV, the link failure is overcome by re-routing from the source node which is considered to be a time consuming process that increases the overhead of the nodes. Also, in case of multiple link failures, there are chances for loss of data packets. The performance of the network during link failure has to be maintained dynamically in circumstances such as long data transfer such as a stream of voice data which is an underlying challenge. Another challenging problem is to feasibly detect and defend possible attacks during data transmission. In order to overcome these performance related issues, we developed the Secured Local Link Failure Recovery Algorithm (SLLFR) for Adhoc networks that establishes recovery from link failures spontaneously at the point of link breakage. In such cases, a reliable link failure recovery is the main criteria that will determine the performance of the network in terms of quality of service (QoS). The SLLFR is deployed in each node collects RREP in the RREP Buffer Table (RBT) stack in the highest order of signal strength, which gets triggered during link failures. Once a link failure is detected, the intermediate node searches for an alternate path around the faulty area by choosing the first RREP that is stacked in the RBT and establishes a new route to the intended destination for sending the data packets without any time delay. The simulation results show that the performance parameters like packet delivery ratio, throughput, average end to end delay and routing overhead are better compared to the traditional AODV and other link failure recovery techniques.

SOA-EACR: Seagull optimization algorithm based energy aware cluster routing protocol for wireless sensor networks in the livestock industry

The primary goal of Wireless Sensor Networks (WSNs) in the livestock industry is to monitor the health conditions of various animals and their activities. Energy conservation in WSN is one of the most challenging tasks since the devices are connected to limited resource devices. So, clustering is the best choice to save energy in WSN. The sensor nodes are connected to the animal and move from one location to another because of the dynamic nature. In recent years, several clustering protocols have been proposed using an optimization algorithm to conserve energy in the network. However, it takes more time to converge in selecting the best cluster head in the network. The energy is therefore drained early in the network. To overcome the limitation, this paper proposes a Seagull Optimization Algorithm based Energy Aware Cluster Routing Protocol (SOA-EACR) in WSN to prolong the network's lifespan and reduce the end to end delay. The SOA-EACR balances the exploration and exploitation during the CH selection. Thus, it prolongs the lifespan of the network. The simulation is performed using MATLAB 2019a. The efficacy of SOA-EACR is compared with CLPSO, CACONET and GWO. The proposed SOA-EACR enhances the network life by 20 % and increases the packet delivery ratio by 2–5 %.

Energy efficient routing in IOT based UWSN using bald eagle search algorithm

AbstractThe underwater wireless sensor network (UWSN) faces many problems such as limited bandwidth, large path loss, high attenuation, and limited battery power. In recent times, different routing protocols have been proposed in the Internet of Things (IoT) enabled UWSN (IoT‐UWSNs) to explore the underwater environment for different purposes, that is, scientific and military purposes. However, high energy consumption (EC), end to end (E2E) delay, low packet delivery ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in UWSN. The high E2E delay, EC, and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. For effective achievement of EC, proposed a new routing algorithm called bald eagle search (BES). It is a nature‐inspired optimization algorithm that copied bald eagle hunting behavior. The proposed routing protocol includes three stages: initialization stage, construction stage, and the data transmission phase. The nodes identify the location and the sector during the initialization process. The construction phase includes two steps, neighbor node selection, and identification of energy efficient path. Then the last phase includes the transmission, in this the broadcasting node chooses the nodes with high residual energy (RE) in comparison to the average RE of the entire network. The proposed method is implemented in MATLAB. The outcomes of simulation confirm that the BES algorithm has better performance on EC, average RE, and network lifetime than the three existing algorithm in UWSN.

Review of Ad Hoc Networks scenarios and challenges in years 2015-2019

A Mobile Ad-hoc Network (MANET) protocol performance analysis depends on the type of simulation tools, mobility models, and metrics used. These parameters' choice is crucial to researchers because it may produce an inaccurate result if it is not well chosen. The challenges researcher is facing are on the choice of these four parameters. Our survey shows an inclination to used Ad-hoc On-Demand Distance Vector routing (AODV) for performance comparison and enhancement of it by the researcher. Network simulation 2 (NS2) was the most selected tool, but we observe a decline in its utilization in recent years. Random Waypoint Mobility model (RWPM) was the most used mobility model. We have found a high percentage of the published article did not mention the mobility models use; this will make the result difficult for performance comparison with other works. Packet Delivery Ratio (PDR), End to End Delay (E2ED) were the most used metrics. Some authors have self-developed their simulation tools; the authors have also used new metrics and protocols to get a particular result based on their research objective. However, some criteria of choosing a protocol, metrics, mobility model, and simulation tool were not described, decreasing the credibility of their papers' results. Improvement needs to be done in the Ad-hoc network in terms of benchmark, acceptable scenario parameters. This survey will give the best practice to be used and some recommendations to the Ad-hoc network community.

Perancangan Mobile Ad-Hoc Network Mengunakan Optimasi Routing AOMDV

Natural disasters are unpredictable events of the time and place that occur. In fact, natural disasters in Indonesia often make the destruction of an area that can cause the destruction of facilities in the region. Disaster events make regional communication usually cut off, so it requires backup communication tools in the event of a disaster. Backup communications can be built using infrastructure without a network. In this research we will design a network system where we will try to use the system to select some good ad hoc mobile protocols for sending data. The movement of each node means that each node is the data sent. The proposed service may also provide such services. . However, since there is no access to banks in disaster areas, the use of electronic currency for online transactions has become limited. Therefore, the secure payment system will be centered on our offline transactions after conducting simulations and looking at the existing comparison values then we get a conclusion about the results of the parameter trial in the end to end delay test parameters in this simulation we also get the best value that on node 50 is 3.2 seconds and on node 30 get a value of 15.03 seconds this happens because there is a 50

Rate aware congestion control mechanism for wireless sensor networks

The sensor nodes in wireless sensor networks (WSNs). inherit low processing, shorter range and low power features with the miniature size to offer wireless transmission. Therefore, in order to fulfil the long-time data sensing need, several Quality of Service (QoS) parameters such as: lesser delay, higher throughput and packet delivery ratio (PDR) with minimum overhead must to be improved. In recent years extensive research efforts have been made to ameliorate these parameters to achieve optimum QoS. However, the rate adaptation and congestion control in WSNs are still least explored areas. The traffic congestion in WSNs is the main reason that results in higher delay and low throughput. In this paper, a new rate aware congestion control (RACC) mechanism has been proposed which defines three levels of congestion based on which the data rate, throughput, overhead and the delay. RACC at the transport layer, improves congestion by source rate regulation at the specific hotspot areas. Further, RACC has been applied to different modulation schemes like: 16 QAM (Quadrature Amplitude Modulation), BPSK (Binary Phase Shift Keying) and QPSK (Quadrature Phase Shift Keying) to test the optimum modulation scheme for the proposed approach. The testing is done to ensure the that the data can be sent to the longer distant sensors using appropriate modulation technique suitable for the congestion model (RACC). The simulation outcomes in NS2 tool confirms the improvement of RACC over existing techniques (Delay-aware congestion control protocol (DACC) and Joint energy replenishment and load balancing (J-ERLB)) in WSNs. The overall improvement for RACC over existing techniques follows an improvement percentage 17% for throughput parameter, for packet delivery ratio, it is 8.35%, while for normalized routing overhead it shows 0.56% and for MAC Overhead, average end to end delay, and average remaining energy it shows 0.64%, 2.04% and 59.28% improvement respectively.

Performance Estimation of a Wireless Sensor Network with a Mobile Sink Moving in Different Trajectories at Different Velocities

Background: Throughout the past few years, numerous Medium Access Control (MAC) protocols, routing protocols, node deployment mechanisms and duty cycle variation schemes have been designed for achieving high throughput, low delay and jitter, and long network lifetime in Wireless Sensor Networks (WSNs). In a WSN with static sink, voluminous sensors transmit their sensed data to the sink node. The coordinators mutually present in the range of sensors and sink have to forward a number of packets, which cause rapid depletion of their battery. These coordinators become dead too early resulting in the breakage of the communication channel and formation of energy holes. However, to save energy with a static sink, the duty cycle should be short. A mobile sink is a better option than a static sink if the duty cycle is long, as it balances energy consumption among the sensors. It is well observed that the mobile sink is capable of acquiring homogeneous energy depletion leading to stretched lifetime enhancing network performance. Methods: The vital benefaction of this paper is to present a simulation-based analysis of the network performance with a mobile sink having different trajectories of path traversed at different velocities. The intent is to find out the most appropriate and efficient trajectory and a particular velocity for a specific WSN with 100 nodes. The terrain area of the network is 210×210 m2 with the communication range of 20 m. The routing, network and MAC protocols implemented are Ad hoc On-Demand Distance Vector (AODV), Internet Protocol version 4 (IPv4) and Institute of Electrical and Electronics Engineers (IEEE) 802.15.4 respectively. This paper has evaluated and analyzed the influence of lawn mower, elliptical and circular trajectories of a mobile sink moving at different velocities of 0.5, 1 and 2 m/s. The optimum performance is achieved at the velocity of 2 m/s for a circular trajectory of the mobile sink. It is observed that performance has significantly varied with the variation of trajectories and velocities. The notion of precise utilization of sink mobility improves the performance than a static sink. It is equally important to determine the most effective mechanism to implement mobile sinks and to find out the most appropriate scheme out of them. Results: The attainment parameters just as total messages received, average end to end delay (seconds), jitter (seconds), throughput (bits per second), number of packets dropped, number of packets dropped due to channel access failure, residual battery (mAh) and network lifetime (hours) for different trajectories such as lawn mower, elliptical and circular at different speeds of 0.5, 1 and 2 m/s of the sink node are evaluated and compared. The simulation results present that the circular trajectory and the velocity of 2 m/s have provided optimum performance. Conclusion: The objective was to precisely analyze and evaluate the influence of different trajectories of a mobile sink moving at different velocities in a WSN of 100 nodes to determine the most effective and appropriate trajectory and velocity to optimize the attainments. The intent is to uniform the power exhaustion amidst the sensors. The purpose was to gain the attention of researchers of this field to significantly contribute to novel research.