Traditional Mobile Ad Hoc Network Research Articles

Empowering Manets with Advanced Multimodal Biometric Authentication and Encryption

In a mobile ad hoc network (MANET), nodes communicate wirelessly, facing unique challenges. Traditional MANETs suffer from issues like erroneous transmission and vulnerability to unauthorized nodes joining the network, posing security risks. Authentication within MANETs is a significant security concern, prompting ongoing research for enhancements. Our solution integrates multimodal biometric authentication with RSA and AES encryption, providing robust security for user authentication and data protection in MANETs. This approach effectively addresses risks such as unauthorized access and data tampering, crucial for secure communication in dynamic, resource-limited MANET environments. Our proposed system utilizes a combination of face and fingerprint biometrics for encryption, enhancing network security. Through testing, our system demonstrates a high authentication rate of 92.42% with minimal processing times: 0.042 ms for key generation, 0.019 ms for encryption, and 0.032 ms for decryption, based on a 1024-bit key size. These practical results showcase the resilience and efficiency of our secure system.

Design of Mobile ad-hoc network scheme based on SDN

With the expansion of application scale, the network structure and organization mode of traditional MANET are limited by factors such as bandwidth optimization, power control and node mobility. The stability of network performance and the use efficiency of upper layer applications are also seriously affected. In order to solve this problem, Mobile ad hoc network (MANET)scheme based on SDN is proposed to establish a flexible and programmable data forwarding mechanism in MANET. The dynamic deployment mechanism of network functions and the globally consistent cooperative control mechanism realize the global network performance optimization and efficient management control. Finally, the test shows that SDMENT improves the flexibility of MANET network and makes the software of MANET have the significance of engineering application.

A fuzzy based Co-Operative Blackmailing Attack detection scheme for Edge Computing nodes in MANET-IOT environment

Smart cities have been developed with the help of large scale Internet of Things (IoT) device deployment. Under the combination of IoT and traditional Mobile ad-hoc network, the developers could design the communication model for smart city. The increased deployment of IoT devices in smart environment also raised the security and Quality of Service (QoS) related issues. The proposed, Secure approach for Smart city Environment by Accusation based List management (Secure SEAL) primarily explores the various chances of disruption in IoT network caused by co-operative attacks at the edge nodes. The internal co-operative attack is a type of attack which is jointly performed by a group of nodes in IoT network. There is no fine-grained technique to defend against co-operative attacks. To this end, a fuzzy based trustworthy environment is established for reducing the security threats in smart cities with the help of Edge Computing. The trustworthy environment ensures the timely identification of malicious entities and the detection of co-operative attacks. In Edge Computing, the computations required to perform at the end devices can be placed at Edge servers. This will reduce the expected latency and bandwidth utilization required for traditional cloud access. Secure SEAL uses a fuzzy based approach to avoid and isolate the presence of malicious nodes in IoT network. The suspected nodes are re-analyzed based on the reputation value obtained by reaction based trust evaluation. Eventually, the performance of the proposed trustworthy environment has been validated. The proposed work’s efficacy in minimizing the impact of co operative attacks (more than 90%) is comparatively high.

A Routing Optimization Method Based on ACA for FANETs

Routing algorithm is an important factor and a key technology for Flying Ad hoc Networks (FANETs), which can safeguard FANET network communication. In FANETs, the fast-changing nature of FANET network topology makes the traditional Mobile Ad-hoc Networks (MANET) network routing algorithm not directly usable, which leads to challenges for the design of routing algorithms. In this paper, when the FANET nodes need to communicate, the route search program performs route search based on the ant colony algorithm, so as to obtain a stable route with high efficiency. Making use of NS3 for simulation of ACA, Dynamic Source Routing (DSR), and Ad hoc On demand Distance Vector Routing (AODV), the results of simulation show that ACA can improve FANET performance.

Intrusion Detection for Mobile Ad Hoc Networks Based on Node Reputation

The mobile ad hoc network (MANET) is more vulnerable to attacks than traditional networks, due to the high mobility of nodes, the weakness of transmission media and the absence of central node. To overcome the vulnerability, this paper mainly studies the way to detect selfish nodes in the MANET, and thus prevent network intrusion. Specifically, a data-driven reputation evaluation model was proposed to detect selfish nodes using a new reputation mechanism. The mechanism consists of a monitoring module, a reputation evaluation module, penalty module and a response module. The MANET integrated with our reputation mechanism was compared with the traditional MANET through simulation. The results show that the addition of reputation mechanism can suppress the selfish behavior of network nodes and enhance network security.

A probabilistic home-based routing scheme for delay tolerant networks

In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.

A Novel Approach to Comparative Analysis of Legacy and Nature Inspired Ant Colony Optimization based Routing Protocol in MANET

Performance, scalability, Quality of Service (QoS), users’ response, etc. of any network depends upon the efficient network design and communication technologies being exploited. Mobile Ad hoc Networks (MANETs) have become widespread due to their zero-configuration requirements, scalability, maintenance and adaptable nature to cater varying requirements. The core process of any network is routing which is performed by routing protocols. Routing protocols play a crucial role to enhance and improve the performance indicators of any network. Traditional MANET routing protocols have been failed to address growing demands of wireless mobile ad hoc network. In this paper we study and compare a nature inspired Ant Colony Optimization (ACO) algorithm with legacy of MANET protocols. Simulation results show that ACO algorithm has high potential to be used in large scale MANET or other wireless networks. We compared ACO with proactive and reactive routing protocols because despite of their weaknesses these types of protocols are still being used in different and same wireless arrangements.

The Dynamic Routing Protocol Implementation Strategy of the Cooperative Control Awareness Combat Network

In view of the problem of dynamically setting up a fire aiming data chain between the sensors and the shooters in the same battle echelon in the awareness combat network (ACNET) of the future unmanned collaborative combat system, based on the wireless mobile Ad-hoc network technology, a closed loop routing control model is built, in which the information transmitted in the ACNET is regarded as a continuous fluid according to the requirement of the transmission packet and its link state. Based on this model, a high-speed mobile dynamic real-time routing protocol (HDRRP) and its implementation method are proposed. The routing strategy combines the cellular network and Ad hoc to design a node state routing and mobile cellular routing mode and algorithm, and automatically selects the corresponding routing algorithm according to priority. Thus, the sensing information and the combat target strike are organically integrated, and the data are delivered at high speed and in a real-time, dynamic, and reliable way. The simulation results show that this protocol can greatly improve the packet delivery rate, and compared with the traditional wireless mobile Ad-hoc network, it can shorten the transmission delay, has a better anti interruption performance, and reduces control overhead, route discovery time, and routing maintenance time.

Jointed Energy Saving and Cluster Route in the Mobile Ad-HOC Network

The LNCR-IDS for the mobile Ad-HOC network is put forward for the problem that the redundancy clusters are adverse to energy saving because leaf node independent clusters exist in the CHS and cluster partition in the traditional mobile Ad-Hoc network containing IDS. Firstly, make analysis on the traditional random cluster partition method and find that the method easily results in the problem of redundancy partition, put forward the new method which carries out cluster partition starting from the leaf node, try to solve the problem of redundancy of cluster partition, so as to lower the energy consumption; secondly, make analysis on the realization of algorithm, construct the algorithm of single node elimination and give the process of cluster partition via simple analysis example in allusion to the proposed method; finally, carry out simulation comparison with the existed algorithm via the experimental platform created, the proposed algorithm should be about 30% less than the comparing algorithm in the number of clusters, which is beneficial to the improvement of network service life.

Context aware routing management architecture for airborne networks

Military environments require highly dynamic mobile ad hoc networks (MANETs) to meet operational mission requirements. Decision makers rely on the timely delivery of critical battlefield information to make informed determinations quickly and as accurately as possible. However, traditional MANET routing protocols do not provide quality of service (QoS). Furthermore, they do not implement active controls to minimise the impact of network congestion. This study proposes the use of the information embedded in an air tasking order (ATO) during the planning phase of military missions to optimise the network performance. The trajectories of relevant nodes (airborne platforms) participating in the MANET can be forecasted by parsing key information contained in the ATO. Using this idea it is possible to optimise network routes to minimise edge overutilisation and increase network throughput. In one simulated test case, there was a 25% improvement of network throughput, and 23% reduction on dropped packets. Using this technique, the authors can selectively preserve the QoS by establishing network controls that drop low-priority packets when necessary. The algorithm improves the overall MANET throughput while minimising the packets dropped due to network congestion.

Efficient Mechanisms and Performance Analysis of Routing Protocols in VANETs for Realistic Scenarios

Vehicular Ad Hoc Networks (VANETs) are considered as a special case of mobile Ad Hoc Networks (MANETs) and are recently gaining a great attention from the research community. The need for improved road safety, traffic efficiency and direct communication along with the great complexity in routing, makes VANETs a highly challenging field. Routing in VANETs has to adapt to special characteristics such as high speed and road pattern movement as well as high linkage break probability. In this work, the authors show that traditional MANET routing protocols cannot efficiently handle the challenges in a VANET environment and thus need further modifications. For this reason, they propose and implement an enhancement mechanism, applied to the GPSR routing protocol that adapts to the needs of a VANET. The proposed mechanism's performance is evaluated through simulation sets for urban and highway scenarios and compared to the performance of the most common MANET routing protocols adopted in VANETs. The proposed enhancement is shown to be considerably beneficial and it significantly outperforms the rest of the tested routing protocols for almost every topology setting.

An Efficient Hybrid MANET-DTN Routing Scheme for OLSR

This paper presents a new hybrid protocol which combines the end-to-end routing of traditional wireless mobile ad-hoc networks (MANETs) with the store-carry-forward routing paradigm of delay-tolerant networks (DTNs). An extensive evaluation over a wide range of topologies, from highly connected to highly disconnected typologies, shows that this protocol can significantly improve performance in most cases. This newly developed protocol is named OLSR-Opportunistic (OLSR-OPP), and is an extension of the optimised link state routing (OLSR) protocol. Our newly proposed protocol combines the efficiency of the OLSR-based MANET end-to-end routing and the flexibility of the store-and-forward concept of DTNs. Our protocol functionality was validated with a simple scenario setup and worked according to our specification. We then extensively evaluated our proposed protocol over a systematically selected range of topologies and mobility scenarios, ranging from very high to very minimal network connectivity, and effectively demonstrated its significant improvement in terms of packet delivery ratio over traditional MANET and DTN routing. The simulation result shows that the OLSR-OPP significantly outperforms the original OLSR and DTN spray-and-wait protocol. The results further demonstrate the trade-off between protocol performance and overheads via the tuning of the copy_count OLSR-OPP protocol parameter.

Efficient Packet Routing in Highly Mobile Wireless Networks

Traditional mobile ad-hoc network (MANET) and delay tolerant network (DTN) routing schemes work properly only under the limited assumptions. MANET routing schemes are designed for densely populated networks while DTN routing schemes were developed for dealing with intermittently connected topologies. However, in a real environment, the assumption cannot be hold: the density of nodes constantly changes and a network can be separated due to node mobility even when it is composed of large number of nodes. We propose a routing scheme for maximizing the delivery rate in a network with varying density. In the proposed scheme, data packets are used to search an available path while they are delivered by DTN-based routing. If a path exists, subsequent packets are relayed along the path. Otherwise, packets are delivered continuously using DTN-based routing. Using simulation we show that the proposed scheme achieves high throughput and a low overhead in a dense part of the network, while it outperforms existing DTN routing schemes in an intermittently connected situation.

Survey of buffer management policies for delay tolerant networks

Delay tolerant networks (DTN) are a class of networks that are a subset of the traditional mobile ad-hoc networks. It differs from mobile ad hoc networks (MANETs) in the sense that it can withstand high delays in delivering data because of frequent network partitions, limited bandwidth and storage constraints persisting in such networks. Owing to these inherent characteristics of the delay tolerant networks improving delivery ratio in such networks depends on two main factors-use of routing strategy and a good buffer management policy. Many routing protocols have been proposed in the literature for DTN. Buffer management is a very important factor in DTN because of the very limited buffer space available in DTN nodes. Although a scheduling policy in DTN determines which message has to be forwarded first, the dropping policy decides which messages are to be dropped in case of buffer overflow. This Letter presents a survey of the existing buffer management policies proposed for DTN and discusses the pros and cons of these approaches. The buffer management techniques have been classified on the basis of information used by them whether they are based on local information of messages available at the node or global information of all the messages in the network.

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.

Declarative Policy-Based Adaptive Mobile Ad Hoc Networking

This paper presents DAWN, a declarative platform that creates highly adaptive policy-based mobile ad hoc network (MANET) protocols. DAWN leverages declarative networking techniques to achieve extensible routing and forwarding using declarative languages. We make the following contributions. First, we demonstrate that traditional MANET protocols can be expressed in a concise fashion as declarative networks and policy-driven adaptation can be specified in the same language to dictate the dynamic selection of different protocols based on various network and traffic conditions. Second, we propose interprotocol forwarding techniques that ensure packets are able to seamlessly traverse across clusters of nodes running different protocols selected based on their respective policies. Third, we have developed a full-fledged implementation of DAWN using the RapidNet declarative networking system. We experimentally validate a variety of policy-based adaptive MANETs in various dynamic settings using a combination of ns-3 simulations and deployment on the ORBIT testbed. Our experimental results demonstrate that hybrid protocols developed using DAWN outperform traditional MANET routing protocols and are able to flexibly and dynamically adapt their routing mechanisms to achieve a good tradeoff between bandwidth utilization and route quality. We further demonstrate DAWN's capabilities to achieve interprotocol forwarding across different protocols.

A virtual multiple message ferry backbone routing scheme for mobile ad-hoc networks

A MANET (Mobile Ad-Hoc Network) consists of relocating wireless communication devices without infrastructure installed in its network environment. Due to the mobility of the devices, the network topology changes frequently and consequently results in poor network performance. When the density of nodes in a MANET is sparse, the performance becomes even worse due to the intermittent connected routing problem arising. To cope with this problem, this paper integrates mechanisms of Virtual Multiple Message Ferry Routing (VMMFR) and Virtual Multiple Message Ferry Dispatch Scheduling (VMMFDS) into the routing protocol design of MANETs and proposes a Virtual Multiple Message Ferry Backbone Routing (VMMFBR) scheme for MANETs. Several simulations have been conducted using the network simulator NS-2 to evaluate the performance of the proposed VMMFR mechanism. Due to the VMMFR mechanism providing a reliable and predictable backbone routing for MANETs communications. The results show that the proposed method has a higher packet delivery ratio, low bandwidth consumed, and that there is greater precision of packet delivery time, compared to the traditional MANETs routing protocols (AOMDV and DSR). In addition, some theoretical results for the proposed VMMFDS mechanism to minimize the transfer waiting time are also given in this paper.

Enhancing mobile <italic>ad hoc</italic> networks with free-space optics

A mobile ad hoc network (MANET) offers a cost-effective solution for communications in areas where infrastructure is unavailable, e.g., emergency response, disaster recovery, and battlefield scenarios. Traditional MANETs operate in the radio frequency (RF) spectrum, where the available bandwidth faces the challenge of rapidly increasing demands. Free-space optics (FSO) provides an attractive complement to RF wireless MANETs because of its high bandwidth and interference-free operation. We have made an effort to combine the main advantages of MANET and FSO technologies by equipping the network nodes with hybrid communications capabilities. Computer models of such a network were created using the network simulator OPNET Modeler. Various indicators of network performance, including packet loss ratio, end-to-end delay, throughput, etc., were obtained through simulation and examined. The analysis will be of significant assistance in the design and implementation of such next-generation MANETs.

Hybrid Optimize Strategy based QoS Route Algorithm for Mobile Ad hoc Networks

It is very difficult to find feasible QoS (Quality of service) routes in the mobile ad hoc networks (MANETs), because of the nature constrains of it, such as dynamic network topology, wireless communication link and limited process capability of nodes. In order to reduce average cost in flooding path discovery scheme of the traditional MANETs routing protocols and increase the probability of success in finding QoS feasible paths and we proposed a heuristic and distributed route discovery method named RLGAMAN that supports QoS requirement for MANETs in this study. This method integrates a distributed route discovery scheme with a reinforcement learning (RL) method that only utilizes the local information for the dynamic network environment; and the route expand scheme based on genetic algorithms (GA) method to find more new feasible paths and avoid the problem of local optimize. We investigate the performance of the RLGAMAN by simulation experiment bed in NS2. Compared with traditional method, the experiment results showed the network performance is improved obviously and RLGAMAN is efficient and effective.