Multi-hop Data Transfer Research Articles

Performance Analysis of Routing Protocol Using Trust-Based Hybrid FCRO-AEPO Optimization Techniques

Mobile Ad hoc Networks (MANETs) offer numerous benefits and have been used in different applications. MANETs are dynamic peer-to-peer networks that use multi-hop data transfer without the need for-existing infrastructure. Due to their nature, for secure communication of mobile nodes, they need unique security requirements in MANET. In this work, a Hybrid Firefly Cyclic Rider Optimization (FCRO) algorithm is proposed for Cluster Head (CH) selection, it efficiently selects the CH and improves the network efficiency. The Ridge Regression Classification algorithm is presented in this work to sense the malicious nodes in the network and the data is transmitted using trusted Mobile nodes for the QoS enactment metric improvement. A trust-based routing protocol (TBRP) is introduced utilizing the Atom Emperor Penguin Optimization (AEPO) algorithm, it identifies the best-forwarded path to moderate the routing overhead problem in MANET. The planned method is implemented using Matlab software and the presentation metrics are packet delivers ratio, packet loss ratio (PLR), routing overhead, throughput, end-to-end delay (E2ED), transmission delay, energy consumption and network lifetime. The suggested AEPO algorithm is compared with the prevailing PSO-GA, TID-CMGR, and MFFA. The AEPO algorithm’s performance is approximately 1.5%, 3.2%, 2%, 3%, and 4% higher than the existing methods for PLR, packet delivers ratio, throughput, and E2ED and network lifetime. The sender nodes can increase their information transmission rates and reduce delays in appreciation of this evaluation. Additionally, the suggested technique has a perfect benefit in terms of demonstrating the genuine contribution of distinct nodes to trust evaluation (TE).

Awareness routing algorithm in vehicular ad-hoc networks (VANETs)

AbstractThe behavior of a Vehicle Ad hoc Network (VANETs) is extremely unpredictable due to the high mobility and random network topology inherent to the nature of VANETs. Several problems, including frequent connection failures, scalability, multi-hop data transfer, and data loss, impact the performance of Transmission Control Protocols (TCP) in such wireless ad hoc networks. This study proposes using zone-based routing with consideration for mobility in VANETs as a means of avoiding this issue. A hybrid optimization approach is introduced and used to the routing process. Both Ant Colony Optimization (ACO) and Artificial Bee Colony Optimization (ABCO) are components of the hybrid algorithm (ABC). Link stability and Residual energy provide the basis of the fitness function. Several measures, including delivery ratio, time, and overhead, are used to evaluate the effectiveness of the suggested method. A comparison of the suggested method's efficiency with that of other algorithms.

Mobility Aware Zone-Based Routing in Vehicle Ad hoc Networks Using Hybrid Metaheuristic Algorithm

Vehicle Ad hoc Networks (VANETs) have high mobility and a randomized connection structure, resulting in extremely dynamic behavior. Several challenges, such as frequent connection failures, sustainability, multi-hop data transfer, and data loss, affect the effectiveness of Transmission Control Protocols (TCP) on such wireless ad hoc networks. To avoid the problem, in this paper, mobility-aware zone-based routing in VANET is proposed. To achieve this concept, in this paper hybrid optimization algorithm is presented. The hybrid algorithm is a combination of Ant colony optimization (ACO) and artificial bee colony optimization (ABC). The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another. The optimal routing process is used to avoid traffic and link failure. The fitness function is designed based on Link stability and Residual energy. The validation of the proposed algorithm takes solution encoding, fitness calculation, and updating functions. To perform simulation experiments, NS2 simulator software is used. The performance of the proposed approach is analyzed based on different metrics namely, delivery ratio, delay time, throughput, and overhead. The effectiveness of the proposed method compared with different algorithms. Compared to other existing VANET algorithms, the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.

Trust-Based Security: Advancement towards Protection of the Adhoc Network

MANET (mobile ad hoc network) is a collection of mobile nodes that interact without the need for a fixed physical foundation. MANETs have grown in popularity as a result of characteristics like dynamic topology, quick setup, multi-hop data transfer, and so on. MANETs are well-suited to various real-time applications, including environmental monitoring, disaster management, and covert and military operations, because of their distinguishing characteristics. MANETs may also be used in conjunction with new technologies like cloud computing, IoT, and machine learning algorithms to help realize the vision of Industry 4.0. Secure and reliable data transfer is essential for any MANET-based sensitive real-time applications that must achieve the requisite QoS. It is challenging to provide safe and efficient data transfer with MANET. As a result, this article examines different Trust-based Approaches that take a step forward in providing secure transmission while simultaneously improving MANET performance. Furthermore, the study's analysis based on many aspects exposes the inadequacies of existing techniques and provides future directions for improvement.

Particle swarm optimization-based energy efficient clustering protocol in wireless sensor network

The nodes in the wireless sensor network are furnished with restricted and irreplaceable battery power. The continuous sensing, computation, and communication drain out the energy of sensors very quickly. The optimal utilization of the sensor energy has always been a key issue for all the applications in the wireless sensor network. To manage the energy issue of nodes, various approaches were proposed in the past which focused on designing the proper energy management methods. The clustering of sensors is one of the most popular techniques used to manage the energy-related concerns of networks. In this paper, a particle swarm optimization-based energy efficient clustering protocol (PSO-EEC) is proposed to enhance the network lifetime and performance. The proposed protocol uses the particle swarm optimization technique to select the cluster head and relay nodes for the network. The cluster head is selected by employing the particle swarm optimization based fitness function which considers the energy ratio (initial energy and residual energy) of nodes, distance between nodes and cluster head, and node degree to appoint the most optimal node for the cluster head job. For the data transfer to base station, the proposed scheme uses the fitness value based on residual energy of cluster head and distance to base station parameters to nominate the relay nodes for the multi-hop data transfer to the base station. The performance of the proposed protocol is compared with the various existing approaches in terms of different performance parameters such as energy expenditure, network lifetime, and throughput to evaluate its effectiveness. The proposed scheme has improved the lifetime of the network by 238%, 136%, 106%, and 71% as compared to the existing MDCH-PSO, MCHEOR, MOPSO, and HSA-PSO techniques used in the simulation results for the comparison purpose. The stability period of the network in proposed scheme is approximately 396%, 321%, 246%, and 126% more than the existing MDCH-PSO, MCHEOR, MOPSO, and HSA-PSO protocol .

Implementation and Evaluation of Dual-Purpose Normal and Disaster Situations System Based on Delay and Disruption Tolerant Bluetooth MANETs

Dual-purpose systems for both normal and disaster situations are necessary for providing continuous services from normal situations to disaster situations. We have been developing the dual-purposed systems based on the assurance network design principle. The assurance network design principle makes the dual-purpose systems work stably in both normal and disaster situations. This paper proposes a connectivity-dependent data propagation scheme, in which each terminal transfers data adaptively by wireless multi-hop data transfer or store-and-forward data transfer depending on whether the terminal has connections to its neighboring terminals. To verify the resilience against disconnection among neighboring terminals, we show field experimental results on data propagation time. Also we propose the dual-purpose system, in which there are two types of graphical user interface (GUI) for both situations. Whenever each terminal receives a special packet in disaster situations, the GUI automatically switches from one type for normal situations to another type for disaster situations. We have unified these two types of GUI so that users can understand how to use them even when GUI is automatically switched. To validate feasibility of the dual-purpose normal and disaster situations system, we show experimental results on dissemination of assessment information and automatical switching of GUIs.

Spectrally Efficient Packet Recovery in Delay Constrained Rateless Coded Multihop Networks

Rateless codes have been found to be particularly attractive for decode and forward based relaying strategy in delay tolerant multihop networks. The latency performance of such networks is dependent on the worst links that results in the starvation of subsequent nodes with good channel conditions. The total delay suffered by such networks can be constrained by limiting the number of rateless coded transmissions, especially for applications with critical latency requirements. However, the performance of rateless codes deteriorates in such circumstances due to the lack of sufficient mutual information for successfully recovering the entire source packets. The fraction of source packets that can be recovered will depend on the encoded packets received across the transmission channel. This paper investigates the degradation in the performance of such rateless coded networks by deriving the average packet recovery rate. In order to improve the reliability in such delay constrained networks, a novel spectrally efficient transmission scheme for reliable multihop data transfer is proposed. The proposed scheme exploits the broadcast nature of wireless transmissions, which provides an inherent implicit feedback channel, to ensure the reliable delivery of information packets to the nodes in the network. Rather than allocating dedicated channels to feedback the packet recovery information, the implicit feedback channel determines such information which enhances the spectral efficiency. Further, the optimum number of packets recoverable within the specified delay constraint to reduce the reprocessing of lost packets across hops is analytically analysed in this paper.

A Reliability Calculations Model for Large-Scale MANETs

ABSTRACT The Mobile Adhoc Network Extensibility is an issue of concern and research. The wireless network extensibility seems to be an inherent capability of MANETs taking into consideration the Multi-hop data transfer scheme. The limits of extensibility and the tradeoff between MANET stretching and the reliability concerns need to be exercised with a deterministic model. The reliability calculation methods proposed in past have an exponential growth factor for time complexity as number of nodes increase, thus making it computationally unfeasible to calculate reliability of large scale mobile networks .This work proposes a reliability calculation scheme which is realistic for calculating reliability of large scale MANETs. The proposed approach calculates the reliability of Mobile Adhoc networks by identifying critical links within a network . General Terms Reliability, Wireless Networks. Keywords Manet, Reliability, Critical Node, Two-terminal-reliability, Scalable Networks

Quadratic Programming for TDMA Scheduling in Wireless Sensor Networks

This paper presents a novel Multihop Aperiodic Scheduling (MAS) algorithm which guarantees energy-efficient data collection by Wireless Sensor Networks (WSNs) under delay constraints. Present Medium Access Control (MAC) protocols in WSNs typically sacrifice packet latency and/or the reliability of packet transfer to achieve energy-efficiency. Thus, the paper is concerned with developing a novel protocol to achieve energy efficient and reliable multihop data transfer in WSNs satisfying given latency requirements. Energy efficiency is achieved by optimizing the scheduling of the underlying Time Division Multiple Access (TDMA) system by minimizing the wake-up number of the nodes. Schedule optimization is transformed into a quadratic programming (QP) task, which is then solved by the Hopfield net in polynomial time. In this way, an energy efficient scheduling can be obtained which meets a given delay requirement in TDMA systems. The performance of the new algorithm has been evaluated by simulations and compared to the performance of well-known scheduling methods, such as SMAC, UxDMA (a slot assignment algorithm for WSN), and traditional tree-based protocols. The simulations have demonstrated that our method reduces global power consumption for time-driven monitoring.