Communication In Mobile Ad Hoc Networks Research Articles

A Policy Based Scheme for Combined Data Security in Mobile Ad hoc Networks

Problem statement: In Mobile Ad hoc Networks (MANET) routing protocols, we require a network-level or link layer security. Since without appropriate security provisions, the MANETs is subjected to attacks like network traffic, replay transmissions, manipulate packet headers and redirect routing messages. In order to address these needs, a policy based network management system that provides the capability to express network requirements is required. Approach: In this study, we propose a policy based scheme for combined data security which focuses mainly on three policies: Integrity, authentication and Confidentiality. For providing security not only to data, but also for routing information, we calculate the trust indexes of the nodes and the route is selected according to the trust value which improves integrity. Then in order to provide authentication, we propose a Distributed Certificate Authority (DCA) technique in which multiple DCA is required to construct a certificate. Next we propose an RSA based novel encryption mechanism in order to provide Confidentiality among the nodes. Thus, the desired level of security is provided by the system based on the policy of the user by executing the corresponding security modules. Results: By simulation results, we show that this scheme provides a combined data security in MANETs and can be used efficiently. Conclusion: Our proposed combined data security policy provides complete protection for the data in MANET communications.

Analyzed Virtual Routing Protocol for Future Networks (MANET & topological network)

The mobile ad-hoc network (MANET) is a wireless unstructured network and this has mostly suggested for multimedia streaming efficiency. The hackers attacks are reduce the capacity and efficiency of network in MANET. There are various types of protocol are used for the communication in MANET, but security is lacking in those techniques and some insoluble problems present in MANET. In this paper exhibits, a layered protocol network for secured data transmission called Analyzed Virtual Routing Protocol (AVRP). This protocol used to provide more secured data transmission and this not disturbing data streaming in the network.

Securing Mobile Ad hoc Networks: Key Management and Routing

Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in network's topology causes weak trust relationship among the nodes in the network. In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenario occurs for communication in MANETs; where there may be one or more malicious nodes in between source and destination. A routing protocol is said to be secure that detects the detrimental effects of malicious node(s in the path from source to destination). In this paper, we proposed a key management scheme and a secure routing protocol that secures on demand routing protocol such as DSR and AODV. We assume that MANETs is divided into groups having a group leader in each group. Group leader has responsibility of key management in its group. Proposed key management scheme is a decentralized scheme that does not require any Trusted Third Party (TTP) for key management. In proposed key management system, both a new node and group leader authenticates each other mutually before joining the network. While proposed secure routing protocol allows both communicating parties as well as intermediate nodes to authenticate other nodes and maintains message integrity

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.

QoS Routing in Mobile Ad-hoc Networks using Agents

Quality of Service (QoS) provisioning in a Mobile Ad-hoc Network (MANETs) routing for multimedia traffic is a challenging task due to dynamic topology of such networks. Fuzzy Logic (FL) were used for QoS prediction from current uncertain QoS constraints in the network for particular applications, from these uncertain constraints there is an error at the QoS prediction. To overcome this error, we proposed an intelligent system called ”Neuro-Fuzzy” (NF) system. Our proposed scheme optimizes the uncertain weights before QoS prediction using Error Back Propagation (EBP) algorithm, this optimization is done till to get acceptable error limit. From these optimized weights we can predict more accurately and hence, we can provide the well quality of service to the user. And also to provide real-time communication in MANETs, we used software agents.

A Cluster-Based Reliable Token Circulation Scheme for Group Communication in MANET

Providing a reliable group communication in a mobile ad hoc network (MANET) is a challenging task. The dynamic nature of this network makes it highly unreliable. Moreover, the future MANETs such as military applications are so large that the disaster recovery scenes would become unmanageable. For better utilization of the system, nodes within the close proximity need to communicate with each other quite often than those which are far apart. To address these issues and to provide a reliable and manageable group communication, this paper proposes a novel token circulation scheme using an adaptive secondary clusterhead-aided clustering algorithm. The token circulation scheme handles token loss and node failures, while the clustering algorithm provides variable diameter clusters, within which group communication is provided. The primary clusterhead is chosen according to the connection degree and mobility of each node. A secondary clusterhead is also set inside each cluster to take charge of part of the duties of the primary clusterhead, such as clustering functionalities, storage of information relating to clustering, token monitoring, etc. Criteria for comparing the algorithms with the existing algorithms include the average time required to complete a round, number of bytes sent per round, number of nodes visited per round, member change frequency in clusters and rate of change of clusterheads. Simulation results show that the proposed token circulation scheme in combination with the clustering algorithm gives better results in comparison with the existing schemes.

Efficient Security for Mobile Ad-Hoc Network

An Ad-hoc network is a dynamically changing network of mobile nodes that communicate without the support of a fixed network. Due to lack of centralized control, secured communication in mobile Ad-hoc network is important matter due to dynamic nature of the network topology. MANETs is affected by new security problems in addition to the problems of regular networks. In this paper, we introduce an efficient security AODV algorithm to enhance the data security in the network. To generate the private key ECDSA algorithm is used. Simulation result shows that our protocol gives better performance than the previous one.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks (MANETs) cause several vulnerabilities, anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns. Until recently, lots of anonymous routing protocols have been proposed. However, most of them are single path or use one path at a time, and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously. Thus an anonymous multipath routing protocol based on secret sharing is proposed. The protocol provides identity anonymity, location anonymity, data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process. Meanwhile, a hash function is introduced to detect active attacks in the data transmission process. The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks (such as interception and physical destroy attacks). Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

Distributed Fault-Tolerant Quality of Wireless Networks

A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology by means of any of several wireless communication media. MANET communications represent a diversification in communication technology necessary to solve the stringent end-to-end requirements of QoS-based communication networks. Of the many challenges in this complex distributed system, the problem of routing based on a predefined set of customer preferences, critical to guaranteeing quality-of-service, is the focus of this research. Specifically, this paper modifies a cluster-based QoS routing algorithm for mobile ad hoc networks with the aim of providing fault tolerance, which is a critical feature in providing QoS in the link failure-prone environment of mobile networks. Performance of this new fault-tolerant cluster-based QoS wireless algorithm is evaluated according to failure recovery time, dropped packets, throughput, and sustained flow bandwidth via simulations involving node failure scenarios along QoS paths.

A dynamic route change mechanism for mobile ad hoc networks

A mobile ad hoc network (MANET) is a self-configuring network of mobile devices connected by wireless links. Frequent topology changes and limited bandwidth make communication in MANETs particularly challenging. We present a MANET routing protocol that can efficiently handle network mobility by a way of preemptively switching to a better route before the current route fails. The protocol uses a distributed Q-learning algorithm to infer network status information and takes in to consideration link stability and bandwidth efficiency while selecting a route. We study the performance of this protocol through simulation and demonstrate its advantages over existing protocols.

A Novel Group Key Establishment Scheme for MANETs

In mobile ad hoc networks (MANETs), due to unreliable wireless media, nodes mobility and lack of infrastructure, providing a key establishment scheme is a big challenge in this unique network environment. In this paper, a hybrid group key establishment scheme is proposed for secure communications in MANETs. The nodes in network are divided into two parties: Cell group consisting of group members and control group consisting of cell group controller. A centralized key establishment scheme is employed in cell group and a decentralized scheme is employed in control group. In this scheme, an implicitly certified public key approach is used, which reduces the certificate overhead and improves computational efficiency.

Ad-hoc Networks Energy Consumption: A review of the Ad-Hoc Routing Protocols

In MANETs (Mobile Ad Hoc Networks) communication at the mobile nodes can be achieved by using multihop wireless links. The architecture of such network is based not on a centralized base station but on each node which acts as a router and forwards data packets to other nodes in the network. The aim of each protocol, in an ad-hoc network, is to find valid routes between two communicating nodes. These protocols must be able to handle high mobility of the nodes which often cause changes in the network topology. This paper evaluates four ad-hoc network protocols (AODV, DSDV, DSR and TORA) in different network scales taking into consideration the mobility factor. The evaluation of these four protocols was carried out using Network Simulator-2 (ns2), and the poor performance of TORA may be attributed to its implementation in this package. Therefore further investigation of TORA implementation in ns2 needs to be carried out.

Performance Characteristics of Cluster -Based Multicast Key Distribution Scheme for Mobile Adhoc Networks

Many emerging commercial and military applications require secure multicast communication in adhoc environments. Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, high packet loss rates and limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving reliable secure communication using multicast key distribution for mobile adhoc networks. This paper proposes and evaluates the performance of an new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol to provide efficient and reliable multicast key distribution. Simulation results in NS2 accurately predict the performance of proposed scheme in terms of energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio compared with the existing scheme.

A new multi-tier adaptive military MANET security protocol using hybrid cryptography and signcryption

Mobile Ad-hoc NETworks (MANETs) are expected to play an important role in tactical military networks by providing infrastructureless communication. However, maintaining secure and instant information sharing is a difficult task especially for highly dynamic military MANETs. To address this requirement, we propose a new multi-tier adaptive military MANET security protocol using hybrid cryptography and signcryption. In our protocol, we bring novelties to secure military MANET communication for three main points: Cryptographic methods used in MANETs, hybrid key management protocols and structural organization of the military MANETs. As a new approach, we use hybrid cryptography mechanisms and Elliptic Curve Pintsov-Vanstone Signature Scheme (ECPVSS) that provide security and performance advantages when compared to some traditional cryptographic methods. Furthermore, multi-leveled security approach of our protocol provides adaptive solutions according to the requirements of different military units in the MANET. We also use a hybrid key management technique that combines the benefits of both decentralized protocols with single point of failure resistivity and centralized protocols with low rekeying cost. Last, the proposed network structure facilitates certification and key management for the MANET by providing flexibility for Mobile Backbone Network (MBN) tiers.

Range-Based Relative Velocity Estimations for Networked Mobile Devices

The relative velocity between mobile devices is one of the key factors that determine the quality of communications in Mobile Ad-hoc NETworks (MANETs). Velocity estimates are useful in various aspects of ad hoc networking (e.g., predicting link lifetime and measuring performance). Conventional ways of estimating velocity rely on the availability of positioning systems such as the Global Positioning System (GPS) or precise knowledge of the characteristics of wireless channels/signals. A recently proposed method exploits time-varying internode range information for velocity estimations, provided that the range estimates are noise free. In this paper, we propose a new range-based method for relative velocity estimations (RVEs). We derive two range-based relative velocity estimators for both sparse and dense ad hoc networks, i.e., RVEs and RVEd. In addition to being less dependent on the characteristics of the wireless channel, the proposed method is more tolerant of the multipath or nonline-of-sight (NLOS) errors contained in range measurements than the existing method. Simulation results show an excellent match between the velocity estimates given by the proposed method and the actual values in both sparse and dense network cases, regardless of the nodal speed limits or the distribution of noises. In comparison with the existing method, the proposed method is shown to achieve an improvement factor of about 33 (in terms of normalized bias) with Gaussian multipath noises of 4-m standard deviation or 20 with uniform NLOS noises of 32-m maximum standard deviation.

Efficient Node Admission and Certificateless Secure Communication in Short-Lived MANETs

Decentralized node admission is an essential and fundamental security service in mobile ad hoc networks (MANETs). It is needed to securely cope with dynamic membership and topology as well as to bootstrap other important security primitives (such as key management) and services (such as secure routing) without the assistance of any centralized trusted authority. An ideal admission technique must involve minimal interaction among MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, admission must be efficient in terms of computation and communication. Most previously proposed admission protocols are prohibitively expensive and require heavy interaction among MANET nodes. In this paper, we focus on a common type of MANET that is formed on a temporary basis, and present a secure, efficient, and a fully noninteractive admission technique geared for this type of a network. Our admission protocol is based on secret sharing techniques using bivariate polynomials. We also present a new scheme that allows any pair of MANET nodes to efficiently establish an on-the-fly secure communication channel.

Preserving data integrity in mobile ad hoc networks with variant Diffie‐Hellman protocol

AbstractSince the early 1990s, engineers have proposed many mechanisms for providing confidential communications and data integrity in mobile ad hoc networks (MANET). The deficiency of fastened infrastructure makes mobile ad hoc networks more vulnerable to security threats than conventional wireless networks. MANET can be considered as a short‐lived collection of mobile nodes that communicate with each other in between. All involved nodes in the network system share the responsibility for routing, accessing, and communicating. The main challenges on the design of MANET include high power saving and low bandwidth. The public key infrastructure (PKI) is a well‐known mechanism used to provide data integrity and confidential communications in MANET recently. The computation loads of PKI, however, are heavy to each mobile node in the cluster. Without adopting PKI cryptosystems to en/decrypt messages, we propose a novel version based on a variant Diffie‐‐Hellman protocol. The novel method can preserve the forward and backward secrecy of group communications. Specifically, the new method outperforms related works in the computation overheads of involved nodes while communicating with other nodes. Copyright © 2008 John Wiley & Sons, Ltd.

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET). We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN) builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

Authenticated Dynamic Group Key Agreement for Autoconfigurable Mobile Ad Hoc Networks

Secure communication in Mobile Ad Hoc Networks (MANETs) is important as nodes communicate over the wireless medium, which can be easily eavesdropped. Currently, the literature of secure IP address autoconfiguration in MANETs is extremely rare. In this paper, we propose five protocols that provide both secure IP address autoconfiguration and authenticated group key agreement (GKA) to give a more efficient and secure solution for MANET communications. Whenever a dynamic group membership event such as node join, node leave, network merge and network partition occurs, our protocols ensure that the IP address allocation table and group key are updated so that there are no address conflicts and leaving and joining users cannot decrypt future and previous communications respectively. A complexity analysis shows that despite having additional capabilities such as IP address autoconfiguration and key authentication, our protocols are still efficient when compared to other GKA protocols.

A hint-based probabilistic protocol for unicast communications in MANETs

Point-to-point transmissions represent a fundamental primitive in any communication network. Despite many proposals have appeared in the literature, providing an efficient implementation of such an abstraction in Mobile Ad Hoc Networks (MANETs) still remains an open issue. This paper proposes a probabilistic protocol for unicast packet delivery in a MANET. Unlike the classical routing protocols, in our proposal packet forwarding is not driven by a previously computed path. Rather, the nodes of the network exploit a set of routing meta-information (called hints) to discover a path to the destination on-the-fly. This assure robustness against topological changes, while requiring a very low overhead. A node gathers hints from the nodes located within a small number of hops (called the protocol’s lookahead) from itself. As showed through simulations, very good performance can be obtained with small lookahead. The main statistical properties of hints have been investigated through an analytical model, which is also reported in the paper.