Management In Mobile Ad Hoc Networks Research Articles

Blockchain-Based Lightweight Trust Management in Mobile Ad-Hoc Networks.

As a trending and interesting research topic, in recent years, researchers have been adopting the blockchain in the wireless ad-hoc environment. Owing to its strong characteristics, such as consensus, immutability, finality, and provenance, the blockchain is utilized not only as a secure data storage for critical data but also as a platform that facilitates the trustless exchange of data between independent parties. However, the main challenge of blockchain application in an ad-hoc network is which kind of nodes should be involved in the validation process and how to adopt the heavy computational complexity of block validation appropriately while maintaining the genuine characteristics of a blockchain. In this paper, we propose the blockchain-based trust management system with a lightweight consensus algorithm in a mobile ad-hoc network (MANET). The proposed scheme provides the distributed trust framework for routing nodes in MANETs that is tamper-proof via blockchain. The optimized link state routing protocol (OLSR) is exploited as a representative protocol to embed the blockchain concept in MANETs. As a securely distributed and trusted platform, blockchain solves most of the security issues in the OLSR, in which every node is performing the security operation individually and in a repetitive manner. Additionally, using predefined principles, the routing nodes in the proposed scheme can collaborate to defend themselves from the attackers in the network. The experimental results show that the proposed consensus algorithm is suitable to be used in the resource-hungry MANET with reduced validation time and less overhead. Meanwhile, the attack detection overhead and time also decrease because the repetitivity of the process is reduced while providing a scalable and distributed trust among the routing nodes.

The clustering algorithm for efficient energy management in mobile ad-hoc networks

MANET (Mobile Ad-hoc Network) consumes much energy due to their dynamic capabilities, complexities, constraints of design such as lack of a specified communication infrastructure, and their change over time. One strategy to reduce energy consumption is to optimize routing in these networks, which is, in turn, one of the most important challenges in these networks. In addition, optimal routing will increase the network lifetime and lead to its stability. Considering the high efficiency of clustering methods among the routing algorithms we present a new clustering method and considering good performance of Evolutionary Algorithms (EAs) in finding proper head clusters, we present a specific EA-based method named ICA (Imperialist Competitive Algorithm) via numerical coding. By thinking of specific conditions of a MANET and estimating the mobility direction of nodes, we prevent from additional reclusterings leading to reducing the overload. We have evaluated our proposed method for: 1) accuracy (including the reproducibility, convergence and stability criteria) through three case studies with different numbers of nodes and ranges and 2) efficiency (by comparing to other methods). Moreover, we applied our proposed method to a case study (multi-robot system) with low velocity.

A reliable solution of path optimisation in LEACH protocol by implementing trust-based neural network

The mobile ad hoc networks (MANETs) are an infrastructure-less network consisting of a collection of wireless mobile self-directed nodes that communicate with each other without using any centralised authority. MANET is a network in which large numbers of powered mobile nodes are used but the network has always suffered from limited power resource problem due to the mobility nature of nodes. So, in the proposed work we have focused on the least power utilisation by developing an artificial intelligence-based enhanced leach (E-LEACH) routing protocol and designed a hybrid neuro-soft computing technique for the problem. The proposed solution is effective in solving the power resource problem and trust management in MANETs. This work has found a reliable solution to the route optimisation problem in E-LEACH protocol. The whole framework has been titled as energy efficient neuro genetic leach (EENG LEACH). Various performance metrics as throughput, bit error rate (BER), packet delivery ratio (PDR), congestion and energy consumption have been calculated to authenticate the proposed method.

Optimized power control and efficient energy conservation for topology management of MANET with an adaptive Gabriel graph

The dynamic nature of Mobile Ad hoc Networks (MANET) poses many challenges including effective management of scarce resources such as energy. Overall energy consumption of a network depends upon the transmission power of its constituent nodes and decides network lifetime. In this paper, a clustering based scalable topology control method, Optimized Power Control (OPC) is proposed to determine the optimal transmission power of nodes with the help of modified Gabriel Graph (GG) algorithm. OPC is tested for its efficiency in terms of various network parameters such as transmission power, per node energy consumption and network delay. Simulation results show that the proposed scheme is scalable and outperforms the existing schemes such as Local Tree based Reliable Topology (LTRT) and Distributed Power Management (DISPOW) in terms of the above-mentioned network parameters. Additionally, per node power level decision using OPC has been improved by approximately 7% in comparison to LTRT and DISPOW.

Learning Based Route Management in Mobile Ad-Hoc Networks

Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector, Optimized list state routing protocols, Ad hoc on demand routing protocol, dynamic source routing are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on Reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.

Data management issues in mobile ad hoc networks.

Research on mobile ad hoc networks (MANETs) has become a hot research topic since the middle 1990’s. Over the first decade, most research focused on networking techniques, ignoring data management issues. We, however, realized early the importance of data management in MANETs, and have been conducting studies in this area for 15 years. In this review, we summarize some key technical issues related to data management in MANETs, and the studies we have done in addressing these issues, which include placement of data replicas, update management, and query processing with security management. The techniques proposed in our studies have been designed with deep considerations of MANET features including network partitioning, node participation/disappearance, limited network bandwidth, and energy efficiency. Our studies published in early 2000’s have developed a new research field as data management in MANETs. Also, our recent studies are expected to be significant guidelines of new research directions. We conclude the review by discussing some future directions for research.

F3TM: Flooding Factor based Trust Management Framework for secure data transmission in MANETs

Due to the absence of infrastructure support, secure data dissemination is a challenging task in scalable mobile ad hoc networks (MANETs) environment. In most of the traditional routing techniques for MANETs, either security has not been taken into account or only one aspect of security concern has been addressed without optimizing the routing performance. This paper proposes Flooding Factor based Framework for Trust Management (F3TM) in MANETs. True flooding approach is utilized to identify attacker nodes based on the calculation of trust value. Route Discovery Algorithm is developed to discover an efficient and secure path for data forwarding using Experimental Grey Wolf algorithm for validating network nodes. Enhanced Multi-Swarm Optimization is used to optimize the identified delivery path. Simulations are carried out in ns2 to assess and compare the performance of F3TM with the state-of-the-art frameworks: CORMAN and PRIME considering the metrics including delay, packet delivery ration, overhead and throughput. The performance assessment attests the reliable security of F3TM compared to the state-of-the-art frameworks.

Certificate Less Key Management Scheme in Manet Using Threshold Cryptography

In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (IDPKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.

Modeling and Designing Resource Efficient Distributed MANET Management System (DMMS)

Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for management functions increases and become inefficient as it increases the power usage for processing. In this paper, we propose a distributed network management system where each network resource maintains a set of Management Information Base (MIB) elements and stores resource activities in their abstraction in terms of counters, flag and threshold values. The abstract data is exchanged between different management agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.

Alliance-based clustering scheme for group key management in mobile ad hoc networks

Several protocols have been proposed to deal with the group key management problem in mobile ad hoc networks (MANETs). Most of these protocols organize the network into clusters to reduce the cost of key refresh or rekeying. Rekeying constitutes a challenging issue in group key management because it must be launched whenever the constitution of the group is altered following a leave or a join operation. However, cluster maintenance may also generate significative communication overhead. So, the clustering algorithm is an important factor in the performance of any key management solution. A clustering algorithm that ensures stable clusters in spite of mobility is very appreciable in mobile ad hoc networks. In fact, all the overhead due to the traffic generated by cluster adjustments and the related rekeying procedures will be saved. As far as we know, no existing clustering algorithm takes into account self-stabilization while relying on the mobility resilience of graph alliances. In this paper, we propose a fully distributed and self-stabilizing clustering algorithm for key management in MANETs where each cluster is an alliance.

Secure and robust threshold key management (SRKM) scheme for ad hoc networks

AbstractSecuring Mobile ad hoc Networks (MANET) is a challenging task, notably due to the lack of an online infrastructure. In particular, key management in MANET is a problem for which many solutions have been proposed in literature. Unfortunately, these solutions are rather limited in terms of security and availability of keys. In this paper, we propose a secure, robust, and fully distributed scheme for public‐key certificate management in MANET. Our scheme, based on threshold cryptography, ensures that the private key of the certificate authority will not be revealed to an adversary, even if the number of compromised shareholders exceeds the threshold of vulnerability, thereby thwarting mobile‐adversary attacks. We describe SRKM in detail and, by using security analysis and simulations, show its effectiveness, robustness and security. Copyright © 2010 John Wiley & Sons, Ltd.

Providing internet connectivity and mobility management for MANETs

PurposeThe purpose of this paper is to describe the required functionalities on providing internet connectivity and mobility management for mobile ad hoc networks (MANETs), present discovered problems such as inconsistent contexts, and provide the corresponding solutions. It also provides a hybrid metric for the load‐balance of intra/inter‐MANET traffic over multiple internet gateways (IGWs).Design/methodology/approachThe paper uses both mathematical analyses and simulations to discover the required functionalities and problems on providing internet connectivity and mobility management for MANETs. The proposed hybrid metric for IGW selection is a replacement of the shortest hop‐count (HC) metric, and consider three factors: HC distance, intra‐MANET traffic, and inter‐MANET traffic.FindingsSimulation results show that ad hoc routing protocols, using the proposed metric, get better performance in terms of packet delivery ratio and transmission delay, at the cost of slightly increased signalling overhead.Research limitations/implicationsIn the assessment, simulation results are taken from two mobility scenarios, and the hybrid metric is integrated into only reactive ad hoc routing. Thus, more case studies need to be carried out to demonstrate the outcomes of the proposed metric compared with others.Practical implicationsThis paper provides the needed functionalities for broadening the richness of MANET applications to internet users, and vice verse.Originality/valueThis paper contributes to the research on internetworking and mobility management between MANETs and the internet.

Active PDP Discovery for the Policy Based MANET Management

A Policy-based Network Management (PBNM) in Mobile Ad-hoc Networks (MANETs) should be efficient and reliable. In this letter, we propose a mechanism for the policy-based management in ad hoc networks and we discuss methods to discover the Policy Decision Point (PDP), set the management area, and manage the movements of nodes in the PBNM system. Finally, we assess the results through simulations.

Using Resources as Synchronizers to Manage Mobile Process Adaptation

Process management in Mobile Ad-hoc NETworks (MANETs) has to deal with different types of tasks and resources. Teams can be formed with specific goals, such as recognition of a damaged area for disaster assessment, where each member of a team is assigned some task to be performed according to some policy. However, in real situations, it is possible that task assignments and policies have to be revised due to different causes. In addition to typical causes for dynamic changes in adaptive workflows, mobility introduces some specific problems, e.g. the need for new connectivity-maintaining tasks, or reassignment of tasks originally for members who have become unreachable, or who have no sufficient resources to complete the original plan. As these modifications occur dynamically, it is difficult to manage them through hard-coded programs. Rather, we propose the use of a rule-based formalism, expressed in terms of multi-set rewriting. This supports a resource-centered view, in which both data-dependencies between tasks and plan-dependent ordering of tasks are expressed as production and consumption of resources of different types. In turn, rules are themselves seen as resources, so that they are prone to the same rewriting process, in order to redefine process schemas. The paper illustrates these notions and formalisms, and shows some cases of their application.

Cost-effective mobile ad hoc networks management

As there are more and more mobile devices in use, different mobile networking models such as ad hoc or mesh are attracting a large research interest. Self-organizing mobile ad hoc networks (MANET) allow devices to share their services and resources without any central administration or Internet support. In this respect they can become the backbone of the wireless grid or the gateway to existing grids. To achieve these goals, MANET management must be as effective as that of wired networks. This is, however, a challenging task due to network features like mobility, heterogeneity, limited resources of hosts and feeble communication. This paper presents a set of simple, cost-effective and resilient procedures for the basic tasks of MANET creation and management.