Wireless Ad Hoc Networks Research Articles

ECC Based Defense Scheme for Selective Drop Attack in Wireless Ad Hoc Network

Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighbouring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. Resistive to selective drop attack (RSDA) scheme is proposed to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, throughput and end to end delay are analysed.

RETRACTED: An Adaptive Fuzzy System based Insider Attacks detection with Group Key management for Wireless Ad-Hoc Network

Ad-hoc networking of wireless devices permits the establishment of contact links on the taking part hubs without pre-arranged infrastructure. In wireless ad hoc networks, participatorynodestypicallyengageingroupcommunicationssuchasbroadcast, multi-accessor relay functions. Protecting these communications is a challenging task, as internal attackers may secretly cause damage to the network, which is difficult to predict. Internal attackers can affect the sensors negatively and may disrupt the network by dropping sensitive packets or modifying packet information maliciously. Inside attackers are capable of causing many types of activities as well as passive attacks. Attackers located at a critical point in the network can significantly affect network performance. Insider attackers conceal themselves by marking themselves as legitimate nodes. Therefore, it becomes hard for the system to differentiate dishonest nodes from honest nodes. So as to make the communication among the network more secure, an adaptive fuzzy system that uses CSO algorithm for selecting optimal membership function has been proposed. In this approach, the group key is distributed by the cluster head to the cluster members. This makes sure that only the nodes with the same group key can speak with one another. Implementing appropriate group-key management in the system that focuses on internal attacks identifies the dishonest nodes which can be then eliminated through some other security measures. This ensures the absence of the dishonest nodes inside the network. The results have been simulated and the execution of the proposed approach has been contrasted with the tradition FS approach. The results have shown the presented approach has performed better than the traditional approach.

An EAOW algorithm to optimize the throughput in ad-hoc network in emergency communication environment

For improving the throughput of wireless ad-hoc networks in emergency communication environments, this paper proposes an enhanced adaptive on-demand weighted clustering algorithm. The clustering algorithm is very important in heterogeneous wireless ad-hoc networks, but the widely used AOW algorithm has certain limitations. Combined with the emergency communication environment, this article first analyzes the importance of clustering algorithm in improving network throughput, and secondly introduces and analyzes the two shortcomings of the AOW algorithm. On this basis, an enhanced adaptive on-demand weighted clustering algorithm (EAOW) is proposed. In the EAOW algorithm, each weight factor is dimensionlessly processed, and the properties of the nodes are added to the heterogeneous network. The simulation results show that compared with the AOW algorithm, the EAOW algorithm has an obvious progress in the number of cluster heads and the network throughput.

Retraction: An Adaptive Fuzzy System based Insider Attacks detection with Group Key management for Wireless Ad-Hoc Network (J. Phys.: Conf. Ser. 1911 012007)

This article has been retracted by IOP Publishing following an allegation that the work contains tortured phrases [1] and bears similarities to a previous publication by the authors [2].IOP Publishing has investigated in line with the COPE guidelines, and agree the article contains a number of tortured phrases and bears significant similarities to the author’s previous publication.IOP Publishing wishes to credit PubPeer commenters [3] for bringing the issue to our attention.The authors neither agree or disagree to this retraction. [1] Cabanac G, Labbe C, Magazinov A, 2021, arXiv:2107.06751v1 [2] C. Sivakumar Chellappan and C. Nalini, (2019), 'An Adaptive Fuzzy System based Insider Attacks detection with Group Key management for Wireless Ad-Hoc Network', Test Engineering and Management, ISSN: 0193-4120 Page No. 6140-6158, http://www.testmagzine.biz/index.php/testmagzine/article/view/866/783 [3] https://pubpeer.com/publications/DE5BD14EA980CC15B57840CE59213D Retraction published: 08 July 2022

Applicability of Overlay Non-Delay Tolerant Position-Based Protocols in Highways and Urban Environments for VANET

Vehicular Ad hoc Networks (VANETs) is new sort in wireless ad-hoc networks. Vehicle-to-Vehicle (V2V) communication is one of the main communication paradigms that provide a level of safety and convenience to drivers and passengers on the road. In such environment, routing data packet is challenging due to frequently changed of network topology because of highly dynamic nature of vehicles. Thus, routing in VANETs in require for efficient protocols that guarantee message transmission among vehicles. Numerous routing protocols and algorithms have been proposed or enhanced to solve the aforementioned problems. Many position based routing protocols have been developed for routing messages that have been identified to be appropriate for VANETs. This work explores the performances of selected unicast non-delay tolerant overlay position-based routing protocols. The evaluation has been conducted in highway and urban environment in two different scenarios. The evaluation metrics that are used are Packet Delivery Ratio (PDR), Void Problem Occurrence (VPO), and Average Hop Count (AHC).

DyTE: An Effective Routing Protocol for VANET in Urban Scenarios

A Vehicular Ad-hoc Network (VANET) is a subclass of wireless ad-hoc networks, widely used in on-road vehicles and roadside equipment, having applications in various areas including passenger safety, smart traffic solutions, and connectivity on vehicles The VANET is the backbone of the Intelligent Transport System (ITS) that establishes connectivity between vehicles through a wireless medium. When it comes to the communication between high-speed vehicles there is the challenge of dynamic mobility. In order to provide a higher Packet Delivery Ratio (PDR) and increase the throughput, a new routing protocol called Dynamic Trilateral Enrolment (DyTE) is introduced which chooses a dynamic trilateral zone to find the destination vehicle by allowing only relevant nodes to participate in the communication process using the location coordinates of source and destination nodes. The proposed routing protocol is compared with Ad-hoc On-demand Distance Vector (AODV), Ad-hoc On-demand Multipath Distance Vector (AOMDV), and Dynamic Source Routing (DSR), and the results show remarkable improvement in reducing the Network Routing Load (NRL) and increasing the PDR and throughput of the network. DyTE has performed more efficiently in terms of PDR (23% approximately), throughput (26% approximately) and drastically minimized the NRL by a factor of almost 3.

A Privacy Preserving and Efficient Randomness Routing in Adhoc Wireless Network

Now a day’s automatic key establishment of any two devices in the network is placed an important role and generation of key is used for public key based algorithm. By using public key based algorithm we can automatically generated secret key any two devices in the network. So that by performing this process we can randomly generate secret key. In the ad hoc networks another concepts is routing from source node to destination node. The generation of routing process can be done by randomly and performing this process we can improve the efficiency in the routing. In this paper we are implementing random routing of secure data transmission protocol for generating routing and provide privacy of transferred message. By implementing this protocol we can provide random routing process for transferring message. Before transferring message the server will randomly generate routing for source node to destination node. After that the source node will send data to destination node. Before transferring message or data the source node will encrypt and send the cipher format data to destination node. The destination node will retrieve cipher format data and perform the decryption process. After completion of decryption process the destination node will get original message. By implementing those concepts we can improve the efficiency for generating routing and also provide security of transferring message.

The significance of the Tactile Internet and 5G for digital agriculture

Abstract The demand for internet access and data transfer is the key driver of mobile communications technologies. The next step is wireless real-time networking. The “Tactile Internet” demands completely new technologies. Low latency, short response times, high reliability and resilience, a network of edge clouds and security are basic requirements. Therefore, 5G is developed. Novel use cases are industrial automation, autonomous vehicles, e-health, and the Internet of Things. For agriculture, 5G is a crucial technology enabler for robotization and Smart Farming processes. Agriculture needs own ad-hoc radio network solutions to efficiently provide coverage and manage data transfer, privacy and flexibility. The synergy of cellular and local mesh communications can solve the problem of unreliable communication and allows farmers to take full control of their data.

Trade-off between spectral efficiency and normalized energy in Ad-hoc wireless networks

With the ever-increasing deployment of wireless communication technologies, effective management of scarce power and radio spectrum resources is of primary concern. The available bandwidth spectrum should be utilized in the most efficient and controlled way for practical economic growth of industries in conformity with the evolving demand of energy for powering wireless devices. In the proposed optimization scheme, energy management and limited spectrum sharing are distributively implemented for handling quality of service provisioning and potential resource allocation across multiple nodes with inherent operational capability deficiencies. We employ cross-layer information exchange and convex optimization techniques to simultaneously achieve more efficient radio spectrum usage and optimal energy consumption in ad-hoc wireless networks with distributed scenarios. We consider the time-invariant additive white Gaussian noise channel and the time-varying Rayleigh fading channel to study the trade-off between the two network design objectives of achieving improved spectrum efficiency and minimizing the energy overhead in data routing paradigm. The original problem is transformed into an equivalent convex optimization problem through logarithmic processing to obtain the approximate global optimal solution. Moreover, the robustness and efficiency of the proposed framework is evaluated in large-scale set ups to provide the scalability analysis on both the employed performance objectives. The developed optimization scheme is compared with the machine learning models previously proposed in literature by employing the computational and/or time complexity metrics. Finally, the effectiveness of the proposed optimization model is substantiated through the simulation comparison results with the existing schemes in terms of various key performance parameters such as throughput, energy efficiency, and average bit errors.

Qualitative Analysis of dual MAC in Multihop Adhoc Wireless Network

Multihop adhoc wireless networks offer great challenges for protocol designers. Stations in such networks are constrained by factors like low power, limited bandwidth, link errors and collisions. Changes are needed at various levels of the protocol stack, most importantly at the media access layer(MAC). This paper emphasizes in minimizing the collisions, and take care of the hidden and exposed problems in multihop wireless networks. The MAC with Distributed Coordination Function(DCF)does not scale well in such networks. We introduce Point Coordination Function(PCF)in the region of high traffic areas, and discuss its effect on network performance. To improve network scalability and throughput, we propose the design of dual MAC. This work discusses architecture and working of the dual MAC. Performance results of the network using MAC are presented, and compared with that of pure DCF operation.

Performance Analysis of Information Theoretic Learning-Based Cooperative Localization

In the context of localization over ad-hoc wireless networks, the effect of non-line-of-sight (NLoS) presents a severe performance bottleneck that causes outages in the signal-to-noise ratio (SNR) of the returns and significantly increases the location estimates' error-floor. The non-Gaussianity and the scenario-dependent distributions/statistics of the additive noise-process caused by the NLoS returns make the naive ML-based solutions sub-optimal. In this regard, information-potential (IP) based localization algorithms have recently been found viable, especially in the presence of arbitrary additive noise-processes. This letter presents analytical insights on the error-bounds of two IP based algorithms in a cooperative-localization context, namely, maximum correntropy (MCC) and the minimum error entropy with fiducial points (MEE-FP). The presented analytical results for the considered IP based approaches are validated using relevant computer-simulations assuming typical point-processes.

Soft Computing-Based Congestion Control Schemes in Wireless Sensor Networks: Research Issues and Challenges

Wireless Sensor Networks (WSNs) are a special class of wireless ad-hoc networks where their performance is affected by different factors. Congestion is of paramount importance in WSNs. It badly affects channel quality, loss rate, link utilization, throughput, network life time, traffic flow, the number of retransmissions, energy, and delay. In this paper, congestion control schemes are classified as classic or soft computing-based schemes. The soft computing-based congestion control schemes are classified as fuzzy logic-based, game theory-based, swarm intelligence-based, learning automata-based, and neural network-based congestion control schemes. Thereafter, a comprehensive review of different soft computing-based congestion control schemes in wireless sensor networks is presented. Furthermore, these schemes are compared using different performance metrics. Finally, specific directives are used to design and develop novel soft computing-based congestion control schemes in wireless sensor networks.  

Mobile Ad Hoc Network in Disaster Area Network Scenario: A Review on Routing Protocols

Disasters could cause communication systems partially or completely down. In such a case, relief operations need a rapidly deployed communication system to save lives. Exchanging information among the rescue team is a vital factor to make important decisions. Communication system required to be robust to failures, rapidly deployable, easily maintainable to provide better services. Wireless ad-hoc networks could be the choice of establishing communication with the aid of existing infrastructure in a post-disaster case. In order to optimize mobile ad-hoc network performance, address the challenges that could lead to unreliable performance is required. One and most crucial key challenge is routing information from a sender to receiver. Due to the characteristics of a disaster environment such as signal attenuation, communication links exist between rescue crew is short-lived, suffer from frequent route breakage, and may result in unreliable end-to-end services. Many routing protocols have been proposed and evaluated in different network environments. This paper presents the basic taxonomy of Mobile Ad Hoc Networks and the state of the art in routing categorizes (Proactive, Reactive, Geographic-aware and Delay tolerant Networks (DTN)). The comparison of existing routing protocols in Mobile Ad-Hoc Networks indicates that overhead in Proactive and Geographic is competitive with delay in Reactive and DTN routing.

WITHDRAWN: Detection and elimination of black hole attacks in mobile ad hoc networks

Abstract Wireless Ad Hoc Network is a dynamically organized network on emergency situations, in which a group of wireless devices send data among themselves without requiring any base stations for forwarding data. Multi hop communication in MANET is achieved by the cooperation of nodes in forwarding data packets. This feature of MANET is largely exploited to launch a security attack called black hole attack. In this attack, the attacker sends a false route reply to the source node claiming the shortest path to reach the destination and attracts the data traffic towards it and drops all data packets without forwarding it to the destination. A light weight solution called SEC-DSR is proposed to defend the network from black hole attack and enables communication among nodes even in the presence of attackers. In this scheme, by analyzing only the control packets used for routing in the network, the compromised nodes launching the attack are identified. From the collective judgment by the participating nodes in the routing path, a secure route free of black hole nodes is selected for communication by the host. Simulation results validate and ensure the effectiveness of the proposed solution in the presence of black hole nodes. Also the proposed work achieves better throughput and better end-to-end delay in the presence of attack.

Cross Layer Approach and ANFIS based Optimized Routing in Wireless Multi-Hop Ad Hoc Networks

Mobile ad hoc networks are non-dependent on any wired infrastructure and provide exceptional benefits during typical situations like conference, fair/exhibition, disaster recovery and emergency rescue operations. But these networks have to deal with several open issues, since they are battery operated and the dynamic topology can change due to mobility. Thus, multi-hop wireless ad hoc networking needs an energy efficient routing protocol that discovers/maintains routes to any other member node in the network, minimizing computation/communication overhead and battery power consumption. An adaptive neuro fuzzy inference system (ANFIS) based ad hoc routing approach has not been investigated before. In this paper, an ANFIS and cross layer approach-based energy efficient routing protocol for wireless multi-hop networks is proposed and its performance is compared with the Ad Hoc On-demand Distance Vector (AODV) Routing Protocol and fuzzy based AODV, using the network simulator ns2. Using remaining battery power, hop count and link stability as the input variables, the ANFIS module computes the optimum path cost, as the output. The proposed ANFIS based approach produces better results when compared using the metrics: average throughput, packet delivery ratio, average end-to-end delay in packet delivery between source and destination and average routing overhead.

A Survey on Applications of Reinforcement Learning in Flying Ad-Hoc Networks

Flying ad-hoc networks (FANET) are one of the most important branches of wireless ad-hoc networks, consisting of multiple unmanned air vehicles (UAVs) performing assigned tasks and communicating with each other. Nowadays FANETs are being used for commercial and civilian applications such as handling traffic congestion, remote data collection, remote sensing, network relaying, and delivering products. However, there are some major challenges, such as adaptive routing protocols, flight trajectory selection, energy limitations, charging, and autonomous deployment that need to be addressed in FANETs. Several researchers have been working for the last few years to resolve these problems. The main obstacles are the high mobility and unpredictable changes in the topology of FANETs. Hence, many researchers have introduced reinforcement learning (RL) algorithms in FANETs to overcome these shortcomings. In this study, we comprehensively surveyed and qualitatively compared the applications of RL in different scenarios of FANETs such as routing protocol, flight trajectory selection, relaying, and charging. We also discuss open research issues that can provide researchers with clear and direct insights for further research.

Combining Power Allocation and Superposition Coding for an Underlay Two-way Decode-and-forward Scheme

Combining Power Allocation and Superposition Coding for an Underlay Two-way Decode-and-forward Scheme

Multi-objective cooperative medium access control protocols in wireless Ad-Hoc networks

Relay-based cooperative communications have been emerging as a novel paradigm in many wireless protocols. The IEEE 802.11 medium access control (MAC) protocols have attracted many cooperative techniques. The relay selection algorithms have a remarkable influence on the design and the performance of the cooperative MAC (CMAC) protocols. Most of the existing algorithms have been designed based on a single objective such as spectrum efficiency and energy efficiency. In this paper, two multi-objective CMAC protocols are proposed: FCGMAC and EECMAC. The FCGMAC employs a multiple relay selection algorithm providing the spectrum efficiency and fairness. The EECMAC exploits a single relay selection improving the energy efficiency and the spectrum efficiency. The proposed protocols have been simulated in the ns-3 network simulator and the simulation results indicate the improvement of network performance according to the design objectives.

WITHDRAWN: AODV_EXT_BP_DSR – A hybrid AODV and DSR protocol

Abstract Wireless Adhoc Networks have the advantage of differentiation to other new organization advances, for example, Internet Protocol (IP) or cell administrations. MANET is an independent network of Smartphone clients who associate in a similarly restricted width of remote contact with helpless battery power and complex conditions. Be that as it may, a tone was proposed for adhoc steering conventions. Yet, in these adhoc steering conventions there are likewise numerous issues. This paper presents a half breed AODV_EXT_BP_DSR convention. This convention contains all the characteristics of AODV convention and DSR convention. This proposed convention has better information directing due to AODV convention. Additionally it has better dependability as a result of DSR convention. It likewise improves energy utilization and information transmission proficiency by utilizing the idea of Bayesian probability hypothesis.

Intrusion detection in mobile ad-hoc network using Hybrid Reactive Search and Bat algorithm

PurposeThe mischievous nodes that defy the standard corrupt the exhibition of good nodes considerably. Therefore, an intrusion discovery mechanism should be included to the mobile ad-hoc network (MANET). In this paper, worm-hole and other destructive malignant attacks are propelled in MANET.Design/methodology/approachA wireless ad-hoc network also called as mobile ad-hoc network (MANET) is a gathering of hubs that utilizes a wireless channel to exchange information and coordinate together to establish information exchange among any pair of hubs, without any centralized structure. The security issue is a major difficulty while employing MANETs.FindingsConsequently, the attacks due to the malicious node activity are detected using Hybrid Reactive Search and Bat (HRSB) mechanism to prevent the mischievous nodes from entering the network beneath the untruthful information. Moreover, the attack detection rate and node energy are predicted for determining the lifetime of the node.Originality/valueThe simulation outcomes of the proposed HRSB technique are evaluated with the prevailing methods. The comparison studies have proven the efficacy of the current research model by attaining high attack detection rate and achieving more network lifetime.