Mobile Ad Hoc Networks Environment Research Articles

A Comprehensive Survey on Cryptography Evaluation in Mobile (MANETs)

With the rapid development in network technology new network types based on wireless communication have emerged. A large family of wireless communication networks is the Mobile Ad hoc Networks (MANETs). While MANETs mobile devices should be able to connect with each other at any time and place, the vulnerabilities of MANET structure also introduce a wide range of attacks and present new challenges for the design of security mechanism ranging from developing and implementing lightweight cryptographic primitives to designing and analyzing secure protocols. Numerous security solutions and key management schemes such as symmetric and asymmetric cryptography have been used to support MANET environment. This paper conducted survey to gain a quick knowledge of security design demand and cryptography solutions to secure MANET. This survey focused on security schemas and case studies of cryptography techniques on Ad Hoc networks. Finally, conclusions are discussed.

An Efficient Route Failure Detection Mechanism with Energy Efficient Routing (EER) Protocol in MANET

Mobile ad-hoc network (MANET) is a network with two or more number of nodes with restricted energy constraint. The high dynamic nature in MANET attracts needs to consider the energy efficient features in their construct. The routing protocol is an important criterion to be considered for evaluating the performance of the MANET. Energy consumption plays vital role in MANET. Hence designing the scheme that supports energy efficient is much needed for the high dynamic MANET environment concerned. This paper proposes the Energy Efficient Routing (EER) protocol based on efficient route failure detection. The Scope of this paper is to suggest a fresh routing procedure for Mobile Adhoc Network minimizes unsuccessful communication. The projected procedure practices three important criterions to locate the path that assure authentic communication. The channel caliber, connection caliber and node’s residual energy is important reason for the failure of the node in MANET. Hence, the suggested routing mechanism believes these three different parameters to choose the finest node in the route. The reliable transmission and reception are attained by transferring information through route nominated by the suggested system verified by means of NS-2 simulator.

Nonorthogonal CSK/SS ALOHA system under MANET environment

Spread ALOHA systems that combine the spread spectrum techniques with the ALOHA system (a simple random access protocol without carrier sensing function) have been investigated as Mobile Ad-hoc Network (MANET) protocols. This paper presents the effect of the nonorthogonal Code Shift Keying Spread Spectrum (CSK/SS) ALOHA system on improving the throughput and delay performances of the spread ALOHA system under the MANET environment. The nonorthogonal CSK/SS system, which uses systematically-constructed nonorthogonal sequences, is one of the multilevel modulation systems for the spread spectrum technique with increasing the number of bits per frame. Optimum parameters can be used to obtain the best system performance; thus, this paper gives analytical expressions of the data transmission efficiency and delay property of the proposed scheme as a function of the system parameters under the assumption of no power control. Numerical results show that the nonorthogonal CSK/SS ALOHA system is useful in the MANET environment, compared with the conventional spread ALOHA systems.

Performance Evaluation of BDAG Aided Blockchain Technology in Clustered Mobile Ad-Hoc Network for Secure Data Transmission

In mobile ad-hoc network (MANET) environment, routing of data packets is a challenging task due to rapid changes in mobility and network topology. In addition, the security aspect of routing is disturbed by attacks caused by malicious nodes. These attacks greatly affect the Quality of Service. To overcome the challenges faced in routing message packets, the Bayesian Directed Acyclic Graph (B DAG) Aided Blockchain model is proposed for clustered MANET environment. The proposed model encompasses the following processes: (i) Multi factor authentication of users by using BLISS algorithm. This step involves acquisition of user credentials and generates hash values for those credentials using Cube Hash algorithm. These hash values are further used to generate public and private keys by BLISS algorithm, (ii) Weighted sum computation for clustering to reduce complexity in the MANET environment. Cluster head (CH) and cluster member (CM) are classified based on energy status, geometric distance, link quality and direction, (iii) A secure AODV based routing protocol using Dolphin Swarm Optimization (DSO) algorithm. This step involves selection of reputed node based on link stability, relative velocity, available bandwidth, energy, queue length, and trust. The packet forwarding is based on the reputation value of the node, by which the trust provided by malicious nodes are eliminated to improve security and (iv) Bayesian DAG aided blockchain, in which the user authenticity, data integrity of packets and signature are verified to mitigate the routing attacks created by nodes in the MANET environment. The proposed model is experimented in NS 3.26 network simulator tool and its performance in terms of multiple QoS metrics is evaluated.

WITHDRAWN: Improving privacy in SDN based MANET using hybrid encryption and decryption algorithm

Abstract Mobile ad hoc networks (MANETs) are becoming a realistic framework for extensive social networking. In this kind of system, different content flow of information in aspects of content query and reaction. To what extent it must be trusted by mobile users, while user privacy can also be maintained. In this work, we are proposing two mechanisms to deal with the problems mentioned above. Firstly, we propose a simple dual-key method based on fully homomorphic encryption, and then we can suggest a complex hybrid structure-based scheme incorporating a double decryption method with fully homomorphic encryption. To implement the above schemes, Software Define Network (SDN) controllers are placed in MANET environment. By using the above strategy, we can ensure that data encrypted with various keys and processes, including intermediate outcomes, will be secure and that the cost of computing and communication will be minimal.

Identification and eradication of attacker node in a mobile ad-hoc network environment using prediction model on delay factor

Mobile ad-hoc network (MANET) is a theoretical and experimental approach for achieving the applications to the best using VANETs. Given the mobility of nodes in the mobile ad-hoc networks, it is hard to depict the nature of the network or the structure of the network. With static nodes, it is easy to monitor a network. In a mobile environment, any node can come and join the network based on the distance covered by the entire network. A node that enters the region joins the network, while one that moves away leaves it and ceases participating in network communication. The routing table is updated, based on the movement of the nodes. Owing to the factors above, security fails to live up to expectations. Identifying a vulnerable node is a difficult proposition. This paper offers a prediction model based on the delay factor, which impacts the performance of the node and its network. The experimental results determine the malicious node. A malicious node is disconnected from the network.

A Blockchain-Based Computing Architecture for Mobile Ad Hoc Cloud

Mobile ad-hoc cloud can exploit the computing resources (e.g., smartphones, vehicles, and unmanned systems) scattered in the mobile environment to form a self-organized ad-hoc local resource pool for providing opportunistic computing services. However, the highly dynamic and distributed characteristics of the mobile ad-hoc network environment bring great challenges in privacy and security in such opportunistic resource sharing. In this article, we first discuss the attractive features of blockchain for providing such resource sharing services in the mobile ad-hoc network environment in a secure and trustful way and then discuss the problems caused when using existing consensus protocols in such an environment. We accordingly devise a blockchain based trustful mobile ad-hoc cloud architecture, AdChain cloud. We describe the functions at different layers in this architecture, including the network layer, blockchain layer, and smart contract layer. To adapt to the high dynamics of the mobile ad-hoc network environment, we design a stability-aware consensus protocol at the blockchain layer. Simulation results show that our solution can achieve improved performance as compared with existing work.

Hexagonal Clustered Trust Based Distributed Group Key Agreement Scheme in Mobile Ad Hoc Networks

Secure and efficient group communication among mobile nodes is one of the significant aspects in mobile ad hoc networks (MANETs). The group key management (GKM) is a well established cryptographic technique to authorise and to maintain group key in a multicast communication, through secured channels. In a secure group communication, a one-time session key is required to be shared between the participants by using distributed group key agreement (GKA) schemes. Due to the resource constraints of ad hoc networks, the security protocols should be communication efficient with less overhead as possible. The GKM solutions from various researches lacks in considering the mobility features of ad hoc networks. In this paper, we propose a hexagonal clustered one round distributed group key agreement scheme with trust (HT-DGKA) in a public key infrastructure based MANET environment. The proposed HT-DGKA scheme guarantees an access control with key authentication and secrecy. The performance of HT-DGKA is evaluated by simulation analysis in terms of key agreement time and overhead for different number of nodes. Simulation results reveal that the proposed scheme guarantees better performance to secure mobile ad hoc network. It is demonstrated that the proposed scheme possesses a maximum of 2250 ms of key agreement time for the higher node velocity of 25 m/s and lower key agreement overhead. Also, the HT-DGKA scheme outperforms the existing schemes in terms of successful message rate, packet delivery ratio, level of security, computation complexity, number of round, number of exponentiations and number of message sent and received that contribute to the network performance.

A general framework of genetic multi-agent routing protocol for improving the performance of MANET environment

These days, the fields of Mobile Ad hoc Network (MANET) have provided increasing prevalence and consequently, MANET is now a subject of considerable significance for the researchers to instigate research activities. MANET is the collaborative commitment of an assemblage of portable (or mobile) hubs (or nodes) without the necessary mediation of any unified (or centralized) gateway (or access point) or existent framework. There exists a growing inclination or course to embrace MANET for business utilization. MANET is a rising domain of research to give different services in communication to end-clients or consumers. However, these communication services of MANET utilize a large amount of transfer speed (or bandwidth) and a huge measure of web speed. Bandwidth optimization is essential in different information interchanges for fruitful acknowledgement and the application of such a technological innovation. This paper integrates the Genetic Algorithm (GA) and the Multi-Agent System (MAS) to improve the QoS requirements. The proposed framework called Genetic Multi-Agent Routing Protocol (GMARP). The aims of the proposed framework are to utilize the benefits of both approaches in order to fulfil QoS such as (delay, bandwidth, and the number of hops) in the different types of routing conventions (or protocols) such as being (proactive and reactive). In this paper is a simulation scenario to demonstrate the ability of the proposed framework to be satisfied with QoS requirements.

A-CAFDSP: An Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy

In today’s modern era, the multi-path communication paradigm is becoming prominent in supporting multi-media applications due to its dazzling features of improved network’s resilience, reliability, and performance. Specifically, wireless (environments) networks are intended to become typically reliant on the idea of multi-pathing for efficient traffic balancing which ultimately helps in achieving good performance. Although single-path communication is a promising paradigm for supporting multi-media applications but because of its incompetence in providing significant fault-tolerance demands, it is unable to satisfy the good Quality of Service (QoS) and Quality of Experience (QoE) requirements for such applications. Hence, traffic allocation and provisioning in the Mobile Ad-hoc Networks (MANETs) environment, considering the dynamic and dissimilar wireless channel characteristics of paths’ and inadequate offered resources (i.e., buffer) in nodes over those paths’, is a challenging job. Nevertheless, current works on traffic allocation addresses the data scheduling provision without considering the dissimilar wireless channel characteristics and background traffic of paths’ respectively. To address the problem of abrupt data scheduling policy, we propose, a novel Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy (A-CAFDSP) which takes care of each path’s data carrying capacity, dissimilar characteristics and background traffic intensity respectively and ultimately makes data scheduling adaptation decisions to select the efficient paths for concurrent transmissions. Indeed, A-CAFDSP includes the paradigm to concurrently distribute the data packets over multiple available network paths using Fibonacci sequence wisely and regulate the traffic of each available network path individually. Moreover, current works simply adopts and have evaluated their approach on the idealized propagation (radio) prototype without considering fading effects. However, we have evaluated our proposed method in fading environment and all the competent multiple available paths are within the interference ranges of each other hence, the inter-flow interference does exist in our simulation, which certainly gives us the correct idea that how our proposed method works in realistic wireless environment. The simulation results indicate that the performance of A-CAFDSP is better than existing conventional (single-path) and multi-path approaches in terms of average throughput, packet delivery ratio (PDR) and normalized load.

Methodologies for calculating decision-related event occurrence times, with applications to effective routing in diverse MANET environments

To capture the dynamics of context-aware decision making for network functions in Mobile Ad Hoc Networks (MANETs), the paper introduces the concept of Decision-Related Event Occurrence Times (DREOTs). By considering a generic scenario, the paper develops a broadly applicable analysis methodology, which produces upper and lower bounds for the tail probabilities and moments of a DREOT. The nature and effect of the decision is abstracted away to quantities called ‘decision policy impact descriptors’. These are calculated on a case-by-case basis, by considering properties of the specific decision policy and mobility pattern in hand. The power of the approach is demonstrated through a detailed application targeting the analysis of a preexisting routing protocol that bases its next hop forwarding decisions on the location and motion of the neighboring nodes. In the considered application the DREOT represents the time a node retains a message before forwarding it to the next hop and the network nodes move according to the Random Direction mobility model. The proposed methodology is seen to bring more rigorous understanding of the relationship between the retaining time and the relevant context and to yield refined expressions, whose use improves the protocol’s performance for all network conditions in a very diverse set. Furthermore, the broad applicability of the methodology is illustrated through a brief discussion of another application, not related to routing.

Penalty Based Reliable Cooperative Intrusion Detection System for Mobile Adhoc Network Environment

Intrusion detection is the process of finding the malicious behaviour happening in the network to enhance the network performance. This is the most focused research by various researchers to ensure the secured network to the users for increasing their satisfaction level. This is achieved in the previous work by introducing the method namely Cooperative intrusion detection system (CIDS). However this research method doesn’t focus on selfish node presence which might affect the overall intrusion detection process. There is a chance of that monitoring node also can act as selfish node. This is resolved in the proposed work by introducing the method namely Penalty based Reliable Cooperative Intrusion Detection System (PR-CIDS). In this work, initially monitoring nodes are selected optimally by using modified artificial bee colony algorithm through which intrusion detection will be performed. Here intrusion detection is performed based on variation in the forwarded traffic. In order to avoid the selfish node presence, in this work unique secret keys are generated for each monitoring node by using which intrusion decision will be encrypted and then send to the third party node. Here third party node will authenticate the node and then will utilize the intrusion information to make the final decision. Third party node plays more important role in making the intrusion decision. Thus the most suitable third party node is selected by using Hybrid Ant colony with Genetic method. Based on this decision, penalty will be assigned to the selfish monitoring nodes. The overall evaluation of the research work is done in the NS2 simulation environment to prove their performance improvement.

A Literature Review on Collaborative Caching Techniques in MANETs: Issues and Methods used in Serving Queries

Collaborative cache management in Mobile Ad Hoc Networks (MANETs) environment is considered as an efficient technique to increase data accessibility and availability, by sharing and coordination among mobile nodes. Due to nodes’ mobility, limited battery power and insufficient bandwidth, researchers addressed these challenges by developing many different collaborative caching schemes. The objective of this paper is to review various collaborative caching techniques in MANETs. Collaborative caching techniques are classified by methods used in serving queries, such as: hop-by-hop discovering, broadcasting messages, flooding, and query service differentiation. This review reveals that techniques utilizing hop-by-hop methods have better performance compared to others, especially techniques using additional strategies.

A hotspot-based probabilistic cache placement policy for ICN in MANETs

Cache placement is an integral part of information centric networking (ICN) for optimizing the performance of network. The majority of the existing research on cache placement explores fixed or semi fixed network. The present study proposed a cache placement/update policy in a mobile ad-hoc network (MANET) environment, where the consumers and providers of information are constantly moving. On the basis of request probability and transition probability analysis, a novel approach called cache rebalancing is projected to deal with the cache placement/update problem between different regions. Besides, this study also assesses the performance of the proposed approach in comparison with current caching scheme in large-scale real urban mobility traces, demonstrating that our approach are advantageous in hit ratio, hop count, and other performance indexes over previous strategy. Moreover, the cache steady state of our approach is also obtained to demonstrate the request probability in any region.

Efficient framework for processing top-k queries with replication in mobile ad hoc networks

This article addresses the top-k query processing problem on mobile ad hoc networks (MANETs). Top-k query processing is common to retrieve only highly important data items. However, methods for top-k query processing are not enough efficient and accurate in MANET environments. For improving the efficiency and accuracy, replication is a promising technique that each node in MANETs replicates data items retained by other nodes into its storage. Therefore, we fully combine the top-k query processing with data replication. We propose a framework that efficiently processes top-k queries based on a new replication strategy. We develop new replication strategy FReT (topology-Free Replication for Top-k query). FReT determines near-optimal allocations of replicas. It advantages efficient top-k query processing from limited search area without maintenance costs even if mobile nodes move. Our top-k query processing methods retrieve the exact answer with small overhead and delay by gradually increasing the search area based on FReT. We demonstrate, through extensive experiments, that FReT and query processing methods function well in terms of small delay and overhead without sacrificing exactness of the query result.

TRUST MODEL WITH DEFENSE SCHEME IN MANETS

The reliability of delivering packets through multi-hop intermediate nodes is a significant issue in the mobile ad hoc networks (MANETs). The distributed mobile nodes establish connections to form the MANET, which may include selfish and misbehaving nodes. Recommendation based trust management has been proposed in the literature as a mechanism to filter out the misbehaving nodes while searching for a packet delivery route. However, building a trust model that relies on the recommendations from other nodes in the network is vulnerable to the possible dishonest behaviour, such as badmouthing, ballot-stuffing, and collusion, of the recommending nodes. This paper investigates the problems of attacks posed by misbehaving nodes while propagating recommendations in the existing trust models. We propose a recommendation-based trust model with a defence scheme that utilises clustering technique to dynamically filter attacks related to dishonest recommendations within certain time based on number of interactions, compatibility of information and node closeness. The model is empirically tested in several mobile and disconnected topologies in which nodes experience changes in their neighbourhoods and consequently face frequent route changes. The empirical analysis demonstrates robustness and accuracy of the trust model in a dynamic MANET environment.

A Comparative Overview of Fuzzy Particle Swarm Optimization based Key Management Technique in Mobile Adhoc Network Environment

A Comparative Overview of Fuzzy Particle Swarm Optimization based Key Management Technique in Mobile Adhoc Network Environment

Exploiting frame aggregation and weighted round robin with beamforming smart antennas for directional MAC in MANET environments

The development of Directional Medium Access Control (DMAC) strategies that allow to enhance the limitations due to the use of omnidirectional antennas in Mobile ad Hoc Networks (MANET), introduces several issues that need to be properly addressed such as the Deafness problem. The use of Smart Antenna Systems (SAS) along with Directional Request To Send (DRTS) and Directional Clear To Send (DCTS) could be not sufficient to mitigate the Deafness. In this regard, a sectorized antenna approach together with a frame scheduling mechanism can improve the overall MAC performance while limiting the Deafness; however, the employment of scheduling algorithms without priority such as the Round Robin could limit the network performance especially in terms of Packet Delivery Ratio (PDR) and fairness. For this reason, we propose two approaches: the A-MSDU (Aggregation MAC Service Data Unit) MAC and a WRR (Weighted Round Robin) MAC that could allow to overcome the limitations of the Round Robin scheme applied at MAC layer in order to have an high efficiency in the overall resource allocation. More specifically, obtained results show that, through the use of frame aggregation, it is possible to considerably reduce issues implied by Round Robin such as time slice and network overhead; WRR approach, instead, is able to enhance the overall network fairness by reducing the number of collisions provided by a directional MAC based on Round Robin scheduling; this aspect translates into higher PDR performance compared to Round Robin approach.

Defending against false data attacks in 3D grid-based MANET using soft computing approaches

Quality of service (QoS) is one of the major factors for current applications in mobile ad hoc networks (MANET). Due to the limited wireless link capabilities, a path with heavy load will lost battery within short period of time and maximizes the possibility of path disconnection and packet drops. Hence, optimal path is necessary to increase residual energy of the node. Dual CHs are selected by mobile node energy level, distance and expected relative mobility. The dual CH selection considers the residual energy of nodes, average distance to neighbors and number of neighbor nodes. Previously proposed multipath routing techniques reduce network traffic among multiple routes paths instead of sending packets via only one path. There are two research issues are still arisen in multipath routing that are packet redundancy and quality. We address these issues in the proposed optimal routing paradigm where the best path is selected instead of routing among all available paths. We propose hybrid routing scheme that combines type 2 fuzzy logic system to find available paths from source to the destination node and particle swarm optimization to identify a best path among the selected paths. Due to the lack of central monitoring system in MANET, security breach called false data injection attack may occur. To reveal this task, false data predicted on the source digital signature by upcoming cluster member. We implement our proposed approach in 3D grid-based MANET environment using NS3.26. We also compare our proposed approach performance with the conventional 2D routing schemes. Finally, the proposed approach shows higher QoS than others.

COSTA: Composite Trust-Based Asset-Task Assignment in Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), asset-task assignment problems have been explored with vastly different approaches. Considering the unique characteristics of MANET environments, such as no centralized trusted entity, a lack of resources, and high-security vulnerabilities, resource allocation is not a trivial problem particularly for situations where a mobile team aims to successfully complete a common mission. The existing approaches have studied asset-task assignment problems by best matching a node's functionality and requirements of a given task. In this paper, we propose a task assignment protocol using the concept of multidimensional trust, namely, CompoSite Trust-based Assignment (COSTA), aiming to maximize the completion ratio of a common mission consisting of multiple tasks by balancing trust and risk in executing them. Based on the core concept of trust defined as the willingness to take the risk in performing a given task, COSTA selects qualified nodes for a given task while meeting an acceptable risk level for executing multiple tasks contributing to successful mission completion. Given a mission consisting of dynamic multiple tasks, we model each task with importance, urgency, and difficulty characteristics and use them for selecting qualified members. In addition, we model a node's risk behavior (i.e., risk-seeking, risk-neutral, and risk-averse) and investigate its impact on mission performance where a payoff is given for member selection and task execution. We formulate an optimization problem for the task assignment using integer linear programming (ILP). Our simulation results validated with ILP solutions demonstrate the existence of an optimal acceptable risk level that best balances trust and risk so as to maximize the mission completion ratio. We conduct a comprehensive comparative analysis and show that COSTA achieves a higher mission completion ratio while incurring a lower communication overhead compared with non-trust-based counterparts.