Packet Transfer Rate Research Articles

A Machine Learning-based Secured and Energy-efficient Data Transmission in Mobile Ad-Hoc Networks (MANET)

Mobile hoc networks (MANET) are wireless networks of mobile devices that set up Data Transmission (DT) links independently without a fixed framework. Because topology changes constantly, MANET lines are often interrupted and out of balance. So, making sure that DT works well and reliably while also making good use of network resources is a problematic issue that MANET needs to solve. The suggested solution is to create a DT method to deal with these issues. This method aims to improve DT by sending data as quickly as possible while using as little time. As learning examples, the suggested method uses a range of mobile gadgets. Support Vector Machine (SVM) classes are trained to be weak groups. Supervised SVM can sort the surrounding nodes into groups with better link quality and lower energy use. The results of weak learners are combined to create a robust classifier, which guarantees that the data transfer works well. An experimental test checks the amount of power used, the packet transfer rate, the time it takes, and the output. The number of mobile nodes and data packages will be changed during the analysis.

Secure Routing and Reliable Packets Transmission In MANET Using Fast Recursive Transfer Algorithm

Mobile Ad-hoc Network (MANET) autonomous operation can be multi-hop it is the infrastructure-less wireless network. Security is one of the biggest challenges in Mobile Adhoc Network. The MANETs security there are considerations must be so that the routing protocol in order to protect the secure data transmission. In the routing and security that is an important aspect for in a MANETs, existing method routing protocol, however, is not enough to security requirements. The proposed method using Fast Recursive Transmission Algorithm (FRTA) used designed to maximize the data security, routing optimization, minimizing the impact of malicious attack using Collision Detection Avoid Algorithm (CDAA) activity over the MANET and select the best path. Table-driven routing protocols, also known as proactive routing protocols, mandate that every node on the network keep up-to-date routing data. To maintain consistent routing information for network nodes, these protocols propagate frequent updates to the routing table throughout the network, necessitating changes to the network topology. There's a lot of overhead from these upgrades. The suggested FRTA algorithm lowers node data loss rates and increases network energy efficiency. Table-driven routing protocols, also known as proactive routing protocols, mandate that every node on the network keep up-to-date routing data. To maintain consistent routing information for network nodes, these protocols propagate frequent updates to the routing table throughout the network, necessitating changes to the network topology. There's a lot of overhead from these upgrades. The suggested FRTA algorithm lowers node data loss rates and increases network energy efficiency. The proposed method shows high performance than other existing evaluations of the most advanced security and routing energy, end-to-end delay, packet transfer rate, packet loss

Enhanced DV-Hop Algorithm for Efficiency Energy and Network Quality in Wireless Sensor Networks

Wireless Sensor Networks (WSN) are wireless networks with multiple sensor nodes covering a relatively large area. One of the weaknesses of WSNs is the relatively high energy consumption, which affects the network quality of service. Although WSN network routing using the DV-Hop algorithm is widely used because of its simplicity, improvements need to be made to improve energy efficiency, which impacts network lifetime. This article proposes a method to enhance energy efficiency by comparing the original DV-Hop algorithm with the enhanced DV-Hop algorithm. There are three approaches to enhancing the DV-Hop algorithm. Firstly, the CH node selection is based on the distance to the Base Station so that the selected CH node does not have a far distance from the base station. Secondly, the CH node selection must have a minimum number of sensor nodes as neighbors. Lastly, each selected CH node calculates the minimum distance to the previously selected CH node to ensure that the selected CH node is not in a nearby position. The proposed approach obtains better data packet transfer rate, energy efficiency, and network lifetime results using Matlab software simulation that compares the enhanced DV-Hop algorithm with the original DV-Hop algorithm and three other routing algorithms.

A fuzzy logic and DEEC protocol-based clustering routing method for wireless sensor networks

<abstract> <p>Power-efficient wireless sensor network routing techniques (WSN). Clustering is used to extend WSNs' lifetimes. One node act as the cluster head (CH) to represent the others in communications. The member nodes are less important than the cluster hub (CH) in the clustering procedure. Fuzzy techniques based on clustering theory may provide evenly distributed loads. In this study, we provide a fuzzy-logic-based solution that factors in distance to base station (BS), number of nodes, remaining energy, compactness, distance to communicate within a cluster, number of CH, and remaining energy. Fuzzy clustering has a preliminary and final step. First, we select CH based on distance to the base station (BS), remaining node vigor, and node compactness. In the second phase, clusters are created by combining nodes that aren't already in a CH, using density, outstanding vigor, and detachment as limitations. The proposed solution increases load balancing and node longevity. This work provides a unique hybrid routing technique for forming clusters and managing data transfer to the base station. Simulation findings confirm the protocol's functionality and competence. Reduced energy use keeps network sensor nodes online longer. The framework outperforms Stable Election Protocol (SEP), hybrid energy-efficient distributed clustering (HEED), and Low Energy Adaptive Clustering Hierarchy (LEACH). Using the nodes' energy levels to create a grid pattern for the clusters gave four clusters. In addition, the proposed method has a 4347%, 41.46%, 39.26%, 37.57% and 35.67% reduction in average energy consumption when compared with the conventional algorithms. The proposed technologies could increase the network's lifetime, stability interval, packet transfer rate (throughput), and average energy. The suggested protocol is at least 50% better in every statistic that was looked at, such as network lifetime, stability interval, packet transmission rate (throughput), and average energy use.</p> </abstract>

TADR-EAODV: A trust-aware dynamic routing algorithm based on extended AODV protocol for secure communications in wireless sensor networks

Compliance with security requirements in Wireless Sensor Networks (WSNs) is known as an important phenomenon in conserving energy consumption due to its dynamic topology. Energy consumption management in WSN can be achieved through secure routing protocols. Authentication, firewall and intrusion detection, and trust management are common ways to provide security on the WSNs. Meanwhile, trust management provides better performance due to ensuring distributed security through collaboration. In this paper, a Trust-Aware Dynamic Routing algorithm based on Extended AODV protocol for secure communications in the WSN (TADR-EAODV) is proposed. TADR-EAODV considers factors such as direct trust, recommended trust, connectivity strength, energy rate and worthiness score to measure the distributed safety level of nodes in routing. We use the AODV protocol for routing work, which is extended through a multi-route routing approach. In addition, a centralized ensemble clustering for node grouping is included in TADR-EAODV, which enables clustering-based routing to enhance WSN performance. Extensive experiments have been performed in the presence of denial-of-service attacks to verify our claims. The experimental results prove that high-performance TADR-EAODV has been able to identify attackers by detecting their anomalous behavior. Besides, TADR-EAODV has improved the average packet transfer rate by 6% to 17% compared to existing state-of-the-art algorithms such as LEACH-TM, TAAO-SDTIM and TAOSC-MHR.

Improvement of packet transmission scheduling and delivery rate in wireless Ad-Hoc networks

The principal purpose of Ad-Hoc wireless networks is to increase service efficiency in terms of transmission scheduling and packet transfer rate. The approaches that assume frame unicity to satisfy a given set of packets minimize the end-to-end delay. However, they do not guarantee a maximum packet delivery rate due to the difficulty of establishing robust paths for packet transfer across nodes deployed in the network, especially in a three-dimensional (3D) environment. The objective is to minimize the end-to-end delay by ensuring the maximum delivery of packets to their destinations. Furthermore, the signal-to-interference-and-noise-ratio (SINR) model is considered to optimize transmission scheduling. In this paper, an optimal node coordinates optimization approach is proposed to extend two recently investigated schemes in the literature (S-RDSP and I-RDSP). The developed algorithms, named S-MPDR and I-MPDR, seek to reduce the end-to-end delay by delivering a collection of inserted packets over a 3D environment while also maximizing the delivery rate of these packets. Desirability functions are used to evaluate the network’s performance in various scenarios involving two different environments, Level 0 and Level 1. Numerical results demonstrate that the developed algorithms outperform both schemes in terms of end-to-end delay and packet delivery rate. In the Level 0 environment, the overall minimum delay and packet delivery rate scores provided by S-MPDR are increased by 28% and 88% compared to S-RDSP, respectively. In comparison, those provided by I-MPDR are increased by 24% and 16% compared to I-RDSP. Similarly, in the Level 1 environment, the scores provided by S-MPDR are increased by 25% and 100% compared to S-RDSP, respectively, while those provided by I-MPDR are increased by 23% and 25% compared to I-RDSP.

Learning-Vector-Quantization-Based Topology Sustainability for Clustered-AANETs

Aeronautical ad hoc networks (AANETs) dramatically increase the Internet access rates of aircraft by widening the coverage area thanks to the air-to-air links established. However, the mobility and atmospheric effects on AANETs increase air-to-air link breakages, leading to frequent aircraft replacement and reducing link quality. These broken air-to-air links should be transferred to other aircraft to enable the sustainability of the AANET topology. At that point, the wrong and late transfer decisions of broken links make topology sustainability challenging by reducing packet transfer success and increasing end-to-end latency, respectively. Despite these challenges, to the best of our knowledge, air-to-air link transfers between aircraft in AANETs have not been investigated by any study to enable the topology sustainability. This article proposes to utilize learning vector quantization in three phases - winning cluster selection, intra-clus-ter link determination, and attribute update - to enable the sustainability of AANET topology, which is in the form of aircraft clusters. In winning cluster selection, we consider each cluster in the topology as a pattern. Then we aim to find the best matching cluster of an aircraft observing air-to-air link breakage through pattern classification. Then we take airplanes in a cluster pattern as weight vectors with location and queuing delay attributes to determine the intra-cluster links of newly assigned aircraft. Here, the aircraft is modeled according to a G/G/1 queuing system for delay attribute calculations. Finally, according to the freshly established intra-cluster links, we update weight vectors' attributes using the throughput rate as the learning rate. We simulate the proposed system by utilizing OMNET++ and Weka tools with realistic air traffic data obtained from flight radar databases. In these simulations, we can reduce the end-to-end latency of AANET topology by 25 percent and increase the packet transfer rate by 31 percent compared to the methodologies in the literature.

Data prediction approaches for efficient data transmission using optimized Leibler distance matrix-based data aggregation in wireless sensor network

In wireless sensor networks, sensor nodes are distributed in different geographically dispersed areas, sink nodes are used for sensing data and sink nodes are used for data collected from different sensor nodes. Therefore, data collection is a key issue in wireless sensor networks. In addition to computational overhead, many challenging security issues have been introduced to in-network data processing. Data collection and communication methods are also proposed based on the Optimized Leibler Distance Matrix-based data aggregation (OLDMDA) algorithm. These sensor nodes belong to the category forming the OLDMDA plane data aggregation technology, which includes homogeneous nodes and data collection protocols. Leibler Distance Matrix for Node Location to find the location and multi sink node selection is based on node location distance using a Leibler matrix. In this distance matrix to collect the information of node energy, transmission rate to identify the higher performance node on the network. The Optimized Johnson's shortest path algorithm to solve the path problem source to destination. In this path selection method proposed to find the all the possible multi path randomly generate the graph. The performance of the new technology has been implemented using the network emulator (NS2). Simulation results of the proposed method OLDMDA higher performance with respect to the average packet transfer rate and metrics, as compared with the delay and network lifetime.

Performance and evaluation of location energy aware trusted distance source routing protocol for secure routing in WSNs

Objectives: To propose a suitable algorithm for improving the network lifetime of Wireless Sensor Networks (WSNs). Methods/Findings: We proposed a suitable Location and Energy Aware Trusted Distance Source Routing (LEATDSR) algorithm. Here, the energy consumption, location and the data quality are equalized by the Quality of Service (QoS) based routing algorithms. In addition to this algorithm, an existing clustering algorithm is also incorporates for grouping the sensor nodes based on the trust, location, energy and distance. In this LEATDSR is capable of deciding the evaluation metrics which express the QoS. Moreover, a new trust mechanism is also introduced in this model that incorporates multi-attributes of various sensor nodes in terms of communication, data, energy, and recommendation. This new trust mechanism relies on an enhanced sliding window time by considering the occurrences of attack frequency for facilitating the discovery of anomalous behaviours of attackers. The enhanced energy utilization is established within the sensor nodes for performing the active data transmission. The performance of the proposed model is evaluated by conducting various experiments in a simulation environment which creates by using NS2. From the experiments conducted in this work, the average packet transfer rate is increased drastically when compared to existing models available in the literature.

CEPRAN-Cooperative Energy Efficient and Priority Based Reliable Routing Protocol with Network Coding for WBAN

The wireless body area network (WBAN) can effectively modify the health and lifestyle monitoring specifically where multiple body parameters are measured using biomedical sensor devices. However, power consumption and reliability are crucial issues in WBAN. Cooperative Communication usually prolongs the network lifetime of WBAN and allows reliable delivery of bio-medical packets. Hence, the main aim of this investigation is to propose a novel protocol Cooperative Energy efficient and Priority based Reliable routing protocol with Network coding (CEPRAN) to enhance the reliability and energy efficiency of WBAN using cooperative communication method. Firstly, to identify a relay node from the group of sensor nodes for data forwarding, an enhanced Cuckoo search optimization algorithm is proposed. Secondly, Cooperative Random Linear Network Coding approach is incorporated into the relay node to improve the packet transfer rate. CEPRAN is implemented in Ns-3 simulator and the experimental results prove that the proposed protocol outperforms the existing SIMPLE Protocol.

Performance Evaluation of an IEEE 802.11g Network in an Industrial Environment

In the industrial domain, wireless networks are among the most recommended, due to their low deployment cost, great flexibility, and by being less invasive to the environment. In the literature, little emphasis is given to the application of traditional IEEE 802.11a/b/g standards into industrial environments. We have evaluated the communication performance of an 802.11g network infrastructure within a thermoelectric powerplant. Three metrics were considered during our analysis: packet loss rate, transfer rate, and response time. Tests were conducted to evaluate the communication between different points inside the engine room and a point located in the administration room. To get a more realistic scenario, the experiments were performed in working days of the thermoelectric power plant. The network performance did not suffer significant degradation, even under electromagnetic interference and other intrinsic characteristics of such harsh environment. We concluded suggesting the addition of a few more access points to the engine room in order to improve the signal quality and thus the communication.

SEAT-DSR: Spatial and energy aware trusted dynamic distance source routing algorithm for secure data communications in wireless sensor networks

This paper propose a novel secure routing mechanism called Spatial and Energy Aware Trusted Dynamic Distance Source Routing (SEAT-DSR) algorithm for enhancing the network life time of wireless sensor networks. Here, the spatial information, energy level, and the effectiveness of data quality are equalized by the Quality of Service (QoS) based energy aware routing algorithms. In addition to this approach, a standard clustering algorithm is also incorporates for grouping the wireless sensor nodes based on the trust score, spatial information, energy level and the distance between the nodes. In this SEAT-DSR is also capable of making decision over the evaluation metrics that are decided and expressed the QoS. Moreover, a new hierarchical trust mechanism is also introduced in this model which adopts multi-attributes of many wireless sensor nodes according to the data communication speed, data size, energy consumption, and the recommendation. This new hierarchical trust method relies over an improved the sliding window time by considering the presence of various attacks frequency to identify the attackers by discovering their anomalous behaviour. The proposed SEAT-DSR is evaluated by conducting many experiments in a simulation environment that creates by using Network Simulator-2 (NS2). The experimental results of the proposed algorithm are proved that the average packet transfer rate is increased drastically than the existing secure routing methodologies.

RED-Based Technique for Detecting and Avoiding Anomaly Network Congestion

Active Queue Management (AQM) is an intelligent drop of network packets within the network routers as a result of buffer saturation to reduce network congestion. Random Early Detection (RED) mechanism is the most used mechanism among the existing AQMs, as it can avoid network congestion at the early stages. The RED mechanism prompts users to reduce their windows size when the queue average has exceeded a predefined threshold. However, some users do not respond to these notifications, and therefore, RED drops all packets in the link. This will generate a false alarm because the well-behaving packets on that link will be dropped as well. This study proposes a technique for monitoring gateways’ queues and dropping only the misbehaving packets. Every RED gateway reports the packet transfer rate (PTR) of misbehaving users that have exceeded their bandwidth shares to the SLA management (SLAM) unit. The SLAM unit will compute the users’ PTRs and compare them with their predefined ratios in the SLA. Users that have exceeded the SLA-predefined threshold will be considered as misbehaving and isolated from the normal users. The obtained results show that the proposed technique is efficient in identifying the misbehaving packets and avoiding network congestion.

Modeling Large-Scale Slim Fly Networks Using Parallel Discrete-Event Simulation

As supercomputers approach exascale performance, the increased number of processors translates to an increased demand on the underlying network interconnect. The slim fly network topology, a new low-diameter, low-latency, and low-cost interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this article, we present a high-fidelity slim fly packet-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate the model with published work before scaling the network size up to an unprecedented 1 million compute nodes and confirming that the slim fly observes peak network throughput at extreme scale. In addition to synthetic workloads, we evaluate large-scale slim fly models with real communication workloads from applications in the Design Forward program with over 110,000 MPI processes. We show strong scaling of the slim fly model on an Intel cluster achieving a peak network packet transfer rate of 2.3 million packets per second and processing over 7 billion discrete events using 128 MPI tasks. Enabled by the strong performance capabilities of the model, we perform a detailed application trace and routing protocol performance study. Through analysis of metrics such as packet latency, hop count, and congestion, we find that the slim fly network is able to leverage simple minimal routing and achieve the same performance as more complex adaptive routing for tested DOE benchmark applications.

Comparative Performance Evaluation of TCP with Identical and Cross-Variant Congestion Control

The Transmission Control Protocol (TCP), a key functional building block of the Internet, operates as a rate-adaptive end-to-end protocol at the Transport Layer of the network protocol stack. It regulates the prevailing load conditions within the network by getting the source node to adapt the packet transfer rate in accord with the processing capacity of the receiver. The regulation is enforced by means of dropping of packets on the part of the receiver. The TCP sender then reduces the packet injection rate so as to allow the network to recover from congestion. The focus of this paper is performance evaluation of certain notable TCP congestion avoidance algorithms, namely, Vegas, Reno and New Reno. Specifically, a number of performance measures have been analysed based on ns-2 simulation data where the scenarios involved TCP flows operating with identical and cross-variant congestion control mechanisms. Congestion window behaviour, packet loss, throughput, transmission delay and jitter are the performance criteria studied with the setup mentioned. In the flows with identical variants, Vegas outperforms other TCP variants. However, TCP Vegas has been observed to contribute to unfair appropriation of the resources in the cross-variant setting.

A Comprehensive Trust-Aware Routing Protocol With Multi-Attributes for WSNs

Due to the impact of an open deployment environment, severe restrictions in power with poor hardware equipment, and a lack of centralized administration in management, wireless sensor networks (WSNs) are extremely vulnerable to malicious attacks aimed at routing and other aspects. To face this problem, we propose a novel trust-aware routing protocol for WSNs which incorporates multiattributes (TRPM) of sensor nodes in terms of communication, data, energy, and recommendation. The proposed trust model relies on an improved sliding time window considering attack frequency to facilitate the discovery of malicious behaviors of attackers. Combined with effective routing detection and maintenance protocol, the performance of our solution is tested through a wide set of simulation experiments. Extensive results reveal that an average packet transfer rate of TRPM is increased by about 19% and time consumption on the routing update is shortened by about 11% in case 20% of all sensor nodes are malicious compared with other existing trust-based routing protocols.

IBFWA: Integrated Bloom Filter in Watchdog Algorithm for hybrid black hole attack detection in MANET

ABSTRACTIn recent days, the Mobile Ad-hoc Network (MANET) has gained more attention and popularity due to its dynamic nature. However, it is highly vulnerable to attacks due to its wireless nature and lack of central authority. This affects the overall performance of the network. To solve this problem, the Watchdog protocol was developed for attack detection. However, if it receives a false report from a misbehaving node, it fails to detect the attack. To overcome this problem, the Integrated Bloom Filter with Watchdog Algorithm (IBFWA) is proposed in this article to avoid packet loss. Here, the Certificate Authority (CA) validates the node through the process of key generation. Then, it checks whether the node is normal or attacker; if it is a black hole node, it will be blocked and communication through this node is avoided. If a node is compromised and revoked as a normal node, it is added to the network and communication through the node is enabled. The experimental results evaluate the performance of the proposed attack detection system in terms of lower node outage, residual energy, end-to-end delay, high detection probability, throughput, packet transfer rate and packet delivery ratio.

Proxy Based Seamless Connection Management Scheme for Smart Transportation Service

Nowadays, complex IoT devices are developed that support smart transportation service, medical alarm service, and smart surveillance camera which require communication to the computation server. Most of IoT devices communicate to their servers on fixed network through wireless channel. In this paper, we are focused on smart transportation service that is one of bus, train, airplane or ship that takes embedded IoT devices and passengers using IoT devices. Embedded IoT devices are communicated with embedded access router (AR) on transportation by Bluetooth/Z-wave/NFC, and passengers' IoT devices are communicated with their own egg/AR on fixed network, or public AR on transportation. Transportation environment has a major problem that mobile node moves fast through multiple cells. Each IoT device in transportation keeps updating its current point of attachment to its home agent and corresponding node. To overcome this problem we consider feature of transportation. It has two major features. The one is mobile device has fast mobility by transportation. The other one is mobile device moves fixed route. It causes mobile device has intra mobility between several subnets of one agency when it moves into a subway or highway. Based on two features, we design proxy based architecture and extend router advertisement message to alert join in proxy domain. Then, we are classified the mobility into intra proxy mobility and global mobility. And we proposed proxy based mobility management scheme using prediction algorithm. By numerical analysis, we shows proposed scheme reduces signaling overheads and increase packet transfer rate than NEMO and proxy MIP.

Improving Quality of Service and Reducing Power Consumption with WAN accelerator in Cloud Computing Environments

The widespread use of cloud computing services is expected to deteriorate a Quality of Service and toincrease the power consumption of ICT devices, since the distance to a server becomes longer than before. Migration of virtual machines over a wide area can solve many problems such as load balancing and power saving in cloud computing environments. This paper proposes to dynamically apply WAN accelerator within the network when a virtual machine is moved to a distant center, in order to prevent the degradation in performance after live migration of virtual machines over a wide area. mSCTP-based data transfer using different TCP connections before and after migration is proposed in order to use a currently available WAN accelerator. This paper does not consider the performance degradation of live migration itself. Then, this paper proposes to reduce the power consumption of ICT devices, which consists of installing WAN accelerators as part of cloud resources actively and increasing the packet transfer rate of communication link temporarily. It is demonstrated that the power consumption with WAN accelerator could be reduced to one-tenth of that without WAN accelerator.

A Mobile Asset Tracking System Architecture under Mobile-Stationary Co-Existing WSNs

The tracking of multiple wireless mobile nodes is not easy with current legacy WSN technologies, due to their inherent technical complexity, especially when heavy traffic and frequent movement of mobile nodes are encountered. To enable mobile asset tracking under these legacy WSN systems, it is necessary to design a specific system architecture that can manage numerous mobile nodes attached to mobile assets. In this paper, we present a practical system architecture including a communication protocol, a three-tier network, and server-side middleware for mobile asset tracking in legacy WSNs consisting of mobile-stationary co-existing infrastructures, and we prove the functionality of this architecture through careful evaluation in a test bed. Evaluation was carried out in a microwave anechoic chamber as well as on a straight road near our office. We evaluated communication mobility performance between mobile and stationary nodes, location-awareness performance, system stability under numerous mobile node conditions, and the successful packet transfer rate according to the speed of the mobile nodes. The results indicate that the proposed architecture is sufficiently robust for application in realistic mobile asset tracking services that require a large number of mobile nodes.